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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 6.0K Feb 26 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Feb 26 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 432K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678268208367

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-d1m09
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 09:36:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 09:36:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 09:36:50] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2023-03-08 09:36:50] [INFO ] Transformed 1440 places.
[2023-03-08 09:36:50] [INFO ] Transformed 672 transitions.
[2023-03-08 09:36:50] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 184 place count 243 transition count 412
Iterating global reduction 1 with 83 rules applied. Total rules applied 267 place count 243 transition count 412
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 279 place count 243 transition count 400
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 341 place count 181 transition count 338
Iterating global reduction 2 with 62 rules applied. Total rules applied 403 place count 181 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 406 place count 181 transition count 335
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 436 place count 151 transition count 287
Iterating global reduction 3 with 30 rules applied. Total rules applied 466 place count 151 transition count 287
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 493 place count 151 transition count 260
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 499 place count 145 transition count 252
Iterating global reduction 4 with 6 rules applied. Total rules applied 505 place count 145 transition count 252
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 510 place count 140 transition count 247
Iterating global reduction 4 with 5 rules applied. Total rules applied 515 place count 140 transition count 247
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 517 place count 140 transition count 245
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 520 place count 137 transition count 242
Iterating global reduction 5 with 3 rules applied. Total rules applied 523 place count 137 transition count 242
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 524 place count 136 transition count 240
Iterating global reduction 5 with 1 rules applied. Total rules applied 525 place count 136 transition count 240
Applied a total of 525 rules in 86 ms. Remains 136 /347 variables (removed 211) and now considering 240/672 (removed 432) transitions.
// Phase 1: matrix 240 rows 136 cols
[2023-03-08 09:36:50] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-08 09:36:51] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-03-08 09:36:51] [INFO ] Invariant cache hit.
[2023-03-08 09:36:51] [INFO ] State equation strengthened by 121 read => feed constraints.
[2023-03-08 09:36:51] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
[2023-03-08 09:36:51] [INFO ] Invariant cache hit.
[2023-03-08 09:36:51] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/347 places, 240/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 818 ms. Remains : 136/347 places, 240/672 transitions.
Support contains 29 out of 136 places after structural reductions.
[2023-03-08 09:36:51] [INFO ] Flatten gal took : 51 ms
[2023-03-08 09:36:51] [INFO ] Flatten gal took : 22 ms
[2023-03-08 09:36:51] [INFO ] Input system was already deterministic with 240 transitions.
Incomplete random walk after 10000 steps, including 2248 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 26) seen :5
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 38 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 105 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 60 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 40 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-03-08 09:36:52] [INFO ] Invariant cache hit.
[2023-03-08 09:36:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 09:36:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 09:36:53] [INFO ] After 719ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:19
[2023-03-08 09:36:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 09:36:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 09:36:54] [INFO ] After 503ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :19
[2023-03-08 09:36:54] [INFO ] State equation strengthened by 121 read => feed constraints.
[2023-03-08 09:36:54] [INFO ] After 742ms SMT Verify possible using 121 Read/Feed constraints in natural domain returned unsat :2 sat :19
[2023-03-08 09:36:55] [INFO ] After 1445ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :19
Attempting to minimize the solution found.
Minimization took 669 ms.
[2023-03-08 09:36:56] [INFO ] After 2764ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :19
Fused 21 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 259 ms.
Support contains 23 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 131 transition count 227
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 131 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 131 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 130 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 130 transition count 225
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 129 transition count 224
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 129 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 129 transition count 223
Applied a total of 16 rules in 35 ms. Remains 129 /136 variables (removed 7) and now considering 223/240 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 129/136 places, 223/240 transitions.
Incomplete random walk after 10000 steps, including 2312 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 32 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Finished probabilistic random walk after 7618 steps, run visited all 19 properties in 114 ms. (steps per millisecond=66 )
Probabilistic random walk after 7618 steps, saw 3499 distinct states, run finished after 115 ms. (steps per millisecond=66 ) properties seen :19
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 5 stabilizing places and 24 stable transitions
Graph (complete) has 509 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(p1)&&p0)))))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 116 transition count 168
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 116 transition count 168
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 116 transition count 165
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 105 transition count 154
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 105 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 69 place count 105 transition count 150
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 79 place count 95 transition count 135
Iterating global reduction 2 with 10 rules applied. Total rules applied 89 place count 95 transition count 135
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 95 place count 95 transition count 129
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 90 transition count 118
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 90 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 90 transition count 116
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 110 place count 87 transition count 113
Iterating global reduction 4 with 3 rules applied. Total rules applied 113 place count 87 transition count 113
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 115 place count 85 transition count 111
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 85 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 119 place count 85 transition count 109
Applied a total of 119 rules in 17 ms. Remains 85 /136 variables (removed 51) and now considering 109/240 (removed 131) transitions.
// Phase 1: matrix 109 rows 85 cols
[2023-03-08 09:36:57] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 09:36:57] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-08 09:36:57] [INFO ] Invariant cache hit.
[2023-03-08 09:36:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-08 09:36:57] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2023-03-08 09:36:57] [INFO ] Invariant cache hit.
[2023-03-08 09:36:58] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/136 places, 109/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 604 ms. Remains : 85/136 places, 109/240 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s42 1)), p1:(AND (GEQ s1 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-00 finished in 974 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 116 transition count 172
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 116 transition count 172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 116 transition count 168
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 54 place count 106 transition count 158
Iterating global reduction 1 with 10 rules applied. Total rules applied 64 place count 106 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 67 place count 106 transition count 155
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 76 place count 97 transition count 141
Iterating global reduction 2 with 9 rules applied. Total rules applied 85 place count 97 transition count 141
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 91 place count 97 transition count 135
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 96 place count 92 transition count 120
Iterating global reduction 3 with 5 rules applied. Total rules applied 101 place count 92 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 102 place count 92 transition count 119
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 105 place count 89 transition count 116
Iterating global reduction 4 with 3 rules applied. Total rules applied 108 place count 89 transition count 116
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 110 place count 87 transition count 114
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 87 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 114 place count 87 transition count 112
Applied a total of 114 rules in 34 ms. Remains 87 /136 variables (removed 49) and now considering 112/240 (removed 128) transitions.
// Phase 1: matrix 112 rows 87 cols
[2023-03-08 09:36:58] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 09:36:58] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-08 09:36:58] [INFO ] Invariant cache hit.
[2023-03-08 09:36:58] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 09:36:58] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2023-03-08 09:36:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 09:36:58] [INFO ] Invariant cache hit.
[2023-03-08 09:36:58] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/136 places, 112/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 353 ms. Remains : 87/136 places, 112/240 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-01 finished in 403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((G(p1) U p2))&&F(p1)&&p0)))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 117 transition count 173
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 117 transition count 173
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 117 transition count 169
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 52 place count 107 transition count 159
Iterating global reduction 1 with 10 rules applied. Total rules applied 62 place count 107 transition count 159
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 66 place count 107 transition count 155
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 75 place count 98 transition count 142
Iterating global reduction 2 with 9 rules applied. Total rules applied 84 place count 98 transition count 142
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 89 place count 98 transition count 137
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 94 place count 93 transition count 121
Iterating global reduction 3 with 5 rules applied. Total rules applied 99 place count 93 transition count 121
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 103 place count 93 transition count 117
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 105 place count 91 transition count 115
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 91 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 109 place count 89 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 111 place count 89 transition count 113
Applied a total of 111 rules in 19 ms. Remains 89 /136 variables (removed 47) and now considering 113/240 (removed 127) transitions.
// Phase 1: matrix 113 rows 89 cols
[2023-03-08 09:36:58] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 09:36:58] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-08 09:36:58] [INFO ] Invariant cache hit.
[2023-03-08 09:36:59] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-08 09:36:59] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-03-08 09:36:59] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 09:36:59] [INFO ] Invariant cache hit.
[2023-03-08 09:36:59] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/136 places, 113/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 368 ms. Remains : 89/136 places, 113/240 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=0 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={0} source=0 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=3 dest: 2}, { cond=(OR p2 p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={1} source=5 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s84 1)), p2:(AND (GEQ s26 1) (GEQ s35 1)), p1:(AND (GEQ s1 1) (GEQ s84 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-02 finished in 658 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 116 transition count 171
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 116 transition count 171
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 116 transition count 167
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 54 place count 106 transition count 157
Iterating global reduction 1 with 10 rules applied. Total rules applied 64 place count 106 transition count 157
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 68 place count 106 transition count 153
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 77 place count 97 transition count 139
Iterating global reduction 2 with 9 rules applied. Total rules applied 86 place count 97 transition count 139
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 91 place count 97 transition count 134
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 97 place count 91 transition count 117
Iterating global reduction 3 with 6 rules applied. Total rules applied 103 place count 91 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 105 place count 91 transition count 115
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 108 place count 88 transition count 112
Iterating global reduction 4 with 3 rules applied. Total rules applied 111 place count 88 transition count 112
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 113 place count 86 transition count 110
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 86 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 117 place count 86 transition count 108
Applied a total of 117 rules in 31 ms. Remains 86 /136 variables (removed 50) and now considering 108/240 (removed 132) transitions.
// Phase 1: matrix 108 rows 86 cols
[2023-03-08 09:36:59] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 09:36:59] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-08 09:36:59] [INFO ] Invariant cache hit.
[2023-03-08 09:36:59] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-08 09:36:59] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2023-03-08 09:36:59] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 09:36:59] [INFO ] Invariant cache hit.
[2023-03-08 09:36:59] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/136 places, 108/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 320 ms. Remains : 86/136 places, 108/240 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-03 finished in 365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F(p0))||(p0&&X(X(p1)))))))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 117 transition count 174
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 117 transition count 174
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 117 transition count 171
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 52 place count 106 transition count 160
Iterating global reduction 1 with 11 rules applied. Total rules applied 63 place count 106 transition count 160
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 67 place count 106 transition count 156
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 77 place count 96 transition count 141
Iterating global reduction 2 with 10 rules applied. Total rules applied 87 place count 96 transition count 141
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 93 place count 96 transition count 135
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 99 place count 90 transition count 118
Iterating global reduction 3 with 6 rules applied. Total rules applied 105 place count 90 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 90 transition count 116
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 110 place count 87 transition count 113
Iterating global reduction 4 with 3 rules applied. Total rules applied 113 place count 87 transition count 113
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 115 place count 85 transition count 111
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 85 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 119 place count 85 transition count 109
Applied a total of 119 rules in 13 ms. Remains 85 /136 variables (removed 51) and now considering 109/240 (removed 131) transitions.
// Phase 1: matrix 109 rows 85 cols
[2023-03-08 09:36:59] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 09:36:59] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-08 09:36:59] [INFO ] Invariant cache hit.
[2023-03-08 09:36:59] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 09:37:00] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-08 09:37:00] [INFO ] Invariant cache hit.
[2023-03-08 09:37:00] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/136 places, 109/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 269 ms. Remains : 85/136 places, 109/240 transitions.
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(OR (LT s2 1) (LT s82 1)), p1:(AND (GEQ s1 1) (GEQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28560 reset in 233 ms.
Product exploration explored 100000 steps with 28579 reset in 173 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 290 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2286 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Finished probabilistic random walk after 3346 steps, run visited all 2 properties in 15 ms. (steps per millisecond=223 )
Probabilistic random walk after 3346 steps, saw 1646 distinct states, run finished after 16 ms. (steps per millisecond=209 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 109/109 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-08 09:37:01] [INFO ] Invariant cache hit.
[2023-03-08 09:37:01] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 09:37:01] [INFO ] Invariant cache hit.
[2023-03-08 09:37:01] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 09:37:02] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-08 09:37:02] [INFO ] Invariant cache hit.
[2023-03-08 09:37:02] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 227 ms. Remains : 85/85 places, 109/109 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 290 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 258 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2295 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Finished probabilistic random walk after 3346 steps, run visited all 2 properties in 17 ms. (steps per millisecond=196 )
Probabilistic random walk after 3346 steps, saw 1646 distinct states, run finished after 17 ms. (steps per millisecond=196 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 28610 reset in 183 ms.
Product exploration explored 100000 steps with 28529 reset in 169 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 109/109 transitions.
Applied a total of 0 rules in 9 ms. Remains 85 /85 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-08 09:37:04] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 09:37:04] [INFO ] Invariant cache hit.
[2023-03-08 09:37:04] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 85/85 places, 109/109 transitions.
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 109/109 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-08 09:37:04] [INFO ] Invariant cache hit.
[2023-03-08 09:37:04] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 09:37:04] [INFO ] Invariant cache hit.
[2023-03-08 09:37:04] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 09:37:04] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2023-03-08 09:37:04] [INFO ] Invariant cache hit.
[2023-03-08 09:37:04] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 232 ms. Remains : 85/85 places, 109/109 transitions.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-04 finished in 4841 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 117 transition count 180
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 117 transition count 180
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 117 transition count 174
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 54 place count 107 transition count 164
Iterating global reduction 1 with 10 rules applied. Total rules applied 64 place count 107 transition count 164
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 68 place count 107 transition count 160
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 77 place count 98 transition count 147
Iterating global reduction 2 with 9 rules applied. Total rules applied 86 place count 98 transition count 147
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 92 place count 98 transition count 141
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 97 place count 93 transition count 125
Iterating global reduction 3 with 5 rules applied. Total rules applied 102 place count 93 transition count 125
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 106 place count 93 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 108 place count 91 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 110 place count 91 transition count 119
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 112 place count 89 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 89 transition count 117
Applied a total of 114 rules in 26 ms. Remains 89 /136 variables (removed 47) and now considering 117/240 (removed 123) transitions.
// Phase 1: matrix 117 rows 89 cols
[2023-03-08 09:37:04] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 09:37:04] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-08 09:37:04] [INFO ] Invariant cache hit.
[2023-03-08 09:37:04] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-08 09:37:05] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2023-03-08 09:37:05] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 09:37:05] [INFO ] Invariant cache hit.
[2023-03-08 09:37:05] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/136 places, 117/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 512 ms. Remains : 89/136 places, 117/240 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s84 1) (AND (GEQ s1 1) (GEQ s62 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22879 reset in 108 ms.
Product exploration explored 100000 steps with 22850 reset in 114 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 304 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 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)]
Incomplete random walk after 10000 steps, including 2276 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 500 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4849 steps, run visited all 1 properties in 9 ms. (steps per millisecond=538 )
Probabilistic random walk after 4849 steps, saw 2265 distinct states, run finished after 9 ms. (steps per millisecond=538 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 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 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 117/117 transitions.
Applied a total of 0 rules in 5 ms. Remains 89 /89 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-08 09:37:06] [INFO ] Invariant cache hit.
[2023-03-08 09:37:06] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 09:37:06] [INFO ] Invariant cache hit.
[2023-03-08 09:37:06] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-08 09:37:06] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-03-08 09:37:06] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 09:37:06] [INFO ] Invariant cache hit.
[2023-03-08 09:37:06] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 306 ms. Remains : 89/89 places, 117/117 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 304 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2282 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 479 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4849 steps, run visited all 1 properties in 9 ms. (steps per millisecond=538 )
Probabilistic random walk after 4849 steps, saw 2265 distinct states, run finished after 9 ms. (steps per millisecond=538 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22955 reset in 106 ms.
Product exploration explored 100000 steps with 22957 reset in 111 ms.
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 117/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-08 09:37:07] [INFO ] Invariant cache hit.
[2023-03-08 09:37:07] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-08 09:37:07] [INFO ] Invariant cache hit.
[2023-03-08 09:37:07] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-08 09:37:07] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2023-03-08 09:37:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 09:37:07] [INFO ] Invariant cache hit.
[2023-03-08 09:37:07] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 309 ms. Remains : 89/89 places, 117/117 transitions.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-05 finished in 2760 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)||(p0&&F(p1))))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 117 transition count 177
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 117 transition count 177
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 117 transition count 172
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 106 transition count 161
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 106 transition count 161
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 69 place count 106 transition count 157
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 79 place count 96 transition count 142
Iterating global reduction 2 with 10 rules applied. Total rules applied 89 place count 96 transition count 142
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 96 place count 96 transition count 135
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 102 place count 90 transition count 118
Iterating global reduction 3 with 6 rules applied. Total rules applied 108 place count 90 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 110 place count 90 transition count 116
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 113 place count 87 transition count 113
Iterating global reduction 4 with 3 rules applied. Total rules applied 116 place count 87 transition count 113
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 118 place count 85 transition count 111
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 85 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 122 place count 85 transition count 109
Applied a total of 122 rules in 19 ms. Remains 85 /136 variables (removed 51) and now considering 109/240 (removed 131) transitions.
// Phase 1: matrix 109 rows 85 cols
[2023-03-08 09:37:07] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 09:37:07] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 09:37:07] [INFO ] Invariant cache hit.
[2023-03-08 09:37:07] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 09:37:07] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2023-03-08 09:37:07] [INFO ] Invariant cache hit.
[2023-03-08 09:37:07] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/136 places, 109/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 278 ms. Remains : 85/136 places, 109/240 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s57 1)), p1:(OR (LT s1 1) (LT s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Product exploration explored 100000 steps with 50000 reset in 168 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 287 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p1))))
Knowledge based reduction with 5 factoid took 120 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-06 finished in 910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 118 transition count 189
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 118 transition count 189
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 42 place count 118 transition count 183
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 52 place count 108 transition count 173
Iterating global reduction 1 with 10 rules applied. Total rules applied 62 place count 108 transition count 173
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 65 place count 108 transition count 170
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 74 place count 99 transition count 157
Iterating global reduction 2 with 9 rules applied. Total rules applied 83 place count 99 transition count 157
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 91 place count 99 transition count 149
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 96 place count 94 transition count 134
Iterating global reduction 3 with 5 rules applied. Total rules applied 101 place count 94 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 102 place count 94 transition count 133
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 105 place count 91 transition count 130
Iterating global reduction 4 with 3 rules applied. Total rules applied 108 place count 91 transition count 130
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 110 place count 89 transition count 128
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 89 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 114 place count 89 transition count 126
Applied a total of 114 rules in 19 ms. Remains 89 /136 variables (removed 47) and now considering 126/240 (removed 114) transitions.
// Phase 1: matrix 126 rows 89 cols
[2023-03-08 09:37:08] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 09:37:08] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-08 09:37:08] [INFO ] Invariant cache hit.
[2023-03-08 09:37:08] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-08 09:37:08] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2023-03-08 09:37:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 09:37:08] [INFO ] Invariant cache hit.
[2023-03-08 09:37:08] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/136 places, 126/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 309 ms. Remains : 89/136 places, 126/240 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s1 1) (LT s81 1)) (OR (LT s1 1) (LT s59 1))), p1:(AND (GEQ s1 1) (GEQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-07 finished in 445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(F(p1) U X(G(!p2))))))'
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 117 transition count 169
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 117 transition count 169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 117 transition count 166
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 50 place count 108 transition count 157
Iterating global reduction 1 with 9 rules applied. Total rules applied 59 place count 108 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 62 place count 108 transition count 154
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 70 place count 100 transition count 141
Iterating global reduction 2 with 8 rules applied. Total rules applied 78 place count 100 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 83 place count 100 transition count 136
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 87 place count 96 transition count 127
Iterating global reduction 3 with 4 rules applied. Total rules applied 91 place count 96 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 96 transition count 126
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 95 place count 93 transition count 123
Iterating global reduction 4 with 3 rules applied. Total rules applied 98 place count 93 transition count 123
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 100 place count 91 transition count 121
Iterating global reduction 4 with 2 rules applied. Total rules applied 102 place count 91 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 104 place count 91 transition count 119
Applied a total of 104 rules in 12 ms. Remains 91 /136 variables (removed 45) and now considering 119/240 (removed 121) transitions.
// Phase 1: matrix 119 rows 91 cols
[2023-03-08 09:37:08] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 09:37:08] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 09:37:08] [INFO ] Invariant cache hit.
[2023-03-08 09:37:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 09:37:08] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2023-03-08 09:37:08] [INFO ] Invariant cache hit.
[2023-03-08 09:37:09] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/136 places, 119/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 262 ms. Remains : 91/136 places, 119/240 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) p2), (AND (NOT p1) p2), p2, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s59 1)), p1:(AND (GEQ s30 1) (GEQ s35 1)), p2:(AND (GEQ s27 1) (GEQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33896 reset in 182 ms.
Product exploration explored 100000 steps with 33804 reset in 196 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 311 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 278 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[p2, (AND (NOT p1) p2), p2, (NOT p1)]
Incomplete random walk after 10000 steps, including 2292 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 978 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 09:37:10] [INFO ] Invariant cache hit.
[2023-03-08 09:37:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 09:37:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 09:37:10] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 09:37:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 09:37:10] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 09:37:10] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 09:37:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 09:37:10] [INFO ] After 23ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 09:37:10] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-08 09:37:10] [INFO ] After 169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 119/119 transitions.
Graph (complete) has 286 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 90 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 89 transition count 115
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 89 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 89 transition count 114
Applied a total of 7 rules in 11 ms. Remains 89 /91 variables (removed 2) and now considering 114/119 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 89/91 places, 114/119 transitions.
Incomplete random walk after 10000 steps, including 2324 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 473 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 962 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Finished probabilistic random walk after 15617 steps, run visited all 2 properties in 59 ms. (steps per millisecond=264 )
Probabilistic random walk after 15617 steps, saw 7442 distinct states, run finished after 59 ms. (steps per millisecond=264 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(F p2), (F p0), (F p1), (F (AND (NOT p1) p2))]
Knowledge based reduction with 7 factoid took 394 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[p2, (AND (NOT p1) p2), p2, (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[p2, (AND (NOT p1) p2), p2, (NOT p1)]
Support contains 3 out of 91 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 119/119 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-08 09:37:11] [INFO ] Invariant cache hit.
[2023-03-08 09:37:11] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-08 09:37:11] [INFO ] Invariant cache hit.
[2023-03-08 09:37:11] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 09:37:11] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2023-03-08 09:37:11] [INFO ] Invariant cache hit.
[2023-03-08 09:37:11] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 271 ms. Remains : 91/91 places, 119/119 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 311 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 226 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[p2, (AND (NOT p1) p2), p2, (NOT p1)]
Incomplete random walk after 10000 steps, including 2273 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 980 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 09:37:11] [INFO ] Invariant cache hit.
[2023-03-08 09:37:11] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 09:37:11] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 09:37:11] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 09:37:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 09:37:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 09:37:12] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 09:37:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 09:37:12] [INFO ] After 15ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 09:37:12] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-08 09:37:12] [INFO ] After 104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 119/119 transitions.
Graph (complete) has 286 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 90 transition count 116
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 88 transition count 114
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 88 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 88 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 87 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 87 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 86 transition count 111
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 86 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 86 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 85 transition count 104
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 85 transition count 104
Applied a total of 16 rules in 9 ms. Remains 85 /91 variables (removed 6) and now considering 104/119 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 85/91 places, 104/119 transitions.
Incomplete random walk after 10000 steps, including 2289 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 951 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16047 steps, run visited all 1 properties in 23 ms. (steps per millisecond=697 )
Probabilistic random walk after 16047 steps, saw 7663 distinct states, run finished after 24 ms. (steps per millisecond=668 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F p2), (F p1)]
Knowledge based reduction with 6 factoid took 394 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[p2, (AND (NOT p1) p2), p2, (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[p2, (AND (NOT p1) p2), p2, (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[p2, (AND (NOT p1) p2), p2, (NOT p1)]
Product exploration explored 100000 steps with 29829 reset in 138 ms.
Product exploration explored 100000 steps with 29821 reset in 140 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 140 ms :[p2, (AND (NOT p1) p2), p2, (NOT p1)]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 119/119 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 90 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 89 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 89 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 88 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 88 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 88 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 87 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 87 transition count 109
Applied a total of 9 rules in 9 ms. Remains 87 /91 variables (removed 4) and now considering 109/119 (removed 10) transitions.
[2023-03-08 09:37:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 109 rows 87 cols
[2023-03-08 09:37:13] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 09:37:13] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/91 places, 109/119 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 87/91 places, 109/119 transitions.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 119/119 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 90 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 89 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 89 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 88 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 88 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 88 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 87 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 87 transition count 109
Applied a total of 9 rules in 5 ms. Remains 87 /91 variables (removed 4) and now considering 109/119 (removed 10) transitions.
[2023-03-08 09:37:13] [INFO ] Invariant cache hit.
[2023-03-08 09:37:13] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 09:37:13] [INFO ] Invariant cache hit.
[2023-03-08 09:37:13] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-08 09:37:13] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-08 09:37:13] [INFO ] Invariant cache hit.
[2023-03-08 09:37:13] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/91 places, 109/119 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 252 ms. Remains : 87/91 places, 109/119 transitions.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-08 finished in 5086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((X(p0)&&p1))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 117 transition count 181
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 117 transition count 181
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 117 transition count 176
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 106 transition count 165
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 106 transition count 165
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 70 place count 106 transition count 160
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 80 place count 96 transition count 145
Iterating global reduction 2 with 10 rules applied. Total rules applied 90 place count 96 transition count 145
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 97 place count 96 transition count 138
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 103 place count 90 transition count 121
Iterating global reduction 3 with 6 rules applied. Total rules applied 109 place count 90 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 111 place count 90 transition count 119
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 114 place count 87 transition count 116
Iterating global reduction 4 with 3 rules applied. Total rules applied 117 place count 87 transition count 116
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 119 place count 85 transition count 114
Iterating global reduction 4 with 2 rules applied. Total rules applied 121 place count 85 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 123 place count 85 transition count 112
Applied a total of 123 rules in 6 ms. Remains 85 /136 variables (removed 51) and now considering 112/240 (removed 128) transitions.
// Phase 1: matrix 112 rows 85 cols
[2023-03-08 09:37:13] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 09:37:13] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-08 09:37:13] [INFO ] Invariant cache hit.
[2023-03-08 09:37:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 09:37:14] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2023-03-08 09:37:14] [INFO ] Invariant cache hit.
[2023-03-08 09:37:14] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/136 places, 112/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 237 ms. Remains : 85/136 places, 112/240 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=p1, acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s60 1)), p1:(AND (GEQ s1 1) (GEQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-10 finished in 455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&F(G(!p1)))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 117 transition count 177
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 117 transition count 177
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 117 transition count 173
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 51 place count 108 transition count 164
Iterating global reduction 1 with 9 rules applied. Total rules applied 60 place count 108 transition count 164
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 63 place count 108 transition count 161
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 71 place count 100 transition count 148
Iterating global reduction 2 with 8 rules applied. Total rules applied 79 place count 100 transition count 148
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 85 place count 100 transition count 142
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 89 place count 96 transition count 129
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 96 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 96 transition count 128
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 96 place count 94 transition count 126
Iterating global reduction 4 with 2 rules applied. Total rules applied 98 place count 94 transition count 126
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 93 transition count 125
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 93 transition count 125
Applied a total of 100 rules in 13 ms. Remains 93 /136 variables (removed 43) and now considering 125/240 (removed 115) transitions.
// Phase 1: matrix 125 rows 93 cols
[2023-03-08 09:37:14] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 09:37:14] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-08 09:37:14] [INFO ] Invariant cache hit.
[2023-03-08 09:37:14] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 09:37:14] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-08 09:37:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 09:37:14] [INFO ] Invariant cache hit.
[2023-03-08 09:37:14] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/136 places, 125/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 325 ms. Remains : 93/136 places, 125/240 transitions.
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) p1), p1]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s91 1)), p1:(AND (GEQ s1 1) (GEQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22949 reset in 136 ms.
Product exploration explored 100000 steps with 22927 reset in 142 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 320 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X p0), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 262 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p0) p1), p1]
Incomplete random walk after 10000 steps, including 2277 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Finished probabilistic random walk after 19401 steps, run visited all 3 properties in 86 ms. (steps per millisecond=225 )
Probabilistic random walk after 19401 steps, saw 9284 distinct states, run finished after 86 ms. (steps per millisecond=225 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X p0), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND p1 p0))]
Knowledge based reduction with 7 factoid took 309 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) p1), p1]
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 93 /93 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-08 09:37:16] [INFO ] Invariant cache hit.
[2023-03-08 09:37:16] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-08 09:37:16] [INFO ] Invariant cache hit.
[2023-03-08 09:37:16] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 09:37:16] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2023-03-08 09:37:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 09:37:16] [INFO ] Invariant cache hit.
[2023-03-08 09:37:16] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 289 ms. Remains : 93/93 places, 125/125 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 320 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X p0), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 255 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p0) p1), p1]
Incomplete random walk after 10000 steps, including 2297 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 500 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 466 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Finished probabilistic random walk after 19401 steps, run visited all 3 properties in 97 ms. (steps per millisecond=200 )
Probabilistic random walk after 19401 steps, saw 9284 distinct states, run finished after 97 ms. (steps per millisecond=200 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X p0), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND p1 p0))]
Knowledge based reduction with 7 factoid took 446 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) p1), p1]
Product exploration explored 100000 steps with 23042 reset in 132 ms.
Product exploration explored 100000 steps with 22919 reset in 136 ms.
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-08 09:37:18] [INFO ] Invariant cache hit.
[2023-03-08 09:37:18] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-08 09:37:18] [INFO ] Invariant cache hit.
[2023-03-08 09:37:18] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 09:37:18] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2023-03-08 09:37:18] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 09:37:18] [INFO ] Invariant cache hit.
[2023-03-08 09:37:18] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 310 ms. Remains : 93/93 places, 125/125 transitions.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-13 finished in 4098 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(!p0 U p1)||X(!(!p0 U p2)))))'
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 118 transition count 174
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 118 transition count 174
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 41 place count 118 transition count 169
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 49 place count 110 transition count 161
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 110 transition count 161
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 60 place count 110 transition count 158
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 102 transition count 147
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 102 transition count 147
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 80 place count 102 transition count 143
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 84 place count 98 transition count 133
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 98 transition count 133
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 92 place count 98 transition count 129
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 94 place count 96 transition count 127
Iterating global reduction 4 with 2 rules applied. Total rules applied 96 place count 96 transition count 127
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 98 place count 94 transition count 125
Iterating global reduction 4 with 2 rules applied. Total rules applied 100 place count 94 transition count 125
Applied a total of 100 rules in 18 ms. Remains 94 /136 variables (removed 42) and now considering 125/240 (removed 115) transitions.
// Phase 1: matrix 125 rows 94 cols
[2023-03-08 09:37:18] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 09:37:18] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-08 09:37:18] [INFO ] Invariant cache hit.
[2023-03-08 09:37:18] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-08 09:37:18] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-08 09:37:18] [INFO ] Invariant cache hit.
[2023-03-08 09:37:18] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/136 places, 125/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 340 ms. Remains : 94/136 places, 125/240 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (AND p1 p2), (AND p1 p2), p1, p2]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s7 1) (GEQ s36 1)), p1:(AND (GEQ s1 1) (GEQ s89 1)), p2:(AND (GEQ s1 1) (GEQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 23027 reset in 157 ms.
Product exploration explored 100000 steps with 23067 reset in 163 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 322 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 925 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[true, (AND p1 p2), p2, p1, (AND p1 p2)]
Incomplete random walk after 10000 steps, including 2336 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 967 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 471 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 1000 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 464 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 1018 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 1009 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 490 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 521 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 964 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 2480021 steps, run timeout after 3001 ms. (steps per millisecond=826 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 7=1, 8=1, 9=1}
Probabilistic random walk after 2480021 steps, saw 962578 distinct states, run finished after 3002 ms. (steps per millisecond=826 ) properties seen :9
Running SMT prover for 1 properties.
[2023-03-08 09:37:23] [INFO ] Invariant cache hit.
[2023-03-08 09:37:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 09:37:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-08 09:37:24] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1))), (G (NOT (AND p2 p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p2) (NOT p1))), (F p2), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND (NOT p0) p2 (NOT p1))), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 23 factoid took 1236 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 164 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-08 09:37:25] [INFO ] Invariant cache hit.
[2023-03-08 09:37:25] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-08 09:37:25] [INFO ] Invariant cache hit.
[2023-03-08 09:37:25] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-08 09:37:25] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2023-03-08 09:37:25] [INFO ] Invariant cache hit.
[2023-03-08 09:37:25] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 274 ms. Remains : 94/94 places, 125/125 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 322 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 836 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Incomplete random walk after 10000 steps, including 2295 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 477 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1007 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 1017 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 448 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 993 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 971 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 442 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 989 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Finished probabilistic random walk after 21133 steps, run visited all 8 properties in 101 ms. (steps per millisecond=209 )
Probabilistic random walk after 21133 steps, saw 10012 distinct states, run finished after 101 ms. (steps per millisecond=209 ) properties seen :8
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p2 (NOT p0))), (F (AND p0 (NOT p1))), (F p2), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
Knowledge based reduction with 18 factoid took 1146 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 183 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 168 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Product exploration explored 100000 steps with 22971 reset in 136 ms.
Product exploration explored 100000 steps with 22817 reset in 143 ms.
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-08 09:37:29] [INFO ] Invariant cache hit.
[2023-03-08 09:37:29] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-08 09:37:29] [INFO ] Invariant cache hit.
[2023-03-08 09:37:29] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-08 09:37:29] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-08 09:37:29] [INFO ] Invariant cache hit.
[2023-03-08 09:37:29] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 271 ms. Remains : 94/94 places, 125/125 transitions.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-14 finished in 11462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U !p1)))'
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 117 transition count 169
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 117 transition count 169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 117 transition count 166
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 51 place count 107 transition count 156
Iterating global reduction 1 with 10 rules applied. Total rules applied 61 place count 107 transition count 156
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 64 place count 107 transition count 153
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 73 place count 98 transition count 140
Iterating global reduction 2 with 9 rules applied. Total rules applied 82 place count 98 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 87 place count 98 transition count 135
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 91 place count 94 transition count 125
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 place count 94 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 97 place count 94 transition count 123
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 99 place count 92 transition count 121
Iterating global reduction 4 with 2 rules applied. Total rules applied 101 place count 92 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 103 place count 90 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 105 place count 90 transition count 119
Applied a total of 105 rules in 10 ms. Remains 90 /136 variables (removed 46) and now considering 119/240 (removed 121) transitions.
// Phase 1: matrix 119 rows 90 cols
[2023-03-08 09:37:29] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 09:37:30] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-08 09:37:30] [INFO ] Invariant cache hit.
[2023-03-08 09:37:30] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-08 09:37:30] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2023-03-08 09:37:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 09:37:30] [INFO ] Invariant cache hit.
[2023-03-08 09:37:30] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/136 places, 119/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 332 ms. Remains : 90/136 places, 119/240 transitions.
Stuttering acceptance computed with spot in 102 ms :[p1, (NOT p0), p1]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s51 1)), p0:(OR (AND (GEQ s1 1) (GEQ s46 1)) (AND (GEQ s26 1) (GEQ s50 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 22978 reset in 115 ms.
Product exploration explored 100000 steps with 22915 reset in 126 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 308 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 177 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[p1, (NOT p0), p1]
Incomplete random walk after 10000 steps, including 2289 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 495 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Finished probabilistic random walk after 5348 steps, run visited all 2 properties in 30 ms. (steps per millisecond=178 )
Probabilistic random walk after 5348 steps, saw 2548 distinct states, run finished after 30 ms. (steps per millisecond=178 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 282 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[p1, (NOT p0), p1]
Stuttering acceptance computed with spot in 131 ms :[p1, (NOT p0), p1]
Support contains 5 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 119/119 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-08 09:37:31] [INFO ] Invariant cache hit.
[2023-03-08 09:37:31] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 09:37:31] [INFO ] Invariant cache hit.
[2023-03-08 09:37:31] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-08 09:37:31] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2023-03-08 09:37:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 09:37:31] [INFO ] Invariant cache hit.
[2023-03-08 09:37:31] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 253 ms. Remains : 90/90 places, 119/119 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 308 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 176 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[p1, (NOT p0), p1]
Incomplete random walk after 10000 steps, including 2298 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Finished probabilistic random walk after 5348 steps, run visited all 2 properties in 20 ms. (steps per millisecond=267 )
Probabilistic random walk after 5348 steps, saw 2548 distinct states, run finished after 20 ms. (steps per millisecond=267 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 232 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[p1, (NOT p0), p1]
Stuttering acceptance computed with spot in 109 ms :[p1, (NOT p0), p1]
Stuttering acceptance computed with spot in 120 ms :[p1, (NOT p0), p1]
Product exploration explored 100000 steps with 22904 reset in 114 ms.
Product exploration explored 100000 steps with 22922 reset in 119 ms.
Support contains 5 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 119/119 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-08 09:37:33] [INFO ] Invariant cache hit.
[2023-03-08 09:37:33] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 09:37:33] [INFO ] Invariant cache hit.
[2023-03-08 09:37:33] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-08 09:37:33] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-08 09:37:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 09:37:33] [INFO ] Invariant cache hit.
[2023-03-08 09:37:33] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 235 ms. Remains : 90/90 places, 119/119 transitions.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-15 finished in 3559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F(p0))||(p0&&X(X(p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(F(p1) U X(G(!p2))))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d1m09-LTLFireability-08
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) p2), (AND (NOT p1) p2), p2, (NOT p1)]
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 117 transition count 169
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 117 transition count 169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 117 transition count 166
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 50 place count 108 transition count 157
Iterating global reduction 1 with 9 rules applied. Total rules applied 59 place count 108 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 62 place count 108 transition count 154
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 70 place count 100 transition count 141
Iterating global reduction 2 with 8 rules applied. Total rules applied 78 place count 100 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 83 place count 100 transition count 136
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 87 place count 96 transition count 127
Iterating global reduction 3 with 4 rules applied. Total rules applied 91 place count 96 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 96 transition count 126
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 95 place count 93 transition count 123
Iterating global reduction 4 with 3 rules applied. Total rules applied 98 place count 93 transition count 123
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 100 place count 91 transition count 121
Iterating global reduction 4 with 2 rules applied. Total rules applied 102 place count 91 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 104 place count 91 transition count 119
Applied a total of 104 rules in 15 ms. Remains 91 /136 variables (removed 45) and now considering 119/240 (removed 121) transitions.
// Phase 1: matrix 119 rows 91 cols
[2023-03-08 09:37:33] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 09:37:33] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-08 09:37:33] [INFO ] Invariant cache hit.
[2023-03-08 09:37:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 09:37:34] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-08 09:37:34] [INFO ] Invariant cache hit.
[2023-03-08 09:37:34] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 91/136 places, 119/240 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 285 ms. Remains : 91/136 places, 119/240 transitions.
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s59 1)), p1:(AND (GEQ s30 1) (GEQ s35 1)), p2:(AND (GEQ s27 1) (GEQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33679 reset in 150 ms.
Product exploration explored 100000 steps with 33878 reset in 160 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 311 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 318 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[p2, (AND (NOT p1) p2), p2, (NOT p1)]
Incomplete random walk after 10000 steps, including 2298 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 490 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 990 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 996 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 09:37:35] [INFO ] Invariant cache hit.
[2023-03-08 09:37:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 09:37:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-08 09:37:35] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 09:37:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 09:37:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 09:37:35] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 09:37:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 09:37:35] [INFO ] After 34ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 09:37:35] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-08 09:37:35] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 119/119 transitions.
Graph (complete) has 286 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 90 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 89 transition count 115
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 89 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 89 transition count 114
Applied a total of 7 rules in 6 ms. Remains 89 /91 variables (removed 2) and now considering 114/119 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 89/91 places, 114/119 transitions.
Incomplete random walk after 10000 steps, including 2343 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 969 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Finished probabilistic random walk after 15617 steps, run visited all 2 properties in 50 ms. (steps per millisecond=312 )
Probabilistic random walk after 15617 steps, saw 7442 distinct states, run finished after 50 ms. (steps per millisecond=312 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(F p2), (F p0), (F p1), (F (AND (NOT p1) p2))]
Knowledge based reduction with 7 factoid took 407 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[p2, (AND (NOT p1) p2), p2, (NOT p1)]
Stuttering acceptance computed with spot in 137 ms :[p2, (AND (NOT p1) p2), p2, (NOT p1)]
Support contains 3 out of 91 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 119/119 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-08 09:37:36] [INFO ] Invariant cache hit.
[2023-03-08 09:37:36] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-08 09:37:36] [INFO ] Invariant cache hit.
[2023-03-08 09:37:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 09:37:36] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-08 09:37:36] [INFO ] Invariant cache hit.
[2023-03-08 09:37:36] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 281 ms. Remains : 91/91 places, 119/119 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 311 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 288 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[p2, (AND (NOT p1) p2), p2, (NOT p1)]
Incomplete random walk after 10000 steps, including 2290 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 1024 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 09:37:37] [INFO ] Invariant cache hit.
[2023-03-08 09:37:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 09:37:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 09:37:37] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 09:37:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 09:37:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 09:37:37] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 09:37:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 09:37:37] [INFO ] After 11ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 09:37:37] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-08 09:37:37] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 119/119 transitions.
Graph (complete) has 286 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 90 transition count 116
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 88 transition count 114
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 88 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 88 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 87 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 87 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 86 transition count 111
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 86 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 86 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 85 transition count 104
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 85 transition count 104
Applied a total of 16 rules in 9 ms. Remains 85 /91 variables (removed 6) and now considering 104/119 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 85/91 places, 104/119 transitions.
Incomplete random walk after 10000 steps, including 2330 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16047 steps, run visited all 1 properties in 20 ms. (steps per millisecond=802 )
Probabilistic random walk after 16047 steps, saw 7663 distinct states, run finished after 20 ms. (steps per millisecond=802 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F p2), (F p1)]
Knowledge based reduction with 6 factoid took 470 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[p2, (AND (NOT p1) p2), p2, (NOT p1)]
Stuttering acceptance computed with spot in 175 ms :[p2, (AND (NOT p1) p2), p2, (NOT p1)]
Stuttering acceptance computed with spot in 155 ms :[p2, (AND (NOT p1) p2), p2, (NOT p1)]
Product exploration explored 100000 steps with 29822 reset in 136 ms.
Product exploration explored 100000 steps with 29803 reset in 136 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 154 ms :[p2, (AND (NOT p1) p2), p2, (NOT p1)]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 119/119 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 90 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 89 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 89 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 88 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 88 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 88 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 87 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 87 transition count 109
Applied a total of 9 rules in 11 ms. Remains 87 /91 variables (removed 4) and now considering 109/119 (removed 10) transitions.
[2023-03-08 09:37:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 109 rows 87 cols
[2023-03-08 09:37:38] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 09:37:38] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/91 places, 109/119 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 87/91 places, 109/119 transitions.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 119/119 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 90 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 89 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 89 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 88 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 88 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 88 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 87 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 87 transition count 109
Applied a total of 9 rules in 3 ms. Remains 87 /91 variables (removed 4) and now considering 109/119 (removed 10) transitions.
[2023-03-08 09:37:38] [INFO ] Invariant cache hit.
[2023-03-08 09:37:38] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 09:37:38] [INFO ] Invariant cache hit.
[2023-03-08 09:37:38] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-08 09:37:38] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-08 09:37:38] [INFO ] Invariant cache hit.
[2023-03-08 09:37:39] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/91 places, 109/119 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 234 ms. Remains : 87/91 places, 109/119 transitions.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-08 finished in 5418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&F(G(!p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(!p0 U p1)||X(!(!p0 U p2)))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d1m09-LTLFireability-14
Stuttering acceptance computed with spot in 176 ms :[true, (AND p1 p2), (AND p1 p2), p1, p2]
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 118 transition count 174
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 118 transition count 174
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 41 place count 118 transition count 169
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 49 place count 110 transition count 161
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 110 transition count 161
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 60 place count 110 transition count 158
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 102 transition count 147
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 102 transition count 147
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 80 place count 102 transition count 143
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 84 place count 98 transition count 133
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 98 transition count 133
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 92 place count 98 transition count 129
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 94 place count 96 transition count 127
Iterating global reduction 4 with 2 rules applied. Total rules applied 96 place count 96 transition count 127
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 98 place count 94 transition count 125
Iterating global reduction 4 with 2 rules applied. Total rules applied 100 place count 94 transition count 125
Applied a total of 100 rules in 15 ms. Remains 94 /136 variables (removed 42) and now considering 125/240 (removed 115) transitions.
// Phase 1: matrix 125 rows 94 cols
[2023-03-08 09:37:39] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 09:37:39] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-08 09:37:39] [INFO ] Invariant cache hit.
[2023-03-08 09:37:39] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-08 09:37:39] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-08 09:37:39] [INFO ] Invariant cache hit.
[2023-03-08 09:37:39] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 94/136 places, 125/240 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 286 ms. Remains : 94/136 places, 125/240 transitions.
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s7 1) (GEQ s36 1)), p1:(AND (GEQ s1 1) (GEQ s89 1)), p2:(AND (GEQ s1 1) (GEQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 23043 reset in 151 ms.
Product exploration explored 100000 steps with 22943 reset in 156 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 322 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 1070 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[true, (AND p1 p2), p2, p1, (AND p1 p2)]
Incomplete random walk after 10000 steps, including 2302 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 954 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 485 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 1036 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 1031 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 1003 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 449 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 952 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 2411285 steps, run timeout after 3001 ms. (steps per millisecond=803 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 7=1, 8=1, 9=1}
Probabilistic random walk after 2411285 steps, saw 934010 distinct states, run finished after 3001 ms. (steps per millisecond=803 ) properties seen :9
Running SMT prover for 1 properties.
[2023-03-08 09:37:44] [INFO ] Invariant cache hit.
[2023-03-08 09:37:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 09:37:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 09:37:44] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1))), (G (NOT (AND p2 p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p2) (NOT p1))), (F p2), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND (NOT p0) p2 (NOT p1))), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 23 factoid took 1205 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 183 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-08 09:37:46] [INFO ] Invariant cache hit.
[2023-03-08 09:37:46] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-08 09:37:46] [INFO ] Invariant cache hit.
[2023-03-08 09:37:46] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-08 09:37:46] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-08 09:37:46] [INFO ] Invariant cache hit.
[2023-03-08 09:37:46] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 94/94 places, 125/125 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 322 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 897 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Incomplete random walk after 10000 steps, including 2272 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 485 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 975 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 972 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 439 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 962 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 911 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 928 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Finished probabilistic random walk after 21133 steps, run visited all 8 properties in 99 ms. (steps per millisecond=213 )
Probabilistic random walk after 21133 steps, saw 10012 distinct states, run finished after 99 ms. (steps per millisecond=213 ) properties seen :8
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p2 (NOT p0))), (F (AND p0 (NOT p1))), (F p2), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
Knowledge based reduction with 18 factoid took 1129 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 181 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 185 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Product exploration explored 100000 steps with 22957 reset in 135 ms.
Product exploration explored 100000 steps with 22899 reset in 141 ms.
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-08 09:37:50] [INFO ] Invariant cache hit.
[2023-03-08 09:37:50] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-08 09:37:50] [INFO ] Invariant cache hit.
[2023-03-08 09:37:50] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-08 09:37:50] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2023-03-08 09:37:50] [INFO ] Invariant cache hit.
[2023-03-08 09:37:50] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 245 ms. Remains : 94/94 places, 125/125 transitions.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-14 finished in 11683 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U !p1)))'
[2023-03-08 09:37:50] [INFO ] Flatten gal took : 18 ms
[2023-03-08 09:37:50] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 09:37:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 136 places, 240 transitions and 941 arcs took 5 ms.
Total runtime 60783 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3117/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3117/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3117/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3117/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3117/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3117/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DBSingleClientW-PT-d1m09-LTLFireability-04
Could not compute solution for formula : DBSingleClientW-PT-d1m09-LTLFireability-05
Could not compute solution for formula : DBSingleClientW-PT-d1m09-LTLFireability-08
Could not compute solution for formula : DBSingleClientW-PT-d1m09-LTLFireability-13
Could not compute solution for formula : DBSingleClientW-PT-d1m09-LTLFireability-14
Could not compute solution for formula : DBSingleClientW-PT-d1m09-LTLFireability-15

