About the Execution of LoLa+red for SieveSingleMsgMbox-PT-d2m18
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
436.899 | 27130.00 | 54081.00 | 159.00 | FFFFFFTFFFTFFFFF | normal |
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.r423-tajo-167905976800468.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 lolaxred
Input is SieveSingleMsgMbox-PT-d2m18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976800468
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 10:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 10:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 10:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 10:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 10:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 10:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 10:33 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-d2m18-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679248266703
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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m18
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 17:51:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 17:51:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:51:08] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2023-03-19 17:51:08] [INFO ] Transformed 2398 places.
[2023-03-19 17:51:08] [INFO ] Transformed 1954 transitions.
[2023-03-19 17:51:08] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 280 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 1984 places in 49 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 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 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 960 place count 282 transition count 563
Iterating global reduction 1 with 107 rules applied. Total rules applied 1067 place count 282 transition count 563
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 1078 place count 282 transition count 552
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 1157 place count 203 transition count 473
Iterating global reduction 2 with 79 rules applied. Total rules applied 1236 place count 203 transition count 473
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 1264 place count 203 transition count 445
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1294 place count 173 transition count 409
Iterating global reduction 3 with 30 rules applied. Total rules applied 1324 place count 173 transition count 409
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 1384 place count 173 transition count 349
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1391 place count 166 transition count 337
Iterating global reduction 4 with 7 rules applied. Total rules applied 1398 place count 166 transition count 337
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1405 place count 159 transition count 330
Iterating global reduction 4 with 7 rules applied. Total rules applied 1412 place count 159 transition count 330
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1416 place count 155 transition count 325
Iterating global reduction 4 with 4 rules applied. Total rules applied 1420 place count 155 transition count 325
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1424 place count 151 transition count 321
Iterating global reduction 4 with 4 rules applied. Total rules applied 1428 place count 151 transition count 321
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1432 place count 147 transition count 317
Iterating global reduction 4 with 4 rules applied. Total rules applied 1436 place count 147 transition count 317
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1438 place count 145 transition count 313
Iterating global reduction 4 with 2 rules applied. Total rules applied 1440 place count 145 transition count 313
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1441 place count 144 transition count 312
Iterating global reduction 4 with 1 rules applied. Total rules applied 1442 place count 144 transition count 312
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1443 place count 143 transition count 311
Iterating global reduction 4 with 1 rules applied. Total rules applied 1444 place count 143 transition count 311
Applied a total of 1444 rules in 139 ms. Remains 143 /414 variables (removed 271) and now considering 311/1954 (removed 1643) transitions.
// Phase 1: matrix 311 rows 143 cols
[2023-03-19 17:51:09] [INFO ] Computed 5 place invariants in 24 ms
[2023-03-19 17:51:09] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-19 17:51:09] [INFO ] Invariant cache hit.
[2023-03-19 17:51:09] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-19 17:51:10] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
[2023-03-19 17:51:10] [INFO ] Invariant cache hit.
[2023-03-19 17:51:10] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 143/414 places, 311/1954 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1072 ms. Remains : 143/414 places, 311/1954 transitions.
Support contains 20 out of 143 places after structural reductions.
[2023-03-19 17:51:10] [INFO ] Flatten gal took : 80 ms
[2023-03-19 17:51:10] [INFO ] Flatten gal took : 34 ms
[2023-03-19 17:51:10] [INFO ] Input system was already deterministic with 311 transitions.
Incomplete random walk after 10000 steps, including 2254 resets, run finished after 783 ms. (steps per millisecond=12 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 434 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10000 steps, including 1073 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 449 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 444 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 451 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 491 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 459 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 504 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 458 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-19 17:51:12] [INFO ] Invariant cache hit.
[2023-03-19 17:51:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:51:12] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-19 17:51:12] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-19 17:51:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:51:12] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-19 17:51:13] [INFO ] After 542ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-19 17:51:13] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-19 17:51:14] [INFO ] After 710ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-19 17:51:14] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 8 ms to minimize.
[2023-03-19 17:51:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-03-19 17:51:15] [INFO ] After 2019ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 981 ms.
[2023-03-19 17:51:16] [INFO ] After 3731ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 0 properties in 295 ms.
Support contains 17 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 311/311 transitions.
Graph (complete) has 540 edges and 143 vertex of which 142 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 142 transition count 309
Applied a total of 3 rules in 32 ms. Remains 142 /143 variables (removed 1) and now considering 309/311 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 142/143 places, 309/311 transitions.
Incomplete random walk after 10000 steps, including 2262 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 471 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 1047 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 424 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 442 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 487 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 490 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 498 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 472 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 577908 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :{0=1, 1=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 12=1}
Probabilistic random walk after 577908 steps, saw 255851 distinct states, run finished after 3002 ms. (steps per millisecond=192 ) properties seen :9
Running SMT prover for 4 properties.
// Phase 1: matrix 309 rows 142 cols
[2023-03-19 17:51:20] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-19 17:51:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:51:21] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-19 17:51:21] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 17:51:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:51:21] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 17:51:21] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 17:51:21] [INFO ] State equation strengthened by 198 read => feed constraints.
[2023-03-19 17:51:21] [INFO ] After 251ms SMT Verify possible using 198 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 17:51:21] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 3 ms to minimize.
[2023-03-19 17:51:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-19 17:51:22] [INFO ] After 613ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 241 ms.
[2023-03-19 17:51:22] [INFO ] After 1117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 55 ms.
Support contains 6 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 309/309 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 132 transition count 191
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 132 transition count 191
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 123 transition count 182
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 123 transition count 182
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 123 transition count 176
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 116 transition count 162
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 116 transition count 162
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 64 place count 116 transition count 156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 115 transition count 155
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 115 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 114 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 114 transition count 154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 113 transition count 153
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 113 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 73 place count 113 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 112 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 112 transition count 149
Applied a total of 75 rules in 26 ms. Remains 112 /142 variables (removed 30) and now considering 149/309 (removed 160) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 112/142 places, 149/309 transitions.
Incomplete random walk after 10000 steps, including 2242 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1071 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 440 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 486 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 988488 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :{}
Probabilistic random walk after 988488 steps, saw 422999 distinct states, run finished after 3003 ms. (steps per millisecond=329 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 149 rows 112 cols
[2023-03-19 17:51:25] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-19 17:51:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:51:25] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-19 17:51:25] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 17:51:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:51:25] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 17:51:25] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 17:51:25] [INFO ] State equation strengthened by 70 read => feed constraints.
[2023-03-19 17:51:26] [INFO ] After 89ms SMT Verify possible using 70 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 17:51:26] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-19 17:51:26] [INFO ] After 493ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 62 ms.
Support contains 6 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 149/149 transitions.
Applied a total of 0 rules in 7 ms. Remains 112 /112 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 112/112 places, 149/149 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 149/149 transitions.
Applied a total of 0 rules in 6 ms. Remains 112 /112 variables (removed 0) and now considering 149/149 (removed 0) transitions.
[2023-03-19 17:51:26] [INFO ] Invariant cache hit.
[2023-03-19 17:51:26] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-19 17:51:26] [INFO ] Invariant cache hit.
[2023-03-19 17:51:26] [INFO ] State equation strengthened by 70 read => feed constraints.
[2023-03-19 17:51:26] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2023-03-19 17:51:26] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-19 17:51:26] [INFO ] Invariant cache hit.
[2023-03-19 17:51:26] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 383 ms. Remains : 112/112 places, 149/149 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 112 transition count 143
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 107 transition count 143
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 11 place count 107 transition count 126
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 45 place count 90 transition count 126
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 61 place count 82 transition count 118
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 72 place count 82 transition count 118
Applied a total of 72 rules in 21 ms. Remains 82 /112 variables (removed 30) and now considering 118/149 (removed 31) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 118 rows 82 cols
[2023-03-19 17:51:26] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-19 17:51:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 17:51:26] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-19 17:51:27] [INFO ] After 265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 17:51:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 17:51:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-19 17:51:27] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 17:51:27] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2023-03-19 17:51:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-19 17:51:27] [INFO ] After 179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-19 17:51:27] [INFO ] After 408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Computed a total of 22 stabilizing places and 37 stable transitions
Graph (complete) has 590 edges and 143 vertex of which 142 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
Support contains 6 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 311/311 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 133 transition count 205
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 133 transition count 205
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 124 transition count 196
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 124 transition count 196
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 124 transition count 191
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 119 transition count 181
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 119 transition count 181
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 57 place count 119 transition count 177
Applied a total of 57 rules in 21 ms. Remains 119 /143 variables (removed 24) and now considering 177/311 (removed 134) transitions.
// Phase 1: matrix 177 rows 119 cols
[2023-03-19 17:51:27] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:51:28] [INFO ] Implicit Places using invariants in 596 ms returned []
[2023-03-19 17:51:28] [INFO ] Invariant cache hit.
[2023-03-19 17:51:28] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-19 17:51:28] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
[2023-03-19 17:51:28] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 17:51:28] [INFO ] Invariant cache hit.
[2023-03-19 17:51:28] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/143 places, 177/311 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 937 ms. Remains : 119/143 places, 177/311 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s23 1) (GEQ s73 1)) (AND (GEQ s1 1) (GEQ s113 1)) (AND (GEQ s1 1) (GEQ s112 1))), p1:(AND (GEQ s1 1) (GEQ s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 2 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-00 finished in 1177 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 311/311 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 131 transition count 179
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 131 transition count 179
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 35 place count 120 transition count 168
Iterating global reduction 0 with 11 rules applied. Total rules applied 46 place count 120 transition count 168
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 53 place count 120 transition count 161
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 61 place count 112 transition count 145
Iterating global reduction 1 with 8 rules applied. Total rules applied 69 place count 112 transition count 145
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 112 transition count 138
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 110 transition count 136
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 110 transition count 136
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 108 transition count 134
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 108 transition count 134
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 107 transition count 133
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 107 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 88 place count 107 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 106 transition count 130
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 106 transition count 130
Applied a total of 90 rules in 12 ms. Remains 106 /143 variables (removed 37) and now considering 130/311 (removed 181) transitions.
// Phase 1: matrix 130 rows 106 cols
[2023-03-19 17:51:28] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:51:28] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-19 17:51:28] [INFO ] Invariant cache hit.
[2023-03-19 17:51:28] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 17:51:29] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2023-03-19 17:51:29] [INFO ] Invariant cache hit.
[2023-03-19 17:51:29] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/143 places, 130/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 383 ms. Remains : 106/143 places, 130/311 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (GEQ s25 1) (GEQ s71 1)), p0:(AND (GEQ s1 1) (GEQ s101 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-01 finished in 448 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 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 311/311 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 130 transition count 166
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 130 transition count 166
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 119 transition count 155
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 119 transition count 155
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 56 place count 119 transition count 147
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 65 place count 110 transition count 129
Iterating global reduction 1 with 9 rules applied. Total rules applied 74 place count 110 transition count 129
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 82 place count 110 transition count 121
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 107 transition count 118
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 107 transition count 118
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 104 transition count 115
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 104 transition count 115
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 102 transition count 113
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 102 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 102 transition count 111
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 102 place count 100 transition count 109
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 100 transition count 109
Applied a total of 104 rules in 32 ms. Remains 100 /143 variables (removed 43) and now considering 109/311 (removed 202) transitions.
// Phase 1: matrix 109 rows 100 cols
[2023-03-19 17:51:29] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:51:29] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-19 17:51:29] [INFO ] Invariant cache hit.
[2023-03-19 17:51:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-19 17:51:29] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2023-03-19 17:51:29] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 17:51:29] [INFO ] Invariant cache hit.
[2023-03-19 17:51:29] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/143 places, 109/311 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 456 ms. Remains : 100/143 places, 109/311 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-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:(AND (GEQ s1 1) (GEQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-02 finished in 491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1||G(p2)))))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 311/311 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 132 transition count 204
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 132 transition count 204
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 123 transition count 195
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 123 transition count 195
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 46 place count 123 transition count 189
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 53 place count 116 transition count 175
Iterating global reduction 1 with 7 rules applied. Total rules applied 60 place count 116 transition count 175
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 66 place count 116 transition count 169
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 114 transition count 167
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 114 transition count 167
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 112 transition count 165
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 112 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 111 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 111 transition count 164
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 80 place count 111 transition count 160
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 110 transition count 159
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 110 transition count 159
Applied a total of 82 rules in 8 ms. Remains 110 /143 variables (removed 33) and now considering 159/311 (removed 152) transitions.
// Phase 1: matrix 159 rows 110 cols
[2023-03-19 17:51:29] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:51:29] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-19 17:51:29] [INFO ] Invariant cache hit.
[2023-03-19 17:51:29] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-19 17:51:30] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2023-03-19 17:51:30] [INFO ] Invariant cache hit.
[2023-03-19 17:51:30] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/143 places, 159/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 328 ms. Remains : 110/143 places, 159/311 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s102 1)), p1:(AND (GEQ s1 1) (GEQ s103 1)), p2:(AND (GEQ s1 1) (GEQ s105 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-04 finished in 460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1||X(p2))))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 311/311 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 132 transition count 204
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 132 transition count 204
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 123 transition count 195
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 123 transition count 195
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 45 place count 123 transition count 190
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 117 transition count 178
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 117 transition count 178
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 62 place count 117 transition count 173
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 116 transition count 172
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 116 transition count 172
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 115 transition count 171
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 115 transition count 171
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 114 transition count 170
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 114 transition count 170
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 72 place count 114 transition count 166
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 113 transition count 165
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 113 transition count 165
Applied a total of 74 rules in 8 ms. Remains 113 /143 variables (removed 30) and now considering 165/311 (removed 146) transitions.
// Phase 1: matrix 165 rows 113 cols
[2023-03-19 17:51:30] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-19 17:51:30] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-19 17:51:30] [INFO ] Invariant cache hit.
[2023-03-19 17:51:30] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-19 17:51:30] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-03-19 17:51:30] [INFO ] Invariant cache hit.
[2023-03-19 17:51:30] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/143 places, 165/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 406 ms. Remains : 113/143 places, 165/311 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s107 1)), p0:(AND (GEQ s1 1) (GEQ s106 1)), p2:(AND (GEQ s1 1) (GEQ s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-05 finished in 541 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 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 311/311 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 130 transition count 178
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 130 transition count 178
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 119 transition count 167
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 119 transition count 167
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 55 place count 119 transition count 160
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 63 place count 111 transition count 144
Iterating global reduction 1 with 8 rules applied. Total rules applied 71 place count 111 transition count 144
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 78 place count 111 transition count 137
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 109 transition count 135
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 109 transition count 135
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 107 transition count 133
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 107 transition count 133
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 106 transition count 132
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 106 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 90 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 105 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 105 transition count 129
Applied a total of 92 rules in 8 ms. Remains 105 /143 variables (removed 38) and now considering 129/311 (removed 182) transitions.
// Phase 1: matrix 129 rows 105 cols
[2023-03-19 17:51:30] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:51:30] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-19 17:51:30] [INFO ] Invariant cache hit.
[2023-03-19 17:51:30] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 17:51:30] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2023-03-19 17:51:30] [INFO ] Invariant cache hit.
[2023-03-19 17:51:31] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/143 places, 129/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 260 ms. Remains : 105/143 places, 129/311 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-07 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 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-07 finished in 349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 311/311 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 130 transition count 178
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 130 transition count 178
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 119 transition count 167
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 119 transition count 167
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 55 place count 119 transition count 160
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 63 place count 111 transition count 144
Iterating global reduction 1 with 8 rules applied. Total rules applied 71 place count 111 transition count 144
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 78 place count 111 transition count 137
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 109 transition count 135
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 109 transition count 135
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 107 transition count 133
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 107 transition count 133
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 106 transition count 132
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 106 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 90 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 105 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 105 transition count 129
Applied a total of 92 rules in 11 ms. Remains 105 /143 variables (removed 38) and now considering 129/311 (removed 182) transitions.
// Phase 1: matrix 129 rows 105 cols
[2023-03-19 17:51:31] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-19 17:51:31] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-19 17:51:31] [INFO ] Invariant cache hit.
[2023-03-19 17:51:31] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 17:51:31] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-19 17:51:31] [INFO ] Invariant cache hit.
[2023-03-19 17:51:31] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/143 places, 129/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 296 ms. Remains : 105/143 places, 129/311 transitions.
Stuttering acceptance computed with spot in 71 ms :[p0, p0, p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s100 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]]
Product exploration explored 100000 steps with 33333 reset in 194 ms.
Product exploration explored 100000 steps with 33333 reset in 253 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.11 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-10 finished in 909 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 311/311 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 130 transition count 178
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 130 transition count 178
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 119 transition count 167
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 119 transition count 167
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 56 place count 119 transition count 159
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 111 transition count 143
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 111 transition count 143
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 79 place count 111 transition count 136
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 81 place count 109 transition count 134
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 109 transition count 134
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 107 transition count 132
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 107 transition count 132
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 106 transition count 131
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 106 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 105 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 105 transition count 128
Applied a total of 93 rules in 20 ms. Remains 105 /143 variables (removed 38) and now considering 128/311 (removed 183) transitions.
// Phase 1: matrix 128 rows 105 cols
[2023-03-19 17:51:32] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:51:32] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-19 17:51:32] [INFO ] Invariant cache hit.
[2023-03-19 17:51:32] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 17:51:32] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2023-03-19 17:51:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:51:32] [INFO ] Invariant cache hit.
[2023-03-19 17:51:32] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/143 places, 128/311 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 441 ms. Remains : 105/143 places, 128/311 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-12 finished in 508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 311/311 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 131 transition count 191
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 131 transition count 191
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 121 transition count 181
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 121 transition count 181
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 50 place count 121 transition count 175
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 114 transition count 161
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 114 transition count 161
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 70 place count 114 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 113 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 113 transition count 154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 112 transition count 153
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 112 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 111 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 111 transition count 152
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 79 place count 111 transition count 149
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 110 transition count 148
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 110 transition count 148
Applied a total of 81 rules in 19 ms. Remains 110 /143 variables (removed 33) and now considering 148/311 (removed 163) transitions.
// Phase 1: matrix 148 rows 110 cols
[2023-03-19 17:51:32] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:51:32] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-19 17:51:32] [INFO ] Invariant cache hit.
[2023-03-19 17:51:32] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-19 17:51:32] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2023-03-19 17:51:32] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 17:51:32] [INFO ] Invariant cache hit.
[2023-03-19 17:51:32] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/143 places, 148/311 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 410 ms. Remains : 110/143 places, 148/311 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s105 1)), p1:(AND (OR (LT s1 1) (LT s104 1)) (GEQ s1 1) (GEQ s68 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 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-14 finished in 521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 311/311 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 129 transition count 165
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 129 transition count 165
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 40 place count 117 transition count 153
Iterating global reduction 0 with 12 rules applied. Total rules applied 52 place count 117 transition count 153
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 60 place count 117 transition count 145
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 69 place count 108 transition count 127
Iterating global reduction 1 with 9 rules applied. Total rules applied 78 place count 108 transition count 127
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 86 place count 108 transition count 119
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 105 transition count 116
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 105 transition count 116
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 95 place count 102 transition count 113
Iterating global reduction 2 with 3 rules applied. Total rules applied 98 place count 102 transition count 113
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 100 transition count 111
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 100 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 104 place count 100 transition count 109
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 106 place count 98 transition count 107
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 98 transition count 107
Applied a total of 108 rules in 9 ms. Remains 98 /143 variables (removed 45) and now considering 107/311 (removed 204) transitions.
// Phase 1: matrix 107 rows 98 cols
[2023-03-19 17:51:33] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 17:51:33] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-19 17:51:33] [INFO ] Invariant cache hit.
[2023-03-19 17:51:33] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-19 17:51:33] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-03-19 17:51:33] [INFO ] Invariant cache hit.
[2023-03-19 17:51:33] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/143 places, 107/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 343 ms. Remains : 98/143 places, 107/311 transitions.
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (LT s3 1) (LT s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-15 finished in 563 ms.
All properties solved by simple procedures.
Total runtime 25039 ms.
ITS solved all properties within timeout
BK_STOP 1679248293833
--------------------
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
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-d2m18"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is SieveSingleMsgMbox-PT-d2m18, 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 r423-tajo-167905976800468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m18.tgz
mv SieveSingleMsgMbox-PT-d2m18 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 '
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 ;