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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 9.5K Feb 26 15:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 26 15:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 15:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 15:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 15:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 15:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 15:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 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 119K 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-d0m06-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678265150871

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-d0m06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 08:45:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 08:45:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 08:45:52] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-08 08:45:52] [INFO ] Transformed 553 places.
[2023-03-08 08:45:52] [INFO ] Transformed 150 transitions.
[2023-03-08 08:45:52] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 34 place count 86 transition count 116
Iterating global reduction 1 with 16 rules applied. Total rules applied 50 place count 86 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 86 transition count 115
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 57 place count 80 transition count 109
Iterating global reduction 2 with 6 rules applied. Total rules applied 63 place count 80 transition count 109
Applied a total of 63 rules in 21 ms. Remains 80 /109 variables (removed 29) and now considering 109/150 (removed 41) transitions.
// Phase 1: matrix 109 rows 80 cols
[2023-03-08 08:45:52] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-08 08:45:53] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-03-08 08:45:53] [INFO ] Invariant cache hit.
[2023-03-08 08:45:53] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-08 08:45:53] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2023-03-08 08:45:53] [INFO ] Invariant cache hit.
[2023-03-08 08:45:53] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/109 places, 109/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 640 ms. Remains : 80/109 places, 109/150 transitions.
Support contains 34 out of 80 places after structural reductions.
[2023-03-08 08:45:53] [INFO ] Flatten gal took : 30 ms
[2023-03-08 08:45:53] [INFO ] Flatten gal took : 11 ms
[2023-03-08 08:45:53] [INFO ] Input system was already deterministic with 109 transitions.
Support contains 32 out of 80 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2300 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 28) seen :15
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 1016 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 991 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 498 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 987 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 1057 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 491 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 503 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-08 08:45:55] [INFO ] Invariant cache hit.
[2023-03-08 08:45:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 08:45:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:45:55] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-08 08:45:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:45:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:45:55] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-08 08:45:55] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-08 08:45:55] [INFO ] After 92ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-08 08:45:55] [INFO ] After 223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-08 08:45:55] [INFO ] After 506ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 47 ms.
Support contains 12 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 109/109 transitions.
Graph (complete) has 236 edges and 80 vertex of which 79 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 79 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 76 transition count 99
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 76 transition count 99
Applied a total of 8 rules in 14 ms. Remains 76 /80 variables (removed 4) and now considering 99/109 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 76/80 places, 99/109 transitions.
Incomplete random walk after 10000 steps, including 2266 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 510 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 987 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 520 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1025 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1039 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 515 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 99 rows 76 cols
[2023-03-08 08:45:56] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-08 08:45:56] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:45:56] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 08:45:56] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:45:56] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-08 08:45:56] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-08 08:45:56] [INFO ] After 52ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-08 08:45:56] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-08 08:45:56] [INFO ] After 294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 1 properties in 26 ms.
Support contains 7 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 99/99 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 73 transition count 92
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 73 transition count 92
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 70 transition count 89
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 70 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 70 transition count 87
Applied a total of 14 rules in 14 ms. Remains 70 /76 variables (removed 6) and now considering 87/99 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 70/76 places, 87/99 transitions.
Incomplete random walk after 10000 steps, including 2301 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 498 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 994 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 532 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 1012 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 1046 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 5) seen :0
Finished probabilistic random walk after 24942 steps, run visited all 5 properties in 177 ms. (steps per millisecond=140 )
Probabilistic random walk after 24942 steps, saw 10939 distinct states, run finished after 177 ms. (steps per millisecond=140 ) properties seen :5
Computed a total of 6 stabilizing places and 15 stable transitions
Graph (complete) has 264 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 72 transition count 93
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 72 transition count 93
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 67 transition count 88
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 67 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 67 transition count 86
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 64 transition count 80
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 64 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 64 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 62 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 62 transition count 76
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 60 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 60 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 59 transition count 71
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 49 place count 59 transition count 69
Applied a total of 49 rules in 21 ms. Remains 59 /80 variables (removed 21) and now considering 69/109 (removed 40) transitions.
// Phase 1: matrix 69 rows 59 cols
[2023-03-08 08:45:58] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:45:58] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 08:45:58] [INFO ] Invariant cache hit.
[2023-03-08 08:45:58] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 08:45:58] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-08 08:45:58] [INFO ] Invariant cache hit.
[2023-03-08 08:45:58] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/80 places, 69/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 59/80 places, 69/109 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s42 1)) (AND (GEQ s1 1) (GEQ s53 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-00 finished in 434 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||G(p1)||G(p2)))))'
Support contains 5 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 74 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 74 transition count 97
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 70 transition count 93
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 70 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 70 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 69 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 69 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 69 transition count 88
Applied a total of 25 rules in 21 ms. Remains 69 /80 variables (removed 11) and now considering 88/109 (removed 21) transitions.
// Phase 1: matrix 88 rows 69 cols
[2023-03-08 08:45:58] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 08:45:58] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-08 08:45:58] [INFO ] Invariant cache hit.
[2023-03-08 08:45:58] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-08 08:45:58] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-03-08 08:45:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:45:58] [INFO ] Invariant cache hit.
[2023-03-08 08:45:58] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/80 places, 88/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 214 ms. Remains : 69/80 places, 88/109 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s46 1)), p0:(AND (GEQ s22 1) (GEQ s43 1)), p2:(AND (GEQ s1 1) (GEQ s66 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-02 finished in 338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(G(p1)&&(p2||G(p0)))))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 73 transition count 90
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 73 transition count 90
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 69 transition count 86
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 69 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 67 transition count 81
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 67 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 67 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 66 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 66 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 65 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 64 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 64 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 37 place count 64 transition count 74
Applied a total of 37 rules in 19 ms. Remains 64 /80 variables (removed 16) and now considering 74/109 (removed 35) transitions.
// Phase 1: matrix 74 rows 64 cols
[2023-03-08 08:45:58] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:45:58] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 08:45:58] [INFO ] Invariant cache hit.
[2023-03-08 08:45:58] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 08:45:58] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-08 08:45:58] [INFO ] Invariant cache hit.
[2023-03-08 08:45:58] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/80 places, 74/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 194 ms. Remains : 64/80 places, 74/109 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(OR (AND p0 p1) (AND p1 p2)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s62 1)), p1:(OR (LT s1 1) (LT s60 1)), p2:(AND (GEQ s1 1) (GEQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-03 finished in 382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(p1)&&p0))&&!(G(!p2) U (p1 U p3)))))'
Support contains 6 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 72 transition count 91
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 72 transition count 91
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 68 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 66 transition count 82
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 66 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 66 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 65 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 65 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 64 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 64 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 63 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 63 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 39 place count 63 transition count 75
Applied a total of 39 rules in 12 ms. Remains 63 /80 variables (removed 17) and now considering 75/109 (removed 34) transitions.
// Phase 1: matrix 75 rows 63 cols
[2023-03-08 08:45:59] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:45:59] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 08:45:59] [INFO ] Invariant cache hit.
[2023-03-08 08:45:59] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-08 08:45:59] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-08 08:45:59] [INFO ] Invariant cache hit.
[2023-03-08 08:45:59] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/80 places, 75/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 63/80 places, 75/109 transitions.
Stuttering acceptance computed with spot in 404 ms :[true, (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) p3), (OR (NOT p1) (NOT p0) p3), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0) (AND (NOT p2) p3)), (OR (NOT p0) (NOT p1) p3)]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1 p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR p3 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p3) p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) p0), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=3 dest: 6}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p1 p3 p0), acceptance={} source=5 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p3) p0), acceptance={} source=5 dest: 5}], [{ cond=(OR (NOT p1) p3 (NOT p0)), acceptance={} source=6 dest: 0}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(AND (GEQ s22 1) (GEQ s36 1)), p0:(AND (GEQ s1 1) (GEQ s61 1)), p2:(AND (GEQ s1 1) (GEQ s33 1)), p3:(AND (GEQ s1 1) (GEQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-04 finished in 595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 71 transition count 88
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 71 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 67 transition count 84
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 65 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 63 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 62 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 62 transition count 72
Applied a total of 40 rules in 11 ms. Remains 62 /80 variables (removed 18) and now considering 72/109 (removed 37) transitions.
// Phase 1: matrix 72 rows 62 cols
[2023-03-08 08:45:59] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 08:45:59] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 08:45:59] [INFO ] Invariant cache hit.
[2023-03-08 08:45:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:45:59] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-08 08:45:59] [INFO ] Invariant cache hit.
[2023-03-08 08:45:59] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/80 places, 72/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 176 ms. Remains : 62/80 places, 72/109 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s35 1)) (AND (GEQ s1 1) (GEQ s54 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-05 finished in 396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 71 transition count 88
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 71 transition count 88
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 66 transition count 83
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 63 transition count 75
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 61 transition count 71
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 59 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 58 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 51 place count 58 transition count 64
Applied a total of 51 rules in 7 ms. Remains 58 /80 variables (removed 22) and now considering 64/109 (removed 45) transitions.
// Phase 1: matrix 64 rows 58 cols
[2023-03-08 08:46:00] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:46:02] [INFO ] Implicit Places using invariants in 1859 ms returned []
[2023-03-08 08:46:02] [INFO ] Invariant cache hit.
[2023-03-08 08:46:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 08:46:02] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 1950 ms to find 0 implicit places.
[2023-03-08 08:46:02] [INFO ] Invariant cache hit.
[2023-03-08 08:46:02] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/80 places, 64/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2013 ms. Remains : 58/80 places, 64/109 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-06 finished in 2132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 71 transition count 88
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 71 transition count 88
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 66 transition count 83
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 63 transition count 75
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 61 transition count 71
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 59 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 58 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 51 place count 58 transition count 64
Applied a total of 51 rules in 8 ms. Remains 58 /80 variables (removed 22) and now considering 64/109 (removed 45) transitions.
[2023-03-08 08:46:02] [INFO ] Invariant cache hit.
[2023-03-08 08:46:02] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-08 08:46:02] [INFO ] Invariant cache hit.
[2023-03-08 08:46:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 08:46:02] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-08 08:46:02] [INFO ] Invariant cache hit.
[2023-03-08 08:46:02] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/80 places, 64/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 280 ms. Remains : 58/80 places, 64/109 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-07 finished in 387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||(F(p2)&&p1))&&(p3||G(F(p0))))))'
Support contains 6 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 73 transition count 92
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 73 transition count 92
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 71 transition count 90
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 71 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 70 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 70 transition count 87
Applied a total of 22 rules in 7 ms. Remains 70 /80 variables (removed 10) and now considering 87/109 (removed 22) transitions.
// Phase 1: matrix 87 rows 70 cols
[2023-03-08 08:46:02] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:46:02] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-08 08:46:02] [INFO ] Invariant cache hit.
[2023-03-08 08:46:02] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-08 08:46:02] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-08 08:46:02] [INFO ] Invariant cache hit.
[2023-03-08 08:46:02] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/80 places, 87/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 268 ms. Remains : 70/80 places, 87/109 transitions.
Stuttering acceptance computed with spot in 367 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), true, (NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s24 1) (GEQ s38 1)), p1:(AND (GEQ s1 1) (GEQ s53 1)), p2:(AND (GEQ s1 1) (GEQ s67 1)), p3:(AND (GEQ s1 1) (GEQ s64 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 0 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-08 finished in 674 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((F(G((p2 U !p0)))&&p1))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 71 transition count 88
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 71 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 67 transition count 84
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 66 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 66 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 65 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 65 transition count 79
Applied a total of 32 rules in 3 ms. Remains 65 /80 variables (removed 15) and now considering 79/109 (removed 30) transitions.
// Phase 1: matrix 79 rows 65 cols
[2023-03-08 08:46:03] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:46:03] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 08:46:03] [INFO ] Invariant cache hit.
[2023-03-08 08:46:03] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 08:46:03] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-08 08:46:03] [INFO ] Invariant cache hit.
[2023-03-08 08:46:03] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/80 places, 79/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231 ms. Remains : 65/80 places, 79/109 transitions.
Stuttering acceptance computed with spot in 257 ms :[true, (NOT p0), (OR (NOT p1) p0), true, p0, p0]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR (NOT p0) p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s15 1) (LT s36 1)), p1:(AND (GEQ s15 1) (GEQ s36 1)), p2:(AND (GEQ s1 1) (GEQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-09 finished in 539 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(X(F((G(!p1)||p0)))))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 73 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 73 transition count 96
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 69 transition count 92
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 69 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 67 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 67 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 66 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 66 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 65 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 65 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 65 transition count 80
Applied a total of 35 rules in 8 ms. Remains 65 /80 variables (removed 15) and now considering 80/109 (removed 29) transitions.
// Phase 1: matrix 80 rows 65 cols
[2023-03-08 08:46:03] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 08:46:03] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 08:46:03] [INFO ] Invariant cache hit.
[2023-03-08 08:46:04] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 08:46:04] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-08 08:46:04] [INFO ] Invariant cache hit.
[2023-03-08 08:46:04] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/80 places, 80/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 65/80 places, 80/109 transitions.
Stuttering acceptance computed with spot in 217 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (GEQ s1 1) (GEQ s63 1)), p0:(OR (AND (GEQ s1 1) (GEQ s43 1)) (AND (GEQ s1 1) (GEQ s38 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22950 reset in 221 ms.
Product exploration explored 100000 steps with 22794 reset in 160 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 212 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 217 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2324 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 505 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 08:46:05] [INFO ] Invariant cache hit.
[2023-03-08 08:46:05] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 08:46:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:46:05] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 08:46:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:46:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:46:05] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 08:46:05] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 08:46:05] [INFO ] After 17ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 08:46:05] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 08:46:05] [INFO ] After 105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 80/80 transitions.
Graph (complete) has 192 edges and 65 vertex of which 64 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 79
Applied a total of 2 rules in 6 ms. Remains 64 /65 variables (removed 1) and now considering 79/80 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 64/65 places, 79/80 transitions.
Incomplete random walk after 10000 steps, including 2294 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 519 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8355 steps, run visited all 1 properties in 25 ms. (steps per millisecond=334 )
Probabilistic random walk after 8355 steps, saw 3646 distinct states, run finished after 25 ms. (steps per millisecond=334 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-08 08:46:05] [INFO ] Invariant cache hit.
[2023-03-08 08:46:06] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 08:46:06] [INFO ] Invariant cache hit.
[2023-03-08 08:46:06] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 08:46:06] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-08 08:46:06] [INFO ] Invariant cache hit.
[2023-03-08 08:46:06] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 65/65 places, 80/80 transitions.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 212 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2306 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 496 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 509 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Finished probabilistic random walk after 8367 steps, run visited all 2 properties in 14 ms. (steps per millisecond=597 )
Probabilistic random walk after 8367 steps, saw 3652 distinct states, run finished after 15 ms. (steps per millisecond=557 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 22834 reset in 100 ms.
Product exploration explored 100000 steps with 22961 reset in 137 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 80/80 transitions.
Applied a total of 0 rules in 9 ms. Remains 65 /65 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-08 08:46:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:46:08] [INFO ] Invariant cache hit.
[2023-03-08 08:46:08] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 65/65 places, 80/80 transitions.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-08 08:46:08] [INFO ] Invariant cache hit.
[2023-03-08 08:46:08] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 08:46:08] [INFO ] Invariant cache hit.
[2023-03-08 08:46:08] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 08:46:08] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-08 08:46:08] [INFO ] Invariant cache hit.
[2023-03-08 08:46:08] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162 ms. Remains : 65/65 places, 80/80 transitions.
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-10 finished in 4379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(!p0)) U p1)))'
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 72 transition count 89
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 72 transition count 89
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 68 transition count 85
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 66 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 64 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 63 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 38 place count 63 transition count 73
Applied a total of 38 rules in 8 ms. Remains 63 /80 variables (removed 17) and now considering 73/109 (removed 36) transitions.
// Phase 1: matrix 73 rows 63 cols
[2023-03-08 08:46:08] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 08:46:08] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 08:46:08] [INFO ] Invariant cache hit.
[2023-03-08 08:46:08] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 08:46:08] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-08 08:46:08] [INFO ] Invariant cache hit.
[2023-03-08 08:46:08] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/80 places, 73/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 182 ms. Remains : 63/80 places, 73/109 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), p0]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s29 1)), p0:(AND (GEQ s1 1) (GEQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 2 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-11 finished in 322 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(X(G(!p0))))||(X(F(!p2))&&p1))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 73 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 73 transition count 96
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 68 transition count 91
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 68 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 68 transition count 89
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 65 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 65 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 65 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 35 place count 63 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 63 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 61 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 61 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 61 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 60 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 60 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 47 place count 60 transition count 72
Applied a total of 47 rules in 10 ms. Remains 60 /80 variables (removed 20) and now considering 72/109 (removed 37) transitions.
// Phase 1: matrix 72 rows 60 cols
[2023-03-08 08:46:08] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:46:08] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 08:46:08] [INFO ] Invariant cache hit.
[2023-03-08 08:46:08] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-08 08:46:08] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2023-03-08 08:46:08] [INFO ] Invariant cache hit.
[2023-03-08 08:46:08] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/80 places, 72/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 215 ms. Remains : 60/80 places, 72/109 transitions.
Stuttering acceptance computed with spot in 357 ms :[true, p2, p0, (AND p2 p0), p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p2 p0), (AND p2 p0), (OR (AND p0 (NOT p1)) (AND p0 p2)), p0]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=p1, acceptance={} source=5 dest: 7}, { cond=(NOT p1), acceptance={} source=5 dest: 9}], [{ cond=p2, acceptance={} source=6 dest: 3}], [{ cond=p2, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={} source=8 dest: 5}], [{ cond=true, acceptance={} source=9 dest: 4}]], initial=8, aps=[p2:(AND (GEQ s1 1) (GEQ s26 1)), p0:(AND (GEQ s1 1) (GEQ s42 1)), p1:(AND (GEQ s1 1) (GEQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 805 steps with 182 reset in 4 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-12 finished in 593 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)||G(p1))))'
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 71 transition count 88
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 71 transition count 88
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 66 transition count 83
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 66 transition count 81
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 64 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 62 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 61 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 42 place count 61 transition count 71
Applied a total of 42 rules in 13 ms. Remains 61 /80 variables (removed 19) and now considering 71/109 (removed 38) transitions.
// Phase 1: matrix 71 rows 61 cols
[2023-03-08 08:46:09] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:46:09] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 08:46:09] [INFO ] Invariant cache hit.
[2023-03-08 08:46:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:46:09] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-08 08:46:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:46:09] [INFO ] Invariant cache hit.
[2023-03-08 08:46:09] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/80 places, 71/109 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 206 ms. Remains : 61/80 places, 71/109 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s52 1)) (AND (GEQ s1 1) (GEQ s26 1))), p1:(AND (GEQ s1 1) (GEQ s26 1))], nbAcceptance=2, 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-d0m06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-13 finished in 256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 71 transition count 88
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 71 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 67 transition count 84
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 65 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 65 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 65 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 64 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 63 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 63 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 39 place count 63 transition count 72
Applied a total of 39 rules in 7 ms. Remains 63 /80 variables (removed 17) and now considering 72/109 (removed 37) transitions.
// Phase 1: matrix 72 rows 63 cols
[2023-03-08 08:46:09] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 08:46:09] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 08:46:09] [INFO ] Invariant cache hit.
[2023-03-08 08:46:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 08:46:09] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2023-03-08 08:46:09] [INFO ] Invariant cache hit.
[2023-03-08 08:46:09] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/80 places, 72/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 195 ms. Remains : 63/80 places, 72/109 transitions.
Stuttering acceptance computed with spot in 235 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (OR (LT s1 1) (LT s61 1)) (GEQ s1 1) (GEQ s37 1)), p0:(OR (LT s1 1) (LT s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-14 finished in 444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 72 transition count 91
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 72 transition count 91
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 68 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 68 transition count 87
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 65 transition count 81
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 63 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 61 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 60 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 60 transition count 70
Applied a total of 45 rules in 8 ms. Remains 60 /80 variables (removed 20) and now considering 70/109 (removed 39) transitions.
// Phase 1: matrix 70 rows 60 cols
[2023-03-08 08:46:09] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:46:09] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 08:46:09] [INFO ] Invariant cache hit.
[2023-03-08 08:46:09] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 08:46:10] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-08 08:46:10] [INFO ] Invariant cache hit.
[2023-03-08 08:46:10] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/80 places, 70/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 60/80 places, 70/109 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22892 reset in 125 ms.
Product exploration explored 100000 steps with 22932 reset in 131 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2273 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 511 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4178 steps, run visited all 1 properties in 8 ms. (steps per millisecond=522 )
Probabilistic random walk after 4178 steps, saw 1880 distinct states, run finished after 8 ms. (steps per millisecond=522 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2023-03-08 08:46:11] [INFO ] Invariant cache hit.
[2023-03-08 08:46:11] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 08:46:11] [INFO ] Invariant cache hit.
[2023-03-08 08:46:11] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 08:46:11] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-08 08:46:11] [INFO ] Invariant cache hit.
[2023-03-08 08:46:11] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 60/60 places, 70/70 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2275 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 506 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4178 steps, run visited all 1 properties in 15 ms. (steps per millisecond=278 )
Probabilistic random walk after 4178 steps, saw 1880 distinct states, run finished after 15 ms. (steps per millisecond=278 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22923 reset in 84 ms.
Product exploration explored 100000 steps with 22878 reset in 91 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2023-03-08 08:46:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:46:12] [INFO ] Invariant cache hit.
[2023-03-08 08:46:12] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55 ms. Remains : 60/60 places, 70/70 transitions.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 0 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2023-03-08 08:46:12] [INFO ] Invariant cache hit.
[2023-03-08 08:46:12] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 08:46:12] [INFO ] Invariant cache hit.
[2023-03-08 08:46:12] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 08:46:12] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-03-08 08:46:12] [INFO ] Invariant cache hit.
[2023-03-08 08:46:12] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 204 ms. Remains : 60/60 places, 70/70 transitions.
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-15 finished in 2713 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(X(F((G(!p1)||p0)))))))'
Found a Shortening insensitive property : DBSingleClientW-PT-d0m06-LTLFireability-10
Stuttering acceptance computed with spot in 260 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 73 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 73 transition count 96
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 69 transition count 92
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 69 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 67 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 67 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 66 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 66 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 65 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 65 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 65 transition count 80
Applied a total of 35 rules in 16 ms. Remains 65 /80 variables (removed 15) and now considering 80/109 (removed 29) transitions.
// Phase 1: matrix 80 rows 65 cols
[2023-03-08 08:46:12] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 08:46:13] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-08 08:46:13] [INFO ] Invariant cache hit.
[2023-03-08 08:46:13] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 08:46:13] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2023-03-08 08:46:13] [INFO ] Invariant cache hit.
[2023-03-08 08:46:13] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 65/80 places, 80/109 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 222 ms. Remains : 65/80 places, 80/109 transitions.
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (GEQ s1 1) (GEQ s63 1)), p0:(OR (AND (GEQ s1 1) (GEQ s43 1)) (AND (GEQ s1 1) (GEQ s38 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22982 reset in 84 ms.
Product exploration explored 100000 steps with 22946 reset in 93 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 212 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2281 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 508 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 08:46:13] [INFO ] Invariant cache hit.
[2023-03-08 08:46:13] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 08:46:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:46:13] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 08:46:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 08:46:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:46:13] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 08:46:13] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 08:46:13] [INFO ] After 12ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 08:46:13] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 08:46:13] [INFO ] After 105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 80/80 transitions.
Graph (complete) has 192 edges and 65 vertex of which 64 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 79
Applied a total of 2 rules in 5 ms. Remains 64 /65 variables (removed 1) and now considering 79/80 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 64/65 places, 79/80 transitions.
Incomplete random walk after 10000 steps, including 2313 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 504 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8355 steps, run visited all 1 properties in 13 ms. (steps per millisecond=642 )
Probabilistic random walk after 8355 steps, saw 3646 distinct states, run finished after 13 ms. (steps per millisecond=642 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 153 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-08 08:46:14] [INFO ] Invariant cache hit.
[2023-03-08 08:46:14] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 08:46:14] [INFO ] Invariant cache hit.
[2023-03-08 08:46:14] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 08:46:14] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-03-08 08:46:14] [INFO ] Invariant cache hit.
[2023-03-08 08:46:14] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 65/65 places, 80/80 transitions.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 212 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2322 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 528 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 512 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-08 08:46:15] [INFO ] Invariant cache hit.
[2023-03-08 08:46:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:46:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:46:15] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 08:46:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 08:46:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 08:46:15] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 08:46:15] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 08:46:15] [INFO ] After 10ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 08:46:15] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 08:46:15] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 80/80 transitions.
Graph (complete) has 192 edges and 65 vertex of which 64 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 79
Applied a total of 2 rules in 6 ms. Remains 64 /65 variables (removed 1) and now considering 79/80 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 64/65 places, 79/80 transitions.
Incomplete random walk after 10000 steps, including 2244 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 532 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8355 steps, run visited all 1 properties in 13 ms. (steps per millisecond=642 )
Probabilistic random walk after 8355 steps, saw 3646 distinct states, run finished after 14 ms. (steps per millisecond=596 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 22895 reset in 91 ms.
Product exploration explored 100000 steps with 22886 reset in 100 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-08 08:46:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:46:16] [INFO ] Invariant cache hit.
[2023-03-08 08:46:16] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53 ms. Remains : 65/65 places, 80/80 transitions.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-08 08:46:16] [INFO ] Invariant cache hit.
[2023-03-08 08:46:16] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 08:46:16] [INFO ] Invariant cache hit.
[2023-03-08 08:46:16] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-08 08:46:16] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-08 08:46:16] [INFO ] Invariant cache hit.
[2023-03-08 08:46:16] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 65/65 places, 80/80 transitions.
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-10 finished in 4072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d0m06-LTLFireability-15
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 72 transition count 91
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 72 transition count 91
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 68 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 68 transition count 87
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 65 transition count 81
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 63 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 61 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 60 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 60 transition count 70
Applied a total of 45 rules in 15 ms. Remains 60 /80 variables (removed 20) and now considering 70/109 (removed 39) transitions.
// Phase 1: matrix 70 rows 60 cols
[2023-03-08 08:46:16] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:46:16] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 08:46:16] [INFO ] Invariant cache hit.
[2023-03-08 08:46:16] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 08:46:16] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-08 08:46:16] [INFO ] Invariant cache hit.
[2023-03-08 08:46:17] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 60/80 places, 70/109 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 173 ms. Remains : 60/80 places, 70/109 transitions.
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 23050 reset in 83 ms.
Product exploration explored 100000 steps with 22952 reset in 88 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2278 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 501 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4178 steps, run visited all 1 properties in 8 ms. (steps per millisecond=522 )
Probabilistic random walk after 4178 steps, saw 1880 distinct states, run finished after 9 ms. (steps per millisecond=464 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2023-03-08 08:46:17] [INFO ] Invariant cache hit.
[2023-03-08 08:46:17] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 08:46:17] [INFO ] Invariant cache hit.
[2023-03-08 08:46:17] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 08:46:17] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-08 08:46:17] [INFO ] Invariant cache hit.
[2023-03-08 08:46:17] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 60/60 places, 70/70 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2277 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 509 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4178 steps, run visited all 1 properties in 15 ms. (steps per millisecond=278 )
Probabilistic random walk after 4178 steps, saw 1880 distinct states, run finished after 15 ms. (steps per millisecond=278 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22915 reset in 91 ms.
Product exploration explored 100000 steps with 22906 reset in 96 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2023-03-08 08:46:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 08:46:19] [INFO ] Invariant cache hit.
[2023-03-08 08:46:19] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62 ms. Remains : 60/60 places, 70/70 transitions.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 0 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2023-03-08 08:46:19] [INFO ] Invariant cache hit.
[2023-03-08 08:46:19] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 08:46:19] [INFO ] Invariant cache hit.
[2023-03-08 08:46:19] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 08:46:19] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-08 08:46:19] [INFO ] Invariant cache hit.
[2023-03-08 08:46:19] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 60/60 places, 70/70 transitions.
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-15 finished in 2682 ms.
[2023-03-08 08:46:19] [INFO ] Flatten gal took : 9 ms
[2023-03-08 08:46:19] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 08:46:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 80 places, 109 transitions and 427 arcs took 1 ms.
Total runtime 26971 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1823/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1823/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DBSingleClientW-PT-d0m06-LTLFireability-10
Could not compute solution for formula : DBSingleClientW-PT-d0m06-LTLFireability-15

BK_STOP 1678265180559

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name DBSingleClientW-PT-d0m06-LTLFireability-10
ltl formula formula --ltl=/tmp/1823/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 80 places, 109 transitions and 427 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.010 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1823/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1823/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1823/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1823/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DBSingleClientW-PT-d0m06-LTLFireability-15
ltl formula formula --ltl=/tmp/1823/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 80 places, 109 transitions and 427 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.010 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1823/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1823/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1823/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1823/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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

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