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-167905978200476.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-d2m36, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978200476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 10:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 10:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 10:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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 17K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 10:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 10:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 10:28 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 1.1M 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-d2m36-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679318712011

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-d2m36
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 13:25:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 13:25:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 13:25:13] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2023-03-20 13:25:13] [INFO ] Transformed 2398 places.
[2023-03-20 13:25:13] [INFO ] Transformed 1954 transitions.
[2023-03-20 13:25:13] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 223 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 3 formulas.
Deduced a syphon composed of 1984 places in 15 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 99 places :
Symmetric choice reduction at 1 with 99 rule applications. Total rules 952 place count 290 transition count 660
Iterating global reduction 1 with 99 rules applied. Total rules applied 1051 place count 290 transition count 660
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1060 place count 290 transition count 651
Discarding 75 places :
Symmetric choice reduction at 2 with 75 rule applications. Total rules 1135 place count 215 transition count 576
Iterating global reduction 2 with 75 rules applied. Total rules applied 1210 place count 215 transition count 576
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 1246 place count 215 transition count 540
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1272 place count 189 transition count 510
Iterating global reduction 3 with 26 rules applied. Total rules applied 1298 place count 189 transition count 510
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 3 with 78 rules applied. Total rules applied 1376 place count 189 transition count 432
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1383 place count 182 transition count 420
Iterating global reduction 4 with 7 rules applied. Total rules applied 1390 place count 182 transition count 420
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1396 place count 176 transition count 414
Iterating global reduction 4 with 6 rules applied. Total rules applied 1402 place count 176 transition count 414
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1405 place count 173 transition count 410
Iterating global reduction 4 with 3 rules applied. Total rules applied 1408 place count 173 transition count 410
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1410 place count 171 transition count 408
Iterating global reduction 4 with 2 rules applied. Total rules applied 1412 place count 171 transition count 408
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1413 place count 170 transition count 407
Iterating global reduction 4 with 1 rules applied. Total rules applied 1414 place count 170 transition count 407
Applied a total of 1414 rules in 91 ms. Remains 170 /414 variables (removed 244) and now considering 407/1954 (removed 1547) transitions.
// Phase 1: matrix 407 rows 170 cols
[2023-03-20 13:25:14] [INFO ] Computed 5 place invariants in 18 ms
[2023-03-20 13:25:14] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-20 13:25:14] [INFO ] Invariant cache hit.
[2023-03-20 13:25:14] [INFO ] State equation strengthened by 277 read => feed constraints.
[2023-03-20 13:25:14] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
[2023-03-20 13:25:14] [INFO ] Invariant cache hit.
[2023-03-20 13:25:15] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 170/414 places, 407/1954 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1177 ms. Remains : 170/414 places, 407/1954 transitions.
Support contains 26 out of 170 places after structural reductions.
[2023-03-20 13:25:15] [INFO ] Flatten gal took : 66 ms
[2023-03-20 13:25:15] [INFO ] Flatten gal took : 32 ms
[2023-03-20 13:25:15] [INFO ] Input system was already deterministic with 407 transitions.
Support contains 25 out of 170 places (down from 26) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2226 resets, run finished after 583 ms. (steps per millisecond=17 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 115 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 122 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 23) seen :0
Interrupted probabilistic random walk after 203410 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{1=1, 4=1, 6=1, 8=1, 9=1, 11=1, 12=1, 13=1, 19=1, 22=1}
Probabilistic random walk after 203410 steps, saw 94559 distinct states, run finished after 3004 ms. (steps per millisecond=67 ) properties seen :10
Running SMT prover for 13 properties.
[2023-03-20 13:25:19] [INFO ] Invariant cache hit.
[2023-03-20 13:25:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:25:19] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 13:25:20] [INFO ] After 388ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-20 13:25:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:25:20] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 13:25:20] [INFO ] After 492ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-20 13:25:20] [INFO ] State equation strengthened by 277 read => feed constraints.
[2023-03-20 13:25:22] [INFO ] After 1700ms SMT Verify possible using 277 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-20 13:25:24] [INFO ] After 3432ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 1282 ms.
[2023-03-20 13:25:25] [INFO ] After 5367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 0 properties in 691 ms.
Support contains 16 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 407/407 transitions.
Graph (complete) has 672 edges and 170 vertex of which 169 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 169 transition count 405
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 161 transition count 335
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 161 transition count 335
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 154 transition count 328
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 154 transition count 328
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 36 place count 154 transition count 325
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 41 place count 149 transition count 317
Iterating global reduction 2 with 5 rules applied. Total rules applied 46 place count 149 transition count 317
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 49 place count 149 transition count 314
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 148 transition count 313
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 148 transition count 313
Applied a total of 51 rules in 76 ms. Remains 148 /170 variables (removed 22) and now considering 313/407 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 148/170 places, 313/407 transitions.
Incomplete random walk after 10000 steps, including 2232 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 490 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 449 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 466 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 455 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 392 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 474 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 482 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 384728 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{0=1}
Probabilistic random walk after 384728 steps, saw 173463 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :1
Running SMT prover for 12 properties.
// Phase 1: matrix 313 rows 148 cols
[2023-03-20 13:25:30] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-20 13:25:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:25:30] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:25:31] [INFO ] After 1074ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-20 13:25:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:25:31] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 11 ms returned sat
[2023-03-20 13:25:31] [INFO ] After 470ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-20 13:25:31] [INFO ] State equation strengthened by 204 read => feed constraints.
[2023-03-20 13:25:32] [INFO ] After 931ms SMT Verify possible using 204 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-20 13:25:33] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 14 ms to minimize.
[2023-03-20 13:25:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-03-20 13:25:34] [INFO ] After 2090ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 848 ms.
[2023-03-20 13:25:34] [INFO ] After 3590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 247 ms.
Support contains 15 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 313/313 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 147 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 147 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 146 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 146 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 145 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 145 transition count 297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 145 transition count 296
Applied a total of 7 rules in 19 ms. Remains 145 /148 variables (removed 3) and now considering 296/313 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 145/148 places, 296/313 transitions.
Incomplete random walk after 10000 steps, including 2240 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 458 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 491 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 480 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 357 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 456 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 455 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 472 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 314987 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 314987 steps, saw 140929 distinct states, run finished after 3004 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 296 rows 145 cols
[2023-03-20 13:25:39] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-20 13:25:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:25:39] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 13:25:39] [INFO ] After 646ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-20 13:25:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:25:39] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 13:25:40] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-20 13:25:40] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-20 13:25:40] [INFO ] After 777ms SMT Verify possible using 190 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-20 13:25:41] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 4 ms to minimize.
[2023-03-20 13:25:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-03-20 13:25:42] [INFO ] After 2164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 1184 ms.
[2023-03-20 13:25:43] [INFO ] After 3791ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 360 ms.
Support contains 15 out of 145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 296/296 transitions.
Applied a total of 0 rules in 12 ms. Remains 145 /145 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 145/145 places, 296/296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 296/296 transitions.
Applied a total of 0 rules in 11 ms. Remains 145 /145 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-20 13:25:43] [INFO ] Invariant cache hit.
[2023-03-20 13:25:44] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-20 13:25:44] [INFO ] Invariant cache hit.
[2023-03-20 13:25:44] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-20 13:25:44] [INFO ] Implicit Places using invariants and state equation in 873 ms returned []
Implicit Place search using SMT with State Equation took 1082 ms to find 0 implicit places.
[2023-03-20 13:25:44] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-20 13:25:45] [INFO ] Invariant cache hit.
[2023-03-20 13:25:45] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1264 ms. Remains : 145/145 places, 296/296 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 145 transition count 291
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 141 transition count 290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 140 transition count 290
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 11 place count 140 transition count 276
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 39 place count 126 transition count 276
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 67 place count 112 transition count 262
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 111 transition count 272
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 111 transition count 271
Applied a total of 70 rules in 25 ms. Remains 111 /145 variables (removed 34) and now considering 271/296 (removed 25) transitions.
Running SMT prover for 12 properties.
// Phase 1: matrix 271 rows 111 cols
[2023-03-20 13:25:45] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-20 13:25:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:25:45] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:25:45] [INFO ] After 546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-20 13:25:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:25:45] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:25:46] [INFO ] After 405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-20 13:25:46] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2023-03-20 13:25:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-20 13:25:46] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2023-03-20 13:25:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-20 13:25:46] [INFO ] After 918ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 317 ms.
[2023-03-20 13:25:47] [INFO ] After 1354ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 36 stabilizing places and 61 stable transitions
Graph (complete) has 734 edges and 170 vertex of which 169 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 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 149 transition count 203
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 149 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 149 transition count 202
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 130 transition count 183
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 130 transition count 183
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 89 place count 130 transition count 175
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 102 place count 117 transition count 153
Iterating global reduction 2 with 13 rules applied. Total rules applied 115 place count 117 transition count 153
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 124 place count 117 transition count 144
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 128 place count 113 transition count 140
Iterating global reduction 3 with 4 rules applied. Total rules applied 132 place count 113 transition count 140
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 135 place count 110 transition count 137
Iterating global reduction 3 with 3 rules applied. Total rules applied 138 place count 110 transition count 137
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 140 place count 108 transition count 133
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 108 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 144 place count 108 transition count 131
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 146 place count 106 transition count 129
Iterating global reduction 4 with 2 rules applied. Total rules applied 148 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 149 place count 105 transition count 128
Iterating global reduction 4 with 1 rules applied. Total rules applied 150 place count 105 transition count 128
Applied a total of 150 rules in 19 ms. Remains 105 /170 variables (removed 65) and now considering 128/407 (removed 279) transitions.
// Phase 1: matrix 128 rows 105 cols
[2023-03-20 13:25:47] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 13:25:47] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-20 13:25:47] [INFO ] Invariant cache hit.
[2023-03-20 13:25:47] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 13:25:47] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2023-03-20 13:25:47] [INFO ] Invariant cache hit.
[2023-03-20 13:25:47] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/170 places, 128/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 417 ms. Remains : 105/170 places, 128/407 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s100 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 22444 reset in 226 ms.
Product exploration explored 100000 steps with 22523 reset in 172 ms.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 342 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 178 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)]
Incomplete random walk after 10000 steps, including 2199 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 476 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 177282 steps, run visited all 1 properties in 294 ms. (steps per millisecond=603 )
Probabilistic random walk after 177282 steps, saw 88429 distinct states, run finished after 300 ms. (steps per millisecond=590 ) 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 157 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)]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-20 13:25:49] [INFO ] Invariant cache hit.
[2023-03-20 13:25:49] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-20 13:25:49] [INFO ] Invariant cache hit.
[2023-03-20 13:25:49] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 13:25:49] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2023-03-20 13:25:49] [INFO ] Invariant cache hit.
[2023-03-20 13:25:49] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 389 ms. Remains : 105/105 places, 128/128 transitions.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 342 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 142 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 77 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2285 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 177282 steps, run visited all 1 properties in 279 ms. (steps per millisecond=635 )
Probabilistic random walk after 177282 steps, saw 88429 distinct states, run finished after 280 ms. (steps per millisecond=633 ) 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 188 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)]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22637 reset in 110 ms.
Product exploration explored 100000 steps with 22388 reset in 124 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 128/128 transitions.
Applied a total of 0 rules in 6 ms. Remains 105 /105 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-20 13:25:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 13:25:51] [INFO ] Invariant cache hit.
[2023-03-20 13:25:51] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72 ms. Remains : 105/105 places, 128/128 transitions.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-20 13:25:51] [INFO ] Invariant cache hit.
[2023-03-20 13:25:51] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-20 13:25:51] [INFO ] Invariant cache hit.
[2023-03-20 13:25:51] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 13:25:51] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2023-03-20 13:25:51] [INFO ] Invariant cache hit.
[2023-03-20 13:25:51] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 314 ms. Remains : 105/105 places, 128/128 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-00 finished in 4365 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((F(p1)&&p0))))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 150 transition count 216
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 150 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 150 transition count 215
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 59 place count 132 transition count 197
Iterating global reduction 1 with 18 rules applied. Total rules applied 77 place count 132 transition count 197
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 84 place count 132 transition count 190
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 96 place count 120 transition count 170
Iterating global reduction 2 with 12 rules applied. Total rules applied 108 place count 120 transition count 170
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 116 place count 120 transition count 162
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 117 transition count 159
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 117 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 124 place count 115 transition count 157
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 115 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 114 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 114 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 113 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 113 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 131 place count 112 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 132 place count 112 transition count 152
Applied a total of 132 rules in 25 ms. Remains 112 /170 variables (removed 58) and now considering 152/407 (removed 255) transitions.
// Phase 1: matrix 152 rows 112 cols
[2023-03-20 13:25:51] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 13:25:51] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-20 13:25:51] [INFO ] Invariant cache hit.
[2023-03-20 13:25:51] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-20 13:25:52] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2023-03-20 13:25:52] [INFO ] Invariant cache hit.
[2023-03-20 13:25:52] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/170 places, 152/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 530 ms. Remains : 112/170 places, 152/407 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s107 1)), p1:(OR (LT s1 1) (LT s106 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-01 finished in 698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 149 transition count 203
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 149 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 149 transition count 202
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 130 transition count 183
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 130 transition count 183
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 130 transition count 176
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 101 place count 117 transition count 154
Iterating global reduction 2 with 13 rules applied. Total rules applied 114 place count 117 transition count 154
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 123 place count 117 transition count 145
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 113 transition count 141
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 113 transition count 141
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 134 place count 110 transition count 138
Iterating global reduction 3 with 3 rules applied. Total rules applied 137 place count 110 transition count 138
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 108 transition count 134
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 108 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 143 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 145 place count 106 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 148 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 105 transition count 129
Applied a total of 149 rules in 58 ms. Remains 105 /170 variables (removed 65) and now considering 129/407 (removed 278) transitions.
// Phase 1: matrix 129 rows 105 cols
[2023-03-20 13:25:52] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 13:25:52] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-20 13:25:52] [INFO ] Invariant cache hit.
[2023-03-20 13:25:52] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 13:25:52] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2023-03-20 13:25:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 13:25:52] [INFO ] Invariant cache hit.
[2023-03-20 13:25:52] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/170 places, 129/407 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 531 ms. Remains : 105/170 places, 129/407 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22425 reset in 142 ms.
Product exploration explored 100000 steps with 22550 reset in 152 ms.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 343 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 151 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 55 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2205 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 496 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1275048 steps, run visited all 1 properties in 1904 ms. (steps per millisecond=669 )
Probabilistic random walk after 1275048 steps, saw 537553 distinct states, run finished after 1905 ms. (steps per millisecond=669 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-20 13:25:55] [INFO ] Invariant cache hit.
[2023-03-20 13:25:55] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-20 13:25:55] [INFO ] Invariant cache hit.
[2023-03-20 13:25:55] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 13:25:55] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2023-03-20 13:25:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 13:25:55] [INFO ] Invariant cache hit.
[2023-03-20 13:25:55] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 385 ms. Remains : 105/105 places, 129/129 transitions.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 343 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2238 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1275048 steps, run visited all 1 properties in 1947 ms. (steps per millisecond=654 )
Probabilistic random walk after 1275048 steps, saw 537553 distinct states, run finished after 1950 ms. (steps per millisecond=653 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22404 reset in 157 ms.
Product exploration explored 100000 steps with 22461 reset in 215 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-20 13:25:58] [INFO ] Invariant cache hit.
[2023-03-20 13:25:58] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-20 13:25:58] [INFO ] Invariant cache hit.
[2023-03-20 13:25:58] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 13:25:59] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2023-03-20 13:25:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 13:25:59] [INFO ] Invariant cache hit.
[2023-03-20 13:25:59] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 522 ms. Remains : 105/105 places, 129/129 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-02 finished in 6890 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(G(p1))||p0))&&F(p2))))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 150 transition count 205
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 150 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 150 transition count 204
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 60 place count 131 transition count 185
Iterating global reduction 1 with 19 rules applied. Total rules applied 79 place count 131 transition count 185
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 86 place count 131 transition count 178
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 99 place count 118 transition count 156
Iterating global reduction 2 with 13 rules applied. Total rules applied 112 place count 118 transition count 156
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 120 place count 118 transition count 148
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 123 place count 115 transition count 145
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 115 transition count 145
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 128 place count 113 transition count 143
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 113 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 132 place count 111 transition count 139
Iterating global reduction 3 with 2 rules applied. Total rules applied 134 place count 111 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 136 place count 111 transition count 137
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 138 place count 109 transition count 135
Iterating global reduction 4 with 2 rules applied. Total rules applied 140 place count 109 transition count 135
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 141 place count 108 transition count 134
Iterating global reduction 4 with 1 rules applied. Total rules applied 142 place count 108 transition count 134
Applied a total of 142 rules in 16 ms. Remains 108 /170 variables (removed 62) and now considering 134/407 (removed 273) transitions.
// Phase 1: matrix 134 rows 108 cols
[2023-03-20 13:25:59] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 13:25:59] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-20 13:25:59] [INFO ] Invariant cache hit.
[2023-03-20 13:25:59] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-20 13:25:59] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2023-03-20 13:25:59] [INFO ] Invariant cache hit.
[2023-03-20 13:25:59] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/170 places, 134/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 361 ms. Remains : 108/170 places, 134/407 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=0 dest: 2}, { cond=(NOT p1), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p2:(OR (LT s1 1) (LT s103 1)), p1:(AND (GEQ s1 1) (GEQ s96 1)), p0:(OR (LT s1 1) (LT s103 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22461 reset in 255 ms.
Product exploration explored 100000 steps with 22310 reset in 174 ms.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 354 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 684 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2236 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 448 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1939828 steps, run timeout after 3001 ms. (steps per millisecond=646 ) properties seen :{0=1}
Probabilistic random walk after 1939828 steps, saw 808112 distinct states, run finished after 3001 ms. (steps per millisecond=646 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-20 13:26:04] [INFO ] Invariant cache hit.
[2023-03-20 13:26:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:26:04] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 13:26:04] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:26:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:26:04] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 13:26:04] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:26:04] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-20 13:26:04] [INFO ] After 21ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 13:26:04] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2023-03-20 13:26:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-20 13:26:04] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-20 13:26:04] [INFO ] After 206ms 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 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 134/134 transitions.
Graph (complete) has 317 edges and 108 vertex of which 107 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 107 transition count 132
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 106 transition count 130
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 106 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 105 transition count 128
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 105 transition count 128
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 104 transition count 127
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 104 transition count 127
Applied a total of 10 rules in 10 ms. Remains 104 /108 variables (removed 4) and now considering 127/134 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 104/108 places, 127/134 transitions.
Incomplete random walk after 10000 steps, including 2226 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 473 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2179604 steps, run timeout after 3001 ms. (steps per millisecond=726 ) properties seen :{}
Probabilistic random walk after 2179604 steps, saw 915411 distinct states, run finished after 3001 ms. (steps per millisecond=726 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 104 cols
[2023-03-20 13:26:07] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-20 13:26:07] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:26:07] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 13:26:07] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:26:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:26:07] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:26:07] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:26:07] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-20 13:26:07] [INFO ] After 23ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 13:26:08] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-20 13:26:08] [INFO ] After 179ms 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 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 11 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 104/104 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 6 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2023-03-20 13:26:08] [INFO ] Invariant cache hit.
[2023-03-20 13:26:08] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-20 13:26:08] [INFO ] Invariant cache hit.
[2023-03-20 13:26:08] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-20 13:26:08] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2023-03-20 13:26:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 13:26:08] [INFO ] Invariant cache hit.
[2023-03-20 13:26:08] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 391 ms. Remains : 104/104 places, 127/127 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 120
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 98 transition count 103
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 81 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 75 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 74 transition count 106
Applied a total of 61 rules in 16 ms. Remains 74 /104 variables (removed 30) and now considering 106/127 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 106 rows 74 cols
[2023-03-20 13:26:08] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 13:26:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:26:08] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:26:08] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:26:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:26:08] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:26:08] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:26:08] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-20 13:26:08] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 13 factoid took 399 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 134/134 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 108 cols
[2023-03-20 13:26:09] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 13:26:09] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-20 13:26:09] [INFO ] Invariant cache hit.
[2023-03-20 13:26:09] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-20 13:26:09] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2023-03-20 13:26:09] [INFO ] Invariant cache hit.
[2023-03-20 13:26:09] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 320 ms. Remains : 108/108 places, 134/134 transitions.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 354 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2254 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 474 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 2355206 steps, run timeout after 3001 ms. (steps per millisecond=784 ) properties seen :{0=1}
Probabilistic random walk after 2355206 steps, saw 972962 distinct states, run finished after 3002 ms. (steps per millisecond=784 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-20 13:26:12] [INFO ] Invariant cache hit.
[2023-03-20 13:26:13] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:26:13] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 13:26:13] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:26:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:26:13] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 13:26:13] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:26:13] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-20 13:26:13] [INFO ] After 22ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 13:26:13] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2023-03-20 13:26:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-20 13:26:13] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-20 13:26:13] [INFO ] After 232ms 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 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 134/134 transitions.
Graph (complete) has 317 edges and 108 vertex of which 107 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 107 transition count 132
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 106 transition count 130
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 106 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 105 transition count 128
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 105 transition count 128
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 104 transition count 127
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 104 transition count 127
Applied a total of 10 rules in 22 ms. Remains 104 /108 variables (removed 4) and now considering 127/134 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 104/108 places, 127/134 transitions.
Incomplete random walk after 10000 steps, including 2213 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 450 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2063631 steps, run timeout after 3001 ms. (steps per millisecond=687 ) properties seen :{}
Probabilistic random walk after 2063631 steps, saw 866363 distinct states, run finished after 3001 ms. (steps per millisecond=687 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 104 cols
[2023-03-20 13:26:16] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 13:26:16] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:26:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 13:26:16] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:26:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:26:16] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 13:26:16] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:26:16] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-20 13:26:16] [INFO ] After 26ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 13:26:16] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-20 13:26:16] [INFO ] After 239ms 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 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 104/104 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2023-03-20 13:26:16] [INFO ] Invariant cache hit.
[2023-03-20 13:26:17] [INFO ] Implicit Places using invariants in 676 ms returned []
[2023-03-20 13:26:17] [INFO ] Invariant cache hit.
[2023-03-20 13:26:17] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-20 13:26:17] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
[2023-03-20 13:26:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 13:26:17] [INFO ] Invariant cache hit.
[2023-03-20 13:26:17] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 973 ms. Remains : 104/104 places, 127/127 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 120
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 98 transition count 103
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 81 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 75 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 74 transition count 106
Applied a total of 61 rules in 9 ms. Remains 74 /104 variables (removed 30) and now considering 106/127 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 106 rows 74 cols
[2023-03-20 13:26:17] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 13:26:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:26:17] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:26:17] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:26:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-20 13:26:17] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:26:17] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:26:18] [INFO ] After 46ms 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 13:26:18] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 22487 reset in 108 ms.
Product exploration explored 100000 steps with 22511 reset in 140 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2023-03-20 13:26:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 134 rows 108 cols
[2023-03-20 13:26:19] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 13:26:19] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 108/108 places, 134/134 transitions.
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 134/134 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2023-03-20 13:26:19] [INFO ] Invariant cache hit.
[2023-03-20 13:26:19] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-20 13:26:19] [INFO ] Invariant cache hit.
[2023-03-20 13:26:19] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-20 13:26:19] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2023-03-20 13:26:19] [INFO ] Invariant cache hit.
[2023-03-20 13:26:19] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 378 ms. Remains : 108/108 places, 134/134 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-03 finished in 20390 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 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 149 transition count 203
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 149 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 149 transition count 202
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 130 transition count 183
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 130 transition count 183
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 130 transition count 176
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 101 place count 117 transition count 154
Iterating global reduction 2 with 13 rules applied. Total rules applied 114 place count 117 transition count 154
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 123 place count 117 transition count 145
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 113 transition count 141
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 113 transition count 141
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 134 place count 110 transition count 138
Iterating global reduction 3 with 3 rules applied. Total rules applied 137 place count 110 transition count 138
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 108 transition count 134
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 108 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 143 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 145 place count 106 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 148 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 105 transition count 129
Applied a total of 149 rules in 11 ms. Remains 105 /170 variables (removed 65) and now considering 129/407 (removed 278) transitions.
// Phase 1: matrix 129 rows 105 cols
[2023-03-20 13:26:19] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 13:26:19] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-20 13:26:19] [INFO ] Invariant cache hit.
[2023-03-20 13:26:19] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 13:26:19] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2023-03-20 13:26:19] [INFO ] Invariant cache hit.
[2023-03-20 13:26:19] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/170 places, 129/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 105/170 places, 129/407 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-04 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 s1 1) (LT s100 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 22508 reset in 111 ms.
Product exploration explored 100000 steps with 22473 reset in 136 ms.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 343 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 187 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 61 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2233 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 434 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3121 steps, run visited all 1 properties in 9 ms. (steps per millisecond=346 )
Probabilistic random walk after 3121 steps, saw 1576 distinct states, run finished after 10 ms. (steps per millisecond=312 ) 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 136 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 66 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-20 13:26:20] [INFO ] Invariant cache hit.
[2023-03-20 13:26:20] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-20 13:26:20] [INFO ] Invariant cache hit.
[2023-03-20 13:26:21] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 13:26:21] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2023-03-20 13:26:21] [INFO ] Invariant cache hit.
[2023-03-20 13:26:21] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 426 ms. Remains : 105/105 places, 129/129 transitions.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 343 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2254 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 489 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3121 steps, run visited all 1 properties in 8 ms. (steps per millisecond=390 )
Probabilistic random walk after 3121 steps, saw 1576 distinct states, run finished after 8 ms. (steps per millisecond=390 ) 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 195 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 65 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22457 reset in 109 ms.
Product exploration explored 100000 steps with 22292 reset in 178 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-20 13:26:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 13:26:22] [INFO ] Invariant cache hit.
[2023-03-20 13:26:22] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112 ms. Remains : 105/105 places, 129/129 transitions.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-20 13:26:22] [INFO ] Invariant cache hit.
[2023-03-20 13:26:22] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-20 13:26:22] [INFO ] Invariant cache hit.
[2023-03-20 13:26:22] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 13:26:22] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2023-03-20 13:26:22] [INFO ] Invariant cache hit.
[2023-03-20 13:26:23] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 397 ms. Remains : 105/105 places, 129/129 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-04 finished in 3464 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 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 151 transition count 217
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 151 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 151 transition count 216
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 57 place count 133 transition count 198
Iterating global reduction 1 with 18 rules applied. Total rules applied 75 place count 133 transition count 198
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 82 place count 133 transition count 191
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 94 place count 121 transition count 171
Iterating global reduction 2 with 12 rules applied. Total rules applied 106 place count 121 transition count 171
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 114 place count 121 transition count 163
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 118 transition count 160
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 118 transition count 160
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 122 place count 116 transition count 158
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 116 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 115 transition count 155
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 115 transition count 155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 114 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 114 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 113 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 113 transition count 153
Applied a total of 130 rules in 16 ms. Remains 113 /170 variables (removed 57) and now considering 153/407 (removed 254) transitions.
// Phase 1: matrix 153 rows 113 cols
[2023-03-20 13:26:23] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 13:26:23] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-20 13:26:23] [INFO ] Invariant cache hit.
[2023-03-20 13:26:23] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-20 13:26:23] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2023-03-20 13:26:23] [INFO ] Invariant cache hit.
[2023-03-20 13:26:23] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/170 places, 153/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 490 ms. Remains : 113/170 places, 153/407 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-05 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 (GEQ s1 1) (GEQ s107 1) (OR (LT s1 1) (LT s41 1)) (OR (LT s1 1) (LT s108 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-05 finished in 596 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((F(p1)&&p0))&&X(F(p1))))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 150 transition count 216
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 150 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 150 transition count 215
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 59 place count 132 transition count 197
Iterating global reduction 1 with 18 rules applied. Total rules applied 77 place count 132 transition count 197
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 84 place count 132 transition count 190
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 96 place count 120 transition count 170
Iterating global reduction 2 with 12 rules applied. Total rules applied 108 place count 120 transition count 170
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 116 place count 120 transition count 162
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 120 place count 116 transition count 158
Iterating global reduction 3 with 4 rules applied. Total rules applied 124 place count 116 transition count 158
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 127 place count 113 transition count 155
Iterating global reduction 3 with 3 rules applied. Total rules applied 130 place count 113 transition count 155
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 132 place count 111 transition count 151
Iterating global reduction 3 with 2 rules applied. Total rules applied 134 place count 111 transition count 151
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 137 place count 111 transition count 148
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 139 place count 109 transition count 146
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 109 transition count 146
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 108 transition count 145
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 108 transition count 145
Applied a total of 143 rules in 10 ms. Remains 108 /170 variables (removed 62) and now considering 145/407 (removed 262) transitions.
// Phase 1: matrix 145 rows 108 cols
[2023-03-20 13:26:23] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 13:26:24] [INFO ] Implicit Places using invariants in 361 ms returned []
[2023-03-20 13:26:24] [INFO ] Invariant cache hit.
[2023-03-20 13:26:24] [INFO ] State equation strengthened by 70 read => feed constraints.
[2023-03-20 13:26:24] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2023-03-20 13:26:24] [INFO ] Invariant cache hit.
[2023-03-20 13:26:24] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/170 places, 145/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 654 ms. Remains : 108/170 places, 145/407 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s102 1)), p1:(AND (GEQ s1 1) (GEQ s103 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-d2m36-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-07 finished in 762 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||(p1&&G(F(p2))))))'
Support contains 5 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 151 transition count 206
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 151 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 151 transition count 205
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 56 place count 134 transition count 188
Iterating global reduction 1 with 17 rules applied. Total rules applied 73 place count 134 transition count 188
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 81 place count 134 transition count 180
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 92 place count 123 transition count 160
Iterating global reduction 2 with 11 rules applied. Total rules applied 103 place count 123 transition count 160
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 111 place count 123 transition count 152
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 113 place count 121 transition count 150
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 121 transition count 150
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 117 place count 119 transition count 148
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 119 transition count 148
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 118 transition count 147
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 118 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 123 place count 118 transition count 145
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 117 transition count 144
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 117 transition count 144
Applied a total of 125 rules in 41 ms. Remains 117 /170 variables (removed 53) and now considering 144/407 (removed 263) transitions.
// Phase 1: matrix 144 rows 117 cols
[2023-03-20 13:26:24] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 13:26:24] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-20 13:26:24] [INFO ] Invariant cache hit.
[2023-03-20 13:26:24] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-20 13:26:24] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2023-03-20 13:26:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 13:26:24] [INFO ] Invariant cache hit.
[2023-03-20 13:26:24] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/170 places, 144/407 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 428 ms. Remains : 117/170 places, 144/407 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s112 1)), p1:(OR (LT s10 1) (LT s35 1)), p2:(OR (AND (GEQ s1 1) (GEQ s63 1)) (AND (GEQ s10 1) (GEQ s35 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-10 finished in 527 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((X((F(p1)&&p0)) U p2))))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 150 transition count 204
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 150 transition count 204
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 58 place count 132 transition count 186
Iterating global reduction 0 with 18 rules applied. Total rules applied 76 place count 132 transition count 186
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 84 place count 132 transition count 178
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 96 place count 120 transition count 157
Iterating global reduction 1 with 12 rules applied. Total rules applied 108 place count 120 transition count 157
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 117 place count 120 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 121 place count 116 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 125 place count 116 transition count 144
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 128 place count 113 transition count 141
Iterating global reduction 2 with 3 rules applied. Total rules applied 131 place count 113 transition count 141
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 111 transition count 137
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 111 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 137 place count 111 transition count 135
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 109 transition count 133
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 109 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 108 transition count 132
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 108 transition count 132
Applied a total of 143 rules in 11 ms. Remains 108 /170 variables (removed 62) and now considering 132/407 (removed 275) transitions.
// Phase 1: matrix 132 rows 108 cols
[2023-03-20 13:26:24] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 13:26:25] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-20 13:26:25] [INFO ] Invariant cache hit.
[2023-03-20 13:26:25] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-20 13:26:25] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2023-03-20 13:26:25] [INFO ] Invariant cache hit.
[2023-03-20 13:26:25] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/170 places, 132/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 567 ms. Remains : 108/170 places, 132/407 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s81 1) (GEQ s38 1)), p0:(AND (GEQ s1 1) (GEQ s38 1)), p1:(OR (AND (GEQ s1 1) (GEQ s103 1)) (AND (GEQ s1 1) (GEQ s81 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-11 finished in 682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 149 transition count 203
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 149 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 149 transition count 202
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 130 transition count 183
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 130 transition count 183
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 130 transition count 176
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 101 place count 117 transition count 154
Iterating global reduction 2 with 13 rules applied. Total rules applied 114 place count 117 transition count 154
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 123 place count 117 transition count 145
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 113 transition count 141
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 113 transition count 141
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 134 place count 110 transition count 138
Iterating global reduction 3 with 3 rules applied. Total rules applied 137 place count 110 transition count 138
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 108 transition count 134
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 108 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 143 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 145 place count 106 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 148 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 105 transition count 129
Applied a total of 149 rules in 17 ms. Remains 105 /170 variables (removed 65) and now considering 129/407 (removed 278) transitions.
// Phase 1: matrix 129 rows 105 cols
[2023-03-20 13:26:25] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 13:26:25] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-20 13:26:25] [INFO ] Invariant cache hit.
[2023-03-20 13:26:25] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 13:26:25] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2023-03-20 13:26:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 13:26:25] [INFO ] Invariant cache hit.
[2023-03-20 13:26:26] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/170 places, 129/407 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 382 ms. Remains : 105/170 places, 129/407 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22568 reset in 114 ms.
Product exploration explored 100000 steps with 22308 reset in 127 ms.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 343 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 187 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 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2238 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 469 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2269100 steps, run timeout after 3001 ms. (steps per millisecond=756 ) properties seen :{}
Probabilistic random walk after 2269100 steps, saw 952940 distinct states, run finished after 3001 ms. (steps per millisecond=756 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 13:26:29] [INFO ] Invariant cache hit.
[2023-03-20 13:26:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:26:29] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 13:26:29] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:26:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:26:29] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 13:26:29] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:26:29] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 13:26:29] [INFO ] After 17ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 13:26:29] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2023-03-20 13:26:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-20 13:26:29] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-20 13:26:29] [INFO ] After 192ms 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 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 129/129 transitions.
Graph (complete) has 307 edges and 105 vertex of which 104 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 104 transition count 127
Applied a total of 3 rules in 9 ms. Remains 104 /105 variables (removed 1) and now considering 127/129 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 104/105 places, 127/129 transitions.
Incomplete random walk after 10000 steps, including 2253 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1976465 steps, run timeout after 3001 ms. (steps per millisecond=658 ) properties seen :{}
Probabilistic random walk after 1976465 steps, saw 830898 distinct states, run finished after 3001 ms. (steps per millisecond=658 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 104 cols
[2023-03-20 13:26:32] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-20 13:26:33] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:26:33] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 13:26:33] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:26:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:26:33] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:26:33] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:26:33] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-20 13:26:33] [INFO ] After 23ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 13:26:33] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-20 13:26:33] [INFO ] After 159ms 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 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 104/104 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2023-03-20 13:26:33] [INFO ] Invariant cache hit.
[2023-03-20 13:26:33] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-20 13:26:33] [INFO ] Invariant cache hit.
[2023-03-20 13:26:33] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-20 13:26:33] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2023-03-20 13:26:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 13:26:33] [INFO ] Invariant cache hit.
[2023-03-20 13:26:33] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 380 ms. Remains : 104/104 places, 127/127 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 120
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 98 transition count 103
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 81 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 75 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 74 transition count 106
Applied a total of 61 rules in 9 ms. Remains 74 /104 variables (removed 30) and now considering 106/127 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 106 rows 74 cols
[2023-03-20 13:26:33] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-20 13:26:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:26:33] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:26:33] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:26:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-20 13:26:33] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-20 13:26:33] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:26:33] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-20 13:26:33] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 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 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 105 cols
[2023-03-20 13:26:34] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 13:26:34] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-20 13:26:34] [INFO ] Invariant cache hit.
[2023-03-20 13:26:34] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 13:26:34] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2023-03-20 13:26:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 13:26:34] [INFO ] Invariant cache hit.
[2023-03-20 13:26:34] [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 339 ms. Remains : 105/105 places, 129/129 transitions.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 343 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 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 24 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2249 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 471 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2349207 steps, run timeout after 3001 ms. (steps per millisecond=782 ) properties seen :{}
Probabilistic random walk after 2349207 steps, saw 985209 distinct states, run finished after 3001 ms. (steps per millisecond=782 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 13:26:37] [INFO ] Invariant cache hit.
[2023-03-20 13:26:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:26:37] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 13:26:37] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:26:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 13:26:37] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 13:26:37] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:26:37] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 13:26:37] [INFO ] After 17ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 13:26:37] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2023-03-20 13:26:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-20 13:26:37] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-20 13:26:37] [INFO ] After 199ms 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 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 129/129 transitions.
Graph (complete) has 307 edges and 105 vertex of which 104 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 104 transition count 127
Applied a total of 3 rules in 5 ms. Remains 104 /105 variables (removed 1) and now considering 127/129 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 104/105 places, 127/129 transitions.
Incomplete random walk after 10000 steps, including 2247 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 481 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2517265 steps, run timeout after 3001 ms. (steps per millisecond=838 ) properties seen :{}
Probabilistic random walk after 2517265 steps, saw 1055619 distinct states, run finished after 3001 ms. (steps per millisecond=838 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 104 cols
[2023-03-20 13:26:40] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 13:26:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:26:40] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:26:41] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:26:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:26:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:26:41] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:26:41] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-20 13:26:41] [INFO ] After 18ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 13:26:41] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-20 13:26:41] [INFO ] After 137ms 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 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 104/104 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2023-03-20 13:26:41] [INFO ] Invariant cache hit.
[2023-03-20 13:26:41] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-20 13:26:41] [INFO ] Invariant cache hit.
[2023-03-20 13:26:41] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-20 13:26:41] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2023-03-20 13:26:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 13:26:41] [INFO ] Invariant cache hit.
[2023-03-20 13:26:41] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 349 ms. Remains : 104/104 places, 127/127 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 120
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 98 transition count 103
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 81 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 75 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 74 transition count 106
Applied a total of 61 rules in 10 ms. Remains 74 /104 variables (removed 30) and now considering 106/127 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 106 rows 74 cols
[2023-03-20 13:26:41] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 13:26:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:26:41] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-20 13:26:41] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:26:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-20 13:26:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:26:41] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:26:41] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-20 13:26:41] [INFO ] After 102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22580 reset in 133 ms.
Product exploration explored 100000 steps with 22506 reset in 152 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 9 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 105 cols
[2023-03-20 13:26:42] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 13:26:42] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-20 13:26:42] [INFO ] Invariant cache hit.
[2023-03-20 13:26:42] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 13:26:42] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2023-03-20 13:26:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 13:26:42] [INFO ] Invariant cache hit.
[2023-03-20 13:26:42] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 445 ms. Remains : 105/105 places, 129/129 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-12 finished in 17011 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)||(p1 U (p2||(p1 U G(p2)))))))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 151 transition count 229
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 151 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 151 transition count 228
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 56 place count 134 transition count 211
Iterating global reduction 1 with 17 rules applied. Total rules applied 73 place count 134 transition count 211
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 79 place count 134 transition count 205
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 90 place count 123 transition count 187
Iterating global reduction 2 with 11 rules applied. Total rules applied 101 place count 123 transition count 187
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 108 place count 123 transition count 180
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 111 place count 120 transition count 177
Iterating global reduction 3 with 3 rules applied. Total rules applied 114 place count 120 transition count 177
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 116 place count 118 transition count 175
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 118 transition count 175
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 120 place count 116 transition count 171
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 116 transition count 171
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 126 place count 116 transition count 167
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 128 place count 114 transition count 165
Iterating global reduction 4 with 2 rules applied. Total rules applied 130 place count 114 transition count 165
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 131 place count 113 transition count 164
Iterating global reduction 4 with 1 rules applied. Total rules applied 132 place count 113 transition count 164
Applied a total of 132 rules in 14 ms. Remains 113 /170 variables (removed 57) and now considering 164/407 (removed 243) transitions.
// Phase 1: matrix 164 rows 113 cols
[2023-03-20 13:26:42] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 13:26:42] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-20 13:26:42] [INFO ] Invariant cache hit.
[2023-03-20 13:26:42] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-20 13:26:42] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-20 13:26:43] [INFO ] Invariant cache hit.
[2023-03-20 13:26:43] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/170 places, 164/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 392 ms. Remains : 113/170 places, 164/407 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(AND (GEQ s1 1) (GEQ s108 1)), p1:(AND (GEQ s1 1) (GEQ s107 1)), p0:(AND (GEQ s1 1) (GEQ s106 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-13 finished in 560 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((p0||X(F(p1)))))&&(p2||(p1 U p3)))))'
Support contains 5 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 152 transition count 231
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 152 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 152 transition count 230
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 53 place count 136 transition count 214
Iterating global reduction 1 with 16 rules applied. Total rules applied 69 place count 136 transition count 214
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 76 place count 136 transition count 207
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 86 place count 126 transition count 190
Iterating global reduction 2 with 10 rules applied. Total rules applied 96 place count 126 transition count 190
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 102 place count 126 transition count 184
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 125 transition count 183
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 125 transition count 183
Applied a total of 104 rules in 6 ms. Remains 125 /170 variables (removed 45) and now considering 183/407 (removed 224) transitions.
// Phase 1: matrix 183 rows 125 cols
[2023-03-20 13:26:43] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 13:26:43] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-20 13:26:43] [INFO ] Invariant cache hit.
[2023-03-20 13:26:43] [INFO ] State equation strengthened by 95 read => feed constraints.
[2023-03-20 13:26:43] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2023-03-20 13:26:43] [INFO ] Invariant cache hit.
[2023-03-20 13:26:43] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/170 places, 183/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 485 ms. Remains : 125/170 places, 183/407 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={} source=1 dest: 3}, { cond=(OR p2 p3 p1), acceptance={} source=1 dest: 4}, { cond=(OR (AND p2 (NOT p1) (NOT p0)) (AND p3 (NOT p1) (NOT p0))), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s120 1)), p3:(AND (GEQ s1 1) (GEQ s118 1)), p1:(AND (GEQ s1 1) (GEQ s119 1)), p0:(AND (GEQ s1 1) (GEQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-15 finished in 711 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-d2m36-LTLFireability-00
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 149 transition count 203
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 149 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 149 transition count 202
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 130 transition count 183
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 130 transition count 183
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 89 place count 130 transition count 175
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 102 place count 117 transition count 153
Iterating global reduction 2 with 13 rules applied. Total rules applied 115 place count 117 transition count 153
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 124 place count 117 transition count 144
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 128 place count 113 transition count 140
Iterating global reduction 3 with 4 rules applied. Total rules applied 132 place count 113 transition count 140
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 135 place count 110 transition count 137
Iterating global reduction 3 with 3 rules applied. Total rules applied 138 place count 110 transition count 137
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 140 place count 108 transition count 133
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 108 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 144 place count 108 transition count 131
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 146 place count 106 transition count 129
Iterating global reduction 4 with 2 rules applied. Total rules applied 148 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 149 place count 105 transition count 128
Iterating global reduction 4 with 1 rules applied. Total rules applied 150 place count 105 transition count 128
Applied a total of 150 rules in 19 ms. Remains 105 /170 variables (removed 65) and now considering 128/407 (removed 279) transitions.
// Phase 1: matrix 128 rows 105 cols
[2023-03-20 13:26:44] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 13:26:44] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-20 13:26:44] [INFO ] Invariant cache hit.
[2023-03-20 13:26:44] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 13:26:44] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2023-03-20 13:26:44] [INFO ] Invariant cache hit.
[2023-03-20 13:26:44] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 105/170 places, 128/407 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 414 ms. Remains : 105/170 places, 128/407 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s100 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 22496 reset in 110 ms.
Product exploration explored 100000 steps with 22412 reset in 121 ms.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 342 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 189 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 54 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2243 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 475 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 177282 steps, run visited all 1 properties in 257 ms. (steps per millisecond=689 )
Probabilistic random walk after 177282 steps, saw 88429 distinct states, run finished after 258 ms. (steps per millisecond=687 ) 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 180 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 65 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-20 13:26:45] [INFO ] Invariant cache hit.
[2023-03-20 13:26:45] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-20 13:26:45] [INFO ] Invariant cache hit.
[2023-03-20 13:26:45] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 13:26:45] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2023-03-20 13:26:45] [INFO ] Invariant cache hit.
[2023-03-20 13:26:45] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 303 ms. Remains : 105/105 places, 128/128 transitions.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 342 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 159 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 69 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2224 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 501 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 177282 steps, run visited all 1 properties in 223 ms. (steps per millisecond=794 )
Probabilistic random walk after 177282 steps, saw 88429 distinct states, run finished after 223 ms. (steps per millisecond=794 ) 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 240 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 82 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22423 reset in 109 ms.
Product exploration explored 100000 steps with 22352 reset in 160 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-20 13:26:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 13:26:47] [INFO ] Invariant cache hit.
[2023-03-20 13:26:47] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 131 ms. Remains : 105/105 places, 128/128 transitions.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-20 13:26:47] [INFO ] Invariant cache hit.
[2023-03-20 13:26:47] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-20 13:26:47] [INFO ] Invariant cache hit.
[2023-03-20 13:26:47] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 13:26:47] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2023-03-20 13:26:47] [INFO ] Invariant cache hit.
[2023-03-20 13:26:47] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 339 ms. Remains : 105/105 places, 128/128 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-00 finished in 3889 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(G(p1))||p0))&&F(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-04
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 170/170 places, 407/407 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 149 transition count 203
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 149 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 149 transition count 202
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 130 transition count 183
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 130 transition count 183
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 130 transition count 176
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 101 place count 117 transition count 154
Iterating global reduction 2 with 13 rules applied. Total rules applied 114 place count 117 transition count 154
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 123 place count 117 transition count 145
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 113 transition count 141
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 113 transition count 141
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 134 place count 110 transition count 138
Iterating global reduction 3 with 3 rules applied. Total rules applied 137 place count 110 transition count 138
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 108 transition count 134
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 108 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 143 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 145 place count 106 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 148 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 105 transition count 129
Applied a total of 149 rules in 16 ms. Remains 105 /170 variables (removed 65) and now considering 129/407 (removed 278) transitions.
// Phase 1: matrix 129 rows 105 cols
[2023-03-20 13:26:48] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 13:26:48] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-20 13:26:48] [INFO ] Invariant cache hit.
[2023-03-20 13:26:48] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 13:26:48] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2023-03-20 13:26:48] [INFO ] Invariant cache hit.
[2023-03-20 13:26:48] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 105/170 places, 129/407 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 485 ms. Remains : 105/170 places, 129/407 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-04 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 s1 1) (LT s100 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 22501 reset in 107 ms.
Product exploration explored 100000 steps with 22582 reset in 183 ms.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 343 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 228 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 2258 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 480 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3121 steps, run visited all 1 properties in 9 ms. (steps per millisecond=346 )
Probabilistic random walk after 3121 steps, saw 1576 distinct states, run finished after 9 ms. (steps per millisecond=346 ) 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 174 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 72 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-20 13:26:49] [INFO ] Invariant cache hit.
[2023-03-20 13:26:49] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-20 13:26:49] [INFO ] Invariant cache hit.
[2023-03-20 13:26:49] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 13:26:49] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2023-03-20 13:26:49] [INFO ] Invariant cache hit.
[2023-03-20 13:26:49] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 427 ms. Remains : 105/105 places, 129/129 transitions.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 343 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 115 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 61 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2282 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 454 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3121 steps, run visited all 1 properties in 8 ms. (steps per millisecond=390 )
Probabilistic random walk after 3121 steps, saw 1576 distinct states, run finished after 9 ms. (steps per millisecond=346 ) 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 128 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 57 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 64 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22563 reset in 116 ms.
Product exploration explored 100000 steps with 22475 reset in 123 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-20 13:26:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 13:26:51] [INFO ] Invariant cache hit.
[2023-03-20 13:26:51] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 105/105 places, 129/129 transitions.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-20 13:26:51] [INFO ] Invariant cache hit.
[2023-03-20 13:26:51] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-20 13:26:51] [INFO ] Invariant cache hit.
[2023-03-20 13:26:51] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 13:26:51] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2023-03-20 13:26:51] [INFO ] Invariant cache hit.
[2023-03-20 13:26:51] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 380 ms. Remains : 105/105 places, 129/129 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-04 finished in 3536 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)))'
[2023-03-20 13:26:51] [INFO ] Flatten gal took : 78 ms
[2023-03-20 13:26:51] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 9 ms.
[2023-03-20 13:26:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 170 places, 407 transitions and 1609 arcs took 8 ms.
Total runtime 98140 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2173/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2173/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2173/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2173/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2173/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m36-LTLFireability-00
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m36-LTLFireability-02
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m36-LTLFireability-03
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m36-LTLFireability-04
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m36-LTLFireability-12

BK_STOP 1679318812912

--------------------
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-d2m36-LTLFireability-00
ltl formula formula --ltl=/tmp/2173/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 170 places, 407 transitions and 1609 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.090 real 0.010 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2173/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2173/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2173/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2173/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-d2m36-LTLFireability-02
ltl formula formula --ltl=/tmp/2173/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 170 places, 407 transitions and 1609 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.090 real 0.000 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2173/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2173/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2173/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2173/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name SieveSingleMsgMbox-PT-d2m36-LTLFireability-03
ltl formula formula --ltl=/tmp/2173/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 170 places, 407 transitions and 1609 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.080 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2173/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2173/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2173/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2173/ltl_2_
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-d2m36-LTLFireability-04
ltl formula formula --ltl=/tmp/2173/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
pnml2lts-mc( 0/ 4): Petri net has 170 places, 407 transitions and 1609 arcs
Warning: program compiled against libxml 210 using older 209
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.130 real 0.010 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2173/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2173/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2173/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2173/ltl_3_
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-d2m36-LTLFireability-12
ltl formula formula --ltl=/tmp/2173/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
pnml2lts-mc( 0/ 4): Petri net has 170 places, 407 transitions and 1609 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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2173/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2173/ltl_4_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2173/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2173/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d2m36"
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-d2m36, 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-167905978200476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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