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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 6.0K Feb 26 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Feb 26 15:37 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-d1m09-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678242110933

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-d1m09
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 02:21:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 02:21:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 02:21:52] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2023-03-08 02:21:52] [INFO ] Transformed 1440 places.
[2023-03-08 02:21:52] [INFO ] Transformed 672 transitions.
[2023-03-08 02:21:52] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 151 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 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 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 184 place count 243 transition count 412
Iterating global reduction 1 with 83 rules applied. Total rules applied 267 place count 243 transition count 412
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 279 place count 243 transition count 400
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 341 place count 181 transition count 338
Iterating global reduction 2 with 62 rules applied. Total rules applied 403 place count 181 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 406 place count 181 transition count 335
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 436 place count 151 transition count 287
Iterating global reduction 3 with 30 rules applied. Total rules applied 466 place count 151 transition count 287
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 493 place count 151 transition count 260
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 499 place count 145 transition count 252
Iterating global reduction 4 with 6 rules applied. Total rules applied 505 place count 145 transition count 252
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 510 place count 140 transition count 247
Iterating global reduction 4 with 5 rules applied. Total rules applied 515 place count 140 transition count 247
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 517 place count 140 transition count 245
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 520 place count 137 transition count 242
Iterating global reduction 5 with 3 rules applied. Total rules applied 523 place count 137 transition count 242
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 524 place count 136 transition count 240
Iterating global reduction 5 with 1 rules applied. Total rules applied 525 place count 136 transition count 240
Applied a total of 525 rules in 72 ms. Remains 136 /347 variables (removed 211) and now considering 240/672 (removed 432) transitions.
// Phase 1: matrix 240 rows 136 cols
[2023-03-08 02:21:53] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-08 02:21:53] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-03-08 02:21:53] [INFO ] Invariant cache hit.
[2023-03-08 02:21:53] [INFO ] State equation strengthened by 121 read => feed constraints.
[2023-03-08 02:21:53] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
[2023-03-08 02:21:53] [INFO ] Invariant cache hit.
[2023-03-08 02:21:53] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/347 places, 240/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1121 ms. Remains : 136/347 places, 240/672 transitions.
Support contains 29 out of 136 places after structural reductions.
[2023-03-08 02:21:54] [INFO ] Flatten gal took : 40 ms
[2023-03-08 02:21:54] [INFO ] Flatten gal took : 19 ms
[2023-03-08 02:21:54] [INFO ] Input system was already deterministic with 240 transitions.
Incomplete random walk after 10000 steps, including 2253 resets, run finished after 569 ms. (steps per millisecond=17 ) properties (out of 26) seen :3
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 114 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 104 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
[2023-03-08 02:21:55] [INFO ] Invariant cache hit.
[2023-03-08 02:21:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 02:21:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-08 02:21:55] [INFO ] After 733ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:21
[2023-03-08 02:21:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 02:21:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 02:21:56] [INFO ] After 501ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :21
[2023-03-08 02:21:56] [INFO ] State equation strengthened by 121 read => feed constraints.
[2023-03-08 02:21:57] [INFO ] After 713ms SMT Verify possible using 121 Read/Feed constraints in natural domain returned unsat :2 sat :21
[2023-03-08 02:21:58] [INFO ] After 1664ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :21
Attempting to minimize the solution found.
Minimization took 805 ms.
[2023-03-08 02:21:58] [INFO ] After 3112ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :21
Fused 23 Parikh solutions to 21 different solutions.
Parikh walk visited 2 properties in 183 ms.
Support contains 23 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 131 transition count 227
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 131 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 131 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 130 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 130 transition count 225
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 129 transition count 224
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 129 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 129 transition count 223
Applied a total of 16 rules in 32 ms. Remains 129 /136 variables (removed 7) and now considering 223/240 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 129/136 places, 223/240 transitions.
Incomplete random walk after 10000 steps, including 2288 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Finished probabilistic random walk after 7618 steps, run visited all 19 properties in 106 ms. (steps per millisecond=71 )
Probabilistic random walk after 7618 steps, saw 3499 distinct states, run finished after 106 ms. (steps per millisecond=71 ) properties seen :19
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 5 stabilizing places and 24 stable transitions
Graph (complete) has 509 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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((F(p1)&&p0)))))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 116 transition count 168
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 116 transition count 168
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 116 transition count 165
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 105 transition count 154
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 105 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 69 place count 105 transition count 150
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 79 place count 95 transition count 135
Iterating global reduction 2 with 10 rules applied. Total rules applied 89 place count 95 transition count 135
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 95 place count 95 transition count 129
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 90 transition count 118
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 90 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 90 transition count 116
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 110 place count 87 transition count 113
Iterating global reduction 4 with 3 rules applied. Total rules applied 113 place count 87 transition count 113
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 115 place count 85 transition count 111
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 85 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 119 place count 85 transition count 109
Applied a total of 119 rules in 13 ms. Remains 85 /136 variables (removed 51) and now considering 109/240 (removed 131) transitions.
// Phase 1: matrix 109 rows 85 cols
[2023-03-08 02:21:59] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-08 02:22:00] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-08 02:22:00] [INFO ] Invariant cache hit.
[2023-03-08 02:22:00] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-08 02:22:00] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-08 02:22:00] [INFO ] Invariant cache hit.
[2023-03-08 02:22:00] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/136 places, 109/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 280 ms. Remains : 85/136 places, 109/240 transitions.
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s42 1)), p1:(AND (GEQ s1 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-00 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' '!(F(G(p0)))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 116 transition count 172
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 116 transition count 172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 116 transition count 168
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 54 place count 106 transition count 158
Iterating global reduction 1 with 10 rules applied. Total rules applied 64 place count 106 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 67 place count 106 transition count 155
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 76 place count 97 transition count 141
Iterating global reduction 2 with 9 rules applied. Total rules applied 85 place count 97 transition count 141
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 91 place count 97 transition count 135
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 96 place count 92 transition count 120
Iterating global reduction 3 with 5 rules applied. Total rules applied 101 place count 92 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 102 place count 92 transition count 119
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 105 place count 89 transition count 116
Iterating global reduction 4 with 3 rules applied. Total rules applied 108 place count 89 transition count 116
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 110 place count 87 transition count 114
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 87 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 114 place count 87 transition count 112
Applied a total of 114 rules in 31 ms. Remains 87 /136 variables (removed 49) and now considering 112/240 (removed 128) transitions.
// Phase 1: matrix 112 rows 87 cols
[2023-03-08 02:22:00] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 02:22:00] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 02:22:00] [INFO ] Invariant cache hit.
[2023-03-08 02:22:00] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 02:22:00] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-08 02:22:00] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 02:22:00] [INFO ] Invariant cache hit.
[2023-03-08 02:22:00] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/136 places, 112/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 309 ms. Remains : 87/136 places, 112/240 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-01 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 s79 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 5 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-01 finished in 362 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((G(p1) U p2))&&F(p1)&&p0)))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 117 transition count 173
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 117 transition count 173
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 117 transition count 169
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 52 place count 107 transition count 159
Iterating global reduction 1 with 10 rules applied. Total rules applied 62 place count 107 transition count 159
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 66 place count 107 transition count 155
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 75 place count 98 transition count 142
Iterating global reduction 2 with 9 rules applied. Total rules applied 84 place count 98 transition count 142
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 89 place count 98 transition count 137
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 94 place count 93 transition count 121
Iterating global reduction 3 with 5 rules applied. Total rules applied 99 place count 93 transition count 121
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 103 place count 93 transition count 117
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 105 place count 91 transition count 115
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 91 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 109 place count 89 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 111 place count 89 transition count 113
Applied a total of 111 rules in 25 ms. Remains 89 /136 variables (removed 47) and now considering 113/240 (removed 127) transitions.
// Phase 1: matrix 113 rows 89 cols
[2023-03-08 02:22:00] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 02:22:01] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-08 02:22:01] [INFO ] Invariant cache hit.
[2023-03-08 02:22:01] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-08 02:22:01] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-08 02:22:01] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 02:22:01] [INFO ] Invariant cache hit.
[2023-03-08 02:22:01] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/136 places, 113/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 280 ms. Remains : 89/136 places, 113/240 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=0 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={0} source=0 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=3 dest: 2}, { cond=(OR p2 p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={1} source=5 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s84 1)), p2:(AND (GEQ s26 1) (GEQ s35 1)), p1:(AND (GEQ s1 1) (GEQ s84 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 3 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-02 finished in 561 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 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 116 transition count 171
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 116 transition count 171
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 116 transition count 167
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 54 place count 106 transition count 157
Iterating global reduction 1 with 10 rules applied. Total rules applied 64 place count 106 transition count 157
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 68 place count 106 transition count 153
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 77 place count 97 transition count 139
Iterating global reduction 2 with 9 rules applied. Total rules applied 86 place count 97 transition count 139
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 91 place count 97 transition count 134
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 97 place count 91 transition count 117
Iterating global reduction 3 with 6 rules applied. Total rules applied 103 place count 91 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 105 place count 91 transition count 115
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 108 place count 88 transition count 112
Iterating global reduction 4 with 3 rules applied. Total rules applied 111 place count 88 transition count 112
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 113 place count 86 transition count 110
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 86 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 117 place count 86 transition count 108
Applied a total of 117 rules in 23 ms. Remains 86 /136 variables (removed 50) and now considering 108/240 (removed 132) transitions.
// Phase 1: matrix 108 rows 86 cols
[2023-03-08 02:22:01] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 02:22:01] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 02:22:01] [INFO ] Invariant cache hit.
[2023-03-08 02:22:01] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-08 02:22:01] [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 02:22:01] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 02:22:01] [INFO ] Invariant cache hit.
[2023-03-08 02:22:01] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/136 places, 108/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 268 ms. Remains : 86/136 places, 108/240 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-03 finished in 323 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(F(p0))||(p0&&X(X(p1)))))))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 117 transition count 174
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 117 transition count 174
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 117 transition count 171
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 52 place count 106 transition count 160
Iterating global reduction 1 with 11 rules applied. Total rules applied 63 place count 106 transition count 160
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 67 place count 106 transition count 156
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 77 place count 96 transition count 141
Iterating global reduction 2 with 10 rules applied. Total rules applied 87 place count 96 transition count 141
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 93 place count 96 transition count 135
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 99 place count 90 transition count 118
Iterating global reduction 3 with 6 rules applied. Total rules applied 105 place count 90 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 90 transition count 116
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 110 place count 87 transition count 113
Iterating global reduction 4 with 3 rules applied. Total rules applied 113 place count 87 transition count 113
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 115 place count 85 transition count 111
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 85 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 119 place count 85 transition count 109
Applied a total of 119 rules in 5 ms. Remains 85 /136 variables (removed 51) and now considering 109/240 (removed 131) transitions.
// Phase 1: matrix 109 rows 85 cols
[2023-03-08 02:22:01] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 02:22:01] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 02:22:01] [INFO ] Invariant cache hit.
[2023-03-08 02:22:01] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 02:22:01] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2023-03-08 02:22:01] [INFO ] Invariant cache hit.
[2023-03-08 02:22:02] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/136 places, 109/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 232 ms. Remains : 85/136 places, 109/240 transitions.
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(OR (LT s2 1) (LT s82 1)), p1:(AND (GEQ s1 1) (GEQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28537 reset in 257 ms.
Product exploration explored 100000 steps with 28588 reset in 168 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 290 edges and 85 vertex of which 84 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)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2280 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Finished probabilistic random walk after 3346 steps, run visited all 2 properties in 38 ms. (steps per millisecond=88 )
Probabilistic random walk after 3346 steps, saw 1646 distinct states, run finished after 39 ms. (steps per millisecond=85 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 109/109 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-08 02:22:03] [INFO ] Invariant cache hit.
[2023-03-08 02:22:03] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 02:22:03] [INFO ] Invariant cache hit.
[2023-03-08 02:22:04] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 02:22:04] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-08 02:22:04] [INFO ] Invariant cache hit.
[2023-03-08 02:22:04] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 254 ms. Remains : 85/85 places, 109/109 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 290 edges and 85 vertex of which 84 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 (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2285 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Finished probabilistic random walk after 3346 steps, run visited all 2 properties in 24 ms. (steps per millisecond=139 )
Probabilistic random walk after 3346 steps, saw 1646 distinct states, run finished after 24 ms. (steps per millisecond=139 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 234 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 28565 reset in 185 ms.
Product exploration explored 100000 steps with 28569 reset in 169 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 109/109 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-08 02:22:06] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 02:22:06] [INFO ] Invariant cache hit.
[2023-03-08 02:22:06] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 85/85 places, 109/109 transitions.
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 109/109 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-08 02:22:06] [INFO ] Invariant cache hit.
[2023-03-08 02:22:06] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 02:22:06] [INFO ] Invariant cache hit.
[2023-03-08 02:22:06] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 02:22:06] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2023-03-08 02:22:06] [INFO ] Invariant cache hit.
[2023-03-08 02:22:06] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 220 ms. Remains : 85/85 places, 109/109 transitions.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-04 finished in 4881 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)))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 117 transition count 180
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 117 transition count 180
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 117 transition count 174
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 54 place count 107 transition count 164
Iterating global reduction 1 with 10 rules applied. Total rules applied 64 place count 107 transition count 164
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 68 place count 107 transition count 160
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 77 place count 98 transition count 147
Iterating global reduction 2 with 9 rules applied. Total rules applied 86 place count 98 transition count 147
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 92 place count 98 transition count 141
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 97 place count 93 transition count 125
Iterating global reduction 3 with 5 rules applied. Total rules applied 102 place count 93 transition count 125
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 106 place count 93 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 108 place count 91 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 110 place count 91 transition count 119
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 112 place count 89 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 89 transition count 117
Applied a total of 114 rules in 17 ms. Remains 89 /136 variables (removed 47) and now considering 117/240 (removed 123) transitions.
// Phase 1: matrix 117 rows 89 cols
[2023-03-08 02:22:06] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 02:22:07] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-08 02:22:07] [INFO ] Invariant cache hit.
[2023-03-08 02:22:07] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-08 02:22:07] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
[2023-03-08 02:22:07] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 02:22:07] [INFO ] Invariant cache hit.
[2023-03-08 02:22:07] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/136 places, 117/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 522 ms. Remains : 89/136 places, 117/240 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s84 1) (AND (GEQ s1 1) (GEQ s62 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23013 reset in 122 ms.
Product exploration explored 100000 steps with 23014 reset in 122 ms.
Computed a total of 5 stabilizing places and 13 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 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2310 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4849 steps, run visited all 1 properties in 12 ms. (steps per millisecond=404 )
Probabilistic random walk after 4849 steps, saw 2265 distinct states, run finished after 12 ms. (steps per millisecond=404 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 117/117 transitions.
Applied a total of 0 rules in 5 ms. Remains 89 /89 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-08 02:22:08] [INFO ] Invariant cache hit.
[2023-03-08 02:22:08] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-08 02:22:08] [INFO ] Invariant cache hit.
[2023-03-08 02:22:08] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-08 02:22:08] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-08 02:22:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 02:22:08] [INFO ] Invariant cache hit.
[2023-03-08 02:22:08] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 261 ms. Remains : 89/89 places, 117/117 transitions.
Computed a total of 5 stabilizing places and 13 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 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2284 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4849 steps, run visited all 1 properties in 23 ms. (steps per millisecond=210 )
Probabilistic random walk after 4849 steps, saw 2265 distinct states, run finished after 23 ms. (steps per millisecond=210 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22900 reset in 107 ms.
Product exploration explored 100000 steps with 23072 reset in 114 ms.
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 117/117 transitions.
Applied a total of 0 rules in 14 ms. Remains 89 /89 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-08 02:22:09] [INFO ] Invariant cache hit.
[2023-03-08 02:22:09] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-08 02:22:09] [INFO ] Invariant cache hit.
[2023-03-08 02:22:09] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-08 02:22:09] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2023-03-08 02:22:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 02:22:09] [INFO ] Invariant cache hit.
[2023-03-08 02:22:09] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 262 ms. Remains : 89/89 places, 117/117 transitions.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-05 finished in 2662 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((X(p0)||(p0&&F(p1))))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 117 transition count 177
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 117 transition count 177
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 117 transition count 172
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 106 transition count 161
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 106 transition count 161
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 69 place count 106 transition count 157
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 79 place count 96 transition count 142
Iterating global reduction 2 with 10 rules applied. Total rules applied 89 place count 96 transition count 142
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 96 place count 96 transition count 135
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 102 place count 90 transition count 118
Iterating global reduction 3 with 6 rules applied. Total rules applied 108 place count 90 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 110 place count 90 transition count 116
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 113 place count 87 transition count 113
Iterating global reduction 4 with 3 rules applied. Total rules applied 116 place count 87 transition count 113
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 118 place count 85 transition count 111
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 85 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 122 place count 85 transition count 109
Applied a total of 122 rules in 7 ms. Remains 85 /136 variables (removed 51) and now considering 109/240 (removed 131) transitions.
// Phase 1: matrix 109 rows 85 cols
[2023-03-08 02:22:09] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 02:22:09] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 02:22:09] [INFO ] Invariant cache hit.
[2023-03-08 02:22:09] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 02:22:09] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-08 02:22:09] [INFO ] Invariant cache hit.
[2023-03-08 02:22:09] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/136 places, 109/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 248 ms. Remains : 85/136 places, 109/240 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s57 1)), p1:(OR (LT s1 1) (LT s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 160 ms.
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 287 edges and 85 vertex of which 84 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 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p1))))
Knowledge based reduction with 5 factoid took 95 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-06 finished in 822 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(p1))))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 118 transition count 189
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 118 transition count 189
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 42 place count 118 transition count 183
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 52 place count 108 transition count 173
Iterating global reduction 1 with 10 rules applied. Total rules applied 62 place count 108 transition count 173
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 65 place count 108 transition count 170
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 74 place count 99 transition count 157
Iterating global reduction 2 with 9 rules applied. Total rules applied 83 place count 99 transition count 157
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 91 place count 99 transition count 149
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 96 place count 94 transition count 134
Iterating global reduction 3 with 5 rules applied. Total rules applied 101 place count 94 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 102 place count 94 transition count 133
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 105 place count 91 transition count 130
Iterating global reduction 4 with 3 rules applied. Total rules applied 108 place count 91 transition count 130
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 110 place count 89 transition count 128
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 89 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 114 place count 89 transition count 126
Applied a total of 114 rules in 18 ms. Remains 89 /136 variables (removed 47) and now considering 126/240 (removed 114) transitions.
// Phase 1: matrix 126 rows 89 cols
[2023-03-08 02:22:10] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 02:22:10] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 02:22:10] [INFO ] Invariant cache hit.
[2023-03-08 02:22:10] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-08 02:22:10] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-08 02:22:10] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 02:22:10] [INFO ] Invariant cache hit.
[2023-03-08 02:22:10] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/136 places, 126/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 292 ms. Remains : 89/136 places, 126/240 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s1 1) (LT s81 1)) (OR (LT s1 1) (LT s59 1))), p1:(AND (GEQ s1 1) (GEQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-07 finished in 417 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((p0||(F(p1) U X(G(!p2))))))'
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 117 transition count 169
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 117 transition count 169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 117 transition count 166
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 50 place count 108 transition count 157
Iterating global reduction 1 with 9 rules applied. Total rules applied 59 place count 108 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 62 place count 108 transition count 154
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 70 place count 100 transition count 141
Iterating global reduction 2 with 8 rules applied. Total rules applied 78 place count 100 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 83 place count 100 transition count 136
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 87 place count 96 transition count 127
Iterating global reduction 3 with 4 rules applied. Total rules applied 91 place count 96 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 96 transition count 126
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 95 place count 93 transition count 123
Iterating global reduction 4 with 3 rules applied. Total rules applied 98 place count 93 transition count 123
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 100 place count 91 transition count 121
Iterating global reduction 4 with 2 rules applied. Total rules applied 102 place count 91 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 104 place count 91 transition count 119
Applied a total of 104 rules in 15 ms. Remains 91 /136 variables (removed 45) and now considering 119/240 (removed 121) transitions.
// Phase 1: matrix 119 rows 91 cols
[2023-03-08 02:22:10] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 02:22:10] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-08 02:22:10] [INFO ] Invariant cache hit.
[2023-03-08 02:22:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 02:22:10] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2023-03-08 02:22:10] [INFO ] Invariant cache hit.
[2023-03-08 02:22:10] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/136 places, 119/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265 ms. Remains : 91/136 places, 119/240 transitions.
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) p2), (AND (NOT p1) p2), p2, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s59 1)), p1:(AND (GEQ s30 1) (GEQ s35 1)), p2:(AND (GEQ s27 1) (GEQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 4406 steps with 1487 reset in 10 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-08 finished in 468 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(p0) U X((X(p0)&&p1))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 117 transition count 181
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 117 transition count 181
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 117 transition count 176
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 106 transition count 165
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 106 transition count 165
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 70 place count 106 transition count 160
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 80 place count 96 transition count 145
Iterating global reduction 2 with 10 rules applied. Total rules applied 90 place count 96 transition count 145
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 97 place count 96 transition count 138
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 103 place count 90 transition count 121
Iterating global reduction 3 with 6 rules applied. Total rules applied 109 place count 90 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 111 place count 90 transition count 119
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 114 place count 87 transition count 116
Iterating global reduction 4 with 3 rules applied. Total rules applied 117 place count 87 transition count 116
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 119 place count 85 transition count 114
Iterating global reduction 4 with 2 rules applied. Total rules applied 121 place count 85 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 123 place count 85 transition count 112
Applied a total of 123 rules in 14 ms. Remains 85 /136 variables (removed 51) and now considering 112/240 (removed 128) transitions.
// Phase 1: matrix 112 rows 85 cols
[2023-03-08 02:22:11] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 02:22:11] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-08 02:22:11] [INFO ] Invariant cache hit.
[2023-03-08 02:22:11] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 02:22:11] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-08 02:22:11] [INFO ] Invariant cache hit.
[2023-03-08 02:22:11] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/136 places, 112/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 85/136 places, 112/240 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=p1, acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s60 1)), p1:(AND (GEQ s1 1) (GEQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-10 finished in 451 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)&&F(G(!p1)))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 117 transition count 177
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 117 transition count 177
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 117 transition count 173
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 51 place count 108 transition count 164
Iterating global reduction 1 with 9 rules applied. Total rules applied 60 place count 108 transition count 164
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 63 place count 108 transition count 161
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 71 place count 100 transition count 148
Iterating global reduction 2 with 8 rules applied. Total rules applied 79 place count 100 transition count 148
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 85 place count 100 transition count 142
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 89 place count 96 transition count 129
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 96 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 96 transition count 128
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 96 place count 94 transition count 126
Iterating global reduction 4 with 2 rules applied. Total rules applied 98 place count 94 transition count 126
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 93 transition count 125
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 93 transition count 125
Applied a total of 100 rules in 20 ms. Remains 93 /136 variables (removed 43) and now considering 125/240 (removed 115) transitions.
// Phase 1: matrix 125 rows 93 cols
[2023-03-08 02:22:11] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 02:22:11] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-08 02:22:11] [INFO ] Invariant cache hit.
[2023-03-08 02:22:11] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 02:22:11] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-08 02:22:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 02:22:11] [INFO ] Invariant cache hit.
[2023-03-08 02:22:11] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/136 places, 125/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 277 ms. Remains : 93/136 places, 125/240 transitions.
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) p1), p1]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s91 1)), p1:(AND (GEQ s1 1) (GEQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22955 reset in 164 ms.
Product exploration explored 100000 steps with 22935 reset in 174 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 320 edges and 93 vertex of which 92 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 p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X p0), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 227 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(OR (NOT p0) p1), p1]
Incomplete random walk after 10000 steps, including 2243 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 505 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Finished probabilistic random walk after 19401 steps, run visited all 3 properties in 148 ms. (steps per millisecond=131 )
Probabilistic random walk after 19401 steps, saw 9284 distinct states, run finished after 148 ms. (steps per millisecond=131 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X p0), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND p1 p0))]
Knowledge based reduction with 7 factoid took 295 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(OR (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) p1), p1]
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 125/125 transitions.
Applied a total of 0 rules in 7 ms. Remains 93 /93 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-08 02:22:13] [INFO ] Invariant cache hit.
[2023-03-08 02:22:13] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-08 02:22:13] [INFO ] Invariant cache hit.
[2023-03-08 02:22:13] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 02:22:13] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2023-03-08 02:22:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 02:22:13] [INFO ] Invariant cache hit.
[2023-03-08 02:22:13] [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 276 ms. Remains : 93/93 places, 125/125 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 320 edges and 93 vertex of which 92 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 p0 (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X p0), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 229 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(OR (NOT p0) p1), p1]
Incomplete random walk after 10000 steps, including 2286 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 506 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 516 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Finished probabilistic random walk after 19401 steps, run visited all 3 properties in 146 ms. (steps per millisecond=132 )
Probabilistic random walk after 19401 steps, saw 9284 distinct states, run finished after 147 ms. (steps per millisecond=131 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X p0), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND p1 p0))]
Knowledge based reduction with 7 factoid took 310 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) p1), p1]
Product exploration explored 100000 steps with 22952 reset in 132 ms.
Product exploration explored 100000 steps with 22890 reset in 138 ms.
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-08 02:22:15] [INFO ] Invariant cache hit.
[2023-03-08 02:22:15] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-08 02:22:15] [INFO ] Invariant cache hit.
[2023-03-08 02:22:15] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 02:22:15] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-08 02:22:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 02:22:15] [INFO ] Invariant cache hit.
[2023-03-08 02:22:15] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 281 ms. Remains : 93/93 places, 125/125 transitions.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-13 finished in 4000 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((!(!p0 U p1)||X(!(!p0 U p2)))))'
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 118 transition count 174
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 118 transition count 174
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 41 place count 118 transition count 169
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 49 place count 110 transition count 161
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 110 transition count 161
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 60 place count 110 transition count 158
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 102 transition count 147
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 102 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 80 place count 102 transition count 143
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 84 place count 98 transition count 133
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 98 transition count 133
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 92 place count 98 transition count 129
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 94 place count 96 transition count 127
Iterating global reduction 4 with 2 rules applied. Total rules applied 96 place count 96 transition count 127
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 98 place count 94 transition count 125
Iterating global reduction 4 with 2 rules applied. Total rules applied 100 place count 94 transition count 125
Applied a total of 100 rules in 7 ms. Remains 94 /136 variables (removed 42) and now considering 125/240 (removed 115) transitions.
// Phase 1: matrix 125 rows 94 cols
[2023-03-08 02:22:15] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 02:22:15] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-08 02:22:15] [INFO ] Invariant cache hit.
[2023-03-08 02:22:15] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-08 02:22:15] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2023-03-08 02:22:15] [INFO ] Invariant cache hit.
[2023-03-08 02:22:15] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/136 places, 125/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 241 ms. Remains : 94/136 places, 125/240 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (AND p1 p2), (AND p1 p2), p1, p2]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s7 1) (GEQ s36 1)), p1:(AND (GEQ s1 1) (GEQ s89 1)), p2:(AND (GEQ s1 1) (GEQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22973 reset in 147 ms.
Product exploration explored 100000 steps with 22935 reset in 160 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 322 edges and 94 vertex of which 93 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 : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 934 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[true, (AND p1 p2), p2, p1, (AND p1 p2)]
Incomplete random walk after 10000 steps, including 2320 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 990 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 969 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 491 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 994 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 1001 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 446 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 500 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 494 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 992 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 2425395 steps, run timeout after 3001 ms. (steps per millisecond=808 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 7=1, 8=1, 9=1}
Probabilistic random walk after 2425395 steps, saw 939923 distinct states, run finished after 3002 ms. (steps per millisecond=807 ) properties seen :9
Running SMT prover for 1 properties.
[2023-03-08 02:22:21] [INFO ] Invariant cache hit.
[2023-03-08 02:22:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 02:22:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-08 02:22:21] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1))), (G (NOT (AND p2 p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p2) (NOT p1))), (F p2), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND (NOT p0) p2 (NOT p1))), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 23 factoid took 1038 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 138 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 94 /94 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-08 02:22:22] [INFO ] Invariant cache hit.
[2023-03-08 02:22:22] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-08 02:22:22] [INFO ] Invariant cache hit.
[2023-03-08 02:22:22] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-08 02:22:22] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-08 02:22:22] [INFO ] Invariant cache hit.
[2023-03-08 02:22:22] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 259 ms. Remains : 94/94 places, 125/125 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 322 edges and 94 vertex of which 93 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 : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 616 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Incomplete random walk after 10000 steps, including 2331 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 454 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1024 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 953 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1018 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 937 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 983 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Finished probabilistic random walk after 21133 steps, run visited all 8 properties in 185 ms. (steps per millisecond=114 )
Probabilistic random walk after 21133 steps, saw 10012 distinct states, run finished after 186 ms. (steps per millisecond=113 ) properties seen :8
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p2 (NOT p0))), (F (AND p0 (NOT p1))), (F p2), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
Knowledge based reduction with 18 factoid took 828 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 151 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 157 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Product exploration explored 100000 steps with 22915 reset in 148 ms.
Product exploration explored 100000 steps with 22809 reset in 149 ms.
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 125/125 transitions.
Applied a total of 0 rules in 0 ms. Remains 94 /94 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-08 02:22:26] [INFO ] Invariant cache hit.
[2023-03-08 02:22:26] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 02:22:26] [INFO ] Invariant cache hit.
[2023-03-08 02:22:26] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-08 02:22:26] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-08 02:22:26] [INFO ] Invariant cache hit.
[2023-03-08 02:22:26] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 221 ms. Remains : 94/94 places, 125/125 transitions.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-14 finished in 10961 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(G(p0)) U !p1)))'
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 117 transition count 169
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 117 transition count 169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 117 transition count 166
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 51 place count 107 transition count 156
Iterating global reduction 1 with 10 rules applied. Total rules applied 61 place count 107 transition count 156
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 64 place count 107 transition count 153
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 73 place count 98 transition count 140
Iterating global reduction 2 with 9 rules applied. Total rules applied 82 place count 98 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 87 place count 98 transition count 135
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 91 place count 94 transition count 125
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 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 97 place count 94 transition count 123
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 99 place count 92 transition count 121
Iterating global reduction 4 with 2 rules applied. Total rules applied 101 place count 92 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 103 place count 90 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 105 place count 90 transition count 119
Applied a total of 105 rules in 11 ms. Remains 90 /136 variables (removed 46) and now considering 119/240 (removed 121) transitions.
// Phase 1: matrix 119 rows 90 cols
[2023-03-08 02:22:26] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 02:22:26] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 02:22:26] [INFO ] Invariant cache hit.
[2023-03-08 02:22:26] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-08 02:22:26] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2023-03-08 02:22:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 02:22:26] [INFO ] Invariant cache hit.
[2023-03-08 02:22:26] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/136 places, 119/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 232 ms. Remains : 90/136 places, 119/240 transitions.
Stuttering acceptance computed with spot in 115 ms :[p1, (NOT p0), p1]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s51 1)), p0:(OR (AND (GEQ s1 1) (GEQ s46 1)) (AND (GEQ s26 1) (GEQ s50 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 22967 reset in 115 ms.
Product exploration explored 100000 steps with 22991 reset in 114 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 308 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[p1, (NOT p0), p1]
Incomplete random walk after 10000 steps, including 2283 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Finished probabilistic random walk after 5348 steps, run visited all 2 properties in 19 ms. (steps per millisecond=281 )
Probabilistic random walk after 5348 steps, saw 2548 distinct states, run finished after 19 ms. (steps per millisecond=281 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[p1, (NOT p0), p1]
Stuttering acceptance computed with spot in 95 ms :[p1, (NOT p0), p1]
Support contains 5 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 119/119 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-08 02:22:27] [INFO ] Invariant cache hit.
[2023-03-08 02:22:27] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-08 02:22:27] [INFO ] Invariant cache hit.
[2023-03-08 02:22:27] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-08 02:22:28] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-08 02:22:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 02:22:28] [INFO ] Invariant cache hit.
[2023-03-08 02:22:28] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 254 ms. Remains : 90/90 places, 119/119 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 308 edges and 90 vertex of which 89 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 : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 167 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[p1, (NOT p0), p1]
Incomplete random walk after 10000 steps, including 2298 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 440 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Finished probabilistic random walk after 5348 steps, run visited all 2 properties in 20 ms. (steps per millisecond=267 )
Probabilistic random walk after 5348 steps, saw 2548 distinct states, run finished after 20 ms. (steps per millisecond=267 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 236 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[p1, (NOT p0), p1]
Stuttering acceptance computed with spot in 100 ms :[p1, (NOT p0), p1]
Stuttering acceptance computed with spot in 96 ms :[p1, (NOT p0), p1]
Product exploration explored 100000 steps with 23035 reset in 119 ms.
Product exploration explored 100000 steps with 23036 reset in 117 ms.
Support contains 5 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 119/119 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-08 02:22:29] [INFO ] Invariant cache hit.
[2023-03-08 02:22:29] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 02:22:29] [INFO ] Invariant cache hit.
[2023-03-08 02:22:29] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-08 02:22:29] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2023-03-08 02:22:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 02:22:29] [INFO ] Invariant cache hit.
[2023-03-08 02:22:29] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 227 ms. Remains : 90/90 places, 119/119 transitions.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-15 finished in 3088 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(F(p0))||(p0&&X(X(p1)))))))'
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)))'
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)&&F(G(!p1)))))'
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((!(!p0 U p1)||X(!(!p0 U p2)))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d1m09-LTLFireability-14
Stuttering acceptance computed with spot in 161 ms :[true, (AND p1 p2), (AND p1 p2), p1, p2]
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 118 transition count 174
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 118 transition count 174
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 41 place count 118 transition count 169
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 49 place count 110 transition count 161
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 110 transition count 161
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 60 place count 110 transition count 158
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 102 transition count 147
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 102 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 80 place count 102 transition count 143
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 84 place count 98 transition count 133
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 98 transition count 133
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 92 place count 98 transition count 129
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 94 place count 96 transition count 127
Iterating global reduction 4 with 2 rules applied. Total rules applied 96 place count 96 transition count 127
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 98 place count 94 transition count 125
Iterating global reduction 4 with 2 rules applied. Total rules applied 100 place count 94 transition count 125
Applied a total of 100 rules in 17 ms. Remains 94 /136 variables (removed 42) and now considering 125/240 (removed 115) transitions.
// Phase 1: matrix 125 rows 94 cols
[2023-03-08 02:22:30] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 02:22:30] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 02:22:30] [INFO ] Invariant cache hit.
[2023-03-08 02:22:30] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-08 02:22:30] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-08 02:22:30] [INFO ] Invariant cache hit.
[2023-03-08 02:22:30] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 94/136 places, 125/240 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 261 ms. Remains : 94/136 places, 125/240 transitions.
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s7 1) (GEQ s36 1)), p1:(AND (GEQ s1 1) (GEQ s89 1)), p2:(AND (GEQ s1 1) (GEQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22986 reset in 145 ms.
Product exploration explored 100000 steps with 22880 reset in 156 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 322 edges and 94 vertex of which 93 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 : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 958 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (AND p1 p2), p2, p1, (AND p1 p2)]
Incomplete random walk after 10000 steps, including 2324 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 987 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 499 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 977 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 481 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 1010 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 966 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 427 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 939 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 2452799 steps, run timeout after 3001 ms. (steps per millisecond=817 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 7=1, 8=1, 9=1}
Probabilistic random walk after 2452799 steps, saw 951624 distinct states, run finished after 3001 ms. (steps per millisecond=817 ) properties seen :9
Running SMT prover for 1 properties.
[2023-03-08 02:22:35] [INFO ] Invariant cache hit.
[2023-03-08 02:22:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 02:22:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 02:22:35] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1))), (G (NOT (AND p2 p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p2) (NOT p1))), (F p2), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND (NOT p0) p2 (NOT p1))), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 23 factoid took 1169 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 151 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-08 02:22:36] [INFO ] Invariant cache hit.
[2023-03-08 02:22:37] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-08 02:22:37] [INFO ] Invariant cache hit.
[2023-03-08 02:22:37] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-08 02:22:37] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2023-03-08 02:22:37] [INFO ] Invariant cache hit.
[2023-03-08 02:22:37] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 236 ms. Remains : 94/94 places, 125/125 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 322 edges and 94 vertex of which 93 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 : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 785 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Incomplete random walk after 10000 steps, including 2264 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 481 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 979 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1001 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 449 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 992 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 987 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 987 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Finished probabilistic random walk after 21133 steps, run visited all 8 properties in 89 ms. (steps per millisecond=237 )
Probabilistic random walk after 21133 steps, saw 10012 distinct states, run finished after 89 ms. (steps per millisecond=237 ) properties seen :8
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p2 (NOT p0))), (F (AND p0 (NOT p1))), (F p2), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
Knowledge based reduction with 18 factoid took 927 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 170 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 159 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Product exploration explored 100000 steps with 22935 reset in 133 ms.
Product exploration explored 100000 steps with 22988 reset in 142 ms.
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 94 /94 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-08 02:22:40] [INFO ] Invariant cache hit.
[2023-03-08 02:22:40] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 02:22:40] [INFO ] Invariant cache hit.
[2023-03-08 02:22:40] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-08 02:22:40] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2023-03-08 02:22:40] [INFO ] Invariant cache hit.
[2023-03-08 02:22:40] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 230 ms. Remains : 94/94 places, 125/125 transitions.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-14 finished in 10839 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(G(p0)) U !p1)))'
[2023-03-08 02:22:40] [INFO ] Flatten gal took : 19 ms
[2023-03-08 02:22:40] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-08 02:22:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 136 places, 240 transitions and 941 arcs took 3 ms.
Total runtime 48335 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DBSingleClientW-PT-d1m09
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA DBSingleClientW-PT-d1m09-LTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d1m09-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d1m09-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d1m09-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678242191921

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: RELEASE
lola: RELEASE
lola: rewrite Frontend/Parser/formula_rewrite.k:427
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 DBSingleClientW-PT-d1m09-LTLFireability-04
lola: time limit : 720 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for DBSingleClientW-PT-d1m09-LTLFireability-04
lola: result : true
lola: markings : 9
lola: fired transitions : 8
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 DBSingleClientW-PT-d1m09-LTLFireability-13
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for DBSingleClientW-PT-d1m09-LTLFireability-13
lola: result : false
lola: markings : 3761
lola: fired transitions : 10139
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 DBSingleClientW-PT-d1m09-LTLFireability-14
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for DBSingleClientW-PT-d1m09-LTLFireability-14
lola: result : false
lola: markings : 1392
lola: fired transitions : 2620
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 DBSingleClientW-PT-d1m09-LTLFireability-05
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d1m09-LTLFireability-04: LTL true LTL model checker
DBSingleClientW-PT-d1m09-LTLFireability-13: LTL false LTL model checker
DBSingleClientW-PT-d1m09-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DBSingleClientW-PT-d1m09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
DBSingleClientW-PT-d1m09-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1800 7/32 DBSingleClientW-PT-d1m09-LTLFireability-05 951641 m, 190328 m/sec, 2180992 t fired, .

