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.r101-tall-167814475100236.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 itstools
Input is DBSingleClientW-PT-d1m04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475100236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 15:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 18K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 15:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 15:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 15:35 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 432K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678239729883

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m04
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 01:42:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 01:42:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 01:42:11] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2023-03-08 01:42:11] [INFO ] Transformed 1440 places.
[2023-03-08 01:42:11] [INFO ] Transformed 672 transitions.
[2023-03-08 01:42:11] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 151 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 184 place count 243 transition count 384
Iterating global reduction 1 with 83 rules applied. Total rules applied 267 place count 243 transition count 384
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 273 place count 243 transition count 378
Discarding 59 places :
Symmetric choice reduction at 2 with 59 rule applications. Total rules 332 place count 184 transition count 319
Iterating global reduction 2 with 59 rules applied. Total rules applied 391 place count 184 transition count 319
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 392 place count 184 transition count 318
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 419 place count 157 transition count 275
Iterating global reduction 3 with 27 rules applied. Total rules applied 446 place count 157 transition count 275
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 465 place count 157 transition count 256
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 468 place count 154 transition count 252
Iterating global reduction 4 with 3 rules applied. Total rules applied 471 place count 154 transition count 252
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 474 place count 151 transition count 249
Iterating global reduction 4 with 3 rules applied. Total rules applied 477 place count 151 transition count 249
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 480 place count 151 transition count 246
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 481 place count 150 transition count 245
Iterating global reduction 5 with 1 rules applied. Total rules applied 482 place count 150 transition count 245
Applied a total of 482 rules in 68 ms. Remains 150 /347 variables (removed 197) and now considering 245/672 (removed 427) transitions.
// Phase 1: matrix 245 rows 150 cols
[2023-03-08 01:42:11] [INFO ] Computed 2 place invariants in 22 ms
[2023-03-08 01:42:12] [INFO ] Implicit Places using invariants in 456 ms returned []
[2023-03-08 01:42:12] [INFO ] Invariant cache hit.
[2023-03-08 01:42:12] [INFO ] State equation strengthened by 113 read => feed constraints.
[2023-03-08 01:42:12] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
[2023-03-08 01:42:12] [INFO ] Invariant cache hit.
[2023-03-08 01:42:12] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 150/347 places, 245/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1030 ms. Remains : 150/347 places, 245/672 transitions.
Support contains 30 out of 150 places after structural reductions.
[2023-03-08 01:42:12] [INFO ] Flatten gal took : 41 ms
[2023-03-08 01:42:12] [INFO ] Flatten gal took : 18 ms
[2023-03-08 01:42:12] [INFO ] Input system was already deterministic with 245 transitions.
Incomplete random walk after 10000 steps, including 2305 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 98 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 77 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 105 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 121 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 116 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 116 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Probably explored full state space saw : 33176 states, properties seen :23
Probabilistic random walk after 85764 steps, saw 33176 distinct states, run finished after 472 ms. (steps per millisecond=181 ) properties seen :23
Explored full state space saw : 33263 states, properties seen :0
Exhaustive walk after 85875 steps, saw 33263 distinct states, run finished after 300 ms. (steps per millisecond=286 ) properties seen :0
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 26 stable transitions
Graph (complete) has 542 edges and 150 vertex of which 149 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p2)||p1)))))'
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 245/245 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 133 transition count 197
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 133 transition count 197
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 133 transition count 193
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 50 place count 121 transition count 177
Iterating global reduction 1 with 12 rules applied. Total rules applied 62 place count 121 transition count 177
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 66 place count 121 transition count 173
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 77 place count 110 transition count 158
Iterating global reduction 2 with 11 rules applied. Total rules applied 88 place count 110 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 90 place count 110 transition count 156
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 96 place count 104 transition count 147
Iterating global reduction 3 with 6 rules applied. Total rules applied 102 place count 104 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 103 place count 104 transition count 146
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 108 place count 99 transition count 141
Iterating global reduction 4 with 5 rules applied. Total rules applied 113 place count 99 transition count 141
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 117 place count 95 transition count 132
Iterating global reduction 4 with 4 rules applied. Total rules applied 121 place count 95 transition count 132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 124 place count 95 transition count 129
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 125 place count 94 transition count 127
Iterating global reduction 5 with 1 rules applied. Total rules applied 126 place count 94 transition count 127
Applied a total of 126 rules in 38 ms. Remains 94 /150 variables (removed 56) and now considering 127/245 (removed 118) transitions.
// Phase 1: matrix 127 rows 94 cols
[2023-03-08 01:42:14] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 01:42:14] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-08 01:42:14] [INFO ] Invariant cache hit.
[2023-03-08 01:42:14] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-08 01:42:14] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2023-03-08 01:42:14] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 01:42:14] [INFO ] Invariant cache hit.
[2023-03-08 01:42:14] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/150 places, 127/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 345 ms. Remains : 94/150 places, 127/245 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s62 1)), p1:(OR (LT s1 1) (LT s81 1)), p2:(OR (LT s1 1) (LT s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 3 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-03 finished in 640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 245/245 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 131 transition count 187
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 131 transition count 187
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 131 transition count 183
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 55 place count 118 transition count 168
Iterating global reduction 1 with 13 rules applied. Total rules applied 68 place count 118 transition count 168
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 73 place count 118 transition count 163
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 85 place count 106 transition count 147
Iterating global reduction 2 with 12 rules applied. Total rules applied 97 place count 106 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 99 place count 106 transition count 145
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 107 place count 98 transition count 129
Iterating global reduction 3 with 8 rules applied. Total rules applied 115 place count 98 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 117 place count 98 transition count 127
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 122 place count 93 transition count 122
Iterating global reduction 4 with 5 rules applied. Total rules applied 127 place count 93 transition count 122
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 132 place count 88 transition count 112
Iterating global reduction 4 with 5 rules applied. Total rules applied 137 place count 88 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 140 place count 88 transition count 109
Applied a total of 140 rules in 33 ms. Remains 88 /150 variables (removed 62) and now considering 109/245 (removed 136) transitions.
// Phase 1: matrix 109 rows 88 cols
[2023-03-08 01:42:15] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:42:15] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-08 01:42:15] [INFO ] Invariant cache hit.
[2023-03-08 01:42:15] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-08 01:42:15] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-03-08 01:42:15] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 01:42:15] [INFO ] Invariant cache hit.
[2023-03-08 01:42:15] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/150 places, 109/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 319 ms. Remains : 88/150 places, 109/245 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-04 finished in 367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(p1 U p2)||G(p3))))'
Support contains 6 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 245/245 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 134 transition count 191
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 134 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 134 transition count 188
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 47 place count 122 transition count 174
Iterating global reduction 1 with 12 rules applied. Total rules applied 59 place count 122 transition count 174
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 64 place count 122 transition count 169
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 75 place count 111 transition count 154
Iterating global reduction 2 with 11 rules applied. Total rules applied 86 place count 111 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 111 transition count 153
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 94 place count 104 transition count 139
Iterating global reduction 3 with 7 rules applied. Total rules applied 101 place count 104 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 103 place count 104 transition count 137
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 107 place count 100 transition count 133
Iterating global reduction 4 with 4 rules applied. Total rules applied 111 place count 100 transition count 133
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 115 place count 96 transition count 129
Iterating global reduction 4 with 4 rules applied. Total rules applied 119 place count 96 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 122 place count 96 transition count 126
Applied a total of 122 rules in 17 ms. Remains 96 /150 variables (removed 54) and now considering 126/245 (removed 119) transitions.
// Phase 1: matrix 126 rows 96 cols
[2023-03-08 01:42:15] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:42:15] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-08 01:42:15] [INFO ] Invariant cache hit.
[2023-03-08 01:42:15] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-08 01:42:15] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-08 01:42:15] [INFO ] Invariant cache hit.
[2023-03-08 01:42:15] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/150 places, 126/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 299 ms. Remains : 96/150 places, 126/245 transitions.
Stuttering acceptance computed with spot in 260 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p3), acceptance={} source=3 dest: 0}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) p3), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1 p3), acceptance={} source=5 dest: 4}]], initial=2, aps=[p2:(AND (GEQ s1 1) (GEQ s56 1)), p1:(AND (GEQ s1 1) (GEQ s52 1)), p3:(AND (GEQ s18 1) (GEQ s79 1)), p0:(AND (GEQ s1 1) (GEQ s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-06 finished in 584 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)))||(G(p1) U !p0)))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 245/245 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 133 transition count 194
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 133 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 133 transition count 191
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 50 place count 120 transition count 174
Iterating global reduction 1 with 13 rules applied. Total rules applied 63 place count 120 transition count 174
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 66 place count 120 transition count 171
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 78 place count 108 transition count 156
Iterating global reduction 2 with 12 rules applied. Total rules applied 90 place count 108 transition count 156
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 92 place count 108 transition count 154
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 100 place count 100 transition count 139
Iterating global reduction 3 with 8 rules applied. Total rules applied 108 place count 100 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 109 place count 100 transition count 138
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 115 place count 94 transition count 132
Iterating global reduction 4 with 6 rules applied. Total rules applied 121 place count 94 transition count 132
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 125 place count 90 transition count 128
Iterating global reduction 4 with 4 rules applied. Total rules applied 129 place count 90 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 132 place count 90 transition count 125
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 133 place count 89 transition count 123
Iterating global reduction 5 with 1 rules applied. Total rules applied 134 place count 89 transition count 123
Applied a total of 134 rules in 12 ms. Remains 89 /150 variables (removed 61) and now considering 123/245 (removed 122) transitions.
// Phase 1: matrix 123 rows 89 cols
[2023-03-08 01:42:16] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:42:16] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 01:42:16] [INFO ] Invariant cache hit.
[2023-03-08 01:42:16] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 01:42:16] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-08 01:42:16] [INFO ] Invariant cache hit.
[2023-03-08 01:42:16] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/150 places, 123/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 266 ms. Remains : 89/150 places, 123/245 transitions.
Stuttering acceptance computed with spot in 245 ms :[true, false, (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 3}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s80 1)), p1:(AND (GEQ s1 1) (GEQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22976 reset in 254 ms.
Product exploration explored 100000 steps with 22975 reset in 172 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 309 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 282 ms. Reduced automaton from 7 states, 14 edges and 2 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)]
Incomplete random walk after 10000 steps, including 2273 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16749 steps, run visited all 1 properties in 32 ms. (steps per millisecond=523 )
Probabilistic random walk after 16749 steps, saw 7220 distinct states, run finished after 32 ms. (steps per millisecond=523 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 307 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 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 89 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2023-03-08 01:42:18] [INFO ] Invariant cache hit.
[2023-03-08 01:42:18] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-08 01:42:18] [INFO ] Invariant cache hit.
[2023-03-08 01:42:18] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 01:42:18] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-03-08 01:42:18] [INFO ] Invariant cache hit.
[2023-03-08 01:42:18] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 279 ms. Remains : 89/89 places, 123/123 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 309 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 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 208 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2299 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 434 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16749 steps, run visited all 1 properties in 29 ms. (steps per millisecond=577 )
Probabilistic random walk after 16749 steps, saw 7220 distinct states, run finished after 29 ms. (steps per millisecond=577 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 93 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 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 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 22958 reset in 120 ms.
Product exploration explored 100000 steps with 22950 reset in 127 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 123/123 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 88 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 88 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 87 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 87 transition count 114
Applied a total of 5 rules in 16 ms. Remains 87 /89 variables (removed 2) and now considering 114/123 (removed 9) transitions.
[2023-03-08 01:42:19] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 114 rows 87 cols
[2023-03-08 01:42:19] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:42:19] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/89 places, 114/123 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 87/89 places, 114/123 transitions.
Built C files in :
/tmp/ltsmin2262672097527600335
[2023-03-08 01:42:19] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2262672097527600335
Running compilation step : cd /tmp/ltsmin2262672097527600335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 303 ms.
Running link step : cd /tmp/ltsmin2262672097527600335;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin2262672097527600335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6531399774198195223.hoa' '--buchi-type=spotba'
LTSmin run took 240 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-07 finished in 4363 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((F(p1)||p0))))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 245/245 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 133 transition count 194
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 133 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 133 transition count 191
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 50 place count 120 transition count 174
Iterating global reduction 1 with 13 rules applied. Total rules applied 63 place count 120 transition count 174
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 68 place count 120 transition count 169
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 80 place count 108 transition count 153
Iterating global reduction 2 with 12 rules applied. Total rules applied 92 place count 108 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 94 place count 108 transition count 151
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 102 place count 100 transition count 136
Iterating global reduction 3 with 8 rules applied. Total rules applied 110 place count 100 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 112 place count 100 transition count 134
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 117 place count 95 transition count 129
Iterating global reduction 4 with 5 rules applied. Total rules applied 122 place count 95 transition count 129
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 125 place count 92 transition count 126
Iterating global reduction 4 with 3 rules applied. Total rules applied 128 place count 92 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 130 place count 92 transition count 124
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 131 place count 91 transition count 122
Iterating global reduction 5 with 1 rules applied. Total rules applied 132 place count 91 transition count 122
Applied a total of 132 rules in 33 ms. Remains 91 /150 variables (removed 59) and now considering 122/245 (removed 123) transitions.
// Phase 1: matrix 122 rows 91 cols
[2023-03-08 01:42:20] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:42:20] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-08 01:42:20] [INFO ] Invariant cache hit.
[2023-03-08 01:42:20] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-08 01:42:20] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-08 01:42:20] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 01:42:20] [INFO ] Invariant cache hit.
[2023-03-08 01:42:20] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/150 places, 122/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 310 ms. Remains : 91/150 places, 122/245 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s46 1)), p1:(OR (LT s1 1) (LT s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22884 reset in 204 ms.
Product exploration explored 100000 steps with 22898 reset in 138 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 313 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 207 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2284 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Probably explored full state space saw : 12003 states, properties seen :1
Probabilistic random walk after 29441 steps, saw 12003 distinct states, run finished after 99 ms. (steps per millisecond=297 ) properties seen :1
Explored full state space saw : 12028 states, properties seen :0
Exhaustive walk after 29488 steps, saw 12028 distinct states, run finished after 32 ms. (steps per millisecond=921 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 178 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-08 finished in 1520 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((!p1 U (G(!p1)||(!p1&&G(!p2)))))||p0)))'
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 245/245 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 133 transition count 189
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 133 transition count 189
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 133 transition count 185
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 50 place count 121 transition count 169
Iterating global reduction 1 with 12 rules applied. Total rules applied 62 place count 121 transition count 169
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 66 place count 121 transition count 165
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 78 place count 109 transition count 151
Iterating global reduction 2 with 12 rules applied. Total rules applied 90 place count 109 transition count 151
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 92 place count 109 transition count 149
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 100 place count 101 transition count 133
Iterating global reduction 3 with 8 rules applied. Total rules applied 108 place count 101 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 110 place count 101 transition count 131
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 115 place count 96 transition count 126
Iterating global reduction 4 with 5 rules applied. Total rules applied 120 place count 96 transition count 126
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 123 place count 93 transition count 123
Iterating global reduction 4 with 3 rules applied. Total rules applied 126 place count 93 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 129 place count 93 transition count 120
Applied a total of 129 rules in 13 ms. Remains 93 /150 variables (removed 57) and now considering 120/245 (removed 125) transitions.
// Phase 1: matrix 120 rows 93 cols
[2023-03-08 01:42:22] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:42:22] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-08 01:42:22] [INFO ] Invariant cache hit.
[2023-03-08 01:42:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 01:42:22] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-08 01:42:22] [INFO ] Invariant cache hit.
[2023-03-08 01:42:22] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/150 places, 120/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 279 ms. Remains : 93/150 places, 120/245 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 p2), p2]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-09 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: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 p1), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 0}, { cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(OR (LT s7 1) (LT s35 1)), p1:(AND (GEQ s1 1) (GEQ s60 1)), p2:(AND (GEQ s7 1) (GEQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 223 ms.
Product exploration explored 100000 steps with 50000 reset in 193 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 314 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-09 finished in 1006 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 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 245/245 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 131 transition count 187
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 131 transition count 187
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 131 transition count 183
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 56 place count 117 transition count 165
Iterating global reduction 1 with 14 rules applied. Total rules applied 70 place count 117 transition count 165
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 75 place count 117 transition count 160
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 88 place count 104 transition count 143
Iterating global reduction 2 with 13 rules applied. Total rules applied 101 place count 104 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 104 transition count 141
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 112 place count 95 transition count 124
Iterating global reduction 3 with 9 rules applied. Total rules applied 121 place count 95 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 123 place count 95 transition count 122
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 129 place count 89 transition count 116
Iterating global reduction 4 with 6 rules applied. Total rules applied 135 place count 89 transition count 116
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 140 place count 84 transition count 106
Iterating global reduction 4 with 5 rules applied. Total rules applied 145 place count 84 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 148 place count 84 transition count 103
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 149 place count 83 transition count 101
Iterating global reduction 5 with 1 rules applied. Total rules applied 150 place count 83 transition count 101
Applied a total of 150 rules in 18 ms. Remains 83 /150 variables (removed 67) and now considering 101/245 (removed 144) transitions.
// Phase 1: matrix 101 rows 83 cols
[2023-03-08 01:42:23] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 01:42:23] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-08 01:42:23] [INFO ] Invariant cache hit.
[2023-03-08 01:42:23] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-08 01:42:23] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-08 01:42:23] [INFO ] Invariant cache hit.
[2023-03-08 01:42:23] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 83/150 places, 101/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 83/150 places, 101/245 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-11 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 s3 1) (GEQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-11 finished in 315 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)&&X(p1)))||X(G(p2))))'
Support contains 5 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 245/245 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 133 transition count 193
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 133 transition count 193
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 133 transition count 189
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 50 place count 121 transition count 175
Iterating global reduction 1 with 12 rules applied. Total rules applied 62 place count 121 transition count 175
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 67 place count 121 transition count 170
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 77 place count 111 transition count 158
Iterating global reduction 2 with 10 rules applied. Total rules applied 87 place count 111 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 111 transition count 157
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 95 place count 104 transition count 143
Iterating global reduction 3 with 7 rules applied. Total rules applied 102 place count 104 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 104 place count 104 transition count 141
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 108 place count 100 transition count 137
Iterating global reduction 4 with 4 rules applied. Total rules applied 112 place count 100 transition count 137
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 115 place count 97 transition count 134
Iterating global reduction 4 with 3 rules applied. Total rules applied 118 place count 97 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 120 place count 97 transition count 132
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 121 place count 96 transition count 130
Iterating global reduction 5 with 1 rules applied. Total rules applied 122 place count 96 transition count 130
Applied a total of 122 rules in 19 ms. Remains 96 /150 variables (removed 54) and now considering 130/245 (removed 115) transitions.
// Phase 1: matrix 130 rows 96 cols
[2023-03-08 01:42:23] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:42:23] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-08 01:42:23] [INFO ] Invariant cache hit.
[2023-03-08 01:42:23] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 01:42:23] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-08 01:42:23] [INFO ] Invariant cache hit.
[2023-03-08 01:42:23] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/150 places, 130/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 290 ms. Remains : 96/150 places, 130/245 transitions.
Stuttering acceptance computed with spot in 426 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}, { cond=p0, acceptance={0} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s90 1)), p2:(OR (LT s1 1) (LT s58 1)), p1:(AND (GEQ s31 1) (GEQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22891 reset in 158 ms.
Product exploration explored 100000 steps with 23035 reset in 184 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 332 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 764 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2251 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 502 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 450 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 509 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 452 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 945 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Finished probabilistic random walk after 19159 steps, run visited all 9 properties in 166 ms. (steps per millisecond=115 )
Probabilistic random walk after 19159 steps, saw 8327 distinct states, run finished after 167 ms. (steps per millisecond=114 ) properties seen :9
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p2 (NOT p1) p0)), (F (AND (NOT p2) p0)), (F p0), (F (AND (NOT p2) (NOT p1) p0)), (F (NOT (AND p2 (NOT p0)))), (F (AND (NOT p2) (NOT p0))), (F (AND p2 p0)), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 16 factoid took 1039 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 307 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 5 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 130/130 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2023-03-08 01:42:28] [INFO ] Invariant cache hit.
[2023-03-08 01:42:28] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-08 01:42:28] [INFO ] Invariant cache hit.
[2023-03-08 01:42:28] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 01:42:28] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-03-08 01:42:28] [INFO ] Invariant cache hit.
[2023-03-08 01:42:28] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 276 ms. Remains : 96/96 places, 130/130 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 332 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 p0))), (X (AND p2 (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 797 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2275 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 491 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 454 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 972 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 462 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Finished probabilistic random walk after 19159 steps, run visited all 9 properties in 155 ms. (steps per millisecond=123 )
Probabilistic random walk after 19159 steps, saw 8327 distinct states, run finished after 155 ms. (steps per millisecond=123 ) properties seen :9
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 p0))), (X (AND p2 (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p2 (NOT p1) p0)), (F (AND (NOT p2) p0)), (F p0), (F (AND (NOT p2) (NOT p1) p0)), (F (NOT (AND p2 (NOT p0)))), (F (AND (NOT p2) (NOT p0))), (F (AND p2 p0)), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 14 factoid took 875 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 289 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 285 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 23053 reset in 178 ms.
Product exploration explored 100000 steps with 23064 reset in 173 ms.
Built C files in :
/tmp/ltsmin14871150653285292435
[2023-03-08 01:42:32] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14871150653285292435
Running compilation step : cd /tmp/ltsmin14871150653285292435;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 219 ms.
Running link step : cd /tmp/ltsmin14871150653285292435;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14871150653285292435;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3819957615524372350.hoa' '--buchi-type=spotba'
LTSmin run took 124 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-13 finished in 9783 ms.
All properties solved by simple procedures.
Total runtime 21866 ms.

BK_STOP 1678239754198

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-d1m04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is DBSingleClientW-PT-d1m04, 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 r101-tall-167814475100236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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