Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905978200436.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is SieveSingleMsgMbox-PT-d1m64, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978200436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 7.0K Feb 26 10:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 10:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 10:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 10:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 10:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 10:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 450K Mar 5 18:23 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 SieveSingleMsgMbox-PT-d1m64-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679316919347

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=SieveSingleMsgMbox-PT-d1m64
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 12:55:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 12:55:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 12:55:21] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2023-03-20 12:55:21] [INFO ] Transformed 1295 places.
[2023-03-20 12:55:21] [INFO ] Transformed 749 transitions.
[2023-03-20 12:55:21] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1036 places in 7 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 303 place count 196 transition count 393
Iterating global reduction 1 with 46 rules applied. Total rules applied 349 place count 196 transition count 393
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 357 place count 196 transition count 385
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 385 place count 168 transition count 357
Iterating global reduction 2 with 28 rules applied. Total rules applied 413 place count 168 transition count 357
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 420 place count 168 transition count 350
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 434 place count 154 transition count 335
Iterating global reduction 3 with 14 rules applied. Total rules applied 448 place count 154 transition count 335
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 3 with 45 rules applied. Total rules applied 493 place count 154 transition count 290
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 495 place count 152 transition count 287
Iterating global reduction 4 with 2 rules applied. Total rules applied 497 place count 152 transition count 287
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 499 place count 150 transition count 285
Iterating global reduction 4 with 2 rules applied. Total rules applied 501 place count 150 transition count 285
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 502 place count 149 transition count 284
Iterating global reduction 4 with 1 rules applied. Total rules applied 503 place count 149 transition count 284
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 504 place count 148 transition count 283
Iterating global reduction 4 with 1 rules applied. Total rules applied 505 place count 148 transition count 283
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 506 place count 147 transition count 282
Iterating global reduction 4 with 1 rules applied. Total rules applied 507 place count 147 transition count 282
Applied a total of 507 rules in 78 ms. Remains 147 /259 variables (removed 112) and now considering 282/749 (removed 467) transitions.
// Phase 1: matrix 282 rows 147 cols
[2023-03-20 12:55:21] [INFO ] Computed 5 place invariants in 15 ms
[2023-03-20 12:55:21] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-20 12:55:21] [INFO ] Invariant cache hit.
[2023-03-20 12:55:21] [INFO ] State equation strengthened by 178 read => feed constraints.
[2023-03-20 12:55:22] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 819 ms to find 0 implicit places.
[2023-03-20 12:55:22] [INFO ] Invariant cache hit.
[2023-03-20 12:55:22] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 147/259 places, 282/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1059 ms. Remains : 147/259 places, 282/749 transitions.
Support contains 24 out of 147 places after structural reductions.
[2023-03-20 12:55:22] [INFO ] Flatten gal took : 44 ms
[2023-03-20 12:55:22] [INFO ] Flatten gal took : 20 ms
[2023-03-20 12:55:22] [INFO ] Input system was already deterministic with 282 transitions.
Incomplete random walk after 10000 steps, including 2291 resets, run finished after 575 ms. (steps per millisecond=17 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 109 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 109 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 117 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 22) seen :0
Interrupted probabilistic random walk after 239959 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{0=1, 2=1, 3=1, 5=1, 6=1, 7=1, 8=1, 9=1, 11=1, 13=1, 18=1, 19=1, 20=1, 21=1}
Probabilistic random walk after 239959 steps, saw 112015 distinct states, run finished after 3003 ms. (steps per millisecond=79 ) properties seen :14
Running SMT prover for 8 properties.
[2023-03-20 12:55:26] [INFO ] Invariant cache hit.
[2023-03-20 12:55:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 12:55:26] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-20 12:55:27] [INFO ] After 417ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 12:55:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:55:27] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:55:27] [INFO ] After 305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 12:55:27] [INFO ] State equation strengthened by 178 read => feed constraints.
[2023-03-20 12:55:28] [INFO ] After 381ms SMT Verify possible using 178 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-20 12:55:28] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 6 ms to minimize.
[2023-03-20 12:55:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-20 12:55:28] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2023-03-20 12:55:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-20 12:55:28] [INFO ] After 1153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 731 ms.
[2023-03-20 12:55:29] [INFO ] After 2299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 2 properties in 195 ms.
Support contains 7 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 282/282 transitions.
Graph (complete) has 512 edges and 147 vertex of which 146 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 146 transition count 280
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 16 place count 133 transition count 194
Iterating global reduction 1 with 13 rules applied. Total rules applied 29 place count 133 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 133 transition count 192
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 41 place count 123 transition count 182
Iterating global reduction 2 with 10 rules applied. Total rules applied 51 place count 123 transition count 182
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 61 place count 123 transition count 172
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 65 place count 119 transition count 167
Iterating global reduction 3 with 4 rules applied. Total rules applied 69 place count 119 transition count 167
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 71 place count 119 transition count 165
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 73 place count 117 transition count 163
Iterating global reduction 4 with 2 rules applied. Total rules applied 75 place count 117 transition count 163
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 76 place count 116 transition count 162
Iterating global reduction 4 with 1 rules applied. Total rules applied 77 place count 116 transition count 162
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 78 place count 115 transition count 161
Iterating global reduction 4 with 1 rules applied. Total rules applied 79 place count 115 transition count 161
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 84 place count 115 transition count 156
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 85 place count 114 transition count 155
Iterating global reduction 5 with 1 rules applied. Total rules applied 86 place count 114 transition count 155
Applied a total of 86 rules in 58 ms. Remains 114 /147 variables (removed 33) and now considering 155/282 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 114/147 places, 155/282 transitions.
Incomplete random walk after 10000 steps, including 2248 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 480 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 497 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 475 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 489 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 325944 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 325944 steps, saw 140260 distinct states, run finished after 3009 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 155 rows 114 cols
[2023-03-20 12:55:33] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-20 12:55:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:55:33] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:55:33] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 12:55:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:55:33] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 12:55:34] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 12:55:34] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-20 12:55:34] [INFO ] After 247ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-20 12:55:34] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2023-03-20 12:55:34] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2023-03-20 12:55:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 121 ms
[2023-03-20 12:55:34] [INFO ] After 572ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 152 ms.
[2023-03-20 12:55:34] [INFO ] After 924ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 214 ms.
Support contains 7 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 155/155 transitions.
Applied a total of 0 rules in 13 ms. Remains 114 /114 variables (removed 0) and now considering 155/155 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 114/114 places, 155/155 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 155/155 transitions.
Applied a total of 0 rules in 11 ms. Remains 114 /114 variables (removed 0) and now considering 155/155 (removed 0) transitions.
[2023-03-20 12:55:34] [INFO ] Invariant cache hit.
[2023-03-20 12:55:35] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-20 12:55:35] [INFO ] Invariant cache hit.
[2023-03-20 12:55:35] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-20 12:55:35] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2023-03-20 12:55:35] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-20 12:55:35] [INFO ] Invariant cache hit.
[2023-03-20 12:55:35] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 467 ms. Remains : 114/114 places, 155/155 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 114 transition count 150
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 110 transition count 150
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 9 place count 110 transition count 132
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 45 place count 92 transition count 132
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 65 place count 82 transition count 122
Applied a total of 65 rules in 18 ms. Remains 82 /114 variables (removed 32) and now considering 122/155 (removed 33) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 122 rows 82 cols
[2023-03-20 12:55:35] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-20 12:55:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:55:35] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:55:35] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 12:55:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:55:35] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:55:35] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 12:55:35] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2023-03-20 12:55:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-20 12:55:36] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2023-03-20 12:55:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-20 12:55:36] [INFO ] After 406ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-20 12:55:36] [INFO ] After 568ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Computed a total of 32 stabilizing places and 52 stable transitions
Graph (complete) has 566 edges and 147 vertex of which 146 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 5 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 131 transition count 175
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 131 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 131 transition count 173
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 118 transition count 160
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 118 transition count 160
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 67 place count 118 transition count 153
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 76 place count 109 transition count 143
Iterating global reduction 2 with 9 rules applied. Total rules applied 85 place count 109 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 87 place count 109 transition count 141
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 91 place count 105 transition count 136
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 place count 105 transition count 136
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 102 transition count 133
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 102 transition count 133
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 100 transition count 130
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 100 transition count 130
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 98 transition count 128
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 98 transition count 128
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 96 transition count 126
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 96 transition count 126
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 95 transition count 124
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 95 transition count 124
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 94 transition count 123
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 94 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 93 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 93 transition count 122
Applied a total of 119 rules in 33 ms. Remains 93 /147 variables (removed 54) and now considering 122/282 (removed 160) transitions.
// Phase 1: matrix 122 rows 93 cols
[2023-03-20 12:55:36] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 12:55:36] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-20 12:55:36] [INFO ] Invariant cache hit.
[2023-03-20 12:55:36] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-20 12:55:36] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2023-03-20 12:55:36] [INFO ] Invariant cache hit.
[2023-03-20 12:55:36] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/147 places, 122/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 363 ms. Remains : 93/147 places, 122/282 transitions.
Stuttering acceptance computed with spot in 243 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-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:(AND (OR (LT s17 1) (LT s28 1)) (OR (LT s1 1) (LT s88 1)) (OR (LT s1 1) (LT s87 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]]
Product exploration explored 100000 steps with 22324 reset in 343 ms.
Product exploration explored 100000 steps with 22428 reset in 241 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 309 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2261 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1106 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3733 steps, run visited all 1 properties in 10 ms. (steps per millisecond=373 )
Probabilistic random walk after 3733 steps, saw 1655 distinct states, run finished after 10 ms. (steps per millisecond=373 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 185 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 122/122 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2023-03-20 12:55:38] [INFO ] Invariant cache hit.
[2023-03-20 12:55:38] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-20 12:55:38] [INFO ] Invariant cache hit.
[2023-03-20 12:55:38] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-20 12:55:38] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2023-03-20 12:55:38] [INFO ] Invariant cache hit.
[2023-03-20 12:55:38] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 320 ms. Remains : 93/93 places, 122/122 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 309 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2234 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1078 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3733 steps, run visited all 1 properties in 31 ms. (steps per millisecond=120 )
Probabilistic random walk after 3733 steps, saw 1655 distinct states, run finished after 32 ms. (steps per millisecond=116 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22501 reset in 176 ms.
Product exploration explored 100000 steps with 22460 reset in 264 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 122/122 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2023-03-20 12:55:40] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 12:55:40] [INFO ] Invariant cache hit.
[2023-03-20 12:55:40] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 93/93 places, 122/122 transitions.
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2023-03-20 12:55:40] [INFO ] Invariant cache hit.
[2023-03-20 12:55:40] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-20 12:55:40] [INFO ] Invariant cache hit.
[2023-03-20 12:55:40] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-20 12:55:40] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2023-03-20 12:55:40] [INFO ] Invariant cache hit.
[2023-03-20 12:55:40] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 313 ms. Remains : 93/93 places, 122/122 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-00 finished in 4186 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 U p1)&&(!p0 U X((p2 U p0))))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 131 transition count 184
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 131 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 131 transition count 182
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 118 transition count 169
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 118 transition count 169
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 71 place count 118 transition count 158
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 109 transition count 148
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 109 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 109 transition count 146
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 95 place count 105 transition count 141
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 105 transition count 141
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 102 place count 102 transition count 138
Iterating global reduction 3 with 3 rules applied. Total rules applied 105 place count 102 transition count 138
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 100 transition count 135
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 100 transition count 135
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 98 transition count 133
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 98 transition count 133
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 96 transition count 131
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 96 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 95 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 95 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 94 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 94 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 93 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 93 transition count 127
Applied a total of 123 rules in 23 ms. Remains 93 /147 variables (removed 54) and now considering 127/282 (removed 155) transitions.
// Phase 1: matrix 127 rows 93 cols
[2023-03-20 12:55:40] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:55:40] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-20 12:55:40] [INFO ] Invariant cache hit.
[2023-03-20 12:55:40] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-20 12:55:41] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2023-03-20 12:55:41] [INFO ] Invariant cache hit.
[2023-03-20 12:55:41] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/147 places, 127/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 332 ms. Remains : 93/147 places, 127/282 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s87 1)), p0:(AND (GEQ s1 1) (GEQ s86 1)), p2:(AND (GEQ s1 1) (GEQ s88 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-01 finished in 531 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))&&(p0||F(p1)))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 130 transition count 165
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 130 transition count 165
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 130 transition count 163
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 50 place count 116 transition count 149
Iterating global reduction 1 with 14 rules applied. Total rules applied 64 place count 116 transition count 149
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 73 place count 116 transition count 140
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 82 place count 107 transition count 131
Iterating global reduction 2 with 9 rules applied. Total rules applied 91 place count 107 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 94 place count 107 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 103 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 103 transition count 123
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 99 transition count 119
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 99 transition count 119
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 97 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 97 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 116 place count 97 transition count 114
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 118 place count 95 transition count 112
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 95 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 121 place count 94 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 94 transition count 111
Applied a total of 122 rules in 21 ms. Remains 94 /147 variables (removed 53) and now considering 111/282 (removed 171) transitions.
// Phase 1: matrix 111 rows 94 cols
[2023-03-20 12:55:41] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:55:41] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-20 12:55:41] [INFO ] Invariant cache hit.
[2023-03-20 12:55:41] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-20 12:55:41] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-20 12:55:41] [INFO ] Invariant cache hit.
[2023-03-20 12:55:41] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/147 places, 111/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 292 ms. Remains : 94/147 places, 111/282 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(AND (GEQ s10 1) (GEQ s29 1)), p1:(AND (GEQ s1 1) (GEQ s89 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-03 finished in 465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(X(F(!p2))&&(!p0 U (p1||G(!p0)))))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 131 transition count 184
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 131 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 131 transition count 182
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 118 transition count 169
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 118 transition count 169
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 70 place count 118 transition count 159
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 78 place count 110 transition count 150
Iterating global reduction 2 with 8 rules applied. Total rules applied 86 place count 110 transition count 150
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 110 transition count 149
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 107 transition count 145
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 107 transition count 145
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 95 place count 105 transition count 143
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 105 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 99 place count 103 transition count 140
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 103 transition count 140
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 101 transition count 138
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 101 transition count 138
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 99 transition count 136
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 99 transition count 136
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 98 transition count 134
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 98 transition count 134
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 97 transition count 133
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 97 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 96 transition count 132
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 96 transition count 132
Applied a total of 115 rules in 10 ms. Remains 96 /147 variables (removed 51) and now considering 132/282 (removed 150) transitions.
// Phase 1: matrix 132 rows 96 cols
[2023-03-20 12:55:41] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:55:41] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-20 12:55:41] [INFO ] Invariant cache hit.
[2023-03-20 12:55:41] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-20 12:55:41] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2023-03-20 12:55:41] [INFO ] Invariant cache hit.
[2023-03-20 12:55:42] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/147 places, 132/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 296 ms. Remains : 96/147 places, 132/282 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND p0 (NOT p1)), true, (AND p2 p0 (NOT p1)), (AND p0 (NOT p1)), p2]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s89 1)), p1:(AND (NOT (AND (GEQ s1 1) (GEQ s89 1))) (GEQ s1 1) (GEQ s91 1)), p2:(AND (GEQ s1 1) (GEQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 31073 reset in 218 ms.
Product exploration explored 100000 steps with 30996 reset in 210 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 324 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 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p2))), true, (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 418 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2217 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 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 473 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1166241 steps, run visited all 2 properties in 1683 ms. (steps per millisecond=692 )
Probabilistic random walk after 1166241 steps, saw 493958 distinct states, run finished after 1693 ms. (steps per millisecond=688 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p2))), true, (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 404 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 96 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 132/132 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2023-03-20 12:55:45] [INFO ] Invariant cache hit.
[2023-03-20 12:55:45] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-20 12:55:45] [INFO ] Invariant cache hit.
[2023-03-20 12:55:45] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-20 12:55:45] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2023-03-20 12:55:45] [INFO ] Invariant cache hit.
[2023-03-20 12:55:45] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 343 ms. Remains : 96/96 places, 132/132 transitions.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 324 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 186 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2242 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 491 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1166241 steps, run visited all 2 properties in 1966 ms. (steps per millisecond=593 )
Probabilistic random walk after 1166241 steps, saw 493958 distinct states, run finished after 1969 ms. (steps per millisecond=592 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 324 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 22492 reset in 168 ms.
Product exploration explored 100000 steps with 22405 reset in 199 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 104 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 132/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 95 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 95 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 94 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 94 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 93 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 93 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 92 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 91 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 91 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 90 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 90 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 89 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 89 transition count 112
Applied a total of 19 rules in 35 ms. Remains 89 /96 variables (removed 7) and now considering 112/132 (removed 20) transitions.
[2023-03-20 12:55:49] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 112 rows 89 cols
[2023-03-20 12:55:49] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 12:55:49] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/96 places, 112/132 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 89/96 places, 112/132 transitions.
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 132/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 95 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 95 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 94 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 94 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 93 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 93 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 92 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 91 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 91 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 90 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 90 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 89 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 89 transition count 112
Applied a total of 19 rules in 11 ms. Remains 89 /96 variables (removed 7) and now considering 112/132 (removed 20) transitions.
[2023-03-20 12:55:49] [INFO ] Invariant cache hit.
[2023-03-20 12:55:49] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-20 12:55:49] [INFO ] Invariant cache hit.
[2023-03-20 12:55:50] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-20 12:55:50] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2023-03-20 12:55:50] [INFO ] Invariant cache hit.
[2023-03-20 12:55:50] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/96 places, 112/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 377 ms. Remains : 89/96 places, 112/132 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 finished in 8574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(!p0))||(F(!p0)&&G(F(!p1)))))))'
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 129 transition count 164
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 129 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 129 transition count 162
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 53 place count 114 transition count 147
Iterating global reduction 1 with 15 rules applied. Total rules applied 68 place count 114 transition count 147
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 78 place count 114 transition count 137
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 104 transition count 126
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 104 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 104 transition count 123
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 106 place count 99 transition count 117
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 99 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 95 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 95 transition count 113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 121 place count 93 transition count 111
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 93 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 125 place count 93 transition count 109
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 127 place count 91 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 91 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 90 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 132 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 87 transition count 102
Applied a total of 137 rules in 10 ms. Remains 87 /147 variables (removed 60) and now considering 102/282 (removed 180) transitions.
// Phase 1: matrix 102 rows 87 cols
[2023-03-20 12:55:50] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:55:50] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-20 12:55:50] [INFO ] Invariant cache hit.
[2023-03-20 12:55:50] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 12:55:50] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-20 12:55:50] [INFO ] Invariant cache hit.
[2023-03-20 12:55:50] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/147 places, 102/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 284 ms. Remains : 87/147 places, 102/282 transitions.
Stuttering acceptance computed with spot in 246 ms :[p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s82 1)), p1:(AND (GEQ s1 1) (GEQ s61 1) (GEQ s1 1) (GEQ s82 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]]
Product exploration explored 100000 steps with 22403 reset in 261 ms.
Product exploration explored 100000 steps with 22302 reset in 271 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2235 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 486 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2487 steps, run visited all 1 properties in 8 ms. (steps per millisecond=310 )
Probabilistic random walk after 2487 steps, saw 1190 distinct states, run finished after 8 ms. (steps per millisecond=310 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 p0))]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 69 ms :[(AND p1 p0), (AND p1 p0)]
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 8 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-20 12:55:52] [INFO ] Invariant cache hit.
[2023-03-20 12:55:52] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-20 12:55:52] [INFO ] Invariant cache hit.
[2023-03-20 12:55:52] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 12:55:52] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2023-03-20 12:55:52] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 12:55:52] [INFO ] Invariant cache hit.
[2023-03-20 12:55:52] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 359 ms. Remains : 87/87 places, 102/102 transitions.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2252 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 470 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2487 steps, run visited all 1 properties in 7 ms. (steps per millisecond=355 )
Probabilistic random walk after 2487 steps, saw 1190 distinct states, run finished after 7 ms. (steps per millisecond=355 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 93 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 70 ms :[(AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 22459 reset in 111 ms.
Product exploration explored 100000 steps with 22411 reset in 111 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-20 12:55:53] [INFO ] Invariant cache hit.
[2023-03-20 12:55:53] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-20 12:55:53] [INFO ] Invariant cache hit.
[2023-03-20 12:55:53] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 12:55:53] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-20 12:55:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:55:53] [INFO ] Invariant cache hit.
[2023-03-20 12:55:53] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 282 ms. Remains : 87/87 places, 102/102 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 finished in 3215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||(!p0&&F((!p1&&X(X(G(!p0))))))))'
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 129 transition count 164
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 129 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 129 transition count 162
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 53 place count 114 transition count 147
Iterating global reduction 1 with 15 rules applied. Total rules applied 68 place count 114 transition count 147
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 78 place count 114 transition count 137
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 104 transition count 126
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 104 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 104 transition count 123
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 106 place count 99 transition count 117
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 99 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 95 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 95 transition count 113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 121 place count 93 transition count 111
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 93 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 125 place count 93 transition count 109
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 127 place count 91 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 91 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 90 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 132 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 87 transition count 102
Applied a total of 137 rules in 13 ms. Remains 87 /147 variables (removed 60) and now considering 102/282 (removed 180) transitions.
// Phase 1: matrix 102 rows 87 cols
[2023-03-20 12:55:53] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:55:53] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-20 12:55:53] [INFO ] Invariant cache hit.
[2023-03-20 12:55:53] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 12:55:53] [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-20 12:55:53] [INFO ] Invariant cache hit.
[2023-03-20 12:55:53] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/147 places, 102/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 281 ms. Remains : 87/147 places, 102/282 transitions.
Stuttering acceptance computed with spot in 208 ms :[p0, true, p0, p0, (OR p1 p0), p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=p1, acceptance={0} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 2}, { cond=p1, acceptance={0} source=5 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s61 1)), p1:(AND (GEQ s1 1) (GEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22479 reset in 195 ms.
Product exploration explored 100000 steps with 22468 reset in 170 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 479 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[p0, p0, p0, (OR p1 p0), p0]
Incomplete random walk after 10000 steps, including 2210 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 456 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 459 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 12:55:55] [INFO ] Invariant cache hit.
[2023-03-20 12:55:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:55:55] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:55:55] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 12:55:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:55:55] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:55:55] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 12:55:55] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 12:55:55] [INFO ] After 44ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 12:55:55] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-20 12:55:55] [INFO ] After 287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 73 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 102/102 transitions.
Graph (complete) has 245 edges and 87 vertex of which 86 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 86 transition count 100
Applied a total of 3 rules in 6 ms. Remains 86 /87 variables (removed 1) and now considering 100/102 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 86/87 places, 100/102 transitions.
Incomplete random walk after 10000 steps, including 2283 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 505 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 482 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Finished probabilistic random walk after 2813 steps, run visited all 3 properties in 32 ms. (steps per millisecond=87 )
Probabilistic random walk after 2813 steps, saw 1424 distinct states, run finished after 32 ms. (steps per millisecond=87 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 11 factoid took 603 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[p0, p0, p0, (OR p1 p0), p0]
Stuttering acceptance computed with spot in 174 ms :[p0, p0, p0, (OR p1 p0), p0]
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 0 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-20 12:55:57] [INFO ] Invariant cache hit.
[2023-03-20 12:55:57] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-20 12:55:57] [INFO ] Invariant cache hit.
[2023-03-20 12:55:57] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 12:55:58] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
[2023-03-20 12:55:58] [INFO ] Invariant cache hit.
[2023-03-20 12:55:58] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 587 ms. Remains : 87/87 places, 102/102 transitions.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 403 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[p0, p0, p0, (OR p1 p0), p0]
Incomplete random walk after 10000 steps, including 2274 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 500 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 452 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 477 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 12:55:58] [INFO ] Invariant cache hit.
[2023-03-20 12:55:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:55:58] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 26 ms returned sat
[2023-03-20 12:55:59] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 12:55:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:55:59] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:55:59] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 12:55:59] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 12:55:59] [INFO ] After 34ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 12:55:59] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-20 12:55:59] [INFO ] After 244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 42 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 102/102 transitions.
Graph (complete) has 245 edges and 87 vertex of which 86 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 86 transition count 100
Applied a total of 3 rules in 4 ms. Remains 86 /87 variables (removed 1) and now considering 100/102 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 86/87 places, 100/102 transitions.
Incomplete random walk after 10000 steps, including 2242 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 482 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 490 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Finished probabilistic random walk after 2813 steps, run visited all 3 properties in 11 ms. (steps per millisecond=255 )
Probabilistic random walk after 2813 steps, saw 1424 distinct states, run finished after 11 ms. (steps per millisecond=255 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F p1), (F (AND p0 p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 451 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[p0, p0, p0, (OR p1 p0), p0]
Stuttering acceptance computed with spot in 163 ms :[p0, p0, p0, (OR p1 p0), p0]
Stuttering acceptance computed with spot in 158 ms :[p0, p0, p0, (OR p1 p0), p0]
Product exploration explored 100000 steps with 22422 reset in 128 ms.
Product exploration explored 100000 steps with 22345 reset in 135 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-20 12:56:00] [INFO ] Invariant cache hit.
[2023-03-20 12:56:00] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-20 12:56:00] [INFO ] Invariant cache hit.
[2023-03-20 12:56:01] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 12:56:01] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2023-03-20 12:56:01] [INFO ] Invariant cache hit.
[2023-03-20 12:56:01] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 377 ms. Remains : 87/87 places, 102/102 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-07 finished in 7753 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((X((X(F(p1))||F(p2)))&&p0)))'
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 130 transition count 165
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 130 transition count 165
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 130 transition count 163
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 50 place count 116 transition count 149
Iterating global reduction 1 with 14 rules applied. Total rules applied 64 place count 116 transition count 149
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 74 place count 116 transition count 139
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 82 place count 108 transition count 130
Iterating global reduction 2 with 8 rules applied. Total rules applied 90 place count 108 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 93 place count 108 transition count 127
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 97 place count 104 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 101 place count 104 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 104 place count 101 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 107 place count 101 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 109 place count 99 transition count 117
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 99 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 113 place count 99 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 115 place count 97 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 97 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 118 place count 96 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 119 place count 96 transition count 112
Applied a total of 119 rules in 8 ms. Remains 96 /147 variables (removed 51) and now considering 112/282 (removed 170) transitions.
// Phase 1: matrix 112 rows 96 cols
[2023-03-20 12:56:01] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 12:56:01] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-20 12:56:01] [INFO ] Invariant cache hit.
[2023-03-20 12:56:01] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-20 12:56:01] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
[2023-03-20 12:56:01] [INFO ] Invariant cache hit.
[2023-03-20 12:56:01] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/147 places, 112/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 698 ms. Remains : 96/147 places, 112/282 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s59 1)), p2:(OR (LT s1 1) (LT s59 1)), p1:(OR (LT s1 1) (LT s91 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 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-08 finished in 816 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 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 129 transition count 155
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 129 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 129 transition count 153
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 54 place count 113 transition count 137
Iterating global reduction 1 with 16 rules applied. Total rules applied 70 place count 113 transition count 137
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 79 place count 113 transition count 128
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 89 place count 103 transition count 117
Iterating global reduction 2 with 10 rules applied. Total rules applied 99 place count 103 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 102 place count 103 transition count 114
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 99 transition count 109
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 99 transition count 109
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 113 place count 96 transition count 106
Iterating global reduction 3 with 3 rules applied. Total rules applied 116 place count 96 transition count 106
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 93 transition count 102
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 93 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 93 transition count 101
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 126 place count 90 transition count 98
Iterating global reduction 4 with 3 rules applied. Total rules applied 129 place count 90 transition count 98
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 131 place count 88 transition count 96
Iterating global reduction 4 with 2 rules applied. Total rules applied 133 place count 88 transition count 96
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 87 transition count 94
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 87 transition count 94
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 86 transition count 93
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 86 transition count 93
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 85 transition count 92
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 85 transition count 92
Applied a total of 139 rules in 9 ms. Remains 85 /147 variables (removed 62) and now considering 92/282 (removed 190) transitions.
// Phase 1: matrix 92 rows 85 cols
[2023-03-20 12:56:02] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:56:02] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-20 12:56:02] [INFO ] Invariant cache hit.
[2023-03-20 12:56:02] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-20 12:56:02] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2023-03-20 12:56:02] [INFO ] Invariant cache hit.
[2023-03-20 12:56:02] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/147 places, 92/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 298 ms. Remains : 85/147 places, 92/282 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-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: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s20 1) (LT s58 1) (AND (GEQ s1 1) (GEQ s71 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]]
Product exploration explored 100000 steps with 22299 reset in 101 ms.
Product exploration explored 100000 steps with 22396 reset in 110 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 266 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 251 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2245 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1034 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3854 steps, run visited all 1 properties in 8 ms. (steps per millisecond=481 )
Probabilistic random walk after 3854 steps, saw 1736 distinct states, run finished after 8 ms. (steps per millisecond=481 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-20 12:56:03] [INFO ] Invariant cache hit.
[2023-03-20 12:56:03] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-20 12:56:03] [INFO ] Invariant cache hit.
[2023-03-20 12:56:03] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-20 12:56:03] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-20 12:56:03] [INFO ] Invariant cache hit.
[2023-03-20 12:56:03] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 431 ms. Remains : 85/85 places, 92/92 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 266 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2236 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1053 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3854 steps, run visited all 1 properties in 9 ms. (steps per millisecond=428 )
Probabilistic random walk after 3854 steps, saw 1736 distinct states, run finished after 9 ms. (steps per millisecond=428 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22282 reset in 100 ms.
Product exploration explored 100000 steps with 22462 reset in 108 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-20 12:56:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:56:04] [INFO ] Invariant cache hit.
[2023-03-20 12:56:04] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 85/85 places, 92/92 transitions.
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-20 12:56:04] [INFO ] Invariant cache hit.
[2023-03-20 12:56:04] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-20 12:56:04] [INFO ] Invariant cache hit.
[2023-03-20 12:56:05] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-20 12:56:05] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2023-03-20 12:56:05] [INFO ] Invariant cache hit.
[2023-03-20 12:56:05] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 353 ms. Remains : 85/85 places, 92/92 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-09 finished in 3149 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||X((p1&&F(p2)))))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 131 transition count 184
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 131 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 131 transition count 182
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 118 transition count 169
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 118 transition count 169
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 70 place count 118 transition count 159
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 78 place count 110 transition count 150
Iterating global reduction 2 with 8 rules applied. Total rules applied 86 place count 110 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 88 place count 110 transition count 148
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 92 place count 106 transition count 143
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 106 transition count 143
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 99 place count 103 transition count 140
Iterating global reduction 3 with 3 rules applied. Total rules applied 102 place count 103 transition count 140
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 101 transition count 137
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 101 transition count 137
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 99 transition count 135
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 99 transition count 135
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 97 transition count 133
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 97 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 96 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 96 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 117 place count 95 transition count 130
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 95 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 119 place count 94 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 120 place count 94 transition count 129
Applied a total of 120 rules in 12 ms. Remains 94 /147 variables (removed 53) and now considering 129/282 (removed 153) transitions.
// Phase 1: matrix 129 rows 94 cols
[2023-03-20 12:56:05] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:56:05] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-20 12:56:05] [INFO ] Invariant cache hit.
[2023-03-20 12:56:05] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-20 12:56:05] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2023-03-20 12:56:05] [INFO ] Invariant cache hit.
[2023-03-20 12:56:05] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/147 places, 129/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 544 ms. Remains : 94/147 places, 129/282 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s88 1)), p1:(OR (LT s1 1) (LT s89 1)), p2:(OR (LT s1 1) (LT s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 158 ms.
Product exploration explored 100000 steps with 33333 reset in 228 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 317 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1 p2)
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-10 finished in 1223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&G(p1)))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 131 transition count 166
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 131 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 131 transition count 165
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 47 place count 117 transition count 151
Iterating global reduction 1 with 14 rules applied. Total rules applied 61 place count 117 transition count 151
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 71 place count 117 transition count 141
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 108 transition count 131
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 108 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 92 place count 108 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 96 place count 104 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 100 place count 104 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 103 place count 101 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 106 place count 101 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 99 transition count 118
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 99 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 112 place count 99 transition count 116
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 98 transition count 115
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 98 transition count 115
Applied a total of 114 rules in 7 ms. Remains 98 /147 variables (removed 49) and now considering 115/282 (removed 167) transitions.
// Phase 1: matrix 115 rows 98 cols
[2023-03-20 12:56:06] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:56:06] [INFO ] Implicit Places using invariants in 232 ms returned []
[2023-03-20 12:56:06] [INFO ] Invariant cache hit.
[2023-03-20 12:56:06] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-20 12:56:06] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2023-03-20 12:56:06] [INFO ] Invariant cache hit.
[2023-03-20 12:56:06] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/147 places, 115/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 463 ms. Remains : 98/147 places, 115/282 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s41 1)), p0:(OR (AND (GEQ s1 1) (GEQ s67 1)) (AND (GEQ s1 1) (GEQ s93 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-11 finished in 644 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(!p0))))'
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 129 transition count 164
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 129 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 129 transition count 162
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 53 place count 114 transition count 147
Iterating global reduction 1 with 15 rules applied. Total rules applied 68 place count 114 transition count 147
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 78 place count 114 transition count 137
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 104 transition count 126
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 104 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 104 transition count 123
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 106 place count 99 transition count 117
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 99 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 95 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 95 transition count 113
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 122 place count 92 transition count 109
Iterating global reduction 3 with 3 rules applied. Total rules applied 125 place count 92 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 127 place count 92 transition count 107
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 130 place count 89 transition count 104
Iterating global reduction 4 with 3 rules applied. Total rules applied 133 place count 89 transition count 104
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 135 place count 87 transition count 102
Iterating global reduction 4 with 2 rules applied. Total rules applied 137 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 86 transition count 100
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 140 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 84 transition count 98
Applied a total of 143 rules in 36 ms. Remains 84 /147 variables (removed 63) and now considering 98/282 (removed 184) transitions.
// Phase 1: matrix 98 rows 84 cols
[2023-03-20 12:56:07] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 12:56:07] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-20 12:56:07] [INFO ] Invariant cache hit.
[2023-03-20 12:56:07] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 12:56:07] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2023-03-20 12:56:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:56:07] [INFO ] Invariant cache hit.
[2023-03-20 12:56:07] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/147 places, 98/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 275 ms. Remains : 84/147 places, 98/282 transitions.
Stuttering acceptance computed with spot in 31 ms :[false]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s79 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22491 reset in 115 ms.
Product exploration explored 100000 steps with 22525 reset in 238 ms.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 269 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[false]
Incomplete random walk after 10000 steps, including 2266 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 450 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 36123 steps, run visited all 1 properties in 50 ms. (steps per millisecond=722 )
Probabilistic random walk after 36123 steps, saw 16035 distinct states, run finished after 50 ms. (steps per millisecond=722 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[false]
Stuttering acceptance computed with spot in 35 ms :[false]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-20 12:56:08] [INFO ] Invariant cache hit.
[2023-03-20 12:56:08] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-20 12:56:08] [INFO ] Invariant cache hit.
[2023-03-20 12:56:08] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 12:56:08] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-20 12:56:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:56:08] [INFO ] Invariant cache hit.
[2023-03-20 12:56:08] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 350 ms. Remains : 84/84 places, 98/98 transitions.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 269 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[false]
Incomplete random walk after 10000 steps, including 2235 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 490 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 36123 steps, run visited all 1 properties in 46 ms. (steps per millisecond=785 )
Probabilistic random walk after 36123 steps, saw 16035 distinct states, run finished after 46 ms. (steps per millisecond=785 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[false]
Stuttering acceptance computed with spot in 36 ms :[false]
Stuttering acceptance computed with spot in 31 ms :[false]
Product exploration explored 100000 steps with 22473 reset in 164 ms.
Product exploration explored 100000 steps with 22414 reset in 151 ms.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-20 12:56:09] [INFO ] Invariant cache hit.
[2023-03-20 12:56:09] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-20 12:56:09] [INFO ] Invariant cache hit.
[2023-03-20 12:56:09] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 12:56:09] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2023-03-20 12:56:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:56:09] [INFO ] Invariant cache hit.
[2023-03-20 12:56:09] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 409 ms. Remains : 84/84 places, 98/98 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-12 finished in 2717 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&&(p1 U X(X(p2)))))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 131 transition count 176
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 131 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 131 transition count 175
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 47 place count 117 transition count 161
Iterating global reduction 1 with 14 rules applied. Total rules applied 61 place count 117 transition count 161
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 71 place count 117 transition count 151
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 108 transition count 141
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 108 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 108 transition count 139
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 95 place count 104 transition count 134
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 104 transition count 134
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 102 place count 101 transition count 131
Iterating global reduction 3 with 3 rules applied. Total rules applied 105 place count 101 transition count 131
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 99 transition count 128
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 99 transition count 128
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 97 transition count 126
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 97 transition count 126
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 95 transition count 124
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 95 transition count 124
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 94 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 94 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 93 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 93 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 92 transition count 120
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 92 transition count 120
Applied a total of 123 rules in 23 ms. Remains 92 /147 variables (removed 55) and now considering 120/282 (removed 162) transitions.
// Phase 1: matrix 120 rows 92 cols
[2023-03-20 12:56:09] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:56:09] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-20 12:56:09] [INFO ] Invariant cache hit.
[2023-03-20 12:56:10] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-20 12:56:10] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2023-03-20 12:56:10] [INFO ] Invariant cache hit.
[2023-03-20 12:56:10] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/147 places, 120/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 332 ms. Remains : 92/147 places, 120/282 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 4}, { cond=p1, acceptance={0} source=2 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s86 1)), p1:(AND (GEQ s1 1) (GEQ s85 1)), p2:(AND (GEQ s1 1) (GEQ s87 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]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-13 finished in 589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&F(!p1)) U (G((p0&&F(!p1)))||(p0&&G(!p1)))))))'
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 130 transition count 174
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 130 transition count 174
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 130 transition count 172
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 50 place count 116 transition count 158
Iterating global reduction 1 with 14 rules applied. Total rules applied 64 place count 116 transition count 158
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 74 place count 116 transition count 148
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 83 place count 107 transition count 138
Iterating global reduction 2 with 9 rules applied. Total rules applied 92 place count 107 transition count 138
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 107 transition count 136
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 103 transition count 131
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 103 transition count 131
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 105 place count 100 transition count 128
Iterating global reduction 3 with 3 rules applied. Total rules applied 108 place count 100 transition count 128
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 110 place count 98 transition count 125
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 98 transition count 125
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 96 transition count 123
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 96 transition count 123
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 118 place count 94 transition count 121
Iterating global reduction 3 with 2 rules applied. Total rules applied 120 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 121 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 122 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 91 transition count 117
Applied a total of 126 rules in 17 ms. Remains 91 /147 variables (removed 56) and now considering 117/282 (removed 165) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-20 12:56:10] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 12:56:10] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-20 12:56:10] [INFO ] Invariant cache hit.
[2023-03-20 12:56:10] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-20 12:56:10] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2023-03-20 12:56:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:56:10] [INFO ] Invariant cache hit.
[2023-03-20 12:56:10] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/147 places, 117/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 391 ms. Remains : 91/147 places, 117/282 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s86 1)), p1:(AND (GEQ s1 1) (GEQ s85 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 22491 reset in 151 ms.
Product exploration explored 100000 steps with 22549 reset in 151 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 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 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 518 ms. Reduced automaton from 4 states, 13 edges and 2 AP (stutter insensitive) to 4 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Incomplete random walk after 10000 steps, including 2209 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 507 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 499 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 470 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 556409 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :{0=1, 1=1, 3=1, 6=1}
Probabilistic random walk after 556409 steps, saw 238282 distinct states, run finished after 3002 ms. (steps per millisecond=185 ) properties seen :4
Running SMT prover for 3 properties.
[2023-03-20 12:56:15] [INFO ] Invariant cache hit.
[2023-03-20 12:56:15] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-20 12:56:15] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:56:15] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-20 12:56:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:56:15] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:56:15] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-20 12:56:15] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-20 12:56:15] [INFO ] After 33ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-20 12:56:15] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-20 12:56:15] [INFO ] After 186ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 71 ms.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 117/117 transitions.
Graph (complete) has 266 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 90 transition count 115
Applied a total of 3 rules in 5 ms. Remains 90 /91 variables (removed 1) and now considering 115/117 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 90/91 places, 115/117 transitions.
Incomplete random walk after 10000 steps, including 2253 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 499 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 717336 steps, run timeout after 3001 ms. (steps per millisecond=239 ) properties seen :{}
Probabilistic random walk after 717336 steps, saw 308923 distinct states, run finished after 3002 ms. (steps per millisecond=238 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 115 rows 90 cols
[2023-03-20 12:56:19] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 12:56:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:56:19] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-20 12:56:19] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 12:56:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:56:19] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:56:19] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 12:56:19] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-20 12:56:19] [INFO ] After 29ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 12:56:19] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-20 12:56:19] [INFO ] After 186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 47 ms.
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 115/115 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 90/90 places, 115/115 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 115/115 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2023-03-20 12:56:19] [INFO ] Invariant cache hit.
[2023-03-20 12:56:19] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-20 12:56:19] [INFO ] Invariant cache hit.
[2023-03-20 12:56:19] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-20 12:56:19] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-20 12:56:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:56:19] [INFO ] Invariant cache hit.
[2023-03-20 12:56:19] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 291 ms. Remains : 90/90 places, 115/115 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 90 transition count 109
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 85 transition count 109
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 85 transition count 96
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 72 transition count 96
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 55 place count 63 transition count 87
Applied a total of 55 rules in 6 ms. Remains 63 /90 variables (removed 27) and now considering 87/115 (removed 28) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 87 rows 63 cols
[2023-03-20 12:56:19] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 12:56:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:56:19] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:56:19] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 12:56:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 12:56:19] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 12:56:20] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 12:56:20] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-20 12:56:20] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (OR (NOT p0) p1)), (F (AND p0 p1))]
Knowledge based reduction with 12 factoid took 827 ms. Reduced automaton from 4 states, 13 edges and 2 AP (stutter insensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-20 12:56:21] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:56:21] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-20 12:56:21] [INFO ] Invariant cache hit.
[2023-03-20 12:56:21] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-20 12:56:21] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2023-03-20 12:56:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:56:21] [INFO ] Invariant cache hit.
[2023-03-20 12:56:21] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 426 ms. Remains : 91/91 places, 117/117 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 552 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter insensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Incomplete random walk after 10000 steps, including 2231 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 472 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 449 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 479 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 434 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 2197209 steps, run timeout after 3001 ms. (steps per millisecond=732 ) properties seen :{0=1, 1=1, 2=1, 4=1}
Probabilistic random walk after 2197209 steps, saw 909304 distinct states, run finished after 3001 ms. (steps per millisecond=732 ) properties seen :4
Running SMT prover for 1 properties.
[2023-03-20 12:56:26] [INFO ] Invariant cache hit.
[2023-03-20 12:56:26] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 12:56:26] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 12:56:26] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:56:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 12:56:26] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-20 12:56:26] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 12:56:26] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-20 12:56:26] [INFO ] After 33ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 12:56:26] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-20 12:56:26] [INFO ] After 193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 117/117 transitions.
Graph (complete) has 266 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 90 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 89 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 89 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 88 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 88 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 88 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 87 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 87 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 86 transition count 101
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 86 transition count 101
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 85 transition count 100
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 85 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 84 transition count 99
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 84 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 19 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 20 place count 83 transition count 96
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 83 transition count 96
Applied a total of 21 rules in 18 ms. Remains 83 /91 variables (removed 8) and now considering 96/117 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 83/91 places, 96/117 transitions.
Incomplete random walk after 10000 steps, including 2287 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 500 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2311780 steps, run timeout after 3001 ms. (steps per millisecond=770 ) properties seen :{}
Probabilistic random walk after 2311780 steps, saw 970529 distinct states, run finished after 3002 ms. (steps per millisecond=770 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 96 rows 83 cols
[2023-03-20 12:56:29] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-20 12:56:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 12:56:29] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 12:56:29] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:56:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:56:29] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:56:29] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 12:56:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-20 12:56:29] [INFO ] After 18ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 12:56:29] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-20 12:56:29] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 83/83 places, 96/96 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2023-03-20 12:56:29] [INFO ] Invariant cache hit.
[2023-03-20 12:56:29] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-20 12:56:29] [INFO ] Invariant cache hit.
[2023-03-20 12:56:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-20 12:56:30] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2023-03-20 12:56:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:56:30] [INFO ] Invariant cache hit.
[2023-03-20 12:56:30] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 314 ms. Remains : 83/83 places, 96/96 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 83 transition count 90
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 78 transition count 90
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 78 transition count 77
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 65 transition count 77
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 51 place count 58 transition count 70
Applied a total of 51 rules in 6 ms. Remains 58 /83 variables (removed 25) and now considering 70/96 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 58 cols
[2023-03-20 12:56:30] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 12:56:30] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-20 12:56:30] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 12:56:30] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:56:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 12:56:30] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 12:56:30] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 12:56:30] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-20 12:56:30] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (OR (NOT p0) p1)), (F (AND p0 p1)), (F p1)]
Knowledge based reduction with 9 factoid took 565 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter insensitive) to 4 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Product exploration explored 100000 steps with 22550 reset in 185 ms.
Product exploration explored 100000 steps with 22360 reset in 160 ms.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-20 12:56:31] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 12:56:31] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-20 12:56:31] [INFO ] Invariant cache hit.
[2023-03-20 12:56:31] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-20 12:56:32] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2023-03-20 12:56:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:56:32] [INFO ] Invariant cache hit.
[2023-03-20 12:56:32] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 320 ms. Remains : 91/91 places, 117/117 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-14 finished in 21705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 130 transition count 174
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 130 transition count 174
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 130 transition count 172
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 50 place count 116 transition count 158
Iterating global reduction 1 with 14 rules applied. Total rules applied 64 place count 116 transition count 158
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 74 place count 116 transition count 148
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 83 place count 107 transition count 138
Iterating global reduction 2 with 9 rules applied. Total rules applied 92 place count 107 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 95 place count 107 transition count 135
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 102 transition count 129
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 102 transition count 129
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 109 place count 98 transition count 125
Iterating global reduction 3 with 4 rules applied. Total rules applied 113 place count 98 transition count 125
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 116 place count 95 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 119 place count 95 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 122 place count 95 transition count 118
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 125 place count 92 transition count 115
Iterating global reduction 4 with 3 rules applied. Total rules applied 128 place count 92 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 130 place count 90 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 132 place count 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 133 place count 89 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 134 place count 89 transition count 111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 135 place count 88 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 88 transition count 110
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 137 place count 87 transition count 109
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 87 transition count 109
Applied a total of 138 rules in 18 ms. Remains 87 /147 variables (removed 60) and now considering 109/282 (removed 173) transitions.
// Phase 1: matrix 109 rows 87 cols
[2023-03-20 12:56:32] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 12:56:32] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-20 12:56:32] [INFO ] Invariant cache hit.
[2023-03-20 12:56:32] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-20 12:56:32] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-20 12:56:32] [INFO ] Invariant cache hit.
[2023-03-20 12:56:32] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/147 places, 109/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 313 ms. Remains : 87/147 places, 109/282 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s82 1)), p0:(AND (GEQ s1 1) (GEQ s80 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 3 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-15 finished in 436 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)))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-00
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Support contains 5 out of 147 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 131 transition count 175
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 131 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 131 transition count 173
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 118 transition count 160
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 118 transition count 160
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 67 place count 118 transition count 153
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 76 place count 109 transition count 143
Iterating global reduction 2 with 9 rules applied. Total rules applied 85 place count 109 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 87 place count 109 transition count 141
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 91 place count 105 transition count 136
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 place count 105 transition count 136
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 102 transition count 133
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 102 transition count 133
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 100 transition count 130
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 100 transition count 130
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 98 transition count 128
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 98 transition count 128
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 96 transition count 126
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 96 transition count 126
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 95 transition count 124
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 95 transition count 124
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 94 transition count 123
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 94 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 93 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 93 transition count 122
Applied a total of 119 rules in 25 ms. Remains 93 /147 variables (removed 54) and now considering 122/282 (removed 160) transitions.
// Phase 1: matrix 122 rows 93 cols
[2023-03-20 12:56:32] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:56:32] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-20 12:56:32] [INFO ] Invariant cache hit.
[2023-03-20 12:56:32] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-20 12:56:32] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-20 12:56:32] [INFO ] Invariant cache hit.
[2023-03-20 12:56:33] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 93/147 places, 122/282 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 321 ms. Remains : 93/147 places, 122/282 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-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:(AND (OR (LT s17 1) (LT s28 1)) (OR (LT s1 1) (LT s88 1)) (OR (LT s1 1) (LT s87 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][false, false, false]]
Product exploration explored 100000 steps with 22262 reset in 146 ms.
Product exploration explored 100000 steps with 22322 reset in 178 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 309 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 13 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2260 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 978 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3733 steps, run visited all 1 properties in 10 ms. (steps per millisecond=373 )
Probabilistic random walk after 3733 steps, saw 1655 distinct states, run finished after 10 ms. (steps per millisecond=373 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 122/122 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2023-03-20 12:56:34] [INFO ] Invariant cache hit.
[2023-03-20 12:56:34] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-20 12:56:34] [INFO ] Invariant cache hit.
[2023-03-20 12:56:34] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-20 12:56:34] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2023-03-20 12:56:34] [INFO ] Invariant cache hit.
[2023-03-20 12:56:34] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 293 ms. Remains : 93/93 places, 122/122 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 309 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 13 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 217 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2241 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 1049 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3733 steps, run visited all 1 properties in 9 ms. (steps per millisecond=414 )
Probabilistic random walk after 3733 steps, saw 1655 distinct states, run finished after 9 ms. (steps per millisecond=414 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22468 reset in 160 ms.
Product exploration explored 100000 steps with 22518 reset in 151 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 122/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2023-03-20 12:56:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:56:35] [INFO ] Invariant cache hit.
[2023-03-20 12:56:35] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 93/93 places, 122/122 transitions.
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 122/122 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2023-03-20 12:56:35] [INFO ] Invariant cache hit.
[2023-03-20 12:56:35] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-20 12:56:35] [INFO ] Invariant cache hit.
[2023-03-20 12:56:35] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-20 12:56:35] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2023-03-20 12:56:35] [INFO ] Invariant cache hit.
[2023-03-20 12:56:36] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 317 ms. Remains : 93/93 places, 122/122 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-00 finished in 3528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(X(F(!p2))&&(!p0 U (p1||G(!p0)))))))'
Found a Shortening insensitive property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-04
Stuttering acceptance computed with spot in 157 ms :[(AND p0 (NOT p1)), true, (AND p2 p0 (NOT p1)), (AND p0 (NOT p1)), p2]
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 131 transition count 184
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 131 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 131 transition count 182
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 118 transition count 169
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 118 transition count 169
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 70 place count 118 transition count 159
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 78 place count 110 transition count 150
Iterating global reduction 2 with 8 rules applied. Total rules applied 86 place count 110 transition count 150
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 110 transition count 149
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 107 transition count 145
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 107 transition count 145
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 95 place count 105 transition count 143
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 105 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 99 place count 103 transition count 140
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 103 transition count 140
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 101 transition count 138
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 101 transition count 138
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 99 transition count 136
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 99 transition count 136
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 98 transition count 134
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 98 transition count 134
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 97 transition count 133
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 97 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 96 transition count 132
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 96 transition count 132
Applied a total of 115 rules in 39 ms. Remains 96 /147 variables (removed 51) and now considering 132/282 (removed 150) transitions.
// Phase 1: matrix 132 rows 96 cols
[2023-03-20 12:56:36] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:56:36] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-20 12:56:36] [INFO ] Invariant cache hit.
[2023-03-20 12:56:36] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-20 12:56:36] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2023-03-20 12:56:36] [INFO ] Invariant cache hit.
[2023-03-20 12:56:36] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 96/147 places, 132/282 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 461 ms. Remains : 96/147 places, 132/282 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s89 1)), p1:(AND (NOT (AND (GEQ s1 1) (GEQ s89 1))) (GEQ s1 1) (GEQ s91 1)), p2:(AND (GEQ s1 1) (GEQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 30897 reset in 165 ms.
Product exploration explored 100000 steps with 30875 reset in 167 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 324 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 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p2))), true, (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 438 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2229 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 461 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 482 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1166241 steps, run visited all 2 properties in 1715 ms. (steps per millisecond=680 )
Probabilistic random walk after 1166241 steps, saw 493958 distinct states, run finished after 1716 ms. (steps per millisecond=679 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p2))), true, (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 469 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 96 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 132/132 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2023-03-20 12:56:40] [INFO ] Invariant cache hit.
[2023-03-20 12:56:40] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-20 12:56:40] [INFO ] Invariant cache hit.
[2023-03-20 12:56:40] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-20 12:56:40] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2023-03-20 12:56:40] [INFO ] Invariant cache hit.
[2023-03-20 12:56:40] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 379 ms. Remains : 96/96 places, 132/132 transitions.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 324 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 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 292 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2277 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 490 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1166241 steps, run visited all 2 properties in 1453 ms. (steps per millisecond=802 )
Probabilistic random walk after 1166241 steps, saw 493958 distinct states, run finished after 1455 ms. (steps per millisecond=801 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 308 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 22360 reset in 136 ms.
Product exploration explored 100000 steps with 22336 reset in 144 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 117 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 132/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 95 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 95 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 94 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 94 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 93 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 93 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 92 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 91 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 91 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 90 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 90 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 89 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 89 transition count 112
Applied a total of 19 rules in 20 ms. Remains 89 /96 variables (removed 7) and now considering 112/132 (removed 20) transitions.
[2023-03-20 12:56:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 112 rows 89 cols
[2023-03-20 12:56:43] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:56:43] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/96 places, 112/132 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 89/96 places, 112/132 transitions.
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 132/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 95 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 95 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 94 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 94 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 93 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 93 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 92 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 91 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 91 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 90 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 90 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 89 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 89 transition count 112
Applied a total of 19 rules in 8 ms. Remains 89 /96 variables (removed 7) and now considering 112/132 (removed 20) transitions.
[2023-03-20 12:56:43] [INFO ] Invariant cache hit.
[2023-03-20 12:56:43] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-20 12:56:43] [INFO ] Invariant cache hit.
[2023-03-20 12:56:43] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-20 12:56:43] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2023-03-20 12:56:43] [INFO ] Invariant cache hit.
[2023-03-20 12:56:43] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/96 places, 112/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 322 ms. Remains : 89/96 places, 112/132 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 finished in 7835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(!p0))||(F(!p0)&&G(F(!p1)))))))'
Found a Shortening insensitive property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-06
Stuttering acceptance computed with spot in 241 ms :[p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 129 transition count 164
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 129 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 129 transition count 162
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 53 place count 114 transition count 147
Iterating global reduction 1 with 15 rules applied. Total rules applied 68 place count 114 transition count 147
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 78 place count 114 transition count 137
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 104 transition count 126
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 104 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 104 transition count 123
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 106 place count 99 transition count 117
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 99 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 95 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 95 transition count 113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 121 place count 93 transition count 111
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 93 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 125 place count 93 transition count 109
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 127 place count 91 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 91 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 90 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 132 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 87 transition count 102
Applied a total of 137 rules in 23 ms. Remains 87 /147 variables (removed 60) and now considering 102/282 (removed 180) transitions.
// Phase 1: matrix 102 rows 87 cols
[2023-03-20 12:56:44] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:56:44] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-20 12:56:44] [INFO ] Invariant cache hit.
[2023-03-20 12:56:44] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 12:56:44] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2023-03-20 12:56:44] [INFO ] Invariant cache hit.
[2023-03-20 12:56:44] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 87/147 places, 102/282 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 486 ms. Remains : 87/147 places, 102/282 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s82 1)), p1:(AND (GEQ s1 1) (GEQ s61 1) (GEQ s1 1) (GEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22444 reset in 121 ms.
Product exploration explored 100000 steps with 22400 reset in 116 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2287 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 518 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2487 steps, run visited all 1 properties in 7 ms. (steps per millisecond=355 )
Probabilistic random walk after 2487 steps, saw 1190 distinct states, run finished after 7 ms. (steps per millisecond=355 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 p0))]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 165 ms :[(AND p1 p0), (AND p1 p0)]
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-20 12:56:45] [INFO ] Invariant cache hit.
[2023-03-20 12:56:45] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-20 12:56:45] [INFO ] Invariant cache hit.
[2023-03-20 12:56:45] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 12:56:46] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2023-03-20 12:56:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 12:56:46] [INFO ] Invariant cache hit.
[2023-03-20 12:56:46] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 358 ms. Remains : 87/87 places, 102/102 transitions.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2227 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 472 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2487 steps, run visited all 1 properties in 8 ms. (steps per millisecond=310 )
Probabilistic random walk after 2487 steps, saw 1190 distinct states, run finished after 8 ms. (steps per millisecond=310 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 61 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 59 ms :[(AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 22472 reset in 99 ms.
Product exploration explored 100000 steps with 22343 reset in 124 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-20 12:56:46] [INFO ] Invariant cache hit.
[2023-03-20 12:56:46] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-20 12:56:46] [INFO ] Invariant cache hit.
[2023-03-20 12:56:46] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 12:56:47] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-20 12:56:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:56:47] [INFO ] Invariant cache hit.
[2023-03-20 12:56:47] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 307 ms. Remains : 87/87 places, 102/102 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 finished in 3252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||(!p0&&F((!p1&&X(X(G(!p0))))))))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-07
Stuttering acceptance computed with spot in 205 ms :[p0, true, p0, p0, (OR p1 p0), p0]
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 129 transition count 164
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 129 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 129 transition count 162
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 53 place count 114 transition count 147
Iterating global reduction 1 with 15 rules applied. Total rules applied 68 place count 114 transition count 147
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 78 place count 114 transition count 137
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 104 transition count 126
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 104 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 104 transition count 123
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 106 place count 99 transition count 117
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 99 transition count 117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 95 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 95 transition count 113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 121 place count 93 transition count 111
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 93 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 125 place count 93 transition count 109
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 127 place count 91 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 91 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 90 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 132 place count 89 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 88 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 87 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 87 transition count 102
Applied a total of 137 rules in 27 ms. Remains 87 /147 variables (removed 60) and now considering 102/282 (removed 180) transitions.
// Phase 1: matrix 102 rows 87 cols
[2023-03-20 12:56:47] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:56:47] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-20 12:56:47] [INFO ] Invariant cache hit.
[2023-03-20 12:56:47] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 12:56:47] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2023-03-20 12:56:47] [INFO ] Invariant cache hit.
[2023-03-20 12:56:47] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 87/147 places, 102/282 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 520 ms. Remains : 87/147 places, 102/282 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=p1, acceptance={0} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 2}, { cond=p1, acceptance={0} source=5 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s61 1)), p1:(AND (GEQ s1 1) (GEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22345 reset in 149 ms.
Product exploration explored 100000 steps with 22461 reset in 173 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 468 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[p0, p0, p0, (OR p1 p0), p0]
Incomplete random walk after 10000 steps, including 2239 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 482 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 12:56:49] [INFO ] Invariant cache hit.
[2023-03-20 12:56:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:56:49] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:56:49] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 12:56:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:56:49] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:56:49] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 12:56:49] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 12:56:49] [INFO ] After 64ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 12:56:49] [INFO ] After 166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-20 12:56:49] [INFO ] After 339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 102/102 transitions.
Graph (complete) has 245 edges and 87 vertex of which 86 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 86 transition count 100
Applied a total of 3 rules in 5 ms. Remains 86 /87 variables (removed 1) and now considering 100/102 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 86/87 places, 100/102 transitions.
Incomplete random walk after 10000 steps, including 2279 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 479 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 476 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Finished probabilistic random walk after 2813 steps, run visited all 3 properties in 10 ms. (steps per millisecond=281 )
Probabilistic random walk after 2813 steps, saw 1424 distinct states, run finished after 10 ms. (steps per millisecond=281 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 11 factoid took 486 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[p0, p0, p0, (OR p1 p0), p0]
Stuttering acceptance computed with spot in 162 ms :[p0, p0, p0, (OR p1 p0), p0]
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 0 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-20 12:56:50] [INFO ] Invariant cache hit.
[2023-03-20 12:56:51] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-20 12:56:51] [INFO ] Invariant cache hit.
[2023-03-20 12:56:51] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 12:56:51] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2023-03-20 12:56:51] [INFO ] Invariant cache hit.
[2023-03-20 12:56:51] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 322 ms. Remains : 87/87 places, 102/102 transitions.
Computed a total of 16 stabilizing places and 21 stable transitions
Graph (complete) has 278 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 341 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[p0, p0, p0, (OR p1 p0), p0]
Incomplete random walk after 10000 steps, including 2183 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 449 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 495 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 486 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 439 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 461 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Finished probabilistic random walk after 2813 steps, run visited all 5 properties in 7 ms. (steps per millisecond=401 )
Probabilistic random walk after 2813 steps, saw 1424 distinct states, run finished after 7 ms. (steps per millisecond=401 ) properties seen :5
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F p1), (F (AND p0 p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 454 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[p0, p0, p0, (OR p1 p0), p0]
Stuttering acceptance computed with spot in 164 ms :[p0, p0, p0, (OR p1 p0), p0]
Stuttering acceptance computed with spot in 148 ms :[p0, p0, p0, (OR p1 p0), p0]
Product exploration explored 100000 steps with 22372 reset in 130 ms.
Product exploration explored 100000 steps with 22205 reset in 128 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-20 12:56:53] [INFO ] Invariant cache hit.
[2023-03-20 12:56:53] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-20 12:56:53] [INFO ] Invariant cache hit.
[2023-03-20 12:56:53] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 12:56:53] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2023-03-20 12:56:53] [INFO ] Invariant cache hit.
[2023-03-20 12:56:53] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 357 ms. Remains : 87/87 places, 102/102 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-07 finished in 6647 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)))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-09
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 147/147 places, 282/282 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 129 transition count 155
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 129 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 129 transition count 153
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 54 place count 113 transition count 137
Iterating global reduction 1 with 16 rules applied. Total rules applied 70 place count 113 transition count 137
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 79 place count 113 transition count 128
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 89 place count 103 transition count 117
Iterating global reduction 2 with 10 rules applied. Total rules applied 99 place count 103 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 102 place count 103 transition count 114
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 99 transition count 109
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 99 transition count 109
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 113 place count 96 transition count 106
Iterating global reduction 3 with 3 rules applied. Total rules applied 116 place count 96 transition count 106
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 93 transition count 102
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 93 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 93 transition count 101
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 126 place count 90 transition count 98
Iterating global reduction 4 with 3 rules applied. Total rules applied 129 place count 90 transition count 98
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 131 place count 88 transition count 96
Iterating global reduction 4 with 2 rules applied. Total rules applied 133 place count 88 transition count 96
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 87 transition count 94
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 87 transition count 94
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 86 transition count 93
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 86 transition count 93
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 85 transition count 92
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 85 transition count 92
Applied a total of 139 rules in 17 ms. Remains 85 /147 variables (removed 62) and now considering 92/282 (removed 190) transitions.
// Phase 1: matrix 92 rows 85 cols
[2023-03-20 12:56:54] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:56:54] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-20 12:56:54] [INFO ] Invariant cache hit.
[2023-03-20 12:56:54] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-20 12:56:54] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2023-03-20 12:56:54] [INFO ] Invariant cache hit.
[2023-03-20 12:56:54] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 85/147 places, 92/282 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 426 ms. Remains : 85/147 places, 92/282 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-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: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s20 1) (LT s58 1) (AND (GEQ s1 1) (GEQ s71 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][false, false, false]]
Product exploration explored 100000 steps with 22394 reset in 144 ms.
Product exploration explored 100000 steps with 22491 reset in 139 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 266 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 198 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2269 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1049 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3854 steps, run visited all 1 properties in 10 ms. (steps per millisecond=385 )
Probabilistic random walk after 3854 steps, saw 1736 distinct states, run finished after 11 ms. (steps per millisecond=350 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 206 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-20 12:56:55] [INFO ] Invariant cache hit.
[2023-03-20 12:56:55] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-20 12:56:55] [INFO ] Invariant cache hit.
[2023-03-20 12:56:55] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-20 12:56:55] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2023-03-20 12:56:55] [INFO ] Invariant cache hit.
[2023-03-20 12:56:55] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 260 ms. Remains : 85/85 places, 92/92 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 266 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2244 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1042 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3854 steps, run visited all 1 properties in 9 ms. (steps per millisecond=428 )
Probabilistic random walk after 3854 steps, saw 1736 distinct states, run finished after 9 ms. (steps per millisecond=428 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22546 reset in 88 ms.
Product exploration explored 100000 steps with 22334 reset in 104 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-20 12:56:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:56:56] [INFO ] Invariant cache hit.
[2023-03-20 12:56:56] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 85/85 places, 92/92 transitions.
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-20 12:56:56] [INFO ] Invariant cache hit.
[2023-03-20 12:56:56] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-20 12:56:56] [INFO ] Invariant cache hit.
[2023-03-20 12:56:56] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-20 12:56:57] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2023-03-20 12:56:57] [INFO ] Invariant cache hit.
[2023-03-20 12:56:57] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 320 ms. Remains : 85/85 places, 92/92 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-09 finished in 3294 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(!p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&F(!p1)) U (G((p0&&F(!p1)))||(p0&&G(!p1)))))))'
[2023-03-20 12:56:57] [INFO ] Flatten gal took : 19 ms
[2023-03-20 12:56:57] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLFireability.sr.xml took 19 ms.
[2023-03-20 12:56:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 147 places, 282 transitions and 1113 arcs took 6 ms.
Total runtime 96321 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3565/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3565/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3565/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3565/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3565/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3565/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3565/ltl_6_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m64-LTLFireability-00
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m64-LTLFireability-04
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m64-LTLFireability-06
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m64-LTLFireability-07
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m64-LTLFireability-09
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m64-LTLFireability-12
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m64-LTLFireability-14

BK_STOP 1679317018867

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

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name SieveSingleMsgMbox-PT-d1m64-LTLFireability-12
ltl formula formula --ltl=/tmp/3565/ltl_5_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 147 places, 282 transitions and 1113 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3565/ltl_5_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.000 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3565/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3565/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3565/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name SieveSingleMsgMbox-PT-d1m64-LTLFireability-14
ltl formula formula --ltl=/tmp/3565/ltl_6_
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 147 places, 282 transitions and 1113 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3565/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3565/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3565/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3565/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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="SieveSingleMsgMbox-PT-d1m64"
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 SieveSingleMsgMbox-PT-d1m64, 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 r425-tajo-167905978200436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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