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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 6.3K Feb 26 10:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 10:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 10:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 10:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 122K Feb 26 10:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 450K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679314888329

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-d1m18
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 12:21:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 12:21:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 12:21:30] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2023-03-20 12:21:30] [INFO ] Transformed 1295 places.
[2023-03-20 12:21:30] [INFO ] Transformed 749 transitions.
[2023-03-20 12:21:30] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 163 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 4 formulas.
Deduced a syphon composed of 1036 places in 7 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 305 place count 194 transition count 380
Iterating global reduction 1 with 48 rules applied. Total rules applied 353 place count 194 transition count 380
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 359 place count 194 transition count 374
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 391 place count 162 transition count 342
Iterating global reduction 2 with 32 rules applied. Total rules applied 423 place count 162 transition count 342
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 431 place count 162 transition count 334
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 448 place count 145 transition count 315
Iterating global reduction 3 with 17 rules applied. Total rules applied 465 place count 145 transition count 315
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 496 place count 145 transition count 284
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 500 place count 141 transition count 278
Iterating global reduction 4 with 4 rules applied. Total rules applied 504 place count 141 transition count 278
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 508 place count 137 transition count 274
Iterating global reduction 4 with 4 rules applied. Total rules applied 512 place count 137 transition count 274
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 514 place count 135 transition count 271
Iterating global reduction 4 with 2 rules applied. Total rules applied 516 place count 135 transition count 271
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 518 place count 133 transition count 269
Iterating global reduction 4 with 2 rules applied. Total rules applied 520 place count 133 transition count 269
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 522 place count 131 transition count 267
Iterating global reduction 4 with 2 rules applied. Total rules applied 524 place count 131 transition count 267
Applied a total of 524 rules in 67 ms. Remains 131 /259 variables (removed 128) and now considering 267/749 (removed 482) transitions.
// Phase 1: matrix 267 rows 131 cols
[2023-03-20 12:21:30] [INFO ] Computed 5 place invariants in 17 ms
[2023-03-20 12:21:30] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-20 12:21:30] [INFO ] Invariant cache hit.
[2023-03-20 12:21:30] [INFO ] State equation strengthened by 176 read => feed constraints.
[2023-03-20 12:21:31] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
[2023-03-20 12:21:31] [INFO ] Invariant cache hit.
[2023-03-20 12:21:31] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 131/259 places, 267/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 935 ms. Remains : 131/259 places, 267/749 transitions.
Support contains 20 out of 131 places after structural reductions.
[2023-03-20 12:21:31] [INFO ] Flatten gal took : 47 ms
[2023-03-20 12:21:31] [INFO ] Flatten gal took : 19 ms
[2023-03-20 12:21:31] [INFO ] Input system was already deterministic with 267 transitions.
Support contains 18 out of 131 places (down from 20) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2236 resets, run finished after 630 ms. (steps per millisecond=15 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 38 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 256409 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 7=1, 8=1, 10=1, 12=1, 14=1, 15=1, 16=1, 18=1, 20=1}
Probabilistic random walk after 256409 steps, saw 118718 distinct states, run finished after 3002 ms. (steps per millisecond=85 ) properties seen :14
Running SMT prover for 7 properties.
[2023-03-20 12:21:35] [INFO ] Invariant cache hit.
[2023-03-20 12:21:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 12:21:35] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 12:21:35] [INFO ] After 382ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 12:21:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:21:35] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:21:36] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 12:21:36] [INFO ] State equation strengthened by 176 read => feed constraints.
[2023-03-20 12:21:36] [INFO ] After 304ms SMT Verify possible using 176 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 12:21:37] [INFO ] After 879ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 657 ms.
[2023-03-20 12:21:37] [INFO ] After 1827ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 2 properties in 155 ms.
Support contains 5 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 267/267 transitions.
Graph (complete) has 471 edges and 131 vertex of which 130 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 130 transition count 265
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 15 place count 118 transition count 181
Iterating global reduction 1 with 12 rules applied. Total rules applied 27 place count 118 transition count 181
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 38 place count 118 transition count 170
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 47 place count 109 transition count 160
Iterating global reduction 2 with 9 rules applied. Total rules applied 56 place count 109 transition count 160
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 61 place count 109 transition count 155
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 67 place count 103 transition count 149
Iterating global reduction 3 with 6 rules applied. Total rules applied 73 place count 103 transition count 149
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 76 place count 103 transition count 146
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 78 place count 101 transition count 144
Iterating global reduction 4 with 2 rules applied. Total rules applied 80 place count 101 transition count 144
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 82 place count 99 transition count 142
Iterating global reduction 4 with 2 rules applied. Total rules applied 84 place count 99 transition count 142
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 86 place count 97 transition count 140
Iterating global reduction 4 with 2 rules applied. Total rules applied 88 place count 97 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 93 place count 97 transition count 135
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 95 place count 95 transition count 132
Iterating global reduction 5 with 2 rules applied. Total rules applied 97 place count 95 transition count 132
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 98 place count 94 transition count 131
Iterating global reduction 5 with 1 rules applied. Total rules applied 99 place count 94 transition count 131
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 100 place count 93 transition count 130
Iterating global reduction 5 with 1 rules applied. Total rules applied 101 place count 93 transition count 130
Applied a total of 101 rules in 49 ms. Remains 93 /131 variables (removed 38) and now considering 130/267 (removed 137) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 93/131 places, 130/267 transitions.
Incomplete random walk after 10000 steps, including 2241 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 500 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 464 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 511 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 351053 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 351053 steps, saw 153964 distinct states, run finished after 3002 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 130 rows 93 cols
[2023-03-20 12:21:41] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-20 12:21:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:21:41] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:21:41] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 12:21:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:21:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:21:41] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 12:21:41] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-20 12:21:41] [INFO ] After 87ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 12:21:42] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-20 12:21:42] [INFO ] After 479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 121 ms.
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 130/130 transitions.
Applied a total of 0 rules in 9 ms. Remains 93 /93 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 93/93 places, 130/130 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 130/130 transitions.
Applied a total of 0 rules in 8 ms. Remains 93 /93 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2023-03-20 12:21:42] [INFO ] Invariant cache hit.
[2023-03-20 12:21:42] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-20 12:21:42] [INFO ] Invariant cache hit.
[2023-03-20 12:21:42] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-20 12:21:42] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-03-20 12:21:42] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 12:21:42] [INFO ] Invariant cache hit.
[2023-03-20 12:21:42] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 341 ms. Remains : 93/93 places, 130/130 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 93 transition count 124
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 88 transition count 124
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 88 transition count 111
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 75 transition count 111
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 53 place count 67 transition count 103
Applied a total of 53 rules in 12 ms. Remains 67 /93 variables (removed 26) and now considering 103/130 (removed 27) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 103 rows 67 cols
[2023-03-20 12:21:42] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-20 12:21:42] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-20 12:21:42] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 12:21:42] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 12:21:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:21:42] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 12:21:42] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 12:21:42] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-20 12:21:43] [INFO ] After 238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 25 stabilizing places and 45 stable transitions
Graph (complete) has 520 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(F((G(p2)||p1))&&X(p3))))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 267/267 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 118 transition count 162
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 118 transition count 162
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 32 place count 118 transition count 156
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 42 place count 108 transition count 146
Iterating global reduction 1 with 10 rules applied. Total rules applied 52 place count 108 transition count 146
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 108 transition count 140
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 64 place count 102 transition count 134
Iterating global reduction 2 with 6 rules applied. Total rules applied 70 place count 102 transition count 134
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 102 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 101 transition count 130
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 101 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 76 place count 100 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 100 transition count 129
Applied a total of 77 rules in 10 ms. Remains 100 /131 variables (removed 31) and now considering 129/267 (removed 138) transitions.
// Phase 1: matrix 129 rows 100 cols
[2023-03-20 12:21:43] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-20 12:21:43] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-20 12:21:43] [INFO ] Invariant cache hit.
[2023-03-20 12:21:43] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-20 12:21:43] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2023-03-20 12:21:43] [INFO ] Invariant cache hit.
[2023-03-20 12:21:43] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/131 places, 129/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 415 ms. Remains : 100/131 places, 129/267 transitions.
Stuttering acceptance computed with spot in 462 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p2)), true, (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s94 1)), p0:(AND (OR (LT s1 1) (LT s94 1)) (OR (LT s1 1) (LT s95 1))), p3:(OR (LT s1 1) (LT s45 1)), p2:(OR (LT s1 1) (LT s94 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]]
Product exploration explored 100000 steps with 50000 reset in 409 ms.
Product exploration explored 100000 steps with 50000 reset in 264 ms.
Computed a total of 22 stabilizing places and 30 stable transitions
Graph (complete) has 330 edges and 100 vertex of which 99 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 22 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND p1 p0 p3 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p3))))
Knowledge based reduction with 11 factoid took 241 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-01 finished in 1880 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((X(F(p0)) U p1))))'
Support contains 2 out of 131 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 267/267 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 117 transition count 161
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 117 transition count 161
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 35 place count 117 transition count 154
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 46 place count 106 transition count 142
Iterating global reduction 1 with 11 rules applied. Total rules applied 57 place count 106 transition count 142
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 63 place count 106 transition count 136
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 70 place count 99 transition count 129
Iterating global reduction 2 with 7 rules applied. Total rules applied 77 place count 99 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 80 place count 99 transition count 126
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 82 place count 97 transition count 124
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 97 transition count 124
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 86 place count 95 transition count 122
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 91 transition count 117
Applied a total of 96 rules in 38 ms. Remains 91 /131 variables (removed 40) and now considering 117/267 (removed 150) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-20 12:21:45] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:21:45] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-20 12:21:45] [INFO ] Invariant cache hit.
[2023-03-20 12:21:45] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-20 12:21:45] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2023-03-20 12:21:45] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 12:21:45] [INFO ] Invariant cache hit.
[2023-03-20 12:21:45] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/131 places, 117/267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 377 ms. Remains : 91/131 places, 117/267 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-03 finished in 449 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&&F(G(p1))))))'
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 267/267 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 117 transition count 161
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 117 transition count 161
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 35 place count 117 transition count 154
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 46 place count 106 transition count 142
Iterating global reduction 1 with 11 rules applied. Total rules applied 57 place count 106 transition count 142
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 63 place count 106 transition count 136
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 70 place count 99 transition count 129
Iterating global reduction 2 with 7 rules applied. Total rules applied 77 place count 99 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 80 place count 99 transition count 126
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 82 place count 97 transition count 124
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 97 transition count 124
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 86 place count 95 transition count 122
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 91 transition count 117
Applied a total of 96 rules in 16 ms. Remains 91 /131 variables (removed 40) and now considering 117/267 (removed 150) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-20 12:21:45] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 12:21:45] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-20 12:21:45] [INFO ] Invariant cache hit.
[2023-03-20 12:21:45] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-20 12:21:45] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2023-03-20 12:21:45] [INFO ] Invariant cache hit.
[2023-03-20 12:21:46] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/131 places, 117/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 330 ms. Remains : 91/131 places, 117/267 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-04 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=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s85 1)), p1:(AND (GEQ s1 1) (GEQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-04 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(F(!p0)))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 267/267 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 116 transition count 150
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 116 transition count 150
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 35 place count 116 transition count 145
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 47 place count 104 transition count 132
Iterating global reduction 1 with 12 rules applied. Total rules applied 59 place count 104 transition count 132
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 66 place count 104 transition count 125
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 74 place count 96 transition count 117
Iterating global reduction 2 with 8 rules applied. Total rules applied 82 place count 96 transition count 117
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 86 place count 96 transition count 113
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 93 transition count 110
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 93 transition count 110
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 95 place count 90 transition count 107
Iterating global reduction 3 with 3 rules applied. Total rules applied 98 place count 90 transition count 107
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 88 transition count 105
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 88 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 104 place count 88 transition count 103
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 106 place count 86 transition count 100
Iterating global reduction 4 with 2 rules applied. Total rules applied 108 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 109 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 111 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 112 place count 84 transition count 98
Applied a total of 112 rules in 10 ms. Remains 84 /131 variables (removed 47) and now considering 98/267 (removed 169) transitions.
// Phase 1: matrix 98 rows 84 cols
[2023-03-20 12:21:46] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-20 12:21:46] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-20 12:21:46] [INFO ] Invariant cache hit.
[2023-03-20 12:21:46] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 12:21:46] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-03-20 12:21:46] [INFO ] Invariant cache hit.
[2023-03-20 12:21:46] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/131 places, 98/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 298 ms. Remains : 84/131 places, 98/267 transitions.
Stuttering acceptance computed with spot in 100 ms :[p0, p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-05 finished in 422 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 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 267/267 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 116 transition count 140
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 116 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 116 transition count 138
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 45 place count 103 transition count 124
Iterating global reduction 1 with 13 rules applied. Total rules applied 58 place count 103 transition count 124
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 66 place count 103 transition count 116
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 75 place count 94 transition count 107
Iterating global reduction 2 with 9 rules applied. Total rules applied 84 place count 94 transition count 107
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 89 place count 94 transition count 102
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 93 place count 90 transition count 98
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 90 transition count 98
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 101 place count 86 transition count 94
Iterating global reduction 3 with 4 rules applied. Total rules applied 105 place count 86 transition count 94
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 108 place count 83 transition count 91
Iterating global reduction 3 with 3 rules applied. Total rules applied 111 place count 83 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 113 place count 83 transition count 89
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 116 place count 80 transition count 85
Iterating global reduction 4 with 3 rules applied. Total rules applied 119 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 120 place count 79 transition count 84
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 79 transition count 84
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 78 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 78 transition count 83
Applied a total of 123 rules in 30 ms. Remains 78 /131 variables (removed 53) and now considering 83/267 (removed 184) transitions.
// Phase 1: matrix 83 rows 78 cols
[2023-03-20 12:21:46] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:21:46] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-20 12:21:46] [INFO ] Invariant cache hit.
[2023-03-20 12:21:46] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-20 12:21:46] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-20 12:21:46] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:21:46] [INFO ] Invariant cache hit.
[2023-03-20 12:21:46] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/131 places, 83/267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 288 ms. Remains : 78/131 places, 83/267 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-06 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 s67 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 22429 reset in 237 ms.
Product exploration explored 100000 steps with 22501 reset in 189 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 244 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 206 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 63 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2209 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 451 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3723 steps, run visited all 1 properties in 13 ms. (steps per millisecond=286 )
Probabilistic random walk after 3723 steps, saw 1653 distinct states, run finished after 14 ms. (steps per millisecond=265 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 203 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 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 83/83 transitions.
Applied a total of 0 rules in 21 ms. Remains 78 /78 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-20 12:21:48] [INFO ] Invariant cache hit.
[2023-03-20 12:21:48] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-20 12:21:48] [INFO ] Invariant cache hit.
[2023-03-20 12:21:48] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-20 12:21:48] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-20 12:21:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:21:48] [INFO ] Invariant cache hit.
[2023-03-20 12:21:48] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 312 ms. Remains : 78/78 places, 83/83 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 244 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 158 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 60 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2241 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 465 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3723 steps, run visited all 1 properties in 23 ms. (steps per millisecond=161 )
Probabilistic random walk after 3723 steps, saw 1653 distinct states, run finished after 23 ms. (steps per millisecond=161 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 180 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22461 reset in 142 ms.
Product exploration explored 100000 steps with 22475 reset in 135 ms.
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 83/83 transitions.
Applied a total of 0 rules in 7 ms. Remains 78 /78 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-20 12:21:49] [INFO ] Invariant cache hit.
[2023-03-20 12:21:49] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-20 12:21:49] [INFO ] Invariant cache hit.
[2023-03-20 12:21:49] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-20 12:21:49] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-20 12:21:49] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 12:21:49] [INFO ] Invariant cache hit.
[2023-03-20 12:21:49] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 284 ms. Remains : 78/78 places, 83/83 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-06 finished in 3022 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 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 267/267 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 116 transition count 142
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 116 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 116 transition count 138
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 46 place count 104 transition count 125
Iterating global reduction 1 with 12 rules applied. Total rules applied 58 place count 104 transition count 125
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 66 place count 104 transition count 117
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 74 place count 96 transition count 109
Iterating global reduction 2 with 8 rules applied. Total rules applied 82 place count 96 transition count 109
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 86 place count 96 transition count 105
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 90 place count 92 transition count 101
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 92 transition count 101
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 97 place count 89 transition count 98
Iterating global reduction 3 with 3 rules applied. Total rules applied 100 place count 89 transition count 98
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 102 place count 87 transition count 96
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 87 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 106 place count 87 transition count 94
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 108 place count 85 transition count 92
Iterating global reduction 4 with 2 rules applied. Total rules applied 110 place count 85 transition count 92
Applied a total of 110 rules in 9 ms. Remains 85 /131 variables (removed 46) and now considering 92/267 (removed 175) transitions.
// Phase 1: matrix 92 rows 85 cols
[2023-03-20 12:21:49] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-20 12:21:49] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-20 12:21:49] [INFO ] Invariant cache hit.
[2023-03-20 12:21:49] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-20 12:21:49] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2023-03-20 12:21:49] [INFO ] Invariant cache hit.
[2023-03-20 12:21:49] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/131 places, 92/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 314 ms. Remains : 85/131 places, 92/267 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s50 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 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-07 finished in 462 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(G(p0))&&F(p1))))'
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 267/267 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 117 transition count 151
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 117 transition count 151
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 117 transition count 146
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 45 place count 105 transition count 133
Iterating global reduction 1 with 12 rules applied. Total rules applied 57 place count 105 transition count 133
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 64 place count 105 transition count 126
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 72 place count 97 transition count 118
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 97 transition count 118
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 84 place count 97 transition count 114
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 94 transition count 111
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 94 transition count 111
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 93 place count 91 transition count 108
Iterating global reduction 3 with 3 rules applied. Total rules applied 96 place count 91 transition count 108
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 98 place count 89 transition count 106
Iterating global reduction 3 with 2 rules applied. Total rules applied 100 place count 89 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 102 place count 89 transition count 104
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 104 place count 87 transition count 101
Iterating global reduction 4 with 2 rules applied. Total rules applied 106 place count 87 transition count 101
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 86 transition count 100
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 109 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 85 transition count 99
Applied a total of 110 rules in 31 ms. Remains 85 /131 variables (removed 46) and now considering 99/267 (removed 168) transitions.
// Phase 1: matrix 99 rows 85 cols
[2023-03-20 12:21:50] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-20 12:21:50] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-20 12:21:50] [INFO ] Invariant cache hit.
[2023-03-20 12:21:50] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-20 12:21:50] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2023-03-20 12:21:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:21:50] [INFO ] Invariant cache hit.
[2023-03-20 12:21:50] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/131 places, 99/267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 335 ms. Remains : 85/131 places, 99/267 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-09 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=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s34 1)), p1:(AND (GEQ s1 1) (GEQ s80 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-d1m18-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-09 finished in 456 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)) U (X(p1)&&G(!p2))))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 267/267 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 118 transition count 162
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 118 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 118 transition count 158
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 41 place count 107 transition count 146
Iterating global reduction 1 with 11 rules applied. Total rules applied 52 place count 107 transition count 146
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 107 transition count 140
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 65 place count 100 transition count 133
Iterating global reduction 2 with 7 rules applied. Total rules applied 72 place count 100 transition count 133
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 75 place count 100 transition count 130
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 77 place count 98 transition count 128
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 98 transition count 128
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 81 place count 96 transition count 126
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 96 transition count 126
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 95 transition count 125
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 95 transition count 125
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 94 transition count 123
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 94 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 93 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 93 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 92 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 92 transition count 121
Applied a total of 91 rules in 21 ms. Remains 92 /131 variables (removed 39) and now considering 121/267 (removed 146) transitions.
// Phase 1: matrix 121 rows 92 cols
[2023-03-20 12:21:50] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:21:50] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-20 12:21:50] [INFO ] Invariant cache hit.
[2023-03-20 12:21:50] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-20 12:21:50] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-20 12:21:50] [INFO ] Invariant cache hit.
[2023-03-20 12:21:50] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/131 places, 121/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 382 ms. Remains : 92/131 places, 121/267 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p1) p2), (NOT p0), (NOT p0), (NOT p1), p2]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={0} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={0} source=4 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s71 1)), p0:(AND (GEQ s1 1) (GEQ s86 1)), p1:(AND (GEQ s1 1) (GEQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-10 finished in 669 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||F(p1)) U !p2)))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 267/267 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 118 transition count 162
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 118 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 118 transition count 158
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 41 place count 107 transition count 146
Iterating global reduction 1 with 11 rules applied. Total rules applied 52 place count 107 transition count 146
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 107 transition count 140
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 65 place count 100 transition count 133
Iterating global reduction 2 with 7 rules applied. Total rules applied 72 place count 100 transition count 133
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 75 place count 100 transition count 130
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 77 place count 98 transition count 128
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 98 transition count 128
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 81 place count 96 transition count 126
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 96 transition count 126
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 95 transition count 125
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 95 transition count 125
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 94 transition count 123
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 94 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 93 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 93 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 92 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 92 transition count 121
Applied a total of 91 rules in 23 ms. Remains 92 /131 variables (removed 39) and now considering 121/267 (removed 146) transitions.
// Phase 1: matrix 121 rows 92 cols
[2023-03-20 12:21:51] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:21:51] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-20 12:21:51] [INFO ] Invariant cache hit.
[2023-03-20 12:21:51] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-20 12:21:51] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2023-03-20 12:21:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:21:51] [INFO ] Invariant cache hit.
[2023-03-20 12:21:51] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/131 places, 121/267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 425 ms. Remains : 92/131 places, 121/267 transitions.
Stuttering acceptance computed with spot in 206 ms :[p2, (NOT p1), p2]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s85 1)), p0:(AND (GEQ s1 1) (GEQ s70 1)), p1:(AND (GEQ s1 1) (GEQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 22385 reset in 168 ms.
Product exploration explored 100000 steps with 22244 reset in 157 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 306 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 425 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[p2, (NOT p1), p2]
Incomplete random walk after 10000 steps, including 2204 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 501 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 487 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1887190 steps, run timeout after 3001 ms. (steps per millisecond=628 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 1887190 steps, saw 818484 distinct states, run finished after 3001 ms. (steps per millisecond=628 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-20 12:21:56] [INFO ] Invariant cache hit.
[2023-03-20 12:21:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:21:56] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 12:21:56] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:21:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:21:56] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 12:21:56] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 12:21:56] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-20 12:21:56] [INFO ] After 18ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 12:21:56] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-20 12:21:56] [INFO ] After 131ms 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 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 121/121 transitions.
Graph (complete) has 272 edges and 92 vertex of which 91 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 91 transition count 119
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 89 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 89 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 89 transition count 106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 88 transition count 105
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 88 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 88 transition count 104
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 13 place count 87 transition count 103
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 87 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 16 place count 86 transition count 101
Iterating global reduction 4 with 1 rules applied. Total rules applied 17 place count 86 transition count 101
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 18 place count 85 transition count 100
Iterating global reduction 4 with 1 rules applied. Total rules applied 19 place count 85 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 20 place count 84 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 84 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 23 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 24 place count 83 transition count 96
Iterating global reduction 5 with 1 rules applied. Total rules applied 25 place count 83 transition count 96
Applied a total of 25 rules in 13 ms. Remains 83 /92 variables (removed 9) and now considering 96/121 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 83/92 places, 96/121 transitions.
Incomplete random walk after 10000 steps, including 2230 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1119910 steps, run visited all 1 properties in 1448 ms. (steps per millisecond=773 )
Probabilistic random walk after 1119910 steps, saw 497317 distinct states, run finished after 1451 ms. (steps per millisecond=771 ) properties seen :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F p1), (F p2)]
Knowledge based reduction with 7 factoid took 463 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[p2, (NOT p1), p2]
Stuttering acceptance computed with spot in 140 ms :[p2, (NOT p1), p2]
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2023-03-20 12:21:58] [INFO ] Invariant cache hit.
[2023-03-20 12:21:58] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-20 12:21:58] [INFO ] Invariant cache hit.
[2023-03-20 12:21:58] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-20 12:21:58] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2023-03-20 12:21:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:21:58] [INFO ] Invariant cache hit.
[2023-03-20 12:21:58] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 348 ms. Remains : 92/92 places, 121/121 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 306 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 271 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[p2, (NOT p1), p2]
Incomplete random walk after 10000 steps, including 2219 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 441 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 2019667 steps, run timeout after 3001 ms. (steps per millisecond=672 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 2019667 steps, saw 870878 distinct states, run finished after 3001 ms. (steps per millisecond=672 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-20 12:22:02] [INFO ] Invariant cache hit.
[2023-03-20 12:22:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:22:02] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 12:22:02] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 12:22:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:22:02] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 12:22:02] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 12:22:02] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-20 12:22:02] [INFO ] After 18ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 12:22:02] [INFO ] After 36ms 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 12:22:02] [INFO ] After 123ms 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 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 121/121 transitions.
Graph (complete) has 272 edges and 92 vertex of which 91 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 91 transition count 119
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 89 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 89 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 89 transition count 106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 88 transition count 105
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 88 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 88 transition count 104
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 13 place count 87 transition count 103
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 87 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 16 place count 86 transition count 101
Iterating global reduction 4 with 1 rules applied. Total rules applied 17 place count 86 transition count 101
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 18 place count 85 transition count 100
Iterating global reduction 4 with 1 rules applied. Total rules applied 19 place count 85 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 20 place count 84 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 84 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 23 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 24 place count 83 transition count 96
Iterating global reduction 5 with 1 rules applied. Total rules applied 25 place count 83 transition count 96
Applied a total of 25 rules in 15 ms. Remains 83 /92 variables (removed 9) and now considering 96/121 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 83/92 places, 96/121 transitions.
Incomplete random walk after 10000 steps, including 2243 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 474 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1119910 steps, run visited all 1 properties in 1712 ms. (steps per millisecond=654 )
Probabilistic random walk after 1119910 steps, saw 497317 distinct states, run finished after 1712 ms. (steps per millisecond=654 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p2 (NOT p1))), (F p1), (F p2)]
Knowledge based reduction with 7 factoid took 424 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[p2, (NOT p1), p2]
Stuttering acceptance computed with spot in 110 ms :[p2, (NOT p1), p2]
Stuttering acceptance computed with spot in 135 ms :[p2, (NOT p1), p2]
Product exploration explored 100000 steps with 22477 reset in 112 ms.
Product exploration explored 100000 steps with 22434 reset in 126 ms.
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 121/121 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2023-03-20 12:22:05] [INFO ] Invariant cache hit.
[2023-03-20 12:22:05] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-20 12:22:05] [INFO ] Invariant cache hit.
[2023-03-20 12:22:05] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-20 12:22:05] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-03-20 12:22:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:22:05] [INFO ] Invariant cache hit.
[2023-03-20 12:22:05] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 385 ms. Remains : 92/92 places, 121/121 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-12 finished in 14604 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((p1 U p2))&&(F(!p2)||p3)&&p0)))'
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 267/267 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 117 transition count 161
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 117 transition count 161
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 35 place count 117 transition count 154
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 46 place count 106 transition count 142
Iterating global reduction 1 with 11 rules applied. Total rules applied 57 place count 106 transition count 142
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 63 place count 106 transition count 136
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 70 place count 99 transition count 129
Iterating global reduction 2 with 7 rules applied. Total rules applied 77 place count 99 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 80 place count 99 transition count 126
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 82 place count 97 transition count 124
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 97 transition count 124
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 86 place count 95 transition count 122
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 91 transition count 117
Applied a total of 96 rules in 10 ms. Remains 91 /131 variables (removed 40) and now considering 117/267 (removed 150) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-20 12:22:05] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 12:22:06] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-20 12:22:06] [INFO ] Invariant cache hit.
[2023-03-20 12:22:06] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-20 12:22:06] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
[2023-03-20 12:22:06] [INFO ] Invariant cache hit.
[2023-03-20 12:22:06] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/131 places, 117/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 602 ms. Remains : 91/131 places, 117/267 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), true, (NOT p2), (NOT p2), p2]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(OR p2 p1), acceptance={} source=4 dest: 4}], [{ cond=p2, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s85 1)), p2:(AND (GEQ s1 1) (GEQ s85 1)), p1:(AND (GEQ s1 1) (GEQ s86 1)), p3:(OR (LT s1 1) (LT s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-13 finished in 901 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' '!(G(((p0||F(p1)) U !p2)))'
[2023-03-20 12:22:07] [INFO ] Flatten gal took : 26 ms
[2023-03-20 12:22:07] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 12:22:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 131 places, 267 transitions and 1054 arcs took 5 ms.
Total runtime 37053 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1153/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1153/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m18-LTLFireability-06
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m18-LTLFireability-12

BK_STOP 1679314927632

--------------------
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-d1m18-LTLFireability-06
ltl formula formula --ltl=/tmp/1153/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 131 places, 267 transitions and 1054 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1153/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1153/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1153/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.000 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1153/ltl_0_
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-d1m18-LTLFireability-12
ltl formula formula --ltl=/tmp/1153/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 131 places, 267 transitions and 1054 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1153/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1153/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1153/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1153/ltl_1_
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)

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

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