Time elapsed: 5 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d1m09-LTLFireability-04: LTL true LTL model checker
DBSingleClientW-PT-d1m09-LTLFireability-13: LTL false LTL model checker
DBSingleClientW-PT-d1m09-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DBSingleClientW-PT-d1m09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
DBSingleClientW-PT-d1m09-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1800 13/32 DBSingleClientW-PT-d1m09-LTLFireability-05 1844424 m, 178556 m/sec, 4271681 t fired, .

Time elapsed: 10 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d1m09-LTLFireability-04: LTL true LTL model checker
DBSingleClientW-PT-d1m09-LTLFireability-13: LTL false LTL model checker
DBSingleClientW-PT-d1m09-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DBSingleClientW-PT-d1m09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
DBSingleClientW-PT-d1m09-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1800 18/32 DBSingleClientW-PT-d1m09-LTLFireability-05 2695152 m, 170145 m/sec, 6275150 t fired, .

Time elapsed: 15 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d1m09-LTLFireability-04: LTL true LTL model checker
DBSingleClientW-PT-d1m09-LTLFireability-13: LTL false LTL model checker
DBSingleClientW-PT-d1m09-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DBSingleClientW-PT-d1m09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
DBSingleClientW-PT-d1m09-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1800 24/32 DBSingleClientW-PT-d1m09-LTLFireability-05 3507350 m, 162439 m/sec, 8191057 t fired, .

