fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r105-tall-167814481100332
Last Updated
May 14, 2023

About the Execution of LTSMin+red for DBSingleClientW-PT-d2m09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
575.500 42212.00 66503.00 652.90 ?F?FTFTF??FF?TFF normal

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.r105-tall-167814481100332.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 ltsminxred
Input is DBSingleClientW-PT-d2m09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481100332
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.3K Feb 26 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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.3K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:23 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 1.6M 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-d2m09-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678279581926

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m09
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 12:46:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 12:46:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 12:46:23] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2023-03-08 12:46:23] [INFO ] Transformed 4763 places.
[2023-03-08 12:46:23] [INFO ] Transformed 2478 transitions.
[2023-03-08 12:46:23] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 3580 places in 16 ms
Reduce places removed 3580 places and 0 transitions.
Support contains 31 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 378 places :
Symmetric choice reduction at 1 with 378 rule applications. Total rules 623 place count 759 transition count 1361
Iterating global reduction 1 with 378 rules applied. Total rules applied 1001 place count 759 transition count 1361
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 1037 place count 759 transition count 1325
Discarding 299 places :
Symmetric choice reduction at 2 with 299 rule applications. Total rules 1336 place count 460 transition count 1026
Iterating global reduction 2 with 299 rules applied. Total rules applied 1635 place count 460 transition count 1026
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1646 place count 460 transition count 1015
Discarding 222 places :
Symmetric choice reduction at 3 with 222 rule applications. Total rules 1868 place count 238 transition count 702
Iterating global reduction 3 with 222 rules applied. Total rules applied 2090 place count 238 transition count 702
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 251 transitions.
Iterating post reduction 3 with 251 rules applied. Total rules applied 2341 place count 238 transition count 451
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 2359 place count 220 transition count 416
Iterating global reduction 4 with 18 rules applied. Total rules applied 2377 place count 220 transition count 416
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 2397 place count 220 transition count 396
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 2408 place count 209 transition count 385
Iterating global reduction 5 with 11 rules applied. Total rules applied 2419 place count 209 transition count 385
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2422 place count 209 transition count 382
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 2431 place count 200 transition count 373
Iterating global reduction 6 with 9 rules applied. Total rules applied 2440 place count 200 transition count 373
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2448 place count 200 transition count 365
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2450 place count 198 transition count 358
Iterating global reduction 7 with 2 rules applied. Total rules applied 2452 place count 198 transition count 358
Applied a total of 2452 rules in 195 ms. Remains 198 /1183 variables (removed 985) and now considering 358/2478 (removed 2120) transitions.
// Phase 1: matrix 358 rows 198 cols
[2023-03-08 12:46:24] [INFO ] Computed 2 place invariants in 21 ms
[2023-03-08 12:46:24] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-08 12:46:24] [INFO ] Invariant cache hit.
[2023-03-08 12:46:24] [INFO ] State equation strengthened by 175 read => feed constraints.
[2023-03-08 12:46:25] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 929 ms to find 0 implicit places.
[2023-03-08 12:46:25] [INFO ] Invariant cache hit.
[2023-03-08 12:46:25] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 198/1183 places, 358/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1268 ms. Remains : 198/1183 places, 358/2478 transitions.
Support contains 31 out of 198 places after structural reductions.
[2023-03-08 12:46:25] [INFO ] Flatten gal took : 50 ms
[2023-03-08 12:46:25] [INFO ] Flatten gal took : 23 ms
[2023-03-08 12:46:25] [INFO ] Input system was already deterministic with 358 transitions.
Incomplete random walk after 10000 steps, including 2302 resets, run finished after 442 ms. (steps per millisecond=22 ) properties (out of 28) seen :1
Incomplete Best-First random walk after 1000 steps, including 40 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 106 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 103 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 32 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 101 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 101 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Finished probabilistic random walk after 260041 steps, run visited all 27 properties in 914 ms. (steps per millisecond=284 )
Probabilistic random walk after 260041 steps, saw 106186 distinct states, run finished after 914 ms. (steps per millisecond=284 ) properties seen :27
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 5 stabilizing places and 27 stable transitions
Graph (complete) has 759 edges and 198 vertex of which 197 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1||X(X(p2))))))))'
Support contains 5 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 358/358 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 177 transition count 297
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 177 transition count 297
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 177 transition count 294
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 61 place count 161 transition count 274
Iterating global reduction 1 with 16 rules applied. Total rules applied 77 place count 161 transition count 274
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 82 place count 161 transition count 269
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 95 place count 148 transition count 249
Iterating global reduction 2 with 13 rules applied. Total rules applied 108 place count 148 transition count 249
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 117 place count 148 transition count 240
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 126 place count 139 transition count 213
Iterating global reduction 3 with 9 rules applied. Total rules applied 135 place count 139 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 137 place count 139 transition count 211
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 141 place count 135 transition count 207
Iterating global reduction 4 with 4 rules applied. Total rules applied 145 place count 135 transition count 207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 148 place count 135 transition count 204
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 149 place count 134 transition count 202
Iterating global reduction 5 with 1 rules applied. Total rules applied 150 place count 134 transition count 202
Applied a total of 150 rules in 21 ms. Remains 134 /198 variables (removed 64) and now considering 202/358 (removed 156) transitions.
// Phase 1: matrix 202 rows 134 cols
[2023-03-08 12:46:27] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 12:46:28] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-03-08 12:46:28] [INFO ] Invariant cache hit.
[2023-03-08 12:46:28] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-08 12:46:28] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2023-03-08 12:46:28] [INFO ] Invariant cache hit.
[2023-03-08 12:46:28] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 134/198 places, 202/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 616 ms. Remains : 134/198 places, 202/358 transitions.
Stuttering acceptance computed with spot in 373 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-00 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: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s72 1)), p1:(AND (OR (LT s16 1) (LT s55 1)) (OR (LT s1 1) (LT s128 1))), p2:(OR (LT s16 1) (LT s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22970 reset in 303 ms.
Product exploration explored 100000 steps with 22866 reset in 218 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 492 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 355 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2288 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 447 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 938 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 936 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 995 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Finished probabilistic random walk after 17291 steps, run visited all 4 properties in 123 ms. (steps per millisecond=140 )
Probabilistic random walk after 17291 steps, saw 8562 distinct states, run finished after 124 ms. (steps per millisecond=139 ) properties seen :4
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 488 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 134 /134 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-08 12:46:31] [INFO ] Invariant cache hit.
[2023-03-08 12:46:31] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-08 12:46:31] [INFO ] Invariant cache hit.
[2023-03-08 12:46:31] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-08 12:46:31] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2023-03-08 12:46:31] [INFO ] Invariant cache hit.
[2023-03-08 12:46:31] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 454 ms. Remains : 134/134 places, 202/202 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 492 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 289 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2282 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 423 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 991 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 966 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 929 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Finished probabilistic random walk after 17291 steps, run visited all 4 properties in 240 ms. (steps per millisecond=72 )
Probabilistic random walk after 17291 steps, saw 8562 distinct states, run finished after 240 ms. (steps per millisecond=72 ) properties seen :4
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 410 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 23079 reset in 166 ms.
Product exploration explored 100000 steps with 22929 reset in 199 ms.
Applying partial POR strategy [false, true, false, false, false, false]
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 202/202 transitions.
Applied a total of 0 rules in 25 ms. Remains 134 /134 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-08 12:46:35] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-08 12:46:35] [INFO ] Invariant cache hit.
[2023-03-08 12:46:35] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 134/134 places, 202/202 transitions.
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 134 /134 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-08 12:46:35] [INFO ] Invariant cache hit.
[2023-03-08 12:46:35] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 12:46:35] [INFO ] Invariant cache hit.
[2023-03-08 12:46:35] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-08 12:46:35] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2023-03-08 12:46:35] [INFO ] Invariant cache hit.
[2023-03-08 12:46:35] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 469 ms. Remains : 134/134 places, 202/202 transitions.
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-00 finished in 7919 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((p0 U G(!p1))))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 358/358 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 176 transition count 304
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 176 transition count 304
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 176 transition count 301
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 65 place count 158 transition count 279
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 158 transition count 279
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 90 place count 158 transition count 272
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 104 place count 144 transition count 250
Iterating global reduction 2 with 14 rules applied. Total rules applied 118 place count 144 transition count 250
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 130 place count 144 transition count 238
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 140 place count 134 transition count 203
Iterating global reduction 3 with 10 rules applied. Total rules applied 150 place count 134 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 151 place count 134 transition count 202
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 156 place count 129 transition count 197
Iterating global reduction 4 with 5 rules applied. Total rules applied 161 place count 129 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 164 place count 129 transition count 194
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 166 place count 127 transition count 191
Iterating global reduction 5 with 2 rules applied. Total rules applied 168 place count 127 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 169 place count 127 transition count 190
Applied a total of 169 rules in 13 ms. Remains 127 /198 variables (removed 71) and now considering 190/358 (removed 168) transitions.
// Phase 1: matrix 190 rows 127 cols
[2023-03-08 12:46:35] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 12:46:35] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-08 12:46:35] [INFO ] Invariant cache hit.
[2023-03-08 12:46:35] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-08 12:46:36] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2023-03-08 12:46:36] [INFO ] Invariant cache hit.
[2023-03-08 12:46:36] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 127/198 places, 190/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 425 ms. Remains : 127/198 places, 190/358 transitions.
Stuttering acceptance computed with spot in 104 ms :[p1, p1, true, p1]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s69 1)), p0:(AND (GEQ s1 1) (GEQ s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 23129 reset in 206 ms.
Product exploration explored 100000 steps with 22912 reset in 171 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 466 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 433 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, p1, p1]
Incomplete random walk after 10000 steps, including 2331 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 443 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16786 steps, run visited all 1 properties in 30 ms. (steps per millisecond=559 )
Probabilistic random walk after 16786 steps, saw 8304 distinct states, run finished after 30 ms. (steps per millisecond=559 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 11 factoid took 424 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 81 ms :[true, p1, p1]
Support contains 2 out of 127 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 190/190 transitions.
Applied a total of 0 rules in 3 ms. Remains 127 /127 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2023-03-08 12:46:37] [INFO ] Invariant cache hit.
[2023-03-08 12:46:37] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-08 12:46:37] [INFO ] Invariant cache hit.
[2023-03-08 12:46:37] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-08 12:46:38] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-08 12:46:38] [INFO ] Invariant cache hit.
[2023-03-08 12:46:38] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 429 ms. Remains : 127/127 places, 190/190 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 466 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, p1, p1]
Incomplete random walk after 10000 steps, including 2321 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16786 steps, run visited all 1 properties in 30 ms. (steps per millisecond=559 )
Probabilistic random walk after 16786 steps, saw 8304 distinct states, run finished after 31 ms. (steps per millisecond=541 ) properties seen :1
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 93 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 99 ms :[true, p1, p1]
Product exploration explored 100000 steps with 23057 reset in 158 ms.
Product exploration explored 100000 steps with 22926 reset in 156 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 84 ms :[true, p1, p1]
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 190/190 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 126 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 126 transition count 182
Applied a total of 2 rules in 20 ms. Remains 126 /127 variables (removed 1) and now considering 182/190 (removed 8) transitions.
[2023-03-08 12:46:39] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 182 rows 126 cols
[2023-03-08 12:46:39] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 12:46:39] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/127 places, 182/190 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 ms. Remains : 126/127 places, 182/190 transitions.
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 190/190 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 126 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 126 transition count 182
Applied a total of 2 rules in 3 ms. Remains 126 /127 variables (removed 1) and now considering 182/190 (removed 8) transitions.
[2023-03-08 12:46:39] [INFO ] Invariant cache hit.
[2023-03-08 12:46:39] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-08 12:46:39] [INFO ] Invariant cache hit.
[2023-03-08 12:46:39] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-08 12:46:39] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-03-08 12:46:39] [INFO ] Invariant cache hit.
[2023-03-08 12:46:39] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/127 places, 182/190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 386 ms. Remains : 126/127 places, 182/190 transitions.
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-02 finished in 4309 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(!p0) U p1) U (X((G(p2)||p0))||p2)))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 358/358 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 176 transition count 293
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 176 transition count 293
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 176 transition count 289
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 63 place count 161 transition count 271
Iterating global reduction 1 with 15 rules applied. Total rules applied 78 place count 161 transition count 271
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 83 place count 161 transition count 266
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 95 place count 149 transition count 246
Iterating global reduction 2 with 12 rules applied. Total rules applied 107 place count 149 transition count 246
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 115 place count 149 transition count 238
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 124 place count 140 transition count 209
Iterating global reduction 3 with 9 rules applied. Total rules applied 133 place count 140 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 134 place count 140 transition count 208
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 138 place count 136 transition count 204
Iterating global reduction 4 with 4 rules applied. Total rules applied 142 place count 136 transition count 204
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 145 place count 136 transition count 201
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 146 place count 135 transition count 199
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 135 transition count 199
Applied a total of 147 rules in 11 ms. Remains 135 /198 variables (removed 63) and now considering 199/358 (removed 159) transitions.
// Phase 1: matrix 199 rows 135 cols
[2023-03-08 12:46:39] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 12:46:40] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-08 12:46:40] [INFO ] Invariant cache hit.
[2023-03-08 12:46:40] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-08 12:46:40] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2023-03-08 12:46:40] [INFO ] Invariant cache hit.
[2023-03-08 12:46:40] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/198 places, 199/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 482 ms. Remains : 135/198 places, 199/358 transitions.
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (NOT p1) p0), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), true, (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 5}, { cond=(AND p2 p0), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s118 1)), p1:(AND (GEQ s1 1) (GEQ s92 1)), p0:(AND (GEQ s1 1) (GEQ s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-03 finished in 772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 358/358 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 175 transition count 298
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 175 transition count 298
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 175 transition count 294
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 158 transition count 273
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 158 transition count 273
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 89 place count 158 transition count 268
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 102 place count 145 transition count 247
Iterating global reduction 2 with 13 rules applied. Total rules applied 115 place count 145 transition count 247
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 125 place count 145 transition count 237
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 135 place count 135 transition count 196
Iterating global reduction 3 with 10 rules applied. Total rules applied 145 place count 135 transition count 196
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 150 place count 130 transition count 191
Iterating global reduction 3 with 5 rules applied. Total rules applied 155 place count 130 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 158 place count 130 transition count 188
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 160 place count 128 transition count 185
Iterating global reduction 4 with 2 rules applied. Total rules applied 162 place count 128 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 163 place count 128 transition count 184
Applied a total of 163 rules in 14 ms. Remains 128 /198 variables (removed 70) and now considering 184/358 (removed 174) transitions.
// Phase 1: matrix 184 rows 128 cols
[2023-03-08 12:46:40] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 12:46:40] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 12:46:40] [INFO ] Invariant cache hit.
[2023-03-08 12:46:40] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-08 12:46:41] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2023-03-08 12:46:41] [INFO ] Invariant cache hit.
[2023-03-08 12:46:41] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/198 places, 184/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 417 ms. Remains : 128/198 places, 184/358 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s119 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 277 ms.
Product exploration explored 100000 steps with 50000 reset in 240 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 465 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 52 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-04 finished in 1156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 358/358 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 175 transition count 292
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 175 transition count 292
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 175 transition count 289
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 67 place count 157 transition count 267
Iterating global reduction 1 with 18 rules applied. Total rules applied 85 place count 157 transition count 267
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 91 place count 157 transition count 261
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 105 place count 143 transition count 239
Iterating global reduction 2 with 14 rules applied. Total rules applied 119 place count 143 transition count 239
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 129 place count 143 transition count 229
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 139 place count 133 transition count 193
Iterating global reduction 3 with 10 rules applied. Total rules applied 149 place count 133 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 150 place count 133 transition count 192
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 155 place count 128 transition count 187
Iterating global reduction 4 with 5 rules applied. Total rules applied 160 place count 128 transition count 187
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 163 place count 128 transition count 184
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 165 place count 126 transition count 181
Iterating global reduction 5 with 2 rules applied. Total rules applied 167 place count 126 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 168 place count 126 transition count 180
Applied a total of 168 rules in 19 ms. Remains 126 /198 variables (removed 72) and now considering 180/358 (removed 178) transitions.
// Phase 1: matrix 180 rows 126 cols
[2023-03-08 12:46:41] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 12:46:41] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-08 12:46:41] [INFO ] Invariant cache hit.
[2023-03-08 12:46:42] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-08 12:46:42] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-03-08 12:46:42] [INFO ] Invariant cache hit.
[2023-03-08 12:46:42] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/198 places, 180/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 407 ms. Remains : 126/198 places, 180/358 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-05 finished in 481 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(!p0)||((!p1&&X((F(!p0)||G(!p1)))) U G(p1))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 358/358 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 176 transition count 304
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 176 transition count 304
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 50 place count 176 transition count 298
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 159 transition count 277
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 159 transition count 277
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 89 place count 159 transition count 272
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 103 place count 145 transition count 250
Iterating global reduction 2 with 14 rules applied. Total rules applied 117 place count 145 transition count 250
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 129 place count 145 transition count 238
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 139 place count 135 transition count 203
Iterating global reduction 3 with 10 rules applied. Total rules applied 149 place count 135 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 150 place count 135 transition count 202
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 155 place count 130 transition count 197
Iterating global reduction 4 with 5 rules applied. Total rules applied 160 place count 130 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 163 place count 130 transition count 194
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 165 place count 128 transition count 191
Iterating global reduction 5 with 2 rules applied. Total rules applied 167 place count 128 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 168 place count 128 transition count 190
Applied a total of 168 rules in 19 ms. Remains 128 /198 variables (removed 70) and now considering 190/358 (removed 168) transitions.
// Phase 1: matrix 190 rows 128 cols
[2023-03-08 12:46:42] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 12:46:42] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-08 12:46:42] [INFO ] Invariant cache hit.
[2023-03-08 12:46:42] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-08 12:46:42] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2023-03-08 12:46:42] [INFO ] Invariant cache hit.
[2023-03-08 12:46:42] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/198 places, 190/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 447 ms. Remains : 128/198 places, 190/358 transitions.
Stuttering acceptance computed with spot in 225 ms :[true, p0, (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 5}, { cond=(AND p1 p0), acceptance={} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=6 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=6 dest: 6}]], initial=2, aps=[p1:(AND (GEQ s8 1) (GEQ s53 1)), p0:(AND (GEQ s1 1) (GEQ s97 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 240 ms.
Product exploration explored 100000 steps with 50000 reset in 251 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 468 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (X (NOT p1))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 p0)))
Knowledge based reduction with 7 factoid took 129 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-06 finished in 1326 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(F((!p0&&X(p0))))))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 358/358 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 175 transition count 303
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 175 transition count 303
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 175 transition count 297
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 70 place count 157 transition count 275
Iterating global reduction 1 with 18 rules applied. Total rules applied 88 place count 157 transition count 275
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 94 place count 157 transition count 269
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 108 place count 143 transition count 247
Iterating global reduction 2 with 14 rules applied. Total rules applied 122 place count 143 transition count 247
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 134 place count 143 transition count 235
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 145 place count 132 transition count 192
Iterating global reduction 3 with 11 rules applied. Total rules applied 156 place count 132 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 157 place count 132 transition count 191
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 162 place count 127 transition count 186
Iterating global reduction 4 with 5 rules applied. Total rules applied 167 place count 127 transition count 186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 170 place count 127 transition count 183
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 172 place count 125 transition count 180
Iterating global reduction 5 with 2 rules applied. Total rules applied 174 place count 125 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 175 place count 125 transition count 179
Applied a total of 175 rules in 13 ms. Remains 125 /198 variables (removed 73) and now considering 179/358 (removed 179) transitions.
// Phase 1: matrix 179 rows 125 cols
[2023-03-08 12:46:43] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 12:46:43] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-08 12:46:43] [INFO ] Invariant cache hit.
[2023-03-08 12:46:43] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-08 12:46:44] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2023-03-08 12:46:44] [INFO ] Invariant cache hit.
[2023-03-08 12:46:44] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/198 places, 179/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 405 ms. Remains : 125/198 places, 179/358 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), true, true, true]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s1 1) (GEQ s94 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-07 finished in 552 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 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 358/358 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 175 transition count 292
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 175 transition count 292
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 175 transition count 288
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 158 transition count 267
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 158 transition count 267
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 89 place count 158 transition count 262
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 103 place count 144 transition count 240
Iterating global reduction 2 with 14 rules applied. Total rules applied 117 place count 144 transition count 240
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 127 place count 144 transition count 230
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 137 place count 134 transition count 195
Iterating global reduction 3 with 10 rules applied. Total rules applied 147 place count 134 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 148 place count 134 transition count 194
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 153 place count 129 transition count 189
Iterating global reduction 4 with 5 rules applied. Total rules applied 158 place count 129 transition count 189
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 161 place count 129 transition count 186
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 163 place count 127 transition count 183
Iterating global reduction 5 with 2 rules applied. Total rules applied 165 place count 127 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 166 place count 127 transition count 182
Applied a total of 166 rules in 33 ms. Remains 127 /198 variables (removed 71) and now considering 182/358 (removed 176) transitions.
// Phase 1: matrix 182 rows 127 cols
[2023-03-08 12:46:44] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 12:46:44] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-08 12:46:44] [INFO ] Invariant cache hit.
[2023-03-08 12:46:44] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-08 12:46:44] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-08 12:46:44] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:46:44] [INFO ] Invariant cache hit.
[2023-03-08 12:46:44] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/198 places, 182/358 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 422 ms. Remains : 127/198 places, 182/358 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-08 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 s8 1) (LT s53 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 22904 reset in 250 ms.
Product exploration explored 100000 steps with 23103 reset in 138 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 460 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 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 2286 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 960 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 20774 steps, run visited all 1 properties in 35 ms. (steps per millisecond=593 )
Probabilistic random walk after 20774 steps, saw 10293 distinct states, run finished after 36 ms. (steps per millisecond=577 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 130 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 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 182/182 transitions.
Applied a total of 0 rules in 10 ms. Remains 127 /127 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-08 12:46:45] [INFO ] Invariant cache hit.
[2023-03-08 12:46:45] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-08 12:46:45] [INFO ] Invariant cache hit.
[2023-03-08 12:46:45] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-08 12:46:45] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-03-08 12:46:45] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 12:46:45] [INFO ] Invariant cache hit.
[2023-03-08 12:46:46] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 422 ms. Remains : 127/127 places, 182/182 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 460 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 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 308 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2312 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 975 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 20774 steps, run visited all 1 properties in 35 ms. (steps per millisecond=593 )
Probabilistic random walk after 20774 steps, saw 10293 distinct states, run finished after 35 ms. (steps per millisecond=593 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 143 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23014 reset in 136 ms.
Product exploration explored 100000 steps with 23089 reset in 147 ms.
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 182/182 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-08 12:46:47] [INFO ] Invariant cache hit.
[2023-03-08 12:46:47] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-08 12:46:47] [INFO ] Invariant cache hit.
[2023-03-08 12:46:47] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-08 12:46:47] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-08 12:46:47] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 12:46:47] [INFO ] Invariant cache hit.
[2023-03-08 12:46:47] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 435 ms. Remains : 127/127 places, 182/182 transitions.
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-08 finished in 3358 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 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 358/358 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 175 transition count 295
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 175 transition count 295
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 175 transition count 291
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 158 transition count 270
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 158 transition count 270
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 90 place count 158 transition count 264
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 103 place count 145 transition count 244
Iterating global reduction 2 with 13 rules applied. Total rules applied 116 place count 145 transition count 244
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 126 place count 145 transition count 234
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 136 place count 135 transition count 192
Iterating global reduction 3 with 10 rules applied. Total rules applied 146 place count 135 transition count 192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 148 place count 135 transition count 190
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 152 place count 131 transition count 186
Iterating global reduction 4 with 4 rules applied. Total rules applied 156 place count 131 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 157 place count 131 transition count 185
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 159 place count 129 transition count 182
Iterating global reduction 5 with 2 rules applied. Total rules applied 161 place count 129 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 162 place count 129 transition count 181
Applied a total of 162 rules in 25 ms. Remains 129 /198 variables (removed 69) and now considering 181/358 (removed 177) transitions.
// Phase 1: matrix 181 rows 129 cols
[2023-03-08 12:46:47] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 12:46:47] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-08 12:46:47] [INFO ] Invariant cache hit.
[2023-03-08 12:46:47] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-08 12:46:48] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2023-03-08 12:46:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:46:48] [INFO ] Invariant cache hit.
[2023-03-08 12:46:48] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/198 places, 181/358 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 488 ms. Remains : 129/198 places, 181/358 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s123 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22831 reset in 147 ms.
Product exploration explored 100000 steps with 22903 reset in 146 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 464 edges and 129 vertex of which 128 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2264 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 464 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21180 steps, run visited all 1 properties in 45 ms. (steps per millisecond=470 )
Probabilistic random walk after 21180 steps, saw 10451 distinct states, run finished after 45 ms. (steps per millisecond=470 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 181/181 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2023-03-08 12:46:48] [INFO ] Invariant cache hit.
[2023-03-08 12:46:48] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-08 12:46:48] [INFO ] Invariant cache hit.
[2023-03-08 12:46:49] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-08 12:46:49] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-08 12:46:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:46:49] [INFO ] Invariant cache hit.
[2023-03-08 12:46:49] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 422 ms. Remains : 129/129 places, 181/181 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 464 edges and 129 vertex of which 128 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2339 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 446 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21180 steps, run visited all 1 properties in 35 ms. (steps per millisecond=605 )
Probabilistic random walk after 21180 steps, saw 10451 distinct states, run finished after 35 ms. (steps per millisecond=605 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23009 reset in 139 ms.
Product exploration explored 100000 steps with 22928 reset in 151 ms.
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 181/181 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2023-03-08 12:46:50] [INFO ] Invariant cache hit.
[2023-03-08 12:46:50] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-08 12:46:50] [INFO ] Invariant cache hit.
[2023-03-08 12:46:50] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-08 12:46:50] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2023-03-08 12:46:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:46:50] [INFO ] Invariant cache hit.
[2023-03-08 12:46:50] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 440 ms. Remains : 129/129 places, 181/181 transitions.
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-09 finished in 2872 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((p0||G(F(p1)))))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 358/358 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 176 transition count 293
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 176 transition count 293
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 176 transition count 290
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 64 place count 159 transition count 269
Iterating global reduction 1 with 17 rules applied. Total rules applied 81 place count 159 transition count 269
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 87 place count 159 transition count 263
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 100 place count 146 transition count 242
Iterating global reduction 2 with 13 rules applied. Total rules applied 113 place count 146 transition count 242
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 122 place count 146 transition count 233
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 131 place count 137 transition count 205
Iterating global reduction 3 with 9 rules applied. Total rules applied 140 place count 137 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 141 place count 137 transition count 204
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 146 place count 132 transition count 199
Iterating global reduction 4 with 5 rules applied. Total rules applied 151 place count 132 transition count 199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 154 place count 132 transition count 196
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 156 place count 130 transition count 193
Iterating global reduction 5 with 2 rules applied. Total rules applied 158 place count 130 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 159 place count 130 transition count 192
Applied a total of 159 rules in 14 ms. Remains 130 /198 variables (removed 68) and now considering 192/358 (removed 166) transitions.
// Phase 1: matrix 192 rows 130 cols
[2023-03-08 12:46:50] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 12:46:50] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-08 12:46:50] [INFO ] Invariant cache hit.
[2023-03-08 12:46:50] [INFO ] State equation strengthened by 70 read => feed constraints.
[2023-03-08 12:46:50] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2023-03-08 12:46:50] [INFO ] Invariant cache hit.
[2023-03-08 12:46:50] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/198 places, 192/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 393 ms. Remains : 130/198 places, 192/358 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s64 1)), p1:(AND (GEQ s1 1) (GEQ s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-10 finished in 540 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(p0)&&G(((!p0&&G((!p0||X(G(!p0)))))||p1))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 358/358 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 176 transition count 293
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 176 transition count 293
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 176 transition count 289
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 64 place count 160 transition count 269
Iterating global reduction 1 with 16 rules applied. Total rules applied 80 place count 160 transition count 269
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 85 place count 160 transition count 264
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 97 place count 148 transition count 249
Iterating global reduction 2 with 12 rules applied. Total rules applied 109 place count 148 transition count 249
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 119 place count 148 transition count 239
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 129 place count 138 transition count 197
Iterating global reduction 3 with 10 rules applied. Total rules applied 139 place count 138 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 140 place count 138 transition count 196
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 144 place count 134 transition count 192
Iterating global reduction 4 with 4 rules applied. Total rules applied 148 place count 134 transition count 192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 150 place count 134 transition count 190
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 152 place count 132 transition count 187
Iterating global reduction 5 with 2 rules applied. Total rules applied 154 place count 132 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 155 place count 132 transition count 186
Applied a total of 155 rules in 17 ms. Remains 132 /198 variables (removed 66) and now considering 186/358 (removed 172) transitions.
// Phase 1: matrix 186 rows 132 cols
[2023-03-08 12:46:51] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 12:46:51] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-08 12:46:51] [INFO ] Invariant cache hit.
[2023-03-08 12:46:51] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 12:46:51] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-08 12:46:51] [INFO ] Invariant cache hit.
[2023-03-08 12:46:51] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 132/198 places, 186/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 132/198 places, 186/358 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(OR p1 (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 1}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s125 1)), p0:(AND (GEQ s8 1) (GEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, 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 4 steps with 1 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-11 finished in 674 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 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 358/358 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 175 transition count 292
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 175 transition count 292
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 175 transition count 288
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 158 transition count 267
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 158 transition count 267
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 90 place count 158 transition count 261
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 103 place count 145 transition count 240
Iterating global reduction 2 with 13 rules applied. Total rules applied 116 place count 145 transition count 240
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 123 place count 145 transition count 233
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 131 place count 137 transition count 210
Iterating global reduction 3 with 8 rules applied. Total rules applied 139 place count 137 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 140 place count 137 transition count 209
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 145 place count 132 transition count 204
Iterating global reduction 4 with 5 rules applied. Total rules applied 150 place count 132 transition count 204
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 153 place count 132 transition count 201
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 155 place count 130 transition count 198
Iterating global reduction 5 with 2 rules applied. Total rules applied 157 place count 130 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 158 place count 130 transition count 197
Applied a total of 158 rules in 27 ms. Remains 130 /198 variables (removed 68) and now considering 197/358 (removed 161) transitions.
// Phase 1: matrix 197 rows 130 cols
[2023-03-08 12:46:51] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 12:46:51] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-08 12:46:51] [INFO ] Invariant cache hit.
[2023-03-08 12:46:51] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-08 12:46:52] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2023-03-08 12:46:52] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 12:46:52] [INFO ] Invariant cache hit.
[2023-03-08 12:46:52] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/198 places, 197/358 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 520 ms. Remains : 130/198 places, 197/358 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 23110 reset in 150 ms.
Product exploration explored 100000 steps with 22894 reset in 157 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 477 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2325 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 14634 steps, run visited all 1 properties in 26 ms. (steps per millisecond=562 )
Probabilistic random walk after 14634 steps, saw 7127 distinct states, run finished after 26 ms. (steps per millisecond=562 ) 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 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 197/197 transitions.
Applied a total of 0 rules in 4 ms. Remains 130 /130 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2023-03-08 12:46:52] [INFO ] Invariant cache hit.
[2023-03-08 12:46:53] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-08 12:46:53] [INFO ] Invariant cache hit.
[2023-03-08 12:46:53] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-08 12:46:53] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2023-03-08 12:46:53] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 12:46:53] [INFO ] Invariant cache hit.
[2023-03-08 12:46:53] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 507 ms. Remains : 130/130 places, 197/197 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 477 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2236 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 463 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 14634 steps, run visited all 1 properties in 28 ms. (steps per millisecond=522 )
Probabilistic random walk after 14634 steps, saw 7127 distinct states, run finished after 29 ms. (steps per millisecond=504 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23043 reset in 168 ms.
Product exploration explored 100000 steps with 22992 reset in 166 ms.
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 197/197 transitions.
Applied a total of 0 rules in 4 ms. Remains 130 /130 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2023-03-08 12:46:54] [INFO ] Invariant cache hit.
[2023-03-08 12:46:54] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-08 12:46:54] [INFO ] Invariant cache hit.
[2023-03-08 12:46:54] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-08 12:46:54] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2023-03-08 12:46:54] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 12:46:54] [INFO ] Invariant cache hit.
[2023-03-08 12:46:54] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 528 ms. Remains : 130/130 places, 197/197 transitions.
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-12 finished in 3132 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' '!(((p0 U p1)||(X((G(p3)||p2))&&F(p4))))'
Support contains 5 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 358/358 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 177 transition count 308
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 177 transition count 308
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 48 place count 177 transition count 302
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 64 place count 161 transition count 282
Iterating global reduction 1 with 16 rules applied. Total rules applied 80 place count 161 transition count 282
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 86 place count 161 transition count 276
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 98 place count 149 transition count 257
Iterating global reduction 2 with 12 rules applied. Total rules applied 110 place count 149 transition count 257
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 119 place count 149 transition count 248
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 127 place count 141 transition count 221
Iterating global reduction 3 with 8 rules applied. Total rules applied 135 place count 141 transition count 221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 137 place count 141 transition count 219
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 141 place count 137 transition count 215
Iterating global reduction 4 with 4 rules applied. Total rules applied 145 place count 137 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 146 place count 137 transition count 214
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 148 place count 135 transition count 211
Iterating global reduction 5 with 2 rules applied. Total rules applied 150 place count 135 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 151 place count 135 transition count 210
Applied a total of 151 rules in 12 ms. Remains 135 /198 variables (removed 63) and now considering 210/358 (removed 148) transitions.
// Phase 1: matrix 210 rows 135 cols
[2023-03-08 12:46:54] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 12:46:54] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-08 12:46:54] [INFO ] Invariant cache hit.
[2023-03-08 12:46:54] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-08 12:46:55] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2023-03-08 12:46:55] [INFO ] Invariant cache hit.
[2023-03-08 12:46:55] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/198 places, 210/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 473 ms. Remains : 135/198 places, 210/358 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p4))), (AND (NOT p3) (NOT p2)), (NOT p4), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p4)), true, (NOT p3), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p4)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p4)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 6}], [{ cond=(NOT p4), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) p3), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p4)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s129 1)), p0:(AND (GEQ s1 1) (GEQ s97 1)), p4:(OR (LT s1 1) (LT s98 1)), p2:(OR (LT s1 1) (LT s98 1)), p3:(OR (LT s1 1) (LT s90 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 298 ms.
Product exploration explored 100000 steps with 50000 reset in 309 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 499 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p4 p2 p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) p3))), (X (NOT (AND (NOT p1) p0 (NOT p2) p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X p4), (X (NOT (AND (NOT p1) p0 (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p4)))), true, (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (AND (NOT p1) (NOT p0) p3))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p3)), (X (X p4)), (X (X (NOT (AND (NOT p1) p0 (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p4)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) p3)))
Knowledge based reduction with 21 factoid took 409 ms. Reduced automaton from 9 states, 22 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-13 finished in 1846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!p0||X(p1)))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 358/358 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 176 transition count 304
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 176 transition count 304
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 50 place count 176 transition count 298
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 159 transition count 278
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 159 transition count 278
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 89 place count 159 transition count 273
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 103 place count 145 transition count 251
Iterating global reduction 2 with 14 rules applied. Total rules applied 117 place count 145 transition count 251
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 129 place count 145 transition count 239
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 140 place count 134 transition count 196
Iterating global reduction 3 with 11 rules applied. Total rules applied 151 place count 134 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 152 place count 134 transition count 195
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 156 place count 130 transition count 191
Iterating global reduction 4 with 4 rules applied. Total rules applied 160 place count 130 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 163 place count 130 transition count 188
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 164 place count 129 transition count 186
Iterating global reduction 5 with 1 rules applied. Total rules applied 165 place count 129 transition count 186
Applied a total of 165 rules in 14 ms. Remains 129 /198 variables (removed 69) and now considering 186/358 (removed 172) transitions.
// Phase 1: matrix 186 rows 129 cols
[2023-03-08 12:46:56] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 12:46:56] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-08 12:46:56] [INFO ] Invariant cache hit.
[2023-03-08 12:46:56] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-08 12:46:56] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2023-03-08 12:46:56] [INFO ] Invariant cache hit.
[2023-03-08 12:46:57] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/198 places, 186/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 386 ms. Remains : 129/198 places, 186/358 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s44 1) (GEQ s81 1)), p0:(OR (LT s1 1) (LT s94 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-14 finished in 516 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)) U G(p1)))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 358/358 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 176 transition count 299
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 176 transition count 299
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 176 transition count 295
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 64 place count 160 transition count 275
Iterating global reduction 1 with 16 rules applied. Total rules applied 80 place count 160 transition count 275
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 86 place count 160 transition count 269
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 98 place count 148 transition count 249
Iterating global reduction 2 with 12 rules applied. Total rules applied 110 place count 148 transition count 249
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 119 place count 148 transition count 240
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 128 place count 139 transition count 207
Iterating global reduction 3 with 9 rules applied. Total rules applied 137 place count 139 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 138 place count 139 transition count 206
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 142 place count 135 transition count 202
Iterating global reduction 4 with 4 rules applied. Total rules applied 146 place count 135 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 149 place count 135 transition count 199
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 150 place count 134 transition count 197
Iterating global reduction 5 with 1 rules applied. Total rules applied 151 place count 134 transition count 197
Applied a total of 151 rules in 25 ms. Remains 134 /198 variables (removed 64) and now considering 197/358 (removed 161) transitions.
// Phase 1: matrix 197 rows 134 cols
[2023-03-08 12:46:57] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 12:46:57] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-08 12:46:57] [INFO ] Invariant cache hit.
[2023-03-08 12:46:57] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-08 12:46:57] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2023-03-08 12:46:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 12:46:57] [INFO ] Invariant cache hit.
[2023-03-08 12:46:57] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/198 places, 197/358 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 434 ms. Remains : 134/198 places, 197/358 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (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=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s132 1)), p0:(AND (GEQ s1 1) (GEQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 2 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-15 finished in 552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1||X(X(p2))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(!p1))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d2m09-LTLFireability-02
Stuttering acceptance computed with spot in 102 ms :[p1, p1, true, p1]
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 198/198 places, 358/358 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 176 transition count 304
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 176 transition count 304
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 176 transition count 301
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 65 place count 158 transition count 279
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 158 transition count 279
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 90 place count 158 transition count 272
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 104 place count 144 transition count 250
Iterating global reduction 2 with 14 rules applied. Total rules applied 118 place count 144 transition count 250
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 130 place count 144 transition count 238
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 140 place count 134 transition count 203
Iterating global reduction 3 with 10 rules applied. Total rules applied 150 place count 134 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 151 place count 134 transition count 202
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 156 place count 129 transition count 197
Iterating global reduction 4 with 5 rules applied. Total rules applied 161 place count 129 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 164 place count 129 transition count 194
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 166 place count 127 transition count 191
Iterating global reduction 5 with 2 rules applied. Total rules applied 168 place count 127 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 169 place count 127 transition count 190
Applied a total of 169 rules in 28 ms. Remains 127 /198 variables (removed 71) and now considering 190/358 (removed 168) transitions.
// Phase 1: matrix 190 rows 127 cols
[2023-03-08 12:46:58] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 12:46:58] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-08 12:46:58] [INFO ] Invariant cache hit.
[2023-03-08 12:46:58] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-08 12:46:58] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2023-03-08 12:46:58] [INFO ] Invariant cache hit.
[2023-03-08 12:46:58] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 127/198 places, 190/358 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 429 ms. Remains : 127/198 places, 190/358 transitions.
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s69 1)), p0:(AND (GEQ s1 1) (GEQ s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 23046 reset in 151 ms.
Product exploration explored 100000 steps with 23067 reset in 163 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 466 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 460 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, p1, p1]
Incomplete random walk after 10000 steps, including 2320 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 430 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16786 steps, run visited all 1 properties in 30 ms. (steps per millisecond=559 )
Probabilistic random walk after 16786 steps, saw 8304 distinct states, run finished after 30 ms. (steps per millisecond=559 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 11 factoid took 411 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 86 ms :[true, p1, p1]
Support contains 2 out of 127 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 190/190 transitions.
Applied a total of 0 rules in 1 ms. Remains 127 /127 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2023-03-08 12:46:59] [INFO ] Invariant cache hit.
[2023-03-08 12:47:00] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-08 12:47:00] [INFO ] Invariant cache hit.
[2023-03-08 12:47:00] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-08 12:47:00] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2023-03-08 12:47:00] [INFO ] Invariant cache hit.
[2023-03-08 12:47:00] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 396 ms. Remains : 127/127 places, 190/190 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 466 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, p1, p1]
Incomplete random walk after 10000 steps, including 2295 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 442 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16786 steps, run visited all 1 properties in 32 ms. (steps per millisecond=524 )
Probabilistic random walk after 16786 steps, saw 8304 distinct states, run finished after 32 ms. (steps per millisecond=524 ) properties seen :1
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 85 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 81 ms :[true, p1, p1]
Product exploration explored 100000 steps with 22989 reset in 154 ms.
Product exploration explored 100000 steps with 22984 reset in 154 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 163 ms :[true, p1, p1]
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 190/190 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 126 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 126 transition count 182
Applied a total of 2 rules in 10 ms. Remains 126 /127 variables (removed 1) and now considering 182/190 (removed 8) transitions.
[2023-03-08 12:47:01] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 182 rows 126 cols
[2023-03-08 12:47:01] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 12:47:01] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/127 places, 182/190 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 126/127 places, 182/190 transitions.
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 190/190 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 126 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 126 transition count 182
Applied a total of 2 rules in 2 ms. Remains 126 /127 variables (removed 1) and now considering 182/190 (removed 8) transitions.
[2023-03-08 12:47:01] [INFO ] Invariant cache hit.
[2023-03-08 12:47:01] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-08 12:47:01] [INFO ] Invariant cache hit.
[2023-03-08 12:47:01] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-08 12:47:02] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2023-03-08 12:47:02] [INFO ] Invariant cache hit.
[2023-03-08 12:47:02] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/127 places, 182/190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 376 ms. Remains : 126/127 places, 182/190 transitions.
Treatment of property DBSingleClientW-PT-d2m09-LTLFireability-02 finished in 4289 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)))'
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)))'
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)))'
[2023-03-08 12:47:02] [INFO ] Flatten gal took : 32 ms
[2023-03-08 12:47:02] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-08 12:47:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 198 places, 358 transitions and 1410 arcs took 3 ms.
Total runtime 39023 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2072/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2072/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2072/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2072/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2072/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DBSingleClientW-PT-d2m09-LTLFireability-00
Could not compute solution for formula : DBSingleClientW-PT-d2m09-LTLFireability-02
Could not compute solution for formula : DBSingleClientW-PT-d2m09-LTLFireability-08
Could not compute solution for formula : DBSingleClientW-PT-d2m09-LTLFireability-09
Could not compute solution for formula : DBSingleClientW-PT-d2m09-LTLFireability-12

BK_STOP 1678279624138

--------------------
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
mcc2023
ltl formula name DBSingleClientW-PT-d2m09-LTLFireability-00
ltl formula formula --ltl=/tmp/2072/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 198 places, 358 transitions and 1410 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2072/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2072/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2072/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2072/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DBSingleClientW-PT-d2m09-LTLFireability-02
ltl formula formula --ltl=/tmp/2072/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 198 places, 358 transitions and 1410 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2072/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2072/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2072/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2072/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DBSingleClientW-PT-d2m09-LTLFireability-08
ltl formula formula --ltl=/tmp/2072/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 198 places, 358 transitions and 1410 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2072/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2072/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2072/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2072/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DBSingleClientW-PT-d2m09-LTLFireability-09
ltl formula formula --ltl=/tmp/2072/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 198 places, 358 transitions and 1410 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2072/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2072/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2072/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2072/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DBSingleClientW-PT-d2m09-LTLFireability-12
ltl formula formula --ltl=/tmp/2072/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 198 places, 358 transitions and 1410 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.020 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2072/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2072/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2072/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2072/ltl_4_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d2m09"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DBSingleClientW-PT-d2m09, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r105-tall-167814481100332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m09.tgz
mv DBSingleClientW-PT-d2m09 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;