Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r312-tall-165472282900924.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d1m64, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282900924
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 6.6K Jun 7 17:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 7 17:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Jun 7 17:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 7 17:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 6 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 8.8K Jun 7 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 7 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 7 17:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Jun 7 17:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 450K Jun 6 12:11 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-d1m64-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654955002661

Running Version 202205111006
[2022-06-11 13:43:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 13:43:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 13:43:24] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2022-06-11 13:43:24] [INFO ] Transformed 1295 places.
[2022-06-11 13:43:24] [INFO ] Transformed 749 transitions.
[2022-06-11 13:43:24] [INFO ] Parsed PT model containing 1295 places and 749 transitions in 242 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 1036 places in 15 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 305 place count 194 transition count 369
Iterating global reduction 1 with 48 rules applied. Total rules applied 353 place count 194 transition count 369
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 358 place count 194 transition count 364
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 389 place count 163 transition count 333
Iterating global reduction 2 with 31 rules applied. Total rules applied 420 place count 163 transition count 333
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 430 place count 163 transition count 323
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 446 place count 147 transition count 307
Iterating global reduction 3 with 16 rules applied. Total rules applied 462 place count 147 transition count 307
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 500 place count 147 transition count 269
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 504 place count 143 transition count 263
Iterating global reduction 4 with 4 rules applied. Total rules applied 508 place count 143 transition count 263
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 511 place count 140 transition count 260
Iterating global reduction 4 with 3 rules applied. Total rules applied 514 place count 140 transition count 260
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 515 place count 139 transition count 258
Iterating global reduction 4 with 1 rules applied. Total rules applied 516 place count 139 transition count 258
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 517 place count 138 transition count 257
Iterating global reduction 4 with 1 rules applied. Total rules applied 518 place count 138 transition count 257
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 519 place count 137 transition count 256
Iterating global reduction 4 with 1 rules applied. Total rules applied 520 place count 137 transition count 256
Applied a total of 520 rules in 81 ms. Remains 137 /259 variables (removed 122) and now considering 256/749 (removed 493) transitions.
// Phase 1: matrix 256 rows 137 cols
[2022-06-11 13:43:24] [INFO ] Computed 5 place invariants in 19 ms
[2022-06-11 13:43:24] [INFO ] Implicit Places using invariants in 232 ms returned []
// Phase 1: matrix 256 rows 137 cols
[2022-06-11 13:43:24] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 13:43:24] [INFO ] State equation strengthened by 160 read => feed constraints.
[2022-06-11 13:43:24] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
// Phase 1: matrix 256 rows 137 cols
[2022-06-11 13:43:24] [INFO ] Computed 5 place invariants in 8 ms
[2022-06-11 13:43:25] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 137/259 places, 256/749 transitions.
Finished structural reductions, in 1 iterations. Remains : 137/259 places, 256/749 transitions.
Support contains 22 out of 137 places after structural reductions.
[2022-06-11 13:43:25] [INFO ] Flatten gal took : 47 ms
[2022-06-11 13:43:25] [INFO ] Flatten gal took : 21 ms
[2022-06-11 13:43:25] [INFO ] Input system was already deterministic with 256 transitions.
Incomplete random walk after 10000 steps, including 2206 resets, run finished after 755 ms. (steps per millisecond=13 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 108 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 40 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 109 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Interrupted probabilistic random walk after 340572 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 9=1, 12=1, 13=1, 14=1, 15=1, 16=1, 18=1, 21=1}
Probabilistic random walk after 340572 steps, saw 153018 distinct states, run finished after 3009 ms. (steps per millisecond=113 ) properties seen :16
Running SMT prover for 6 properties.
// Phase 1: matrix 256 rows 137 cols
[2022-06-11 13:43:29] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 13:43:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 13:43:29] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2022-06-11 13:43:29] [INFO ] After 268ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-11 13:43:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:43:29] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-11 13:43:30] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-11 13:43:30] [INFO ] State equation strengthened by 160 read => feed constraints.
[2022-06-11 13:43:30] [INFO ] After 243ms SMT Verify possible using 160 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-06-11 13:43:30] [INFO ] After 535ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 262 ms.
[2022-06-11 13:43:30] [INFO ] After 1122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 238 ms.
Support contains 9 out of 137 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 137/137 places, 256/256 transitions.
Graph (complete) has 473 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 136 transition count 254
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 15 place count 124 transition count 177
Iterating global reduction 1 with 12 rules applied. Total rules applied 27 place count 124 transition count 177
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 124 transition count 175
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 38 place count 115 transition count 166
Iterating global reduction 2 with 9 rules applied. Total rules applied 47 place count 115 transition count 166
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 50 place count 115 transition count 163
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 55 place count 110 transition count 157
Iterating global reduction 3 with 5 rules applied. Total rules applied 60 place count 110 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 110 transition count 155
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 109 transition count 154
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 109 transition count 154
Applied a total of 64 rules in 38 ms. Remains 109 /137 variables (removed 28) and now considering 154/256 (removed 102) transitions.
Finished structural reductions, in 1 iterations. Remains : 109/137 places, 154/256 transitions.
Incomplete random walk after 10000 steps, including 2220 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 484 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 483 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1004 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 451 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 331543 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 331543 steps, saw 142598 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 154 rows 109 cols
[2022-06-11 13:43:34] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 13:43:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:43:34] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:43:35] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-11 13:43:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:43:35] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:43:35] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-11 13:43:35] [INFO ] State equation strengthened by 80 read => feed constraints.
[2022-06-11 13:43:35] [INFO ] After 170ms SMT Verify possible using 80 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-06-11 13:43:35] [INFO ] After 362ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 163 ms.
[2022-06-11 13:43:35] [INFO ] After 724ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 274 ms.
Support contains 9 out of 109 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 109/109 places, 154/154 transitions.
Applied a total of 0 rules in 10 ms. Remains 109 /109 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 109/109 places, 154/154 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 109/109 places, 154/154 transitions.
Applied a total of 0 rules in 10 ms. Remains 109 /109 variables (removed 0) and now considering 154/154 (removed 0) transitions.
// Phase 1: matrix 154 rows 109 cols
[2022-06-11 13:43:36] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 13:43:36] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 154 rows 109 cols
[2022-06-11 13:43:36] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 13:43:36] [INFO ] State equation strengthened by 80 read => feed constraints.
[2022-06-11 13:43:36] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2022-06-11 13:43:36] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 154 rows 109 cols
[2022-06-11 13:43:36] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 13:43:36] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/109 places, 154/154 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 109 transition count 148
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 104 transition count 148
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 11 place count 104 transition count 134
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 39 place count 90 transition count 134
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 59 place count 80 transition count 124
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 80 transition count 124
Applied a total of 61 rules in 17 ms. Remains 80 /109 variables (removed 29) and now considering 124/154 (removed 30) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 124 rows 80 cols
[2022-06-11 13:43:36] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 13:43:36] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-06-11 13:43:36] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:43:36] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-11 13:43:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:43:36] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:43:36] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-11 13:43:36] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 2 ms to minimize.
[2022-06-11 13:43:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2022-06-11 13:43:37] [INFO ] After 262ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 84 ms.
[2022-06-11 13:43:37] [INFO ] After 392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2022-06-11 13:43:37] [INFO ] Flatten gal took : 9 ms
[2022-06-11 13:43:37] [INFO ] Flatten gal took : 8 ms
[2022-06-11 13:43:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16303213781634647421.gal : 3 ms
[2022-06-11 13:43:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16130990257178648525.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3554869970087784775;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16303213781634647421.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16130990257178648525.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality16130990257178648525.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :8 after 22
Reachability property AtomicPropp20 is true.
Reachability property AtomicPropp19 is true.
Reachability property AtomicPropp8 is true.
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :22 after 60
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :60 after 177
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :177 after 252
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :252 after 327
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :327 after 510
Reachability property AtomicPropp17 is true.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :510 after 1838
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1838 after 5220
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5220 after 23527
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :23527 after 147870
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :147870 after 1.38587e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.38587e+06 after 1.6626e+07
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.6626e+07 after 6.70345e+07
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :6.70345e+07 after 4.11831e+10
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :4.11831e+10 after 1.45657e+11
Detected timeout of ITS tools.
[2022-06-11 13:43:52] [INFO ] Flatten gal took : 8 ms
[2022-06-11 13:43:52] [INFO ] Applying decomposition
[2022-06-11 13:43:52] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16826741587961184400.txt' '-o' '/tmp/graph16826741587961184400.bin' '-w' '/tmp/graph16826741587961184400.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16826741587961184400.bin' '-l' '-1' '-v' '-w' '/tmp/graph16826741587961184400.weights' '-q' '0' '-e' '0.001'
[2022-06-11 13:43:52] [INFO ] Decomposing Gal with order
[2022-06-11 13:43:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 13:43:52] [INFO ] Removed a total of 30 redundant transitions.
[2022-06-11 13:43:52] [INFO ] Flatten gal took : 47 ms
[2022-06-11 13:43:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 6 ms.
[2022-06-11 13:43:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2061601684285409074.gal : 5 ms
[2022-06-11 13:43:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9744912381875992389.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms3554869970087784775;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2061601684285409074.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9744912381875992389.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality9744912381875992389.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :5 after 8
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :8 after 10
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :10 after 35
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :35 after 62
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :62 after 121
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :121 after 190
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :190 after 294
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :294 after 1119
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1119 after 2296
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2296 after 7067
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :7067 after 19443
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :19443 after 60331
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13566563775971136501
[2022-06-11 13:44:07] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13566563775971136501
Running compilation step : cd /tmp/ltsmin13566563775971136501;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 341 ms.
Running link step : cd /tmp/ltsmin13566563775971136501;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin13566563775971136501;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp10==true'
LTSmin run took 146 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin13566563775971136501;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp11==true'
LTSmin run took 113 ms.
Found Violation
Computed a total of 28 stabilizing places and 35 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(F(p0) U !(!(p1 U G(p1))||X(p2))))))'
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 256/256 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 122 transition count 174
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 122 transition count 174
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 122 transition count 171
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 45 place count 110 transition count 158
Iterating global reduction 1 with 12 rules applied. Total rules applied 57 place count 110 transition count 158
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 64 place count 110 transition count 151
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 71 place count 103 transition count 143
Iterating global reduction 2 with 7 rules applied. Total rules applied 78 place count 103 transition count 143
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 82 place count 103 transition count 139
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 85 place count 100 transition count 136
Iterating global reduction 3 with 3 rules applied. Total rules applied 88 place count 100 transition count 136
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 90 place count 98 transition count 134
Iterating global reduction 3 with 2 rules applied. Total rules applied 92 place count 98 transition count 134
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 97 transition count 133
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 97 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 96 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 96 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 95 transition count 130
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 95 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 94 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 94 transition count 129
Applied a total of 100 rules in 12 ms. Remains 94 /137 variables (removed 43) and now considering 129/256 (removed 127) transitions.
// Phase 1: matrix 129 rows 94 cols
[2022-06-11 13:44:08] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 13:44:08] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 129 rows 94 cols
[2022-06-11 13:44:08] [INFO ] Computed 5 place invariants in 8 ms
[2022-06-11 13:44:08] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-06-11 13:44:08] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
// Phase 1: matrix 129 rows 94 cols
[2022-06-11 13:44:08] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:44:08] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/137 places, 129/256 transitions.
Finished structural reductions, in 1 iterations. Remains : 94/137 places, 129/256 transitions.
Stuttering acceptance computed with spot in 507 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), false]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 6}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=(AND p0 p1), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={1} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 6}], [{ cond=(AND p1 p2), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1 p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s87 1)), p1:(AND (GEQ s1 1) (GEQ s86 1)), p2:(AND (GEQ s1 1) (GEQ s89 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22317 reset in 355 ms.
Product exploration explored 100000 steps with 22439 reset in 277 ms.
Computed a total of 13 stabilizing places and 14 stable transitions
Computed a total of 13 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 618 ms. Reduced automaton from 7 states, 22 edges and 3 AP to 7 states, 22 edges and 3 AP.
Stuttering acceptance computed with spot in 356 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), false]
Incomplete random walk after 10000 steps, including 2248 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 442 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 530 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 450 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 474 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 518 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 281905 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1}
Probabilistic random walk after 281905 steps, saw 121655 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :5
Running SMT prover for 5 properties.
// Phase 1: matrix 129 rows 94 cols
[2022-06-11 13:44:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:44:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:44:14] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 13:44:14] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2022-06-11 13:44:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:44:14] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 13:44:14] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p0 p1))), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND p1 p2))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 (NOT p2))), (F p0), (F p1)]
Knowledge based reduction with 15 factoid took 893 ms. Reduced automaton from 7 states, 22 edges and 3 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 115 ms :[p1, p1, (AND p0 p1), p1]
Stuttering acceptance computed with spot in 128 ms :[p1, p1, (AND p0 p1), p1]
Support contains 3 out of 94 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 129/129 transitions.
Applied a total of 0 rules in 2 ms. Remains 94 /94 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 94 cols
[2022-06-11 13:44:16] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 13:44:16] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 129 rows 94 cols
[2022-06-11 13:44:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:44:16] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-06-11 13:44:16] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
// Phase 1: matrix 129 rows 94 cols
[2022-06-11 13:44:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:44:16] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 94/94 places, 129/129 transitions.
Computed a total of 13 stabilizing places and 14 stable transitions
Computed a total of 13 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 150 ms :[p1, p1, (AND p0 p1), p1]
Incomplete random walk after 10000 steps, including 2219 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 454 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Finished probabilistic random walk after 9880 steps, run visited all 2 properties in 32 ms. (steps per millisecond=308 )
Probabilistic random walk after 9880 steps, saw 4706 distinct states, run finished after 32 ms. (steps per millisecond=308 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 5 factoid took 413 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 136 ms :[p1, p1, (AND p0 p1), p1]
Stuttering acceptance computed with spot in 152 ms :[p1, p1, (AND p0 p1), p1]
Stuttering acceptance computed with spot in 198 ms :[p1, p1, (AND p0 p1), p1]
Product exploration explored 100000 steps with 22497 reset in 123 ms.
Product exploration explored 100000 steps with 22398 reset in 119 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 150 ms :[p1, p1, (AND p0 p1), p1]
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 129/129 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 92 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 92 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 91 transition count 117
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 91 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 91 transition count 116
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 90 transition count 115
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 90 transition count 115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 89 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 89 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 88 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 88 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 88 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 87 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 87 transition count 109
Applied a total of 19 rules in 32 ms. Remains 87 /94 variables (removed 7) and now considering 109/129 (removed 20) transitions.
[2022-06-11 13:44:18] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 109 rows 87 cols
[2022-06-11 13:44:18] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 13:44:18] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/94 places, 109/129 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/94 places, 109/129 transitions.
Product exploration explored 100000 steps with 22541 reset in 305 ms.
Product exploration explored 100000 steps with 22512 reset in 242 ms.
Built C files in :
/tmp/ltsmin11129430424233925598
[2022-06-11 13:44:19] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11129430424233925598
Running compilation step : cd /tmp/ltsmin11129430424233925598;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 220 ms.
Running link step : cd /tmp/ltsmin11129430424233925598;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11129430424233925598;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2199723312296426639.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 129/129 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 92 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 92 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 91 transition count 117
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 91 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 91 transition count 116
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 90 transition count 115
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 90 transition count 115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 89 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 89 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 88 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 88 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 88 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 87 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 87 transition count 109
Applied a total of 19 rules in 17 ms. Remains 87 /94 variables (removed 7) and now considering 109/129 (removed 20) transitions.
// Phase 1: matrix 109 rows 87 cols
[2022-06-11 13:44:34] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 13:44:34] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 109 rows 87 cols
[2022-06-11 13:44:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:44:34] [INFO ] State equation strengthened by 52 read => feed constraints.
[2022-06-11 13:44:34] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
// Phase 1: matrix 109 rows 87 cols
[2022-06-11 13:44:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:44:34] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/94 places, 109/129 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/94 places, 109/129 transitions.
Built C files in :
/tmp/ltsmin462163876789729953
[2022-06-11 13:44:34] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin462163876789729953
Running compilation step : cd /tmp/ltsmin462163876789729953;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 190 ms.
Running link step : cd /tmp/ltsmin462163876789729953;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin462163876789729953;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11218497962597659283.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 13:44:49] [INFO ] Flatten gal took : 8 ms
[2022-06-11 13:44:49] [INFO ] Flatten gal took : 8 ms
[2022-06-11 13:44:49] [INFO ] Time to serialize gal into /tmp/LTL1479085665994765126.gal : 2 ms
[2022-06-11 13:44:49] [INFO ] Time to serialize properties into /tmp/LTL17884429665816319562.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1479085665994765126.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17884429665816319562.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1479085...267
Read 1 LTL properties
Checking formula 0 : !((X(F(!((F("((s1>=1)&&(l1187>=1))"))U(!((!(("((s1>=1)&&(l1186>=1))")U(G("((s1>=1)&&(l1186>=1))"))))||(X("((s1>=1)&&(l1201>=1))"))))))...158
Formula 0 simplified : !XF!(F"((s1>=1)&&(l1187>=1))" U !(!("((s1>=1)&&(l1186>=1))" U G"((s1>=1)&&(l1186>=1))") | X"((s1>=1)&&(l1201>=1))"))
Detected timeout of ITS tools.
[2022-06-11 13:45:04] [INFO ] Flatten gal took : 10 ms
[2022-06-11 13:45:04] [INFO ] Applying decomposition
[2022-06-11 13:45:04] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17017079240823308829.txt' '-o' '/tmp/graph17017079240823308829.bin' '-w' '/tmp/graph17017079240823308829.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17017079240823308829.bin' '-l' '-1' '-v' '-w' '/tmp/graph17017079240823308829.weights' '-q' '0' '-e' '0.001'
[2022-06-11 13:45:04] [INFO ] Decomposing Gal with order
[2022-06-11 13:45:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 13:45:04] [INFO ] Removed a total of 88 redundant transitions.
[2022-06-11 13:45:04] [INFO ] Flatten gal took : 15 ms
[2022-06-11 13:45:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 4 ms.
[2022-06-11 13:45:04] [INFO ] Time to serialize gal into /tmp/LTL1168431062242274220.gal : 2 ms
[2022-06-11 13:45:04] [INFO ] Time to serialize properties into /tmp/LTL8911216670176474739.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1168431062242274220.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8911216670176474739.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1168431...245
Read 1 LTL properties
Checking formula 0 : !((X(F(!((F("((u0.s1>=1)&&(u0.l1187>=1))"))U(!((!(("((u0.s1>=1)&&(u0.l1186>=1))")U(G("((u0.s1>=1)&&(u0.l1186>=1))"))))||(X("((u0.s1>=1...182
Formula 0 simplified : !XF!(F"((u0.s1>=1)&&(u0.l1187>=1))" U !(!("((u0.s1>=1)&&(u0.l1186>=1))" U G"((u0.s1>=1)&&(u0.l1186>=1))") | X"((u0.s1>=1)&&(u0.l1201...163
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2601520224651994222
[2022-06-11 13:45:19] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2601520224651994222
Running compilation step : cd /tmp/ltsmin2601520224651994222;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 215 ms.
Running link step : cd /tmp/ltsmin2601520224651994222;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2601520224651994222;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(!(<>((LTLAPp0==true)) U !(!((LTLAPp1==true) U []((LTLAPp1==true)))||X((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-00 finished in 86636 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(p0))))'
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 256/256 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 120 transition count 154
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 120 transition count 154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 120 transition count 151
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 51 place count 106 transition count 136
Iterating global reduction 1 with 14 rules applied. Total rules applied 65 place count 106 transition count 136
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 106 transition count 129
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 81 place count 97 transition count 119
Iterating global reduction 2 with 9 rules applied. Total rules applied 90 place count 97 transition count 119
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 95 place count 97 transition count 114
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 99 place count 93 transition count 110
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 93 transition count 110
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 106 place count 90 transition count 107
Iterating global reduction 3 with 3 rules applied. Total rules applied 109 place count 90 transition count 107
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 88 transition count 105
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 88 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 115 place count 88 transition count 103
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 86 transition count 100
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 120 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 84 transition count 98
Applied a total of 123 rules in 29 ms. Remains 84 /137 variables (removed 53) and now considering 98/256 (removed 158) transitions.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:45:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:45:34] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:45:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:45:35] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 13:45:35] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2022-06-11 13:45:35] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:45:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:45:35] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/137 places, 98/256 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/137 places, 98/256 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22412 reset in 198 ms.
Product exploration explored 100000 steps with 22359 reset in 138 ms.
Computed a total of 13 stabilizing places and 14 stable transitions
Computed a total of 13 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2243 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3856 steps, run visited all 1 properties in 8 ms. (steps per millisecond=482 )
Probabilistic random walk after 3856 steps, saw 1737 distinct states, run finished after 8 ms. (steps per millisecond=482 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 98/98 transitions.
Applied a total of 0 rules in 6 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:45:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:45:36] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:45:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:45:36] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 13:45:36] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2022-06-11 13:45:36] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:45:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:45:36] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 98/98 transitions.
Computed a total of 13 stabilizing places and 14 stable transitions
Computed a total of 13 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2202 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 494 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3856 steps, run visited all 1 properties in 10 ms. (steps per millisecond=385 )
Probabilistic random walk after 3856 steps, saw 1737 distinct states, run finished after 10 ms. (steps per millisecond=385 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22556 reset in 108 ms.
Product exploration explored 100000 steps with 22481 reset in 107 ms.
Built C files in :
/tmp/ltsmin18227114771577566959
[2022-06-11 13:45:37] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2022-06-11 13:45:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 13:45:37] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2022-06-11 13:45:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 13:45:37] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2022-06-11 13:45:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 13:45:37] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18227114771577566959
Running compilation step : cd /tmp/ltsmin18227114771577566959;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 209 ms.
Running link step : cd /tmp/ltsmin18227114771577566959;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18227114771577566959;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13566673407683180474.hoa' '--buchi-type=spotba'
LTSmin run took 315 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-02 finished in 2797 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!(G(p0) U !p1)||p2)&&(F(!p1)||p3))))'
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 256/256 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 122 transition count 149
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 122 transition count 149
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 122 transition count 148
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 46 place count 107 transition count 132
Iterating global reduction 1 with 15 rules applied. Total rules applied 61 place count 107 transition count 132
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 68 place count 107 transition count 125
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 78 place count 97 transition count 114
Iterating global reduction 2 with 10 rules applied. Total rules applied 88 place count 97 transition count 114
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 94 place count 97 transition count 108
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 93 transition count 104
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 93 transition count 104
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 105 place count 90 transition count 101
Iterating global reduction 3 with 3 rules applied. Total rules applied 108 place count 90 transition count 101
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 110 place count 88 transition count 99
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 88 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 113 place count 88 transition count 98
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 115 place count 86 transition count 95
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 86 transition count 95
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 118 place count 85 transition count 94
Iterating global reduction 4 with 1 rules applied. Total rules applied 119 place count 85 transition count 94
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 120 place count 84 transition count 93
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 84 transition count 93
Applied a total of 121 rules in 21 ms. Remains 84 /137 variables (removed 53) and now considering 93/256 (removed 163) transitions.
// Phase 1: matrix 93 rows 84 cols
[2022-06-11 13:45:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:45:37] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 93 rows 84 cols
[2022-06-11 13:45:37] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 13:45:37] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-11 13:45:38] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
// Phase 1: matrix 93 rows 84 cols
[2022-06-11 13:45:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:45:38] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/137 places, 93/256 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/137 places, 93/256 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p1 (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND p1 (NOT p3))), true, p1, (AND p0 (NOT p1)), p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s82 1)), p1:(AND (GEQ s1 1) (GEQ s75 1)), p3:(OR (LT s1 1) (LT s82 1)), p0:(AND (GEQ s1 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-03 finished in 641 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((G(X(p1))&&p0))&&F(X(X(p2))))))'
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 256/256 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 121 transition count 157
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 121 transition count 157
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 121 transition count 153
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 49 place count 108 transition count 139
Iterating global reduction 1 with 13 rules applied. Total rules applied 62 place count 108 transition count 139
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 69 place count 108 transition count 132
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 76 place count 101 transition count 124
Iterating global reduction 2 with 7 rules applied. Total rules applied 83 place count 101 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 86 place count 101 transition count 121
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 98 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 98 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 97 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 97 transition count 117
Applied a total of 94 rules in 12 ms. Remains 97 /137 variables (removed 40) and now considering 117/256 (removed 139) transitions.
// Phase 1: matrix 117 rows 97 cols
[2022-06-11 13:45:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:45:38] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 117 rows 97 cols
[2022-06-11 13:45:38] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 13:45:38] [INFO ] State equation strengthened by 54 read => feed constraints.
[2022-06-11 13:45:38] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
// Phase 1: matrix 117 rows 97 cols
[2022-06-11 13:45:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:45:38] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/137 places, 117/256 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/137 places, 117/256 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(AND (GEQ s1 1) (GEQ s54 1)), p1:(AND (GEQ s1 1) (GEQ s81 1)), p2:(OR (LT s1 1) (LT s92 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-04 finished in 513 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(!p0))))'
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 256/256 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 120 transition count 154
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 120 transition count 154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 120 transition count 151
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 51 place count 106 transition count 136
Iterating global reduction 1 with 14 rules applied. Total rules applied 65 place count 106 transition count 136
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 106 transition count 129
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 81 place count 97 transition count 119
Iterating global reduction 2 with 9 rules applied. Total rules applied 90 place count 97 transition count 119
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 95 place count 97 transition count 114
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 99 place count 93 transition count 110
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 93 transition count 110
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 106 place count 90 transition count 107
Iterating global reduction 3 with 3 rules applied. Total rules applied 109 place count 90 transition count 107
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 88 transition count 105
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 88 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 115 place count 88 transition count 103
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 86 transition count 100
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 120 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 84 transition count 98
Applied a total of 123 rules in 25 ms. Remains 84 /137 variables (removed 53) and now considering 98/256 (removed 158) transitions.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:45:38] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 13:45:38] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:45:38] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 13:45:38] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 13:45:39] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2022-06-11 13:45:39] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:45:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:45:39] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/137 places, 98/256 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/137 places, 98/256 transitions.
Stuttering acceptance computed with spot in 42 ms :[false]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s79 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22423 reset in 112 ms.
Product exploration explored 100000 steps with 22512 reset in 240 ms.
Computed a total of 13 stabilizing places and 14 stable transitions
Computed a total of 13 stabilizing places and 14 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[false]
Incomplete random walk after 10000 steps, including 2241 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 488 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1119934 steps, run visited all 1 properties in 1545 ms. (steps per millisecond=724 )
Probabilistic random walk after 1119934 steps, saw 497331 distinct states, run finished after 1545 ms. (steps per millisecond=724 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[false]
Stuttering acceptance computed with spot in 32 ms :[false]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:45:41] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:45:41] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:45:41] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 13:45:41] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 13:45:41] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2022-06-11 13:45:41] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:45:41] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 13:45:41] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 98/98 transitions.
Computed a total of 13 stabilizing places and 14 stable transitions
Computed a total of 13 stabilizing places and 14 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[false]
Incomplete random walk after 10000 steps, including 2217 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 457 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1119934 steps, run visited all 1 properties in 1398 ms. (steps per millisecond=801 )
Probabilistic random walk after 1119934 steps, saw 497331 distinct states, run finished after 1398 ms. (steps per millisecond=801 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[false]
Stuttering acceptance computed with spot in 34 ms :[false]
Stuttering acceptance computed with spot in 32 ms :[false]
Product exploration explored 100000 steps with 22387 reset in 98 ms.
Product exploration explored 100000 steps with 22418 reset in 117 ms.
Built C files in :
/tmp/ltsmin9777757683200309161
[2022-06-11 13:45:43] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2022-06-11 13:45:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 13:45:43] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2022-06-11 13:45:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 13:45:43] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2022-06-11 13:45:43] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 13:45:43] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9777757683200309161
Running compilation step : cd /tmp/ltsmin9777757683200309161;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 213 ms.
Running link step : cd /tmp/ltsmin9777757683200309161;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9777757683200309161;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased587187550874642927.hoa' '--buchi-type=spotba'
LTSmin run took 399 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-06 finished in 5627 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 256/256 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 120 transition count 154
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 120 transition count 154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 120 transition count 151
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 51 place count 106 transition count 136
Iterating global reduction 1 with 14 rules applied. Total rules applied 65 place count 106 transition count 136
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 106 transition count 129
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 81 place count 97 transition count 119
Iterating global reduction 2 with 9 rules applied. Total rules applied 90 place count 97 transition count 119
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 95 place count 97 transition count 114
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 99 place count 93 transition count 110
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 93 transition count 110
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 106 place count 90 transition count 107
Iterating global reduction 3 with 3 rules applied. Total rules applied 109 place count 90 transition count 107
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 88 transition count 105
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 88 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 115 place count 88 transition count 103
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 86 transition count 100
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 120 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 84 transition count 98
Applied a total of 123 rules in 12 ms. Remains 84 /137 variables (removed 53) and now considering 98/256 (removed 158) transitions.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:45:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:45:44] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:45:44] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 13:45:44] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 13:45:44] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2022-06-11 13:45:44] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:45:44] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 13:45:44] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/137 places, 98/256 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/137 places, 98/256 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-07 finished in 342 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||p1)))'
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 256/256 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 121 transition count 146
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 121 transition count 146
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 121 transition count 143
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 48 place count 108 transition count 129
Iterating global reduction 1 with 13 rules applied. Total rules applied 61 place count 108 transition count 129
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 108 transition count 122
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 76 place count 100 transition count 114
Iterating global reduction 2 with 8 rules applied. Total rules applied 84 place count 100 transition count 114
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 89 place count 100 transition count 109
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 93 place count 96 transition count 105
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 96 transition count 105
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 101 place count 92 transition count 101
Iterating global reduction 3 with 4 rules applied. Total rules applied 105 place count 92 transition count 101
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 108 place count 89 transition count 98
Iterating global reduction 3 with 3 rules applied. Total rules applied 111 place count 89 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 113 place count 89 transition count 96
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 115 place count 87 transition count 94
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 87 transition count 94
Applied a total of 117 rules in 16 ms. Remains 87 /137 variables (removed 50) and now considering 94/256 (removed 162) transitions.
// Phase 1: matrix 94 rows 87 cols
[2022-06-11 13:45:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:45:44] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 94 rows 87 cols
[2022-06-11 13:45:44] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 13:45:44] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-11 13:45:45] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2022-06-11 13:45:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 94 rows 87 cols
[2022-06-11 13:45:45] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:45:45] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/137 places, 94/256 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/137 places, 94/256 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s70 1)), p1:(AND (GEQ s8 1) (GEQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-08 finished in 303 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F((X((G(p1)||p0))||X(!(p2 U !p3)))))))'
Support contains 5 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 256/256 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 122 transition count 165
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 122 transition count 165
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 122 transition count 162
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 45 place count 110 transition count 149
Iterating global reduction 1 with 12 rules applied. Total rules applied 57 place count 110 transition count 149
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 61 place count 110 transition count 145
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 69 place count 102 transition count 136
Iterating global reduction 2 with 8 rules applied. Total rules applied 77 place count 102 transition count 136
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 81 place count 102 transition count 132
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 84 place count 99 transition count 129
Iterating global reduction 3 with 3 rules applied. Total rules applied 87 place count 99 transition count 129
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 97 transition count 127
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 97 transition count 127
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 95 transition count 125
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 95 transition count 125
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 98 place count 95 transition count 122
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 100 place count 93 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 102 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 103 place count 92 transition count 118
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 105 place count 91 transition count 117
Iterating global reduction 4 with 1 rules applied. Total rules applied 106 place count 91 transition count 117
Applied a total of 106 rules in 27 ms. Remains 91 /137 variables (removed 46) and now considering 117/256 (removed 139) transitions.
// Phase 1: matrix 117 rows 91 cols
[2022-06-11 13:45:45] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 13:45:45] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 117 rows 91 cols
[2022-06-11 13:45:45] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:45:45] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-11 13:45:45] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2022-06-11 13:45:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 117 rows 91 cols
[2022-06-11 13:45:45] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 13:45:45] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/137 places, 117/256 transitions.
Finished structural reductions, in 1 iterations. Remains : 91/137 places, 117/256 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p2 p3 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p3:(AND (GEQ s17 1) (GEQ s28 1)), p0:(OR (LT s1 1) (LT s86 1)), p1:(OR (LT s1 1) (LT s86 1)), p2:(AND (GEQ s1 1) (GEQ s85 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22407 reset in 132 ms.
Product exploration explored 100000 steps with 22538 reset in 155 ms.
Computed a total of 13 stabilizing places and 14 stable transitions
Computed a total of 13 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p3) p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND p1 p2 p3 (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) p2 p3 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 p2 p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p3 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 477 ms. Reduced automaton from 2 states, 6 edges and 4 AP to 2 states, 6 edges and 4 AP.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2251 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 499 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 493539 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{0=1, 4=1}
Probabilistic random walk after 493539 steps, saw 233461 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :2
Running SMT prover for 3 properties.
// Phase 1: matrix 117 rows 91 cols
[2022-06-11 13:45:49] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 13:45:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:45:49] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 13:45:49] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND p1 p2 p3 (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) p2 p3 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 p2 p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p3 (NOT p0))))), (G (NOT (AND (NOT p1) p2 (NOT p0) p3))), (G (NOT (AND p1 (NOT p0) (NOT p3)))), (G (NOT (AND p1 p2 (NOT p0) p3)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) (NOT p3))), (F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 12 factoid took 437 ms. Reduced automaton from 2 states, 6 edges and 4 AP to 2 states, 3 edges and 4 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 5 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 6 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 91 cols
[2022-06-11 13:45:50] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:45:50] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 117 rows 91 cols
[2022-06-11 13:45:50] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 13:45:50] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-11 13:45:50] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2022-06-11 13:45:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 117 rows 91 cols
[2022-06-11 13:45:50] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:45:50] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 91/91 places, 117/117 transitions.
Computed a total of 13 stabilizing places and 14 stable transitions
Computed a total of 13 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2) (NOT p3)), (X (OR (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (OR (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 4 AP to 2 states, 3 edges and 4 AP.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 2249 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 470 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 454 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 2111755 steps, run timeout after 3001 ms. (steps per millisecond=703 ) properties seen :{1=1}
Probabilistic random walk after 2111755 steps, saw 959875 distinct states, run finished after 3001 ms. (steps per millisecond=703 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 91 cols
[2022-06-11 13:45:54] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 13:45:54] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2) (NOT p3)), (X (OR (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (OR (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (G (OR (NOT p1) (NOT p2) p0))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 6 factoid took 249 ms. Reduced automaton from 2 states, 3 edges and 4 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 22486 reset in 119 ms.
Product exploration explored 100000 steps with 22500 reset in 144 ms.
Built C files in :
/tmp/ltsmin2493091198474871319
[2022-06-11 13:45:54] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2022-06-11 13:45:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 13:45:54] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2022-06-11 13:45:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 13:45:54] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2022-06-11 13:45:54] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 13:45:54] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2493091198474871319
Running compilation step : cd /tmp/ltsmin2493091198474871319;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 251 ms.
Running link step : cd /tmp/ltsmin2493091198474871319;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2493091198474871319;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4561903101252236029.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 90 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 89 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 89 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 89 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 88 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 88 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 88 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 87 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 87 transition count 103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 86 transition count 102
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 86 transition count 102
Applied a total of 12 rules in 18 ms. Remains 86 /91 variables (removed 5) and now considering 102/117 (removed 15) transitions.
// Phase 1: matrix 102 rows 86 cols
[2022-06-11 13:46:10] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 13:46:10] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 102 rows 86 cols
[2022-06-11 13:46:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:46:10] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-11 13:46:10] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2022-06-11 13:46:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 102 rows 86 cols
[2022-06-11 13:46:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:46:10] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/91 places, 102/117 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/91 places, 102/117 transitions.
Built C files in :
/tmp/ltsmin16970871430444607292
[2022-06-11 13:46:10] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2022-06-11 13:46:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 13:46:10] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2022-06-11 13:46:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 13:46:10] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2022-06-11 13:46:10] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 13:46:10] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16970871430444607292
Running compilation step : cd /tmp/ltsmin16970871430444607292;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 217 ms.
Running link step : cd /tmp/ltsmin16970871430444607292;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin16970871430444607292;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12686467143533699493.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 13:46:25] [INFO ] Flatten gal took : 7 ms
[2022-06-11 13:46:25] [INFO ] Flatten gal took : 6 ms
[2022-06-11 13:46:25] [INFO ] Time to serialize gal into /tmp/LTL3753646161788033994.gal : 1 ms
[2022-06-11 13:46:25] [INFO ] Time to serialize properties into /tmp/LTL17291298704017069347.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3753646161788033994.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17291298704017069347.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3753646...267
Read 1 LTL properties
Checking formula 0 : !((F(G(F((X(((G("((s1<1)||(l1194<1))"))||("(s1<1)"))||("(l1194<1)")))||(X(!(("((s1>=1)&&(l1190>=1))")U(!("((p51>=1)&&(l0>=1))"))))))))...157
Formula 0 simplified : !FGF(X("(l1194<1)" | "(s1<1)" | G"((s1<1)||(l1194<1))") | X!("((s1>=1)&&(l1190>=1))" U !"((p51>=1)&&(l0>=1))"))
Detected timeout of ITS tools.
[2022-06-11 13:46:40] [INFO ] Flatten gal took : 6 ms
[2022-06-11 13:46:40] [INFO ] Applying decomposition
[2022-06-11 13:46:40] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14407284183547371100.txt' '-o' '/tmp/graph14407284183547371100.bin' '-w' '/tmp/graph14407284183547371100.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14407284183547371100.bin' '-l' '-1' '-v' '-w' '/tmp/graph14407284183547371100.weights' '-q' '0' '-e' '0.001'
[2022-06-11 13:46:40] [INFO ] Decomposing Gal with order
[2022-06-11 13:46:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 13:46:40] [INFO ] Removed a total of 90 redundant transitions.
[2022-06-11 13:46:40] [INFO ] Flatten gal took : 12 ms
[2022-06-11 13:46:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 3 ms.
[2022-06-11 13:46:40] [INFO ] Time to serialize gal into /tmp/LTL15358517948829015040.gal : 2 ms
[2022-06-11 13:46:40] [INFO ] Time to serialize properties into /tmp/LTL14985734977472397326.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15358517948829015040.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14985734977472397326.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1535851...247
Read 1 LTL properties
Checking formula 0 : !((F(G(F((X(((G("((i4.u0.s1<1)||(i4.u0.l1194<1))"))||("(i4.u0.s1<1)"))||("(i4.u0.l1194<1)")))||(X(!(("((i4.u0.s1>=1)&&(i4.u0.l1190>=1)...205
Formula 0 simplified : !FGF(X("(i4.u0.l1194<1)" | "(i4.u0.s1<1)" | G"((i4.u0.s1<1)||(i4.u0.l1194<1))") | X!("((i4.u0.s1>=1)&&(i4.u0.l1190>=1))" U !"((i4.u0...182
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18215893306552064206
[2022-06-11 13:46:55] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18215893306552064206
Running compilation step : cd /tmp/ltsmin18215893306552064206;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 207 ms.
Running link step : cd /tmp/ltsmin18215893306552064206;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin18215893306552064206;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](<>((X(([]((LTLAPp1==true))||(LTLAPp0==true)))||X(!((LTLAPp2==true) U !(LTLAPp3==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-11 finished in 85767 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 256/256 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 120 transition count 154
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 120 transition count 154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 120 transition count 151
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 51 place count 106 transition count 136
Iterating global reduction 1 with 14 rules applied. Total rules applied 65 place count 106 transition count 136
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 106 transition count 129
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 81 place count 97 transition count 119
Iterating global reduction 2 with 9 rules applied. Total rules applied 90 place count 97 transition count 119
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 95 place count 97 transition count 114
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 99 place count 93 transition count 110
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 93 transition count 110
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 106 place count 90 transition count 107
Iterating global reduction 3 with 3 rules applied. Total rules applied 109 place count 90 transition count 107
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 88 transition count 105
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 88 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 115 place count 88 transition count 103
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 86 transition count 100
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 120 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 84 transition count 98
Applied a total of 123 rules in 13 ms. Remains 84 /137 variables (removed 53) and now considering 98/256 (removed 158) transitions.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:47:10] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 13:47:10] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:47:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:47:11] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 13:47:11] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:47:11] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 13:47:11] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/137 places, 98/256 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/137 places, 98/256 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-12 finished in 373 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 256/256 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 120 transition count 154
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 120 transition count 154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 120 transition count 151
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 51 place count 106 transition count 136
Iterating global reduction 1 with 14 rules applied. Total rules applied 65 place count 106 transition count 136
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 106 transition count 129
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 81 place count 97 transition count 119
Iterating global reduction 2 with 9 rules applied. Total rules applied 90 place count 97 transition count 119
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 95 place count 97 transition count 114
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 99 place count 93 transition count 110
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 93 transition count 110
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 106 place count 90 transition count 107
Iterating global reduction 3 with 3 rules applied. Total rules applied 109 place count 90 transition count 107
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 88 transition count 105
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 88 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 115 place count 88 transition count 103
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 86 transition count 100
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 120 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 84 transition count 98
Applied a total of 123 rules in 21 ms. Remains 84 /137 variables (removed 53) and now considering 98/256 (removed 158) transitions.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:47:11] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 13:47:11] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:47:11] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:47:11] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 13:47:11] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2022-06-11 13:47:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 13:47:11] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:47:11] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/137 places, 98/256 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/137 places, 98/256 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-13 finished in 299 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(X(p1))||p0))&&F(p2)))'
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 256/256 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 121 transition count 155
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 121 transition count 155
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 121 transition count 153
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 108 transition count 140
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 108 transition count 140
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 67 place count 108 transition count 133
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 75 place count 100 transition count 124
Iterating global reduction 2 with 8 rules applied. Total rules applied 83 place count 100 transition count 124
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 88 place count 100 transition count 119
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 90 place count 98 transition count 117
Iterating global reduction 3 with 2 rules applied. Total rules applied 92 place count 98 transition count 117
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 97 transition count 116
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 97 transition count 116
Applied a total of 94 rules in 8 ms. Remains 97 /137 variables (removed 40) and now considering 116/256 (removed 140) transitions.
// Phase 1: matrix 116 rows 97 cols
[2022-06-11 13:47:11] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:47:11] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 116 rows 97 cols
[2022-06-11 13:47:11] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 13:47:11] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-06-11 13:47:11] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 97 cols
[2022-06-11 13:47:11] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 13:47:11] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/137 places, 116/256 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/137 places, 116/256 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s89 1)), p0:(OR (AND (GEQ s1 1) (GEQ s89 1) (GEQ s1 1) (GEQ s92 1)) (AND (GEQ s1 1) (GEQ s44 1))), p1:(AND (GEQ s1 1) (GEQ s44 1))...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m64-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-14 finished in 426 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(F(p0) U !(!(p1 U G(p1))||X(p2))))))'
Found a CL insensitive property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-00
Stuttering acceptance computed with spot in 279 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), false]
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 137/137 places, 256/256 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 122 transition count 174
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 122 transition count 174
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 122 transition count 171
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 45 place count 110 transition count 158
Iterating global reduction 1 with 12 rules applied. Total rules applied 57 place count 110 transition count 158
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 64 place count 110 transition count 151
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 71 place count 103 transition count 143
Iterating global reduction 2 with 7 rules applied. Total rules applied 78 place count 103 transition count 143
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 82 place count 103 transition count 139
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 85 place count 100 transition count 136
Iterating global reduction 3 with 3 rules applied. Total rules applied 88 place count 100 transition count 136
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 90 place count 98 transition count 134
Iterating global reduction 3 with 2 rules applied. Total rules applied 92 place count 98 transition count 134
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 97 transition count 133
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 97 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 96 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 96 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 95 transition count 130
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 95 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 94 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 94 transition count 129
Applied a total of 100 rules in 21 ms. Remains 94 /137 variables (removed 43) and now considering 129/256 (removed 127) transitions.
// Phase 1: matrix 129 rows 94 cols
[2022-06-11 13:47:12] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 13:47:12] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 129 rows 94 cols
[2022-06-11 13:47:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:47:12] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-06-11 13:47:12] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
// Phase 1: matrix 129 rows 94 cols
[2022-06-11 13:47:12] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 13:47:12] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 94/137 places, 129/256 transitions.
Finished structural reductions, in 1 iterations. Remains : 94/137 places, 129/256 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m64-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 6}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=(AND p0 p1), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={1} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 6}], [{ cond=(AND p1 p2), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1 p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s87 1)), p1:(AND (GEQ s1 1) (GEQ s86 1)), p2:(AND (GEQ s1 1) (GEQ s89 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22432 reset in 125 ms.
Product exploration explored 100000 steps with 22485 reset in 129 ms.
Computed a total of 13 stabilizing places and 14 stable transitions
Computed a total of 13 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 542 ms. Reduced automaton from 7 states, 22 edges and 3 AP to 7 states, 22 edges and 3 AP.
Stuttering acceptance computed with spot in 368 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), false]
Incomplete random walk after 10000 steps, including 2255 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 455 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 505 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 505 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 495 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 484 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 385745 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1}
Probabilistic random walk after 385745 steps, saw 166825 distinct states, run finished after 3004 ms. (steps per millisecond=128 ) properties seen :5
Running SMT prover for 5 properties.
// Phase 1: matrix 129 rows 94 cols
[2022-06-11 13:47:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:47:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:47:17] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 13:47:17] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2022-06-11 13:47:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:47:18] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 13:47:18] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p0 p1))), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND p1 p2))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 (NOT p2))), (F p0), (F p1)]
Knowledge based reduction with 15 factoid took 880 ms. Reduced automaton from 7 states, 22 edges and 3 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 135 ms :[p1, p1, (AND p0 p1), p1]
Stuttering acceptance computed with spot in 163 ms :[p1, p1, (AND p0 p1), p1]
Support contains 3 out of 94 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 129/129 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 94 cols
[2022-06-11 13:47:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:47:19] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 129 rows 94 cols
[2022-06-11 13:47:19] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 13:47:19] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-06-11 13:47:19] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
// Phase 1: matrix 129 rows 94 cols
[2022-06-11 13:47:19] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 13:47:19] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 94/94 places, 129/129 transitions.
Computed a total of 13 stabilizing places and 14 stable transitions
Computed a total of 13 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 159 ms :[p1, p1, (AND p0 p1), p1]
Incomplete random walk after 10000 steps, including 2256 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 506 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 500 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Finished probabilistic random walk after 9880 steps, run visited all 2 properties in 31 ms. (steps per millisecond=318 )
Probabilistic random walk after 9880 steps, saw 4706 distinct states, run finished after 31 ms. (steps per millisecond=318 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 5 factoid took 212 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 224 ms :[p1, p1, (AND p0 p1), p1]
Stuttering acceptance computed with spot in 131 ms :[p1, p1, (AND p0 p1), p1]
Stuttering acceptance computed with spot in 136 ms :[p1, p1, (AND p0 p1), p1]
Product exploration explored 100000 steps with 22448 reset in 117 ms.
Product exploration explored 100000 steps with 22403 reset in 139 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 144 ms :[p1, p1, (AND p0 p1), p1]
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 129/129 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 92 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 92 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 91 transition count 117
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 91 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 91 transition count 116
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 90 transition count 115
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 90 transition count 115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 89 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 89 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 88 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 88 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 88 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 87 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 87 transition count 109
Applied a total of 19 rules in 16 ms. Remains 87 /94 variables (removed 7) and now considering 109/129 (removed 20) transitions.
[2022-06-11 13:47:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 109 rows 87 cols
[2022-06-11 13:47:21] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 13:47:21] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/94 places, 109/129 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/94 places, 109/129 transitions.
Product exploration explored 100000 steps with 22336 reset in 197 ms.
Product exploration explored 100000 steps with 22444 reset in 225 ms.
Built C files in :
/tmp/ltsmin10669210000248735984
[2022-06-11 13:47:21] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10669210000248735984
Running compilation step : cd /tmp/ltsmin10669210000248735984;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 232 ms.
Running link step : cd /tmp/ltsmin10669210000248735984;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10669210000248735984;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9204016120823683331.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 129/129 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 92 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 92 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 91 transition count 117
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 91 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 91 transition count 116
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 90 transition count 115
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 90 transition count 115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 89 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 89 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 88 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 88 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 88 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 87 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 87 transition count 109
Applied a total of 19 rules in 11 ms. Remains 87 /94 variables (removed 7) and now considering 109/129 (removed 20) transitions.
// Phase 1: matrix 109 rows 87 cols
[2022-06-11 13:47:36] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 13:47:37] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 109 rows 87 cols
[2022-06-11 13:47:37] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 13:47:37] [INFO ] State equation strengthened by 52 read => feed constraints.
[2022-06-11 13:47:37] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
// Phase 1: matrix 109 rows 87 cols
[2022-06-11 13:47:37] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 13:47:37] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/94 places, 109/129 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/94 places, 109/129 transitions.
Built C files in :
/tmp/ltsmin16503057062439186696
[2022-06-11 13:47:37] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16503057062439186696
Running compilation step : cd /tmp/ltsmin16503057062439186696;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 197 ms.
Running link step : cd /tmp/ltsmin16503057062439186696;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin16503057062439186696;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased943010401720752185.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 13:47:52] [INFO ] Flatten gal took : 7 ms
[2022-06-11 13:47:52] [INFO ] Flatten gal took : 6 ms
[2022-06-11 13:47:52] [INFO ] Time to serialize gal into /tmp/LTL4173965035082288740.gal : 1 ms
[2022-06-11 13:47:52] [INFO ] Time to serialize properties into /tmp/LTL9192460079318777869.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4173965035082288740.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9192460079318777869.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4173965...266
Read 1 LTL properties
Checking formula 0 : !((X(F(!((F("((s1>=1)&&(l1187>=1))"))U(!((!(("((s1>=1)&&(l1186>=1))")U(G("((s1>=1)&&(l1186>=1))"))))||(X("((s1>=1)&&(l1201>=1))"))))))...158
Formula 0 simplified : !XF!(F"((s1>=1)&&(l1187>=1))" U !(!("((s1>=1)&&(l1186>=1))" U G"((s1>=1)&&(l1186>=1))") | X"((s1>=1)&&(l1201>=1))"))
Detected timeout of ITS tools.
[2022-06-11 13:48:07] [INFO ] Flatten gal took : 7 ms
[2022-06-11 13:48:07] [INFO ] Applying decomposition
[2022-06-11 13:48:07] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3335473748811921662.txt' '-o' '/tmp/graph3335473748811921662.bin' '-w' '/tmp/graph3335473748811921662.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3335473748811921662.bin' '-l' '-1' '-v' '-w' '/tmp/graph3335473748811921662.weights' '-q' '0' '-e' '0.001'
[2022-06-11 13:48:07] [INFO ] Decomposing Gal with order
[2022-06-11 13:48:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 13:48:07] [INFO ] Removed a total of 88 redundant transitions.
[2022-06-11 13:48:07] [INFO ] Flatten gal took : 13 ms
[2022-06-11 13:48:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 4 ms.
[2022-06-11 13:48:07] [INFO ] Time to serialize gal into /tmp/LTL3162614880326277018.gal : 1 ms
[2022-06-11 13:48:07] [INFO ] Time to serialize properties into /tmp/LTL10617333258259561975.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3162614880326277018.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10617333258259561975.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3162614...246
Read 1 LTL properties
Checking formula 0 : !((X(F(!((F("((u0.s1>=1)&&(u0.l1187>=1))"))U(!((!(("((u0.s1>=1)&&(u0.l1186>=1))")U(G("((u0.s1>=1)&&(u0.l1186>=1))"))))||(X("((u0.s1>=1...182
Formula 0 simplified : !XF!(F"((u0.s1>=1)&&(u0.l1187>=1))" U !(!("((u0.s1>=1)&&(u0.l1186>=1))" U G"((u0.s1>=1)&&(u0.l1186>=1))") | X"((u0.s1>=1)&&(u0.l1201...163
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3368036804923742335
[2022-06-11 13:48:22] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3368036804923742335
Running compilation step : cd /tmp/ltsmin3368036804923742335;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 226 ms.
Running link step : cd /tmp/ltsmin3368036804923742335;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin3368036804923742335;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(!(<>((LTLAPp0==true)) U !(!((LTLAPp1==true) U []((LTLAPp1==true)))||X((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d1m64-LTLFireability-00 finished in 85596 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F((X((G(p1)||p0))||X(!(p2 U !p3)))))))'
[2022-06-11 13:48:37] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8779770162223501548
[2022-06-11 13:48:37] [INFO ] Applying decomposition
[2022-06-11 13:48:37] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2022-06-11 13:48:37] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 13:48:37] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2022-06-11 13:48:37] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 13:48:37] [INFO ] Flatten gal took : 11 ms
[2022-06-11 13:48:37] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6461184940721422199.txt' '-o' '/tmp/graph6461184940721422199.bin' '-w' '/tmp/graph6461184940721422199.weights'
[2022-06-11 13:48:37] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6461184940721422199.bin' '-l' '-1' '-v' '-w' '/tmp/graph6461184940721422199.weights' '-q' '0' '-e' '0.001'
[2022-06-11 13:48:37] [INFO ] Decomposing Gal with order
[2022-06-11 13:48:37] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8779770162223501548
Running compilation step : cd /tmp/ltsmin8779770162223501548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-11 13:48:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 13:48:37] [INFO ] Removed a total of 266 redundant transitions.
[2022-06-11 13:48:37] [INFO ] Flatten gal took : 37 ms
[2022-06-11 13:48:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 193 labels/synchronizations in 6 ms.
[2022-06-11 13:48:37] [INFO ] Time to serialize gal into /tmp/LTLFireability11565075534018339283.gal : 2 ms
[2022-06-11 13:48:37] [INFO ] Time to serialize properties into /tmp/LTLFireability1914774107821335619.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11565075534018339283.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1914774107821335619.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !((X(F(!((F("((i0.u0.s1>=1)&&(u18.l1187>=1))"))U(!((!(("((i0.u0.s1>=1)&&(u18.l1186>=1))")U(G("((i0.u0.s1>=1)&&(u18.l1186>=1))"))))||(X...198
Formula 0 simplified : !XF!(F"((i0.u0.s1>=1)&&(u18.l1187>=1))" U !(!("((i0.u0.s1>=1)&&(u18.l1186>=1))" U G"((i0.u0.s1>=1)&&(u18.l1186>=1))") | X"((i0.u0.s1...179
Compilation finished in 537 ms.
Running link step : cd /tmp/ltsmin8779770162223501548;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8779770162223501548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(!(<>((LTLAPp0==true)) U !(!((LTLAPp1==true) U []((LTLAPp1==true)))||X((LTLAPp2==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: LTL layer: formula: X(<>(!(<>((LTLAPp0==true)) U !(!((LTLAPp1==true) U []((LTLAPp1==true)))||X((LTLAPp2==true))))))
pins2lts-mc-linux64( 1/ 8), 0.004: "X(<>(!(<>((LTLAPp0==true)) U !(!((LTLAPp1==true) U []((LTLAPp1==true)))||X((LTLAPp2==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.045: There are 264 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.045: State length is 138, there are 283 groups
pins2lts-mc-linux64( 0/ 8), 0.045: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.045: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.045: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.045: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.057: [Blue] ~48 levels ~960 states ~2296 transitions
pins2lts-mc-linux64( 6/ 8), 0.069: [Blue] ~45 levels ~1920 states ~4184 transitions
pins2lts-mc-linux64( 0/ 8), 0.082: [Blue] ~48 levels ~3840 states ~8824 transitions
pins2lts-mc-linux64( 0/ 8), 0.110: [Blue] ~92 levels ~7680 states ~18280 transitions
pins2lts-mc-linux64( 0/ 8), 0.181: [Blue] ~92 levels ~15360 states ~35280 transitions
pins2lts-mc-linux64( 0/ 8), 0.321: [Blue] ~187 levels ~30720 states ~69424 transitions
pins2lts-mc-linux64( 0/ 8), 0.593: [Blue] ~187 levels ~61440 states ~139112 transitions
pins2lts-mc-linux64( 0/ 8), 1.138: [Blue] ~283 levels ~122880 states ~283856 transitions
pins2lts-mc-linux64( 0/ 8), 2.027: [Blue] ~283 levels ~245760 states ~576136 transitions
pins2lts-mc-linux64( 0/ 8), 3.375: [Blue] ~379 levels ~491520 states ~1145024 transitions
pins2lts-mc-linux64( 6/ 8), 5.541: [Blue] ~768 levels ~983040 states ~1997520 transitions
pins2lts-mc-linux64( 6/ 8), 9.249: [Blue] ~900 levels ~1966080 states ~3967624 transitions
pins2lts-mc-linux64( 2/ 8), 16.894: [Blue] ~616 levels ~3932160 states ~8944904 transitions
pins2lts-mc-linux64( 2/ 8), 32.031: [Blue] ~699 levels ~7864320 states ~18032632 transitions
pins2lts-mc-linux64( 7/ 8), 62.697: [Blue] ~5101 levels ~15728640 states ~32755544 transitions
pins2lts-mc-linux64( 7/ 8), 131.165: [Blue] ~5491 levels ~31457280 states ~65227592 transitions
pins2lts-mc-linux64( 7/ 8), 258.053: [Blue] ~6011 levels ~62914560 states ~130259480 transitions
pins2lts-mc-linux64( 2/ 8), 508.671: [Blue] ~1363 levels ~125829120 states ~290995712 transitions
pins2lts-mc-linux64( 1/ 8), 534.046: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 534.258:
pins2lts-mc-linux64( 0/ 8), 534.258: Explored 127109927 states 285809763 transitions, fanout: 2.249
pins2lts-mc-linux64( 0/ 8), 534.258: Total exploration time 534.190 sec (534.020 sec minimum, 534.107 sec on average)
pins2lts-mc-linux64( 0/ 8), 534.258: States per second: 237949, Transitions per second: 535034
pins2lts-mc-linux64( 0/ 8), 534.258:
pins2lts-mc-linux64( 0/ 8), 534.258: State space has 134217544 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 534.258: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 534.258: blue states: 127109927 (94.70%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 534.258: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 534.258: all-red states: 41507 (0.03%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 534.258:
pins2lts-mc-linux64( 0/ 8), 534.258: Total memory used for local state coloring: 14.7MB
pins2lts-mc-linux64( 0/ 8), 534.258:
pins2lts-mc-linux64( 0/ 8), 534.258: Queue width: 8B, total height: 960592, memory: 7.33MB
pins2lts-mc-linux64( 0/ 8), 534.258: Tree memory: 1077.2MB, 8.4 B/state, compr.: 1.5%
pins2lts-mc-linux64( 0/ 8), 534.258: Tree fill ratio (roots/leafs): 99.0%/20.0%
pins2lts-mc-linux64( 0/ 8), 534.258: Stored 256 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 534.259: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 534.259: Est. total memory use: 1084.6MB (~1031.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8779770162223501548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(!(<>((LTLAPp0==true)) U !(!((LTLAPp1==true) U []((LTLAPp1==true)))||X((LTLAPp2==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8779770162223501548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(!(<>((LTLAPp0==true)) U !(!((LTLAPp1==true) U []((LTLAPp1==true)))||X((LTLAPp2==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-06-11 14:10:22] [INFO ] Flatten gal took : 10 ms
[2022-06-11 14:10:22] [INFO ] Time to serialize gal into /tmp/LTLFireability9550919644193628161.gal : 2 ms
[2022-06-11 14:10:22] [INFO ] Time to serialize properties into /tmp/LTLFireability9489211304931585191.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9550919644193628161.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9489211304931585191.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...288
Read 2 LTL properties
Checking formula 0 : !((X(F(!((F("((s1>=1)&&(l1187>=1))"))U(!((!(("((s1>=1)&&(l1186>=1))")U(G("((s1>=1)&&(l1186>=1))"))))||(X("((s1>=1)&&(l1201>=1))"))))))...158
Formula 0 simplified : !XF!(F"((s1>=1)&&(l1187>=1))" U !(!("((s1>=1)&&(l1186>=1))" U G"((s1>=1)&&(l1186>=1))") | X"((s1>=1)&&(l1201>=1))"))
Detected timeout of ITS tools.
[2022-06-11 14:32:13] [INFO ] Flatten gal took : 236 ms
[2022-06-11 14:32:15] [INFO ] Input system was already deterministic with 256 transitions.
[2022-06-11 14:32:15] [INFO ] Transformed 137 places.
[2022-06-11 14:32:15] [INFO ] Transformed 256 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-11 14:32:15] [INFO ] Time to serialize gal into /tmp/LTLFireability10195065696705578565.gal : 6 ms
[2022-06-11 14:32:15] [INFO ] Time to serialize properties into /tmp/LTLFireability6591964569333813325.ltl : 22 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10195065696705578565.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6591964569333813325.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(!((F("((s1>=1)&&(l1187>=1))"))U(!((!(("((s1>=1)&&(l1186>=1))")U(G("((s1>=1)&&(l1186>=1))"))))||(X("((s1>=1)&&(l1201>=1))"))))))...158
Formula 0 simplified : !XF!(F"((s1>=1)&&(l1187>=1))" U !(!("((s1>=1)&&(l1186>=1))" U G"((s1>=1)&&(l1186>=1))") | X"((s1>=1)&&(l1201>=1))"))

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-d1m64"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d1m64, 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 r312-tall-165472282900924"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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