Time elapsed: 20 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d1m09-LTLFireability-04: LTL true LTL model checker
DBSingleClientW-PT-d1m09-LTLFireability-13: LTL false LTL model checker
DBSingleClientW-PT-d1m09-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DBSingleClientW-PT-d1m09-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
DBSingleClientW-PT-d1m09-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1800 29/32 DBSingleClientW-PT-d1m09-LTLFireability-05 4298203 m, 158170 m/sec, 10078338 t fired, .

Time elapsed: 25 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 4 (type EXCL) for DBSingleClientW-PT-d1m09-LTLFireability-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d1m09-LTLFireability-04: LTL true LTL model checker
DBSingleClientW-PT-d1m09-LTLFireability-13: LTL false LTL model checker
DBSingleClientW-PT-d1m09-LTLFireability-14: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DBSingleClientW-PT-d1m09-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
DBSingleClientW-PT-d1m09-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 13 (type EXCL) for 12 DBSingleClientW-PT-d1m09-LTLFireability-15
lola: time limit : 3570 sec
lola: memory limit: 32 pages
lola: FINISHED task # 13 (type EXCL) for DBSingleClientW-PT-d1m09-LTLFireability-15
lola: result : false
lola: markings : 324
lola: fired transitions : 581
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 5

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d1m09-LTLFireability-04: LTL true LTL model checker
DBSingleClientW-PT-d1m09-LTLFireability-05: LTL unknown AGGR
DBSingleClientW-PT-d1m09-LTLFireability-13: LTL false LTL model checker
DBSingleClientW-PT-d1m09-LTLFireability-14: LTL false LTL model checker
DBSingleClientW-PT-d1m09-LTLFireability-15: LTL false LTL model checker


Time elapsed: 30 secs. Pages in use: 32

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

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