BK_STOP 1678268272716

--------------------
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-d1m09-LTLFireability-04
ltl formula formula --ltl=/tmp/3117/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 136 places, 240 transitions and 941 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.040 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3117/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3117/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3117/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3117/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name DBSingleClientW-PT-d1m09-LTLFireability-05
ltl formula formula --ltl=/tmp/3117/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
pnml2lts-mc( 0/ 4): Petri net has 136 places, 240 transitions and 941 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
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.060 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3117/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3117/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3117/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3117/ltl_1_
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
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name DBSingleClientW-PT-d1m09-LTLFireability-08
ltl formula formula --ltl=/tmp/3117/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 136 places, 240 transitions and 941 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( 2/ 4): LTL layer: formula: /tmp/3117/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3117/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3117/ltl_2_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3117/ltl_2_
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-d1m09-LTLFireability-13
ltl formula formula --ltl=/tmp/3117/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
pnml2lts-mc( 0/ 4): Petri net has 136 places, 240 transitions and 941 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.050 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3117/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3117/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3117/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3117/ltl_3_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name DBSingleClientW-PT-d1m09-LTLFireability-14
ltl formula formula --ltl=/tmp/3117/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: =============================================================================
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 136 places, 240 transitions and 941 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.050 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3117/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3117/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3117/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3117/ltl_4_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55e2728a33f4]
1: pnml2lts-mc(+0xa2496) [0x55e2728a3496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f7fbab7b140]
3: pnml2lts-mc(+0x405be5) [0x55e272c06be5]
4: pnml2lts-mc(+0x16b3f9) [0x55e27296c3f9]
5: pnml2lts-mc(+0x164ac4) [0x55e272965ac4]
6: pnml2lts-mc(+0x272e0a) [0x55e272a73e0a]
7: pnml2lts-mc(+0xb61f0) [0x55e2728b71f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f7fba9ce4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f7fba9ce67a]
10: pnml2lts-mc(+0xa1581) [0x55e2728a2581]
11: pnml2lts-mc(+0xa1910) [0x55e2728a2910]
12: pnml2lts-mc(+0xa32a2) [0x55e2728a42a2]
13: pnml2lts-mc(+0xa50f4) [0x55e2728a60f4]
14: pnml2lts-mc(+0x3f34b3) [0x55e272bf44b3]
15: pnml2lts-mc(+0x7c63d) [0x55e27287d63d]
16: pnml2lts-mc(+0x67d86) [0x55e272868d86]
17: pnml2lts-mc(+0x60a8a) [0x55e272861a8a]
18: pnml2lts-mc(+0x5eb15) [0x55e27285fb15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f7fba9b6d0a]
20: pnml2lts-mc(+0x6075e) [0x55e27286175e]
ltl formula name DBSingleClientW-PT-d1m09-LTLFireability-15
ltl formula formula --ltl=/tmp/3117/ltl_5_
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 136 places, 240 transitions and 941 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.050 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3117/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3117/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3117/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3117/ltl_5_
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-d1m09"
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-d1m09, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r105-tall-167814481000276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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