Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r395-smll-171683823900083.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is SieveSingleMsgMbox-PT-d2m64, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-smll-171683823900083
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 19:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 12 19:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 12 19:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M May 18 16:43 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-d2m64-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716940850482

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m64
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 00:00:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 00:00:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 00:00:54] [INFO ] Load time of PNML (sax parser for PT used): 301 ms
[2024-05-29 00:00:54] [INFO ] Transformed 2398 places.
[2024-05-29 00:00:54] [INFO ] Transformed 1954 transitions.
[2024-05-29 00:00:54] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 420 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1984 places in 23 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 103 places :
Symmetric choice reduction at 1 with 103 rule applications. Total rules 956 place count 286 transition count 588
Iterating global reduction 1 with 103 rules applied. Total rules applied 1059 place count 286 transition count 588
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 1070 place count 286 transition count 577
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 1146 place count 210 transition count 501
Iterating global reduction 2 with 76 rules applied. Total rules applied 1222 place count 210 transition count 501
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 1252 place count 210 transition count 471
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 1280 place count 182 transition count 437
Iterating global reduction 3 with 28 rules applied. Total rules applied 1308 place count 182 transition count 437
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 3 with 51 rules applied. Total rules applied 1359 place count 182 transition count 386
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1363 place count 178 transition count 380
Iterating global reduction 4 with 4 rules applied. Total rules applied 1367 place count 178 transition count 380
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1371 place count 174 transition count 376
Iterating global reduction 4 with 4 rules applied. Total rules applied 1375 place count 174 transition count 376
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1377 place count 172 transition count 373
Iterating global reduction 4 with 2 rules applied. Total rules applied 1379 place count 172 transition count 373
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1381 place count 170 transition count 371
Iterating global reduction 4 with 2 rules applied. Total rules applied 1383 place count 170 transition count 371
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1385 place count 168 transition count 369
Iterating global reduction 4 with 2 rules applied. Total rules applied 1387 place count 168 transition count 369
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1388 place count 167 transition count 368
Iterating global reduction 4 with 1 rules applied. Total rules applied 1389 place count 167 transition count 368
Applied a total of 1389 rules in 143 ms. Remains 167 /414 variables (removed 247) and now considering 368/1954 (removed 1586) transitions.
// Phase 1: matrix 368 rows 167 cols
[2024-05-29 00:00:54] [INFO ] Computed 5 invariants in 29 ms
[2024-05-29 00:00:55] [INFO ] Implicit Places using invariants in 516 ms returned []
[2024-05-29 00:00:55] [INFO ] Invariant cache hit.
[2024-05-29 00:00:55] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-29 00:00:56] [INFO ] Implicit Places using invariants and state equation in 1290 ms returned []
Implicit Place search using SMT with State Equation took 1849 ms to find 0 implicit places.
[2024-05-29 00:00:56] [INFO ] Invariant cache hit.
[2024-05-29 00:00:57] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 167/414 places, 368/1954 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2417 ms. Remains : 167/414 places, 368/1954 transitions.
Support contains 21 out of 167 places after structural reductions.
[2024-05-29 00:00:57] [INFO ] Flatten gal took : 124 ms
[2024-05-29 00:00:57] [INFO ] Flatten gal took : 59 ms
[2024-05-29 00:00:57] [INFO ] Input system was already deterministic with 368 transitions.
Incomplete random walk after 10000 steps, including 2260 resets, run finished after 872 ms. (steps per millisecond=11 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 59 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 112 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 107 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 176136 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{0=1, 5=1, 7=1, 8=1, 13=1}
Probabilistic random walk after 176136 steps, saw 80171 distinct states, run finished after 3002 ms. (steps per millisecond=58 ) properties seen :5
Running SMT prover for 13 properties.
[2024-05-29 00:01:01] [INFO ] Invariant cache hit.
[2024-05-29 00:01:02] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2024-05-29 00:01:02] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 7 ms returned sat
[2024-05-29 00:01:03] [INFO ] After 1413ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:12
[2024-05-29 00:01:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-29 00:01:03] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 8 ms returned sat
[2024-05-29 00:01:04] [INFO ] After 950ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :12
[2024-05-29 00:01:04] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-29 00:01:06] [INFO ] After 1870ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :1 sat :12
[2024-05-29 00:01:06] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 6 ms to minimize.
[2024-05-29 00:01:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2024-05-29 00:01:07] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-05-29 00:01:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2024-05-29 00:01:10] [INFO ] After 5654ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :12
Attempting to minimize the solution found.
Minimization took 1577 ms.
[2024-05-29 00:01:11] [INFO ] After 8437ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :12
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 1375 ms.
Support contains 14 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 368/368 transitions.
Graph (complete) has 636 edges and 167 vertex of which 166 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 166 transition count 366
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 161 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 161 transition count 296
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 18 place count 156 transition count 291
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 156 transition count 291
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 156 transition count 288
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 30 place count 152 transition count 280
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 152 transition count 280
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 37 place count 152 transition count 277
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 151 transition count 276
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 151 transition count 276
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 150 transition count 275
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 150 transition count 275
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 42 place count 149 transition count 274
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 149 transition count 274
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 51 place count 149 transition count 266
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 52 place count 148 transition count 265
Iterating global reduction 4 with 1 rules applied. Total rules applied 53 place count 148 transition count 265
Applied a total of 53 rules in 94 ms. Remains 148 /167 variables (removed 19) and now considering 265/368 (removed 103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 148/167 places, 265/368 transitions.
Incomplete random walk after 10000 steps, including 2212 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 460 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 445 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 464 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 484 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 1059 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 1019 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 453 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 230997 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 230997 steps, saw 100013 distinct states, run finished after 3002 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 265 rows 148 cols
[2024-05-29 00:01:18] [INFO ] Computed 4 invariants in 7 ms
[2024-05-29 00:01:18] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:01:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-29 00:01:19] [INFO ] After 1013ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-29 00:01:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-29 00:01:19] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-29 00:01:20] [INFO ] After 883ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-29 00:01:20] [INFO ] State equation strengthened by 156 read => feed constraints.
[2024-05-29 00:01:21] [INFO ] After 1312ms SMT Verify possible using 156 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2024-05-29 00:01:23] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 3 ms to minimize.
[2024-05-29 00:01:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2024-05-29 00:01:23] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-29 00:01:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2024-05-29 00:01:24] [INFO ] After 3577ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 4087 ms.
[2024-05-29 00:01:28] [INFO ] After 8769ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 950 ms.
Support contains 14 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 265/265 transitions.
Applied a total of 0 rules in 18 ms. Remains 148 /148 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 148/148 places, 265/265 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 265/265 transitions.
Applied a total of 0 rules in 15 ms. Remains 148 /148 variables (removed 0) and now considering 265/265 (removed 0) transitions.
[2024-05-29 00:01:29] [INFO ] Invariant cache hit.
[2024-05-29 00:01:29] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-29 00:01:29] [INFO ] Invariant cache hit.
[2024-05-29 00:01:29] [INFO ] State equation strengthened by 156 read => feed constraints.
[2024-05-29 00:01:30] [INFO ] Implicit Places using invariants and state equation in 1294 ms returned []
Implicit Place search using SMT with State Equation took 1438 ms to find 0 implicit places.
[2024-05-29 00:01:30] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-29 00:01:30] [INFO ] Invariant cache hit.
[2024-05-29 00:01:30] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1771 ms. Remains : 148/148 places, 265/265 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 148 transition count 259
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 143 transition count 259
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 11 place count 143 transition count 240
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 49 place count 124 transition count 240
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 71 place count 113 transition count 229
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 112 transition count 239
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 112 transition count 239
Applied a total of 75 rules in 54 ms. Remains 112 /148 variables (removed 36) and now considering 239/265 (removed 26) transitions.
Running SMT prover for 12 properties.
// Phase 1: matrix 239 rows 112 cols
[2024-05-29 00:01:30] [INFO ] Computed 4 invariants in 4 ms
[2024-05-29 00:01:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:01:31] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 6 ms returned sat
[2024-05-29 00:01:31] [INFO ] After 731ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-29 00:01:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:01:31] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:01:32] [INFO ] After 638ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-29 00:01:32] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-29 00:01:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2024-05-29 00:01:32] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-29 00:01:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2024-05-29 00:01:33] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-29 00:01:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2024-05-29 00:01:33] [INFO ] After 1768ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 1687 ms.
[2024-05-29 00:01:35] [INFO ] After 3562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 35 stabilizing places and 55 stable transitions
Graph (complete) has 694 edges and 167 vertex of which 166 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U p1)))'
Support contains 3 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 368/368 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 152 transition count 221
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 152 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 152 transition count 220
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 46 place count 137 transition count 204
Iterating global reduction 1 with 15 rules applied. Total rules applied 61 place count 137 transition count 204
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 68 place count 137 transition count 197
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 80 place count 125 transition count 176
Iterating global reduction 2 with 12 rules applied. Total rules applied 92 place count 125 transition count 176
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 101 place count 125 transition count 167
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 104 place count 122 transition count 164
Iterating global reduction 3 with 3 rules applied. Total rules applied 107 place count 122 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 119 transition count 161
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 119 transition count 161
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 117 transition count 159
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 117 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 115 transition count 157
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 115 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 114 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 114 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 113 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 113 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 112 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 112 transition count 152
Applied a total of 127 rules in 30 ms. Remains 112 /167 variables (removed 55) and now considering 152/368 (removed 216) transitions.
// Phase 1: matrix 152 rows 112 cols
[2024-05-29 00:01:35] [INFO ] Computed 5 invariants in 2 ms
[2024-05-29 00:01:35] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-29 00:01:35] [INFO ] Invariant cache hit.
[2024-05-29 00:01:35] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-29 00:01:36] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
[2024-05-29 00:01:36] [INFO ] Invariant cache hit.
[2024-05-29 00:01:36] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/167 places, 152/368 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 863 ms. Remains : 112/167 places, 152/368 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 384 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s106 1)), p0:(AND (GEQ s1 1) (GEQ s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 3 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-00 finished in 1373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 368/368 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 151 transition count 207
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 151 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 151 transition count 206
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 49 place count 135 transition count 189
Iterating global reduction 1 with 16 rules applied. Total rules applied 65 place count 135 transition count 189
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 72 place count 135 transition count 182
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 85 place count 122 transition count 159
Iterating global reduction 2 with 13 rules applied. Total rules applied 98 place count 122 transition count 159
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 107 place count 122 transition count 150
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 111 place count 118 transition count 146
Iterating global reduction 3 with 4 rules applied. Total rules applied 115 place count 118 transition count 146
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 119 place count 114 transition count 142
Iterating global reduction 3 with 4 rules applied. Total rules applied 123 place count 114 transition count 142
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 111 transition count 139
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 111 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 131 place count 111 transition count 137
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 134 place count 108 transition count 134
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 108 transition count 134
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 107 transition count 131
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 107 transition count 131
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 140 place count 106 transition count 130
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 105 transition count 129
Applied a total of 143 rules in 82 ms. Remains 105 /167 variables (removed 62) and now considering 129/368 (removed 239) transitions.
// Phase 1: matrix 129 rows 105 cols
[2024-05-29 00:01:36] [INFO ] Computed 5 invariants in 3 ms
[2024-05-29 00:01:37] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-29 00:01:37] [INFO ] Invariant cache hit.
[2024-05-29 00:01:37] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-29 00:01:37] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
[2024-05-29 00:01:37] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 00:01:37] [INFO ] Invariant cache hit.
[2024-05-29 00:01:37] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/167 places, 129/368 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 839 ms. Remains : 105/167 places, 129/368 transitions.
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22450 reset in 414 ms.
Product exploration explored 100000 steps with 22283 reset in 271 ms.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 343 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 81 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 46 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2253 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 481 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1843651 steps, run timeout after 3001 ms. (steps per millisecond=614 ) properties seen :{}
Probabilistic random walk after 1843651 steps, saw 777302 distinct states, run finished after 3003 ms. (steps per millisecond=613 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 00:01:41] [INFO ] Invariant cache hit.
[2024-05-29 00:01:41] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:01:41] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-29 00:01:41] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:01:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:01:41] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-29 00:01:41] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:01:41] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-29 00:01:41] [INFO ] After 39ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 00:01:42] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2024-05-29 00:01:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2024-05-29 00:01:42] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-29 00:01:42] [INFO ] After 357ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 129/129 transitions.
Graph (complete) has 307 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 104 transition count 127
Applied a total of 3 rules in 10 ms. Remains 104 /105 variables (removed 1) and now considering 127/129 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 104/105 places, 127/129 transitions.
Incomplete random walk after 10000 steps, including 2214 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1794732 steps, run timeout after 3001 ms. (steps per millisecond=598 ) properties seen :{}
Probabilistic random walk after 1794732 steps, saw 757358 distinct states, run finished after 3001 ms. (steps per millisecond=598 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 104 cols
[2024-05-29 00:01:45] [INFO ] Computed 4 invariants in 3 ms
[2024-05-29 00:01:45] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:01:45] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-29 00:01:45] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:01:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 00:01:45] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:01:45] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:01:45] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-29 00:01:45] [INFO ] After 34ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 00:01:45] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-29 00:01:45] [INFO ] After 184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 104/104 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2024-05-29 00:01:45] [INFO ] Invariant cache hit.
[2024-05-29 00:01:45] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-29 00:01:45] [INFO ] Invariant cache hit.
[2024-05-29 00:01:45] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-29 00:01:45] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2024-05-29 00:01:45] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 00:01:45] [INFO ] Invariant cache hit.
[2024-05-29 00:01:46] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 642 ms. Remains : 104/104 places, 127/127 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 120
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 98 transition count 103
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 81 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 75 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 74 transition count 106
Applied a total of 61 rules in 11 ms. Remains 74 /104 variables (removed 30) and now considering 106/127 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 106 rows 74 cols
[2024-05-29 00:01:46] [INFO ] Computed 4 invariants in 2 ms
[2024-05-29 00:01:46] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:01:46] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-29 00:01:46] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:01:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 00:01:46] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-29 00:01:46] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:01:46] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-29 00:01:46] [INFO ] After 183ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 111 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 :[true, (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 105 cols
[2024-05-29 00:01:46] [INFO ] Computed 5 invariants in 2 ms
[2024-05-29 00:01:46] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-29 00:01:46] [INFO ] Invariant cache hit.
[2024-05-29 00:01:46] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-29 00:01:47] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
[2024-05-29 00:01:47] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 00:01:47] [INFO ] Invariant cache hit.
[2024-05-29 00:01:47] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 708 ms. Remains : 105/105 places, 129/129 transitions.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 343 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 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 69 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2248 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 454 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1798371 steps, run timeout after 3001 ms. (steps per millisecond=599 ) properties seen :{}
Probabilistic random walk after 1798371 steps, saw 758809 distinct states, run finished after 3003 ms. (steps per millisecond=598 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 00:01:50] [INFO ] Invariant cache hit.
[2024-05-29 00:01:50] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:01:50] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-29 00:01:50] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:01:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:01:50] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-29 00:01:50] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:01:50] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-29 00:01:50] [INFO ] After 27ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 00:01:50] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-29 00:01:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-29 00:01:51] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-29 00:01:51] [INFO ] After 239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 129/129 transitions.
Graph (complete) has 307 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 104 transition count 127
Applied a total of 3 rules in 6 ms. Remains 104 /105 variables (removed 1) and now considering 127/129 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 104/105 places, 127/129 transitions.
Incomplete random walk after 10000 steps, including 2248 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
Interrupted probabilistic random walk after 1726224 steps, run timeout after 3001 ms. (steps per millisecond=575 ) properties seen :{}
Probabilistic random walk after 1726224 steps, saw 728398 distinct states, run finished after 3001 ms. (steps per millisecond=575 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 104 cols
[2024-05-29 00:01:54] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 00:01:54] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:01:54] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-29 00:01:54] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:01:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:01:54] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-29 00:01:54] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:01:54] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-29 00:01:54] [INFO ] After 37ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 00:01:54] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-29 00:01:54] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 104/104 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2024-05-29 00:01:54] [INFO ] Invariant cache hit.
[2024-05-29 00:01:54] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-29 00:01:54] [INFO ] Invariant cache hit.
[2024-05-29 00:01:54] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-29 00:01:54] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2024-05-29 00:01:54] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 00:01:54] [INFO ] Invariant cache hit.
[2024-05-29 00:01:55] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 602 ms. Remains : 104/104 places, 127/127 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 120
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 98 transition count 103
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 81 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 75 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 74 transition count 106
Applied a total of 61 rules in 19 ms. Remains 74 /104 variables (removed 30) and now considering 106/127 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 106 rows 74 cols
[2024-05-29 00:01:55] [INFO ] Computed 4 invariants in 2 ms
[2024-05-29 00:01:55] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:01:55] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-29 00:01:55] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:01:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:01:55] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-29 00:01:55] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:01:55] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-29 00:01:55] [INFO ] After 198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 82 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 54 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 22536 reset in 153 ms.
Product exploration explored 100000 steps with 22396 reset in 155 ms.
Built C files in :
/tmp/ltsmin2235116583856692111
[2024-05-29 00:01:56] [INFO ] Computing symmetric may disable matrix : 129 transitions.
[2024-05-29 00:01:56] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:01:56] [INFO ] Computing symmetric may enable matrix : 129 transitions.
[2024-05-29 00:01:56] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:01:56] [INFO ] Computing Do-Not-Accords matrix : 129 transitions.
[2024-05-29 00:01:56] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:01:56] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2235116583856692111
Running compilation step : cd /tmp/ltsmin2235116583856692111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 829 ms.
Running link step : cd /tmp/ltsmin2235116583856692111;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin2235116583856692111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14349920186041766225.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 105 cols
[2024-05-29 00:02:11] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 00:02:11] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-29 00:02:11] [INFO ] Invariant cache hit.
[2024-05-29 00:02:11] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-29 00:02:11] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2024-05-29 00:02:11] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 00:02:11] [INFO ] Invariant cache hit.
[2024-05-29 00:02:11] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 723 ms. Remains : 105/105 places, 129/129 transitions.
Built C files in :
/tmp/ltsmin17990986576018506830
[2024-05-29 00:02:11] [INFO ] Computing symmetric may disable matrix : 129 transitions.
[2024-05-29 00:02:11] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:02:11] [INFO ] Computing symmetric may enable matrix : 129 transitions.
[2024-05-29 00:02:11] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:02:11] [INFO ] Computing Do-Not-Accords matrix : 129 transitions.
[2024-05-29 00:02:11] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:02:11] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17990986576018506830
Running compilation step : cd /tmp/ltsmin17990986576018506830;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 607 ms.
Running link step : cd /tmp/ltsmin17990986576018506830;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin17990986576018506830;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17188633296480679245.hoa' '--buchi-type=spotba'
LTSmin run took 2262 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-01 finished in 37988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(!p0)))))'
Support contains 0 out of 167 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 368/368 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 151 transition count 207
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 151 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 151 transition count 206
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 49 place count 135 transition count 189
Iterating global reduction 1 with 16 rules applied. Total rules applied 65 place count 135 transition count 189
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 73 place count 135 transition count 181
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 86 place count 122 transition count 158
Iterating global reduction 2 with 13 rules applied. Total rules applied 99 place count 122 transition count 158
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 108 place count 122 transition count 149
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 112 place count 118 transition count 145
Iterating global reduction 3 with 4 rules applied. Total rules applied 116 place count 118 transition count 145
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 120 place count 114 transition count 141
Iterating global reduction 3 with 4 rules applied. Total rules applied 124 place count 114 transition count 141
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 127 place count 111 transition count 138
Iterating global reduction 3 with 3 rules applied. Total rules applied 130 place count 111 transition count 138
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 111 transition count 136
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 135 place count 108 transition count 133
Iterating global reduction 4 with 3 rules applied. Total rules applied 138 place count 108 transition count 133
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 107 transition count 130
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 107 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 141 place count 106 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 142 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 143 place count 105 transition count 128
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 105 transition count 128
Applied a total of 144 rules in 36 ms. Remains 105 /167 variables (removed 62) and now considering 128/368 (removed 240) transitions.
// Phase 1: matrix 128 rows 105 cols
[2024-05-29 00:02:14] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 00:02:14] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-29 00:02:14] [INFO ] Invariant cache hit.
[2024-05-29 00:02:15] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-29 00:02:15] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
[2024-05-29 00:02:15] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 00:02:15] [INFO ] Invariant cache hit.
[2024-05-29 00:02:15] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/167 places, 128/368 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 606 ms. Remains : 105/167 places, 128/368 transitions.
Stuttering acceptance computed with spot in 18 ms :[true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}]], initial=0, aps=[], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-03 finished in 641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 3 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 368/368 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 152 transition count 221
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 152 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 152 transition count 220
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 46 place count 137 transition count 204
Iterating global reduction 1 with 15 rules applied. Total rules applied 61 place count 137 transition count 204
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 68 place count 137 transition count 197
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 80 place count 125 transition count 176
Iterating global reduction 2 with 12 rules applied. Total rules applied 92 place count 125 transition count 176
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 101 place count 125 transition count 167
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 104 place count 122 transition count 164
Iterating global reduction 3 with 3 rules applied. Total rules applied 107 place count 122 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 119 transition count 161
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 119 transition count 161
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 117 transition count 159
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 117 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 115 transition count 157
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 115 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 114 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 114 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 113 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 113 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 112 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 112 transition count 152
Applied a total of 127 rules in 32 ms. Remains 112 /167 variables (removed 55) and now considering 152/368 (removed 216) transitions.
// Phase 1: matrix 152 rows 112 cols
[2024-05-29 00:02:15] [INFO ] Computed 5 invariants in 2 ms
[2024-05-29 00:02:15] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-29 00:02:15] [INFO ] Invariant cache hit.
[2024-05-29 00:02:15] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-29 00:02:16] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
[2024-05-29 00:02:16] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 00:02:16] [INFO ] Invariant cache hit.
[2024-05-29 00:02:16] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/167 places, 152/368 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 951 ms. Remains : 112/167 places, 152/368 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s107 1)), p1:(OR (LT s1 1) (LT s106 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 10 steps with 1 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-04 finished in 1154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 368/368 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 151 transition count 194
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 151 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 151 transition count 193
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 49 place count 135 transition count 176
Iterating global reduction 1 with 16 rules applied. Total rules applied 65 place count 135 transition count 176
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 73 place count 135 transition count 168
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 86 place count 122 transition count 144
Iterating global reduction 2 with 13 rules applied. Total rules applied 99 place count 122 transition count 144
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 107 place count 122 transition count 136
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 112 place count 117 transition count 131
Iterating global reduction 3 with 5 rules applied. Total rules applied 117 place count 117 transition count 131
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 122 place count 112 transition count 126
Iterating global reduction 3 with 5 rules applied. Total rules applied 127 place count 112 transition count 126
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 131 place count 108 transition count 122
Iterating global reduction 3 with 4 rules applied. Total rules applied 135 place count 108 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 137 place count 108 transition count 120
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 141 place count 104 transition count 116
Iterating global reduction 4 with 4 rules applied. Total rules applied 145 place count 104 transition count 116
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 146 place count 103 transition count 113
Iterating global reduction 4 with 1 rules applied. Total rules applied 147 place count 103 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 148 place count 102 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 102 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 150 place count 101 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 151 place count 101 transition count 111
Applied a total of 151 rules in 45 ms. Remains 101 /167 variables (removed 66) and now considering 111/368 (removed 257) transitions.
// Phase 1: matrix 111 rows 101 cols
[2024-05-29 00:02:16] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 00:02:16] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-29 00:02:16] [INFO ] Invariant cache hit.
[2024-05-29 00:02:16] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-29 00:02:17] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
[2024-05-29 00:02:17] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 00:02:17] [INFO ] Invariant cache hit.
[2024-05-29 00:02:17] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/167 places, 111/368 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 670 ms. Remains : 101/167 places, 111/368 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-05 finished in 747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U (p1 U p2)))))'
Support contains 5 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 368/368 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 153 transition count 222
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 153 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 153 transition count 221
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 43 place count 139 transition count 206
Iterating global reduction 1 with 14 rules applied. Total rules applied 57 place count 139 transition count 206
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 63 place count 139 transition count 200
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 74 place count 128 transition count 181
Iterating global reduction 2 with 11 rules applied. Total rules applied 85 place count 128 transition count 181
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 94 place count 128 transition count 172
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 96 place count 126 transition count 170
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 126 transition count 170
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 124 transition count 168
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 124 transition count 168
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 123 transition count 167
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 123 transition count 167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 122 transition count 166
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 122 transition count 166
Applied a total of 106 rules in 23 ms. Remains 122 /167 variables (removed 45) and now considering 166/368 (removed 202) transitions.
// Phase 1: matrix 166 rows 122 cols
[2024-05-29 00:02:17] [INFO ] Computed 5 invariants in 2 ms
[2024-05-29 00:02:17] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-29 00:02:17] [INFO ] Invariant cache hit.
[2024-05-29 00:02:17] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-29 00:02:17] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
[2024-05-29 00:02:17] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 00:02:17] [INFO ] Invariant cache hit.
[2024-05-29 00:02:18] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/167 places, 166/368 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 739 ms. Remains : 122/167 places, 166/368 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s11 1) (GEQ s36 1)), p1:(AND (GEQ s1 1) (GEQ s117 1)), p0:(AND (GEQ s1 1) (GEQ s116 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-06 finished in 927 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G((!p1||G(!p0)))))'
Support contains 3 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 368/368 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 152 transition count 221
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 152 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 152 transition count 220
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 46 place count 137 transition count 204
Iterating global reduction 1 with 15 rules applied. Total rules applied 61 place count 137 transition count 204
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 69 place count 137 transition count 196
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 81 place count 125 transition count 175
Iterating global reduction 2 with 12 rules applied. Total rules applied 93 place count 125 transition count 175
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 102 place count 125 transition count 166
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 121 transition count 162
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 121 transition count 162
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 114 place count 117 transition count 158
Iterating global reduction 3 with 4 rules applied. Total rules applied 118 place count 117 transition count 158
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 121 place count 114 transition count 155
Iterating global reduction 3 with 3 rules applied. Total rules applied 124 place count 114 transition count 155
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 127 place count 114 transition count 152
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 130 place count 111 transition count 149
Iterating global reduction 4 with 3 rules applied. Total rules applied 133 place count 111 transition count 149
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 110 transition count 146
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 110 transition count 146
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 136 place count 109 transition count 145
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 109 transition count 145
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 108 transition count 144
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 108 transition count 144
Applied a total of 139 rules in 49 ms. Remains 108 /167 variables (removed 59) and now considering 144/368 (removed 224) transitions.
// Phase 1: matrix 144 rows 108 cols
[2024-05-29 00:02:18] [INFO ] Computed 5 invariants in 8 ms
[2024-05-29 00:02:18] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-29 00:02:18] [INFO ] Invariant cache hit.
[2024-05-29 00:02:18] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-29 00:02:18] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2024-05-29 00:02:18] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 00:02:18] [INFO ] Invariant cache hit.
[2024-05-29 00:02:19] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/167 places, 144/368 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 727 ms. Remains : 108/167 places, 144/368 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND p1 p0), (NOT p0), p0, (AND p0 p1), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s103 1)), p0:(AND (GEQ s1 1) (GEQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 22443 reset in 514 ms.
Product exploration explored 100000 steps with 22462 reset in 393 ms.
Computed a total of 22 stabilizing places and 28 stable transitions
Graph (complete) has 363 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 22 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 146 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[true, (AND p0 p1), p0]
Incomplete random walk after 10000 steps, including 2236 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 469 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 482 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 460 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 348505 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 348505 steps, saw 157254 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 00:02:24] [INFO ] Invariant cache hit.
[2024-05-29 00:02:24] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:02:24] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-29 00:02:24] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-29 00:02:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:02:24] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-29 00:02:24] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-29 00:02:24] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-29 00:02:24] [INFO ] After 95ms SMT Verify possible using 70 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-29 00:02:24] [INFO ] After 209ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 110 ms.
[2024-05-29 00:02:24] [INFO ] After 499ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 131 ms.
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 144/144 transitions.
Graph (complete) has 326 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 107 transition count 142
Applied a total of 3 rules in 11 ms. Remains 107 /108 variables (removed 1) and now considering 142/144 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 107/108 places, 142/144 transitions.
Incomplete random walk after 10000 steps, including 2237 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 455 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 458 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 513105 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 513105 steps, saw 230007 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 142 rows 107 cols
[2024-05-29 00:02:28] [INFO ] Computed 4 invariants in 7 ms
[2024-05-29 00:02:28] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:02:28] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-29 00:02:28] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 00:02:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:02:28] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-29 00:02:28] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 00:02:28] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-29 00:02:28] [INFO ] After 105ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 00:02:29] [INFO ] After 198ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 103 ms.
[2024-05-29 00:02:29] [INFO ] After 492ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 99 ms.
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 142/142 transitions.
Applied a total of 0 rules in 4 ms. Remains 107 /107 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 107/107 places, 142/142 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 142/142 transitions.
Applied a total of 0 rules in 3 ms. Remains 107 /107 variables (removed 0) and now considering 142/142 (removed 0) transitions.
[2024-05-29 00:02:29] [INFO ] Invariant cache hit.
[2024-05-29 00:02:29] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-29 00:02:29] [INFO ] Invariant cache hit.
[2024-05-29 00:02:29] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-29 00:02:29] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
[2024-05-29 00:02:29] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 00:02:29] [INFO ] Invariant cache hit.
[2024-05-29 00:02:29] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 727 ms. Remains : 107/107 places, 142/142 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 107 transition count 135
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 101 transition count 135
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 101 transition count 118
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 84 transition count 118
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 78 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 77 transition count 121
Applied a total of 61 rules in 8 ms. Remains 77 /107 variables (removed 30) and now considering 121/142 (removed 21) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 121 rows 77 cols
[2024-05-29 00:02:29] [INFO ] Computed 4 invariants in 2 ms
[2024-05-29 00:02:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 00:02:30] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-29 00:02:30] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 00:02:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:02:30] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-29 00:02:30] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 00:02:30] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-29 00:02:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-29 00:02:30] [INFO ] After 336ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 106 ms.
[2024-05-29 00:02:30] [INFO ] After 499ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT p0))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 235 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (AND p0 p1), p0]
Stuttering acceptance computed with spot in 117 ms :[true, (AND p0 p1), p0]
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 144/144 transitions.
Applied a total of 0 rules in 6 ms. Remains 108 /108 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 108 cols
[2024-05-29 00:02:31] [INFO ] Computed 5 invariants in 2 ms
[2024-05-29 00:02:31] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-29 00:02:31] [INFO ] Invariant cache hit.
[2024-05-29 00:02:31] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-29 00:02:31] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2024-05-29 00:02:31] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 00:02:31] [INFO ] Invariant cache hit.
[2024-05-29 00:02:31] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 762 ms. Remains : 108/108 places, 144/144 transitions.
Computed a total of 22 stabilizing places and 28 stable transitions
Graph (complete) has 363 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 159 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[true, p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2237 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 438 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 459 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 343035 steps, run timeout after 3002 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 343035 steps, saw 154972 distinct states, run finished after 3002 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 00:02:35] [INFO ] Invariant cache hit.
[2024-05-29 00:02:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:02:35] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-29 00:02:36] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-29 00:02:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 00:02:36] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-29 00:02:36] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-29 00:02:36] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-29 00:02:36] [INFO ] After 114ms SMT Verify possible using 70 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-29 00:02:36] [INFO ] After 212ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 97 ms.
[2024-05-29 00:02:36] [INFO ] After 479ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 107 ms.
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 144/144 transitions.
Graph (complete) has 326 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 107 transition count 142
Applied a total of 3 rules in 6 ms. Remains 107 /108 variables (removed 1) and now considering 142/144 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 107/108 places, 142/144 transitions.
Incomplete random walk after 10000 steps, including 2230 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 505 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 481957 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :{}
Probabilistic random walk after 481957 steps, saw 216944 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 142 rows 107 cols
[2024-05-29 00:02:39] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 00:02:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 00:02:40] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-29 00:02:40] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 00:02:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 00:02:40] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-29 00:02:40] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 00:02:40] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-29 00:02:40] [INFO ] After 132ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 00:02:40] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-29 00:02:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-29 00:02:40] [INFO ] After 296ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 102 ms.
[2024-05-29 00:02:40] [INFO ] After 588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 62 ms.
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 142/142 transitions.
Applied a total of 0 rules in 6 ms. Remains 107 /107 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 107/107 places, 142/142 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 142/142 transitions.
Applied a total of 0 rules in 5 ms. Remains 107 /107 variables (removed 0) and now considering 142/142 (removed 0) transitions.
[2024-05-29 00:02:40] [INFO ] Invariant cache hit.
[2024-05-29 00:02:40] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-29 00:02:40] [INFO ] Invariant cache hit.
[2024-05-29 00:02:40] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-29 00:02:41] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2024-05-29 00:02:41] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 00:02:41] [INFO ] Invariant cache hit.
[2024-05-29 00:02:41] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 660 ms. Remains : 107/107 places, 142/142 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 107 transition count 135
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 101 transition count 135
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 101 transition count 118
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 84 transition count 118
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 78 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 77 transition count 121
Applied a total of 61 rules in 27 ms. Remains 77 /107 variables (removed 30) and now considering 121/142 (removed 21) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 121 rows 77 cols
[2024-05-29 00:02:41] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 00:02:41] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:02:41] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:02:41] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 00:02:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:02:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 00:02:41] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 00:02:41] [INFO ] After 279ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 93 ms.
[2024-05-29 00:02:42] [INFO ] After 431ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 168 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[true, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 105 ms :[true, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 104 ms :[true, p0, (AND p0 p1)]
Product exploration explored 100000 steps with 22455 reset in 285 ms.
Product exploration explored 100000 steps with 22388 reset in 302 ms.
Built C files in :
/tmp/ltsmin13447188984883423408
[2024-05-29 00:02:43] [INFO ] Computing symmetric may disable matrix : 144 transitions.
[2024-05-29 00:02:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:02:43] [INFO ] Computing symmetric may enable matrix : 144 transitions.
[2024-05-29 00:02:43] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:02:43] [INFO ] Computing Do-Not-Accords matrix : 144 transitions.
[2024-05-29 00:02:43] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:02:43] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13447188984883423408
Running compilation step : cd /tmp/ltsmin13447188984883423408;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 465 ms.
Running link step : cd /tmp/ltsmin13447188984883423408;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13447188984883423408;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16908316956462108139.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 144/144 transitions.
Applied a total of 0 rules in 6 ms. Remains 108 /108 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 108 cols
[2024-05-29 00:02:58] [INFO ] Computed 5 invariants in 2 ms
[2024-05-29 00:02:58] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-29 00:02:58] [INFO ] Invariant cache hit.
[2024-05-29 00:02:58] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-29 00:02:58] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2024-05-29 00:02:58] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 00:02:58] [INFO ] Invariant cache hit.
[2024-05-29 00:02:59] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 854 ms. Remains : 108/108 places, 144/144 transitions.
Built C files in :
/tmp/ltsmin110107609477467031
[2024-05-29 00:02:59] [INFO ] Computing symmetric may disable matrix : 144 transitions.
[2024-05-29 00:02:59] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:02:59] [INFO ] Computing symmetric may enable matrix : 144 transitions.
[2024-05-29 00:02:59] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:02:59] [INFO ] Computing Do-Not-Accords matrix : 144 transitions.
[2024-05-29 00:02:59] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:02:59] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin110107609477467031
Running compilation step : cd /tmp/ltsmin110107609477467031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 580 ms.
Running link step : cd /tmp/ltsmin110107609477467031;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin110107609477467031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13739764785629538695.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 00:03:14] [INFO ] Flatten gal took : 11 ms
[2024-05-29 00:03:14] [INFO ] Flatten gal took : 11 ms
[2024-05-29 00:03:14] [INFO ] Time to serialize gal into /tmp/LTL11319577205424377249.gal : 4 ms
[2024-05-29 00:03:14] [INFO ] Time to serialize properties into /tmp/LTL15538230733764915650.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11319577205424377249.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15931751663189464532.hoa' '-atoms' '/tmp/LTL15538230733764915650.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15538230733764915650.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15931751663189464532.hoa
Detected timeout of ITS tools.
[2024-05-29 00:03:29] [INFO ] Flatten gal took : 11 ms
[2024-05-29 00:03:29] [INFO ] Flatten gal took : 11 ms
[2024-05-29 00:03:29] [INFO ] Time to serialize gal into /tmp/LTL4324704654298762756.gal : 3 ms
[2024-05-29 00:03:29] [INFO ] Time to serialize properties into /tmp/LTL18254448698110182049.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4324704654298762756.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18254448698110182049.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("((s1>=1)&&(l2236>=1))"))U(G((!("((s1>=1)&&(l2237>=1))"))||(G(!("((s1>=1)&&(l2236>=1))")))))))
Formula 0 simplified : F!"((s1>=1)&&(l2236>=1))" R F("((s1>=1)&&(l2237>=1))" & F"((s1>=1)&&(l2236>=1))")
Detected timeout of ITS tools.
[2024-05-29 00:03:44] [INFO ] Flatten gal took : 11 ms
[2024-05-29 00:03:44] [INFO ] Applying decomposition
[2024-05-29 00:03:44] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8980480133540209172.txt' '-o' '/tmp/graph8980480133540209172.bin' '-w' '/tmp/graph8980480133540209172.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8980480133540209172.bin' '-l' '-1' '-v' '-w' '/tmp/graph8980480133540209172.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:03:44] [INFO ] Decomposing Gal with order
[2024-05-29 00:03:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:03:44] [INFO ] Removed a total of 114 redundant transitions.
[2024-05-29 00:03:44] [INFO ] Flatten gal took : 72 ms
[2024-05-29 00:03:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 18 ms.
[2024-05-29 00:03:44] [INFO ] Time to serialize gal into /tmp/LTL8426705360586517864.gal : 7 ms
[2024-05-29 00:03:44] [INFO ] Time to serialize properties into /tmp/LTL17171953958632263211.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8426705360586517864.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17171953958632263211.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G("((i6.u0.s1>=1)&&(i6.u0.l2236>=1))"))U(G((!("((i6.u0.s1>=1)&&(i6.u0.l2237>=1))"))||(G(!("((i6.u0.s1>=1)&&(i6.u0.l2236>=1))")))))...157
Formula 0 simplified : F!"((i6.u0.s1>=1)&&(i6.u0.l2236>=1))" R F("((i6.u0.s1>=1)&&(i6.u0.l2237>=1))" & F"((i6.u0.s1>=1)&&(i6.u0.l2236>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7576426542639174855
[2024-05-29 00:03:59] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7576426542639174855
Running compilation step : cd /tmp/ltsmin7576426542639174855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 356 ms.
Running link step : cd /tmp/ltsmin7576426542639174855;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7576426542639174855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true)) U []((!(LTLAPp1==true)||[](!(LTLAPp0==true)))))' '--buchi-type=spotba'
LTSmin run took 9704 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-08 finished in 111604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 3 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 368/368 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 152 transition count 221
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 152 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 152 transition count 220
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 46 place count 137 transition count 204
Iterating global reduction 1 with 15 rules applied. Total rules applied 61 place count 137 transition count 204
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 68 place count 137 transition count 197
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 80 place count 125 transition count 176
Iterating global reduction 2 with 12 rules applied. Total rules applied 92 place count 125 transition count 176
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 101 place count 125 transition count 167
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 104 place count 122 transition count 164
Iterating global reduction 3 with 3 rules applied. Total rules applied 107 place count 122 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 119 transition count 161
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 119 transition count 161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 116 place count 116 transition count 158
Iterating global reduction 3 with 3 rules applied. Total rules applied 119 place count 116 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 122 place count 116 transition count 155
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 125 place count 113 transition count 152
Iterating global reduction 4 with 3 rules applied. Total rules applied 128 place count 113 transition count 152
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 129 place count 112 transition count 149
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 112 transition count 149
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 131 place count 111 transition count 148
Iterating global reduction 4 with 1 rules applied. Total rules applied 132 place count 111 transition count 148
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 133 place count 110 transition count 147
Iterating global reduction 4 with 1 rules applied. Total rules applied 134 place count 110 transition count 147
Applied a total of 134 rules in 18 ms. Remains 110 /167 variables (removed 57) and now considering 147/368 (removed 221) transitions.
// Phase 1: matrix 147 rows 110 cols
[2024-05-29 00:04:09] [INFO ] Computed 5 invariants in 2 ms
[2024-05-29 00:04:10] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-29 00:04:10] [INFO ] Invariant cache hit.
[2024-05-29 00:04:10] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-29 00:04:10] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2024-05-29 00:04:10] [INFO ] Invariant cache hit.
[2024-05-29 00:04:10] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/167 places, 147/368 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 656 ms. Remains : 110/167 places, 147/368 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (OR (LT s1 1) (LT s104 1)) (OR (LT s1 1) (LT s105 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22287 reset in 159 ms.
Product exploration explored 100000 steps with 22378 reset in 166 ms.
Computed a total of 22 stabilizing places and 28 stable transitions
Graph (complete) has 370 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 22 stabilizing places and 28 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2223 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2841 steps, run visited all 1 properties in 10 ms. (steps per millisecond=284 )
Probabilistic random walk after 2841 steps, saw 1370 distinct states, run finished after 11 ms. (steps per millisecond=258 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 147/147 transitions.
Applied a total of 0 rules in 1 ms. Remains 110 /110 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2024-05-29 00:04:12] [INFO ] Invariant cache hit.
[2024-05-29 00:04:12] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-29 00:04:12] [INFO ] Invariant cache hit.
[2024-05-29 00:04:12] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-29 00:04:12] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2024-05-29 00:04:12] [INFO ] Invariant cache hit.
[2024-05-29 00:04:12] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 684 ms. Remains : 110/110 places, 147/147 transitions.
Computed a total of 22 stabilizing places and 28 stable transitions
Graph (complete) has 370 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 22 stabilizing places and 28 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2238 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 442 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2841 steps, run visited all 1 properties in 13 ms. (steps per millisecond=218 )
Probabilistic random walk after 2841 steps, saw 1370 distinct states, run finished after 14 ms. (steps per millisecond=202 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 243 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22459 reset in 156 ms.
Product exploration explored 100000 steps with 22445 reset in 166 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 147/147 transitions.
Applied a total of 0 rules in 5 ms. Remains 110 /110 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2024-05-29 00:04:14] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 00:04:14] [INFO ] Invariant cache hit.
[2024-05-29 00:04:14] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 110/110 places, 147/147 transitions.
Built C files in :
/tmp/ltsmin18124485980619704378
[2024-05-29 00:04:14] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18124485980619704378
Running compilation step : cd /tmp/ltsmin18124485980619704378;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 511 ms.
Running link step : cd /tmp/ltsmin18124485980619704378;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin18124485980619704378;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5289830884608409204.hoa' '--buchi-type=spotba'
LTSmin run took 301 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-09 finished in 5717 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 368/368 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 151 transition count 194
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 151 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 151 transition count 193
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 49 place count 135 transition count 176
Iterating global reduction 1 with 16 rules applied. Total rules applied 65 place count 135 transition count 176
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 72 place count 135 transition count 169
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 85 place count 122 transition count 146
Iterating global reduction 2 with 13 rules applied. Total rules applied 98 place count 122 transition count 146
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 107 place count 122 transition count 137
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 111 place count 118 transition count 133
Iterating global reduction 3 with 4 rules applied. Total rules applied 115 place count 118 transition count 133
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 119 place count 114 transition count 129
Iterating global reduction 3 with 4 rules applied. Total rules applied 123 place count 114 transition count 129
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 111 transition count 126
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 111 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 131 place count 111 transition count 124
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 134 place count 108 transition count 121
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 108 transition count 121
Applied a total of 137 rules in 17 ms. Remains 108 /167 variables (removed 59) and now considering 121/368 (removed 247) transitions.
// Phase 1: matrix 121 rows 108 cols
[2024-05-29 00:04:15] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 00:04:15] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-29 00:04:15] [INFO ] Invariant cache hit.
[2024-05-29 00:04:15] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-29 00:04:16] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2024-05-29 00:04:16] [INFO ] Invariant cache hit.
[2024-05-29 00:04:16] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/167 places, 121/368 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 524 ms. Remains : 108/167 places, 121/368 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-11 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 s11 1) (GEQ s32 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 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-11 finished in 613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 368/368 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 151 transition count 207
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 151 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 151 transition count 206
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 49 place count 135 transition count 189
Iterating global reduction 1 with 16 rules applied. Total rules applied 65 place count 135 transition count 189
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 72 place count 135 transition count 182
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 85 place count 122 transition count 159
Iterating global reduction 2 with 13 rules applied. Total rules applied 98 place count 122 transition count 159
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 107 place count 122 transition count 150
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 111 place count 118 transition count 146
Iterating global reduction 3 with 4 rules applied. Total rules applied 115 place count 118 transition count 146
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 119 place count 114 transition count 142
Iterating global reduction 3 with 4 rules applied. Total rules applied 123 place count 114 transition count 142
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 111 transition count 139
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 111 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 131 place count 111 transition count 137
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 134 place count 108 transition count 134
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 108 transition count 134
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 107 transition count 131
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 107 transition count 131
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 140 place count 106 transition count 130
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 105 transition count 129
Applied a total of 143 rules in 29 ms. Remains 105 /167 variables (removed 62) and now considering 129/368 (removed 239) transitions.
// Phase 1: matrix 129 rows 105 cols
[2024-05-29 00:04:16] [INFO ] Computed 5 invariants in 0 ms
[2024-05-29 00:04:16] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-29 00:04:16] [INFO ] Invariant cache hit.
[2024-05-29 00:04:16] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-29 00:04:16] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2024-05-29 00:04:16] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 00:04:16] [INFO ] Invariant cache hit.
[2024-05-29 00:04:16] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/167 places, 129/368 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 484 ms. Remains : 105/167 places, 129/368 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s100 1)), p1:(AND (GEQ s1 1) (GEQ s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-12 finished in 606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&G((X(p0)||p1))))'
Support contains 3 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 368/368 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 152 transition count 208
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 152 transition count 208
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 137 transition count 193
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 137 transition count 193
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 67 place count 137 transition count 186
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 79 place count 125 transition count 164
Iterating global reduction 1 with 12 rules applied. Total rules applied 91 place count 125 transition count 164
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 100 place count 125 transition count 155
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 104 place count 121 transition count 151
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 121 transition count 151
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 111 place count 118 transition count 148
Iterating global reduction 2 with 3 rules applied. Total rules applied 114 place count 118 transition count 148
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 116 place count 116 transition count 146
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 116 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 120 place count 116 transition count 144
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 122 place count 114 transition count 142
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 114 transition count 142
Applied a total of 124 rules in 15 ms. Remains 114 /167 variables (removed 53) and now considering 142/368 (removed 226) transitions.
// Phase 1: matrix 142 rows 114 cols
[2024-05-29 00:04:16] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 00:04:16] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-29 00:04:16] [INFO ] Invariant cache hit.
[2024-05-29 00:04:17] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-29 00:04:17] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2024-05-29 00:04:17] [INFO ] Invariant cache hit.
[2024-05-29 00:04:17] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/167 places, 142/368 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 495 ms. Remains : 114/167 places, 142/368 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 3}, { cond=(NOT p1), acceptance={0} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(OR (AND (GEQ s1 1) (GEQ s109 1)) (AND (GEQ s1 1) (GEQ s51 1))), p0:(AND (GEQ s1 1) (GEQ s109 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-13 finished in 690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 368/368 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 151 transition count 196
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 151 transition count 196
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 151 transition count 194
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 50 place count 135 transition count 177
Iterating global reduction 1 with 16 rules applied. Total rules applied 66 place count 135 transition count 177
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 74 place count 135 transition count 169
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 87 place count 122 transition count 145
Iterating global reduction 2 with 13 rules applied. Total rules applied 100 place count 122 transition count 145
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 108 place count 122 transition count 137
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 113 place count 117 transition count 132
Iterating global reduction 3 with 5 rules applied. Total rules applied 118 place count 117 transition count 132
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 123 place count 112 transition count 127
Iterating global reduction 3 with 5 rules applied. Total rules applied 128 place count 112 transition count 127
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 131 place count 109 transition count 124
Iterating global reduction 3 with 3 rules applied. Total rules applied 134 place count 109 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 136 place count 109 transition count 122
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 139 place count 106 transition count 119
Iterating global reduction 4 with 3 rules applied. Total rules applied 142 place count 106 transition count 119
Applied a total of 142 rules in 21 ms. Remains 106 /167 variables (removed 61) and now considering 119/368 (removed 249) transitions.
// Phase 1: matrix 119 rows 106 cols
[2024-05-29 00:04:17] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 00:04:17] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-29 00:04:17] [INFO ] Invariant cache hit.
[2024-05-29 00:04:17] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-29 00:04:17] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-05-29 00:04:17] [INFO ] Invariant cache hit.
[2024-05-29 00:04:17] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/167 places, 119/368 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 461 ms. Remains : 106/167 places, 119/368 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22433 reset in 123 ms.
Product exploration explored 100000 steps with 22283 reset in 134 ms.
Computed a total of 27 stabilizing places and 33 stable transitions
Graph (complete) has 337 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 27 stabilizing places and 33 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2258 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1934655 steps, run timeout after 3001 ms. (steps per millisecond=644 ) properties seen :{}
Probabilistic random walk after 1934655 steps, saw 901425 distinct states, run finished after 3006 ms. (steps per millisecond=643 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 00:04:21] [INFO ] Invariant cache hit.
[2024-05-29 00:04:21] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:04:21] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-29 00:04:21] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:04:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:04:21] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-29 00:04:22] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:04:22] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-29 00:04:22] [INFO ] After 26ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 00:04:22] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 00:04:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-29 00:04:22] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-29 00:04:22] [INFO ] After 220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 119/119 transitions.
Graph (complete) has 301 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 105 transition count 117
Applied a total of 3 rules in 6 ms. Remains 105 /106 variables (removed 1) and now considering 117/119 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 105/106 places, 117/119 transitions.
Incomplete random walk after 10000 steps, including 2229 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 439 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2058742 steps, run timeout after 3001 ms. (steps per millisecond=686 ) properties seen :{}
Probabilistic random walk after 2058742 steps, saw 961438 distinct states, run finished after 3001 ms. (steps per millisecond=686 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 105 cols
[2024-05-29 00:04:25] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 00:04:25] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:04:25] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-29 00:04:25] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:04:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:04:25] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-29 00:04:25] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:04:25] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-29 00:04:25] [INFO ] After 24ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 00:04:25] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 00:04:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-05-29 00:04:25] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-29 00:04:25] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 105/105 places, 117/117 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-29 00:04:25] [INFO ] Invariant cache hit.
[2024-05-29 00:04:25] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-29 00:04:25] [INFO ] Invariant cache hit.
[2024-05-29 00:04:25] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-29 00:04:25] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-05-29 00:04:25] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 00:04:25] [INFO ] Invariant cache hit.
[2024-05-29 00:04:26] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 537 ms. Remains : 105/105 places, 117/117 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 105 transition count 110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 99 transition count 110
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 13 place count 99 transition count 92
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 49 place count 81 transition count 92
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 59 place count 76 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 75 transition count 95
Applied a total of 61 rules in 12 ms. Remains 75 /105 variables (removed 30) and now considering 95/117 (removed 22) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 95 rows 75 cols
[2024-05-29 00:04:26] [INFO ] Computed 5 invariants in 0 ms
[2024-05-29 00:04:26] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-29 00:04:26] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-29 00:04:26] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:04:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-29 00:04:26] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-29 00:04:26] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:04:26] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-29 00:04:26] [INFO ] After 178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 0 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
// Phase 1: matrix 119 rows 106 cols
[2024-05-29 00:04:26] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 00:04:26] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-29 00:04:26] [INFO ] Invariant cache hit.
[2024-05-29 00:04:27] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-29 00:04:27] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2024-05-29 00:04:27] [INFO ] Invariant cache hit.
[2024-05-29 00:04:27] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 509 ms. Remains : 106/106 places, 119/119 transitions.
Computed a total of 27 stabilizing places and 33 stable transitions
Graph (complete) has 337 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 27 stabilizing places and 33 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2185 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1927750 steps, run timeout after 3001 ms. (steps per millisecond=642 ) properties seen :{}
Probabilistic random walk after 1927750 steps, saw 898437 distinct states, run finished after 3001 ms. (steps per millisecond=642 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 00:04:30] [INFO ] Invariant cache hit.
[2024-05-29 00:04:30] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:04:30] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-29 00:04:30] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:04:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 00:04:30] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-29 00:04:30] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:04:30] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-29 00:04:30] [INFO ] After 25ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 00:04:31] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 00:04:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-29 00:04:31] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-29 00:04:31] [INFO ] After 209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 119/119 transitions.
Graph (complete) has 301 edges and 106 vertex of which 105 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 105 transition count 117
Applied a total of 3 rules in 7 ms. Remains 105 /106 variables (removed 1) and now considering 117/119 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 105/106 places, 117/119 transitions.
Incomplete random walk after 10000 steps, including 2245 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 458 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2096337 steps, run timeout after 3001 ms. (steps per millisecond=698 ) properties seen :{}
Probabilistic random walk after 2096337 steps, saw 978699 distinct states, run finished after 3001 ms. (steps per millisecond=698 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 105 cols
[2024-05-29 00:04:34] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 00:04:34] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:04:34] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-29 00:04:34] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:04:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:04:34] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-29 00:04:34] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:04:34] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-29 00:04:34] [INFO ] After 34ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 00:04:34] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
[2024-05-29 00:04:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-05-29 00:04:34] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-29 00:04:34] [INFO ] After 304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 105/105 places, 117/117 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-29 00:04:34] [INFO ] Invariant cache hit.
[2024-05-29 00:04:34] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-29 00:04:34] [INFO ] Invariant cache hit.
[2024-05-29 00:04:34] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-29 00:04:35] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
[2024-05-29 00:04:35] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 00:04:35] [INFO ] Invariant cache hit.
[2024-05-29 00:04:35] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 698 ms. Remains : 105/105 places, 117/117 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 105 transition count 110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 99 transition count 110
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 13 place count 99 transition count 92
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 49 place count 81 transition count 92
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 59 place count 76 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 75 transition count 95
Applied a total of 61 rules in 17 ms. Remains 75 /105 variables (removed 30) and now considering 95/117 (removed 22) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 95 rows 75 cols
[2024-05-29 00:04:35] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 00:04:35] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-29 00:04:35] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-29 00:04:35] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:04:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-29 00:04:35] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-29 00:04:35] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 00:04:35] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-29 00:04:35] [INFO ] After 188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22423 reset in 208 ms.
Product exploration explored 100000 steps with 22439 reset in 233 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-05-29 00:04:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 119 rows 106 cols
[2024-05-29 00:04:37] [INFO ] Computed 5 invariants in 2 ms
[2024-05-29 00:04:37] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 168 ms. Remains : 106/106 places, 119/119 transitions.
Built C files in :
/tmp/ltsmin15815954428565161541
[2024-05-29 00:04:37] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15815954428565161541
Running compilation step : cd /tmp/ltsmin15815954428565161541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 443 ms.
Running link step : cd /tmp/ltsmin15815954428565161541;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin15815954428565161541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1576656156880987031.hoa' '--buchi-type=spotba'
LTSmin run took 215 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-15 finished in 20500 ms.
All properties solved by simple procedures.
Total runtime 224123 ms.

BK_STOP 1716941079131

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-d2m64"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is SieveSingleMsgMbox-PT-d2m64, 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 r395-smll-171683823900083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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