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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 6.6K Feb 26 10:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 10:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 10:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 10:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 10:27 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-d1m06-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679314444467

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-d1m06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 12:14:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 12:14:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 12:14:06] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2023-03-20 12:14:06] [INFO ] Transformed 1295 places.
[2023-03-20 12:14:06] [INFO ] Transformed 749 transitions.
[2023-03-20 12:14:06] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1036 places in 8 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 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 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 302 place count 197 transition count 396
Iterating global reduction 1 with 45 rules applied. Total rules applied 347 place count 197 transition count 396
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 351 place count 197 transition count 392
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 378 place count 170 transition count 365
Iterating global reduction 2 with 27 rules applied. Total rules applied 405 place count 170 transition count 365
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 413 place count 170 transition count 357
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 427 place count 156 transition count 343
Iterating global reduction 3 with 14 rules applied. Total rules applied 441 place count 156 transition count 343
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 483 place count 156 transition count 301
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 487 place count 152 transition count 295
Iterating global reduction 4 with 4 rules applied. Total rules applied 491 place count 152 transition count 295
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 495 place count 148 transition count 291
Iterating global reduction 4 with 4 rules applied. Total rules applied 499 place count 148 transition count 291
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 500 place count 147 transition count 290
Iterating global reduction 4 with 1 rules applied. Total rules applied 501 place count 147 transition count 290
Applied a total of 501 rules in 66 ms. Remains 147 /259 variables (removed 112) and now considering 290/749 (removed 459) transitions.
// Phase 1: matrix 290 rows 147 cols
[2023-03-20 12:14:06] [INFO ] Computed 5 place invariants in 24 ms
[2023-03-20 12:14:06] [INFO ] Implicit Places using invariants in 230 ms returned []
[2023-03-20 12:14:06] [INFO ] Invariant cache hit.
[2023-03-20 12:14:06] [INFO ] State equation strengthened by 185 read => feed constraints.
[2023-03-20 12:14:07] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
[2023-03-20 12:14:07] [INFO ] Invariant cache hit.
[2023-03-20 12:14:07] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 147/259 places, 290/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 929 ms. Remains : 147/259 places, 290/749 transitions.
Support contains 31 out of 147 places after structural reductions.
[2023-03-20 12:14:07] [INFO ] Flatten gal took : 44 ms
[2023-03-20 12:14:07] [INFO ] Flatten gal took : 25 ms
[2023-03-20 12:14:07] [INFO ] Input system was already deterministic with 290 transitions.
Support contains 29 out of 147 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2226 resets, run finished after 691 ms. (steps per millisecond=14 ) properties (out of 25) seen :2
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 96 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 101 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 23) seen :0
Interrupted probabilistic random walk after 406599 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{1=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 9=1, 11=1, 12=1, 13=1, 14=1, 15=1, 17=1, 19=1, 20=1, 21=1}
Probabilistic random walk after 406599 steps, saw 154495 distinct states, run finished after 3002 ms. (steps per millisecond=135 ) properties seen :17
Running SMT prover for 6 properties.
[2023-03-20 12:14:11] [INFO ] Invariant cache hit.
[2023-03-20 12:14:11] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 12:14:11] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-20 12:14:12] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2023-03-20 12:14:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 12:14:12] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 12:14:12] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-20 12:14:12] [INFO ] State equation strengthened by 185 read => feed constraints.
[2023-03-20 12:14:12] [INFO ] After 96ms SMT Verify possible using 185 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-03-20 12:14:12] [INFO ] After 230ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 166 ms.
[2023-03-20 12:14:12] [INFO ] After 647ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 8 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 290/290 transitions.
Graph (complete) has 520 edges and 147 vertex of which 146 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 146 transition count 288
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 128 transition count 160
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 128 transition count 160
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 128 transition count 158
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 57 place count 112 transition count 141
Iterating global reduction 2 with 16 rules applied. Total rules applied 73 place count 112 transition count 141
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 83 place count 112 transition count 131
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 91 place count 104 transition count 123
Iterating global reduction 3 with 8 rules applied. Total rules applied 99 place count 104 transition count 123
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 103 place count 104 transition count 119
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 106 place count 101 transition count 116
Iterating global reduction 4 with 3 rules applied. Total rules applied 109 place count 101 transition count 116
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 112 place count 98 transition count 113
Iterating global reduction 4 with 3 rules applied. Total rules applied 115 place count 98 transition count 113
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 96 transition count 111
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 96 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 121 place count 96 transition count 109
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 123 place count 94 transition count 107
Iterating global reduction 5 with 2 rules applied. Total rules applied 125 place count 94 transition count 107
Applied a total of 125 rules in 36 ms. Remains 94 /147 variables (removed 53) and now considering 107/290 (removed 183) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 94/147 places, 107/290 transitions.
Incomplete random walk after 10000 steps, including 2262 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 1041 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 1011 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 471 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 1023 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Finished probabilistic random walk after 163846 steps, run visited all 5 properties in 1112 ms. (steps per millisecond=147 )
Probabilistic random walk after 163846 steps, saw 64640 distinct states, run finished after 1112 ms. (steps per millisecond=147 ) properties seen :5
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 35 stabilizing places and 60 stable transitions
Graph (complete) has 574 edges and 147 vertex of which 146 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(F(p1))||p0))))'
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 290/290 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 125 transition count 156
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 125 transition count 156
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 125 transition count 153
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 66 place count 106 transition count 132
Iterating global reduction 1 with 19 rules applied. Total rules applied 85 place count 106 transition count 132
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 97 place count 106 transition count 120
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 107 place count 96 transition count 109
Iterating global reduction 2 with 10 rules applied. Total rules applied 117 place count 96 transition count 109
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 122 place count 96 transition count 104
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 126 place count 92 transition count 100
Iterating global reduction 3 with 4 rules applied. Total rules applied 130 place count 92 transition count 100
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 134 place count 88 transition count 96
Iterating global reduction 3 with 4 rules applied. Total rules applied 138 place count 88 transition count 96
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 140 place count 86 transition count 94
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 86 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 144 place count 86 transition count 92
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 146 place count 84 transition count 90
Iterating global reduction 4 with 2 rules applied. Total rules applied 148 place count 84 transition count 90
Applied a total of 148 rules in 20 ms. Remains 84 /147 variables (removed 63) and now considering 90/290 (removed 200) transitions.
// Phase 1: matrix 90 rows 84 cols
[2023-03-20 12:14:14] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-20 12:14:15] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-20 12:14:15] [INFO ] Invariant cache hit.
[2023-03-20 12:14:15] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-20 12:14:15] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2023-03-20 12:14:15] [INFO ] Invariant cache hit.
[2023-03-20 12:14:15] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/147 places, 90/290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 312 ms. Remains : 84/147 places, 90/290 transitions.
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s8 1) (LT s26 1)), p1:(AND (GEQ s12 1) (GEQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 314 ms.
Product exploration explored 100000 steps with 50000 reset in 232 ms.
Computed a total of 20 stabilizing places and 25 stable transitions
Graph (complete) has 263 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Computed a total of 20 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-00 finished in 1261 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 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 290/290 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 125 transition count 157
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 125 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 125 transition count 154
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 66 place count 106 transition count 133
Iterating global reduction 1 with 19 rules applied. Total rules applied 85 place count 106 transition count 133
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 98 place count 106 transition count 120
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 107 place count 97 transition count 110
Iterating global reduction 2 with 9 rules applied. Total rules applied 116 place count 97 transition count 110
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 121 place count 97 transition count 105
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 125 place count 93 transition count 101
Iterating global reduction 3 with 4 rules applied. Total rules applied 129 place count 93 transition count 101
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 133 place count 89 transition count 97
Iterating global reduction 3 with 4 rules applied. Total rules applied 137 place count 89 transition count 97
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 140 place count 86 transition count 94
Iterating global reduction 3 with 3 rules applied. Total rules applied 143 place count 86 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 145 place count 86 transition count 92
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 148 place count 83 transition count 89
Iterating global reduction 4 with 3 rules applied. Total rules applied 151 place count 83 transition count 89
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 152 place count 82 transition count 87
Iterating global reduction 4 with 1 rules applied. Total rules applied 153 place count 82 transition count 87
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 154 place count 81 transition count 86
Iterating global reduction 4 with 1 rules applied. Total rules applied 155 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 156 place count 80 transition count 85
Iterating global reduction 4 with 1 rules applied. Total rules applied 157 place count 80 transition count 85
Applied a total of 157 rules in 50 ms. Remains 80 /147 variables (removed 67) and now considering 85/290 (removed 205) transitions.
// Phase 1: matrix 85 rows 80 cols
[2023-03-20 12:14:16] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 12:14:16] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-20 12:14:16] [INFO ] Invariant cache hit.
[2023-03-20 12:14:16] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-20 12:14:16] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2023-03-20 12:14:16] [INFO ] Invariant cache hit.
[2023-03-20 12:14:16] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/147 places, 85/290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 376 ms. Remains : 80/147 places, 85/290 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-01 finished in 466 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(p2)&&p1)) U p3))'
Support contains 6 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 290/290 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 128 transition count 177
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 128 transition count 177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 128 transition count 174
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 57 place count 112 transition count 156
Iterating global reduction 1 with 16 rules applied. Total rules applied 73 place count 112 transition count 156
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 86 place count 112 transition count 143
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 94 place count 104 transition count 135
Iterating global reduction 2 with 8 rules applied. Total rules applied 102 place count 104 transition count 135
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 106 place count 104 transition count 131
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 102 transition count 129
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 102 transition count 129
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 100 transition count 127
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 100 transition count 127
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 99 transition count 126
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 99 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 119 place count 99 transition count 123
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 120 place count 98 transition count 122
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 98 transition count 122
Applied a total of 121 rules in 17 ms. Remains 98 /147 variables (removed 49) and now considering 122/290 (removed 168) transitions.
// Phase 1: matrix 122 rows 98 cols
[2023-03-20 12:14:16] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-20 12:14:16] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-20 12:14:16] [INFO ] Invariant cache hit.
[2023-03-20 12:14:16] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-20 12:14:16] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-03-20 12:14:16] [INFO ] Invariant cache hit.
[2023-03-20 12:14:16] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/147 places, 122/290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 353 ms. Remains : 98/147 places, 122/290 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p3), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(AND (GEQ s10 1) (GEQ s31 1)), p1:(AND (GEQ s1 1) (GEQ s63 1)), p2:(AND (GEQ s1 1) (GEQ s63 1)), p0:(OR (AND (GEQ s1 1) (GEQ s93 1)) (AND (GEQ s1 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-02 finished in 564 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((X(F(p0))||F(p1))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 290/290 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 126 transition count 166
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 126 transition count 166
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 126 transition count 163
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 63 place count 108 transition count 143
Iterating global reduction 1 with 18 rules applied. Total rules applied 81 place count 108 transition count 143
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 92 place count 108 transition count 132
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 101 place count 99 transition count 122
Iterating global reduction 2 with 9 rules applied. Total rules applied 110 place count 99 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 114 place count 99 transition count 118
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 96 transition count 115
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 96 transition count 115
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 123 place count 93 transition count 112
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 93 transition count 112
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 128 place count 91 transition count 110
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 91 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 132 place count 91 transition count 108
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 134 place count 89 transition count 106
Iterating global reduction 4 with 2 rules applied. Total rules applied 136 place count 89 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 137 place count 88 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 88 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 87 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 87 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 141 place count 86 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 142 place count 86 transition count 102
Applied a total of 142 rules in 44 ms. Remains 86 /147 variables (removed 61) and now considering 102/290 (removed 188) transitions.
// Phase 1: matrix 102 rows 86 cols
[2023-03-20 12:14:17] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 12:14:17] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-20 12:14:17] [INFO ] Invariant cache hit.
[2023-03-20 12:14:17] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 12:14:17] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2023-03-20 12:14:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:14:17] [INFO ] Invariant cache hit.
[2023-03-20 12:14:17] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/147 places, 102/290 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 331 ms. Remains : 86/147 places, 102/290 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s81 1)), p0:(AND (GEQ s17 1) (GEQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22432 reset in 182 ms.
Product exploration explored 100000 steps with 22457 reset in 147 ms.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 277 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2225 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 466 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 484 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Finished probabilistic random walk after 3732 steps, run visited all 2 properties in 21 ms. (steps per millisecond=177 )
Probabilistic random walk after 3732 steps, saw 1673 distinct states, run finished after 21 ms. (steps per millisecond=177 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 219 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 102/102 transitions.
Applied a total of 0 rules in 5 ms. Remains 86 /86 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-20 12:14:18] [INFO ] Invariant cache hit.
[2023-03-20 12:14:18] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-20 12:14:18] [INFO ] Invariant cache hit.
[2023-03-20 12:14:18] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 12:14:19] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2023-03-20 12:14:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:14:19] [INFO ] Invariant cache hit.
[2023-03-20 12:14:19] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 335 ms. Remains : 86/86 places, 102/102 transitions.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 277 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2257 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 496 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 461 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Finished probabilistic random walk after 3732 steps, run visited all 2 properties in 22 ms. (steps per millisecond=169 )
Probabilistic random walk after 3732 steps, saw 1673 distinct states, run finished after 23 ms. (steps per millisecond=162 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 22398 reset in 152 ms.
Product exploration explored 100000 steps with 22358 reset in 143 ms.
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 102/102 transitions.
Applied a total of 0 rules in 6 ms. Remains 86 /86 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-20 12:14:20] [INFO ] Invariant cache hit.
[2023-03-20 12:14:20] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-20 12:14:20] [INFO ] Invariant cache hit.
[2023-03-20 12:14:20] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 12:14:20] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2023-03-20 12:14:20] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 12:14:20] [INFO ] Invariant cache hit.
[2023-03-20 12:14:20] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 319 ms. Remains : 86/86 places, 102/102 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-05 finished in 3576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (!p0&&G(!p1))))'
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 290/290 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 126 transition count 166
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 126 transition count 166
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 126 transition count 164
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 63 place count 107 transition count 143
Iterating global reduction 1 with 19 rules applied. Total rules applied 82 place count 107 transition count 143
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 95 place count 107 transition count 130
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 104 place count 98 transition count 120
Iterating global reduction 2 with 9 rules applied. Total rules applied 113 place count 98 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 117 place count 98 transition count 116
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 120 place count 95 transition count 113
Iterating global reduction 3 with 3 rules applied. Total rules applied 123 place count 95 transition count 113
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 92 transition count 110
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 92 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 91 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 91 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 133 place count 91 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 90 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 90 transition count 106
Applied a total of 135 rules in 30 ms. Remains 90 /147 variables (removed 57) and now considering 106/290 (removed 184) transitions.
// Phase 1: matrix 106 rows 90 cols
[2023-03-20 12:14:20] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:14:20] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-20 12:14:20] [INFO ] Invariant cache hit.
[2023-03-20 12:14:20] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-20 12:14:21] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2023-03-20 12:14:21] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 12:14:21] [INFO ] Invariant cache hit.
[2023-03-20 12:14:21] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/147 places, 106/290 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 367 ms. Remains : 90/147 places, 106/290 transitions.
Stuttering acceptance computed with spot in 131 ms :[p1, true, (OR p0 p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (GEQ s1 1) (GEQ s85 1)), p0:(AND (GEQ s1 1) (GEQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 22488 reset in 131 ms.
Product exploration explored 100000 steps with 22548 reset in 196 ms.
Computed a total of 19 stabilizing places and 25 stable transitions
Graph (complete) has 289 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 385 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, p1, p1]
Incomplete random walk after 10000 steps, including 2280 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 451 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3731 steps, run visited all 1 properties in 10 ms. (steps per millisecond=373 )
Probabilistic random walk after 3731 steps, saw 1672 distinct states, run finished after 10 ms. (steps per millisecond=373 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 10 factoid took 439 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 112 ms :[true, p1, p1]
Support contains 2 out of 90 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 106/106 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2023-03-20 12:14:22] [INFO ] Invariant cache hit.
[2023-03-20 12:14:22] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-20 12:14:22] [INFO ] Invariant cache hit.
[2023-03-20 12:14:22] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-20 12:14:22] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2023-03-20 12:14:22] [INFO ] Invariant cache hit.
[2023-03-20 12:14:23] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 316 ms. Remains : 90/90 places, 106/106 transitions.
Computed a total of 19 stabilizing places and 25 stable transitions
Graph (complete) has 289 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 19 stabilizing places and 25 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, p1, p1]
Incomplete random walk after 10000 steps, including 2227 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3731 steps, run visited all 1 properties in 11 ms. (steps per millisecond=339 )
Probabilistic random walk after 3731 steps, saw 1672 distinct states, run finished after 11 ms. (steps per millisecond=339 ) properties seen :1
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 88 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 97 ms :[true, p1, p1]
Product exploration explored 100000 steps with 22422 reset in 176 ms.
Product exploration explored 100000 steps with 22496 reset in 157 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 77 ms :[true, p1, p1]
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 106/106 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 89 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 88 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 87 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 86 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 85 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 84 transition count 98
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 84 transition count 98
Applied a total of 13 rules in 20 ms. Remains 84 /90 variables (removed 6) and now considering 98/106 (removed 8) transitions.
[2023-03-20 12:14:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2023-03-20 12:14:24] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:14:24] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/90 places, 98/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 84/90 places, 98/106 transitions.
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 106/106 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 89 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 88 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 87 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 86 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 85 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 84 transition count 98
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 84 transition count 98
Applied a total of 13 rules in 8 ms. Remains 84 /90 variables (removed 6) and now considering 98/106 (removed 8) transitions.
[2023-03-20 12:14:24] [INFO ] Invariant cache hit.
[2023-03-20 12:14:24] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-20 12:14:24] [INFO ] Invariant cache hit.
[2023-03-20 12:14:24] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 12:14:24] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-20 12:14:24] [INFO ] Invariant cache hit.
[2023-03-20 12:14:24] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/90 places, 98/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 207 ms. Remains : 84/90 places, 98/106 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-06 finished in 3954 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(p1)&&p0)))'
Support contains 5 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 290/290 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 126 transition count 166
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 126 transition count 166
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 126 transition count 164
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 62 place count 108 transition count 144
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 108 transition count 144
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 92 place count 108 transition count 132
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 100 place count 100 transition count 123
Iterating global reduction 2 with 8 rules applied. Total rules applied 108 place count 100 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 111 place count 100 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 113 place count 98 transition count 118
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 98 transition count 118
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 117 place count 96 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 96 transition count 116
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 95 transition count 115
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 95 transition count 115
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 94 transition count 114
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 94 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 93 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 93 transition count 112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 92 transition count 111
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 92 transition count 111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 91 transition count 110
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 91 transition count 110
Applied a total of 129 rules in 17 ms. Remains 91 /147 variables (removed 56) and now considering 110/290 (removed 180) transitions.
// Phase 1: matrix 110 rows 91 cols
[2023-03-20 12:14:24] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:14:24] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-20 12:14:24] [INFO ] Invariant cache hit.
[2023-03-20 12:14:24] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-20 12:14:24] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-20 12:14:24] [INFO ] Invariant cache hit.
[2023-03-20 12:14:24] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/147 places, 110/290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 267 ms. Remains : 91/147 places, 110/290 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (AND (GEQ s21 1) (GEQ s60 1)) (AND (GEQ s1 1) (GEQ s55 1))), p0:(AND (GEQ s1 1) (GEQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-07 finished in 413 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 U G(p1)) U (p2||X(G(p3)))))))'
Support contains 5 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 290/290 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 127 transition count 185
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 127 transition count 185
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 127 transition count 182
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 60 place count 110 transition count 163
Iterating global reduction 1 with 17 rules applied. Total rules applied 77 place count 110 transition count 163
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 90 place count 110 transition count 150
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 96 place count 104 transition count 143
Iterating global reduction 2 with 6 rules applied. Total rules applied 102 place count 104 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 104 place count 104 transition count 141
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 103 transition count 140
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 103 transition count 140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 102 transition count 139
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 102 transition count 139
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 109 place count 101 transition count 138
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 101 transition count 138
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 100 transition count 137
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 100 transition count 137
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 113 place count 99 transition count 135
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 99 transition count 135
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 98 transition count 134
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 98 transition count 134
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 117 place count 97 transition count 133
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 97 transition count 133
Applied a total of 118 rules in 58 ms. Remains 97 /147 variables (removed 50) and now considering 133/290 (removed 157) transitions.
// Phase 1: matrix 133 rows 97 cols
[2023-03-20 12:14:25] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 12:14:25] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-20 12:14:25] [INFO ] Invariant cache hit.
[2023-03-20 12:14:25] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-20 12:14:25] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2023-03-20 12:14:25] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 12:14:25] [INFO ] Invariant cache hit.
[2023-03-20 12:14:25] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/147 places, 133/290 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 340 ms. Remains : 97/147 places, 133/290 transitions.
Stuttering acceptance computed with spot in 409 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) p0 (NOT p3))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0, 2} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=0 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={1, 2} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1, 2} source=0 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0, 1, 2} source=0 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1, 2} source=0 dest: 4}], [{ cond=(NOT p3), acceptance={0, 2} source=1 dest: 0}, { cond=(OR (AND p2 p3) (AND p1 p3) (AND p0 p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) p3), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0 p3), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={0, 1} source=1 dest: 2}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={1, 2} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={0, 1, 2} source=1 dest: 2}, { cond=(OR (AND (NOT p2) p1 p3) (AND (NOT p2) p0 p3)), acceptance={0, 1} source=1 dest: 3}, { cond=(OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) p0 (NOT p3))), acceptance={0, 1, 2} source=1 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0) p3), acceptance={1} source=1 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={1, 2} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0, 2} source=2 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0) p3), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) p3), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND p2 p1 p0 p3), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1) p0 p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0 p3), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={1, 2} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND p2 p1 (NOT p0) p3), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0) p3), acceptance={1} source=2 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={1, 2} source=2 dest: 4}, { cond=(AND p1 p0 (NOT p3)), acceptance={2} source=2 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0, 2} source=2 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={2} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) p3), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND (NOT p2) p1 p0 p3), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={1, 2} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p1 p3) (AND (NOT p2) p0 p3)), acceptance={0, 1} source=3 dest: 3}, { cond=(OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) p0 (NOT p3))), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0) p3), acceptance={1} source=3 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={1, 2} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0, 2} source=4 dest: 0}, { cond=(OR (AND p2 (NOT p1) p3) (AND (NOT p1) p0 p3)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) p3), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(AND (NOT p2) p1 p0 p3), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={1, 2} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={0, 1, 2} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={0, 1, 2} source=4 dest: 3}, { cond=(OR (AND p2 p1 p3) (AND p1 p0 p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0) p3), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={1, 2} source=4 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={2} source=4 dest: 6}, { cond=(AND (NOT p2) p1 p0 p3), acceptance={1} source=4 dest: 7}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={1, 2} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 2} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={1, 2} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1, 2} source=5 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1, 2} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={2} source=5 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0, 2} source=5 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={2} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0, 2} source=6 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=6 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={1, 2} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1, 2} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1, 2} source=6 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1, 2} source=6 dest: 4}, { cond=p1, acceptance={2} source=6 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={1, 2} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={0, 1} source=7 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={0, 1, 2} source=7 dest: 3}, { cond=(AND (NOT p2) p1 p0 p3), acceptance={1} source=7 dest: 7}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={1, 2} source=7 dest: 7}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s80 1)), p1:(AND (GEQ s1 1) (GEQ s92 1)), p0:(AND (GEQ s1 1) (GEQ s90 1)), p3:(AND (GEQ s1 1) (GEQ s91 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-08 finished in 784 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(F(p1))))))'
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 290/290 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 126 transition count 175
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 126 transition count 175
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 126 transition count 172
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 63 place count 108 transition count 152
Iterating global reduction 1 with 18 rules applied. Total rules applied 81 place count 108 transition count 152
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 94 place count 108 transition count 139
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 102 place count 100 transition count 130
Iterating global reduction 2 with 8 rules applied. Total rules applied 110 place count 100 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 113 place count 100 transition count 127
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 98 transition count 125
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 98 transition count 125
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 96 transition count 123
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 96 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 95 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 91 transition count 117
Applied a total of 131 rules in 26 ms. Remains 91 /147 variables (removed 56) and now considering 117/290 (removed 173) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-20 12:14:25] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 12:14:25] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-20 12:14:25] [INFO ] Invariant cache hit.
[2023-03-20 12:14:26] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-20 12:14:26] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2023-03-20 12:14:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:14:26] [INFO ] Invariant cache hit.
[2023-03-20 12:14:26] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/147 places, 117/290 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 335 ms. Remains : 91/147 places, 117/290 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s86 1)), p1:(AND (GEQ s1 1) (GEQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-10 finished in 439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 290/290 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 125 transition count 158
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 125 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 125 transition count 155
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 66 place count 106 transition count 134
Iterating global reduction 1 with 19 rules applied. Total rules applied 85 place count 106 transition count 134
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 99 place count 106 transition count 120
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 108 place count 97 transition count 110
Iterating global reduction 2 with 9 rules applied. Total rules applied 117 place count 97 transition count 110
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 121 place count 97 transition count 106
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 125 place count 93 transition count 102
Iterating global reduction 3 with 4 rules applied. Total rules applied 129 place count 93 transition count 102
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 133 place count 89 transition count 98
Iterating global reduction 3 with 4 rules applied. Total rules applied 137 place count 89 transition count 98
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 87 transition count 96
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 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 143 place count 87 transition count 94
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 145 place count 85 transition count 92
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 85 transition count 92
Applied a total of 147 rules in 19 ms. Remains 85 /147 variables (removed 62) and now considering 92/290 (removed 198) transitions.
// Phase 1: matrix 92 rows 85 cols
[2023-03-20 12:14:26] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 12:14:26] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-20 12:14:26] [INFO ] Invariant cache hit.
[2023-03-20 12:14:26] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-20 12:14:26] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2023-03-20 12:14:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:14:26] [INFO ] Invariant cache hit.
[2023-03-20 12:14:26] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/147 places, 92/290 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 276 ms. Remains : 85/147 places, 92/290 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22345 reset in 101 ms.
Product exploration explored 100000 steps with 22509 reset in 102 ms.
Computed a total of 21 stabilizing places and 27 stable transitions
Graph (complete) has 267 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 21 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2256 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 128589 steps, run visited all 1 properties in 210 ms. (steps per millisecond=612 )
Probabilistic random walk after 128589 steps, saw 51668 distinct states, run finished after 212 ms. (steps per millisecond=606 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 92/92 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-20 12:14:27] [INFO ] Invariant cache hit.
[2023-03-20 12:14:27] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-20 12:14:27] [INFO ] Invariant cache hit.
[2023-03-20 12:14:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-20 12:14:27] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2023-03-20 12:14:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:14:27] [INFO ] Invariant cache hit.
[2023-03-20 12:14:27] [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 251 ms. Remains : 85/85 places, 92/92 transitions.
Computed a total of 21 stabilizing places and 27 stable transitions
Graph (complete) has 267 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 21 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2288 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 128589 steps, run visited all 1 properties in 202 ms. (steps per millisecond=636 )
Probabilistic random walk after 128589 steps, saw 51668 distinct states, run finished after 202 ms. (steps per millisecond=636 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22443 reset in 143 ms.
Product exploration explored 100000 steps with 22359 reset in 143 ms.
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-20 12:14:28] [INFO ] Invariant cache hit.
[2023-03-20 12:14:29] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-20 12:14:29] [INFO ] Invariant cache hit.
[2023-03-20 12:14:29] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-20 12:14:29] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2023-03-20 12:14:29] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:14:29] [INFO ] Invariant cache hit.
[2023-03-20 12:14:29] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 313 ms. Remains : 85/85 places, 92/92 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-11 finished in 2999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(!F(p0))&&F(p1))) U (X(p1) U p2)))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 290/290 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 127 transition count 177
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 127 transition count 177
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 127 transition count 175
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 60 place count 109 transition count 155
Iterating global reduction 1 with 18 rules applied. Total rules applied 78 place count 109 transition count 155
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 92 place count 109 transition count 141
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 100 place count 101 transition count 132
Iterating global reduction 2 with 8 rules applied. Total rules applied 108 place count 101 transition count 132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 111 place count 101 transition count 129
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 113 place count 99 transition count 127
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 99 transition count 127
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 117 place count 97 transition count 125
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 97 transition count 125
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 121 place count 95 transition count 123
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 95 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 126 place count 95 transition count 120
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 128 place count 93 transition count 118
Iterating global reduction 4 with 2 rules applied. Total rules applied 130 place count 93 transition count 118
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 131 place count 92 transition count 116
Iterating global reduction 4 with 1 rules applied. Total rules applied 132 place count 92 transition count 116
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 133 place count 91 transition count 115
Iterating global reduction 4 with 1 rules applied. Total rules applied 134 place count 91 transition count 115
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 135 place count 90 transition count 114
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 90 transition count 114
Applied a total of 136 rules in 18 ms. Remains 90 /147 variables (removed 57) and now considering 114/290 (removed 176) transitions.
// Phase 1: matrix 114 rows 90 cols
[2023-03-20 12:14:29] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:14:29] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-20 12:14:29] [INFO ] Invariant cache hit.
[2023-03-20 12:14:29] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-20 12:14:29] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-03-20 12:14:29] [INFO ] Invariant cache hit.
[2023-03-20 12:14:29] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/147 places, 114/290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 317 ms. Remains : 90/147 places, 114/290 transitions.
Stuttering acceptance computed with spot in 287 ms :[(NOT p2), (AND p0 (NOT p1)), (NOT p1), (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (OR (NOT p1) p0), p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={0} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={0} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s83 1)), p0:(AND (GEQ s1 1) (GEQ s87 1)), p1:(AND (GEQ s1 1) (GEQ s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 1 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-12 finished in 630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(X(F(p0))&&G(!p1)))))'
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 290/290 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 126 transition count 175
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 126 transition count 175
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 126 transition count 172
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 63 place count 108 transition count 152
Iterating global reduction 1 with 18 rules applied. Total rules applied 81 place count 108 transition count 152
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 94 place count 108 transition count 139
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 102 place count 100 transition count 130
Iterating global reduction 2 with 8 rules applied. Total rules applied 110 place count 100 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 113 place count 100 transition count 127
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 98 transition count 125
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 98 transition count 125
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 96 transition count 123
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 96 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 95 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 91 transition count 117
Applied a total of 131 rules in 19 ms. Remains 91 /147 variables (removed 56) and now considering 117/290 (removed 173) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-20 12:14:29] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 12:14:30] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-20 12:14:30] [INFO ] Invariant cache hit.
[2023-03-20 12:14:30] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-20 12:14:30] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2023-03-20 12:14:30] [INFO ] Invariant cache hit.
[2023-03-20 12:14:30] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/147 places, 117/290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 329 ms. Remains : 91/147 places, 117/290 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), true, (NOT p0), p1, (AND p1 (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s85 1)), p0:(AND (GEQ s1 1) (GEQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], 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-d1m06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-13 finished in 553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1)||(!p0&&X(G(p2))))))'
Support contains 5 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 290/290 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 127 transition count 176
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 127 transition count 176
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 127 transition count 173
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 60 place count 110 transition count 155
Iterating global reduction 1 with 17 rules applied. Total rules applied 77 place count 110 transition count 155
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 89 place count 110 transition count 143
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 97 place count 102 transition count 134
Iterating global reduction 2 with 8 rules applied. Total rules applied 105 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 108 place count 102 transition count 131
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 110 place count 100 transition count 129
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 100 transition count 129
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 98 transition count 127
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 98 transition count 127
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 118 place count 96 transition count 125
Iterating global reduction 3 with 2 rules applied. Total rules applied 120 place count 96 transition count 125
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 123 place count 96 transition count 122
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 125 place count 94 transition count 120
Iterating global reduction 4 with 2 rules applied. Total rules applied 127 place count 94 transition count 120
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 128 place count 93 transition count 118
Iterating global reduction 4 with 1 rules applied. Total rules applied 129 place count 93 transition count 118
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 92 transition count 117
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 92 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 132 place count 91 transition count 116
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 91 transition count 116
Applied a total of 133 rules in 30 ms. Remains 91 /147 variables (removed 56) and now considering 116/290 (removed 174) transitions.
// Phase 1: matrix 116 rows 91 cols
[2023-03-20 12:14:30] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 12:14:30] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-20 12:14:30] [INFO ] Invariant cache hit.
[2023-03-20 12:14:30] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-20 12:14:30] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2023-03-20 12:14:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 12:14:30] [INFO ] Invariant cache hit.
[2023-03-20 12:14:30] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/147 places, 116/290 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 351 ms. Remains : 91/147 places, 116/290 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s85 1)), p0:(AND (GEQ s23 1) (GEQ s48 1)), p2:(AND (GEQ s1 1) (GEQ s84 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLFireability-14 finished in 413 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((X(F(p0))||F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (!p0&&G(!p1))))'
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)))'
[2023-03-20 12:14:31] [INFO ] Flatten gal took : 20 ms
[2023-03-20 12:14:31] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 12:14:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 147 places, 290 transitions and 1145 arcs took 4 ms.
Total runtime 25103 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1320/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1320/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1320/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m06-LTLFireability-05
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m06-LTLFireability-06
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m06-LTLFireability-11

BK_STOP 1679314471880

--------------------
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-d1m06-LTLFireability-05
ltl formula formula --ltl=/tmp/1320/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 147 places, 290 transitions and 1145 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1320/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1320/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1320/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1320/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name SieveSingleMsgMbox-PT-d1m06-LTLFireability-06
ltl formula formula --ltl=/tmp/1320/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 147 places, 290 transitions and 1145 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1320/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1320/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1320/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1320/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)
ltl formula name SieveSingleMsgMbox-PT-d1m06-LTLFireability-11
ltl formula formula --ltl=/tmp/1320/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 147 places, 290 transitions and 1145 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1320/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1320/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1320/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1320/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 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-d1m06"
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-d1m06, 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-167905978200412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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