Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r421-tajo-167905975200428.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d1m36, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905975200428
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 7.5K Feb 26 10:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 10:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 10:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 10:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 26 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 10:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 10:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 450K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679179495016

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m36
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 22:44:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 22:44:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 22:44:57] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2023-03-18 22:44:57] [INFO ] Transformed 1295 places.
[2023-03-18 22:44:57] [INFO ] Transformed 749 transitions.
[2023-03-18 22:44:57] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 261 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 2 formulas.
Deduced a syphon composed of 1036 places in 12 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 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 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 307 place count 192 transition count 355
Iterating global reduction 1 with 50 rules applied. Total rules applied 357 place count 192 transition count 355
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 364 place count 192 transition count 348
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 398 place count 158 transition count 314
Iterating global reduction 2 with 34 rules applied. Total rules applied 432 place count 158 transition count 314
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 443 place count 158 transition count 303
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 460 place count 141 transition count 284
Iterating global reduction 3 with 17 rules applied. Total rules applied 477 place count 141 transition count 284
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 504 place count 141 transition count 257
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 509 place count 136 transition count 249
Iterating global reduction 4 with 5 rules applied. Total rules applied 514 place count 136 transition count 249
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 518 place count 132 transition count 245
Iterating global reduction 4 with 4 rules applied. Total rules applied 522 place count 132 transition count 245
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 524 place count 130 transition count 242
Iterating global reduction 4 with 2 rules applied. Total rules applied 526 place count 130 transition count 242
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 527 place count 129 transition count 241
Iterating global reduction 4 with 1 rules applied. Total rules applied 528 place count 129 transition count 241
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 529 place count 128 transition count 240
Iterating global reduction 4 with 1 rules applied. Total rules applied 530 place count 128 transition count 240
Applied a total of 530 rules in 125 ms. Remains 128 /259 variables (removed 131) and now considering 240/749 (removed 509) transitions.
// Phase 1: matrix 240 rows 128 cols
[2023-03-18 22:44:58] [INFO ] Computed 5 place invariants in 16 ms
[2023-03-18 22:44:58] [INFO ] Implicit Places using invariants in 514 ms returned []
[2023-03-18 22:44:58] [INFO ] Invariant cache hit.
[2023-03-18 22:44:58] [INFO ] State equation strengthened by 151 read => feed constraints.
[2023-03-18 22:44:59] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1320 ms to find 0 implicit places.
[2023-03-18 22:44:59] [INFO ] Invariant cache hit.
[2023-03-18 22:44:59] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/259 places, 240/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1640 ms. Remains : 128/259 places, 240/749 transitions.
Support contains 24 out of 128 places after structural reductions.
[2023-03-18 22:44:59] [INFO ] Flatten gal took : 92 ms
[2023-03-18 22:45:00] [INFO ] Flatten gal took : 34 ms
[2023-03-18 22:45:00] [INFO ] Input system was already deterministic with 240 transitions.
Incomplete random walk after 10000 steps, including 2220 resets, run finished after 904 ms. (steps per millisecond=11 ) properties (out of 21) seen :3
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 108 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 111 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 99 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 112 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-18 22:45:01] [INFO ] Invariant cache hit.
[2023-03-18 22:45:01] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-18 22:45:01] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-18 22:45:01] [INFO ] After 402ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-18 22:45:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-18 22:45:01] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 6 ms returned sat
[2023-03-18 22:45:03] [INFO ] After 1446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-18 22:45:03] [INFO ] State equation strengthened by 151 read => feed constraints.
[2023-03-18 22:45:04] [INFO ] After 692ms SMT Verify possible using 151 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2023-03-18 22:45:04] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 5 ms to minimize.
[2023-03-18 22:45:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2023-03-18 22:45:05] [INFO ] After 1880ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 1046 ms.
[2023-03-18 22:45:06] [INFO ] After 4627ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Parikh walk visited 3 properties in 295 ms.
Support contains 16 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 240/240 transitions.
Graph (complete) has 443 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 127 transition count 238
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 124 transition count 224
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 124 transition count 224
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 121 transition count 221
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 121 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 121 transition count 220
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 118 transition count 217
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 118 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 118 transition count 216
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 25 place count 116 transition count 214
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 116 transition count 214
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 115 transition count 213
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 115 transition count 213
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 114 transition count 211
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 114 transition count 211
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 113 transition count 210
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 113 transition count 210
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 112 transition count 209
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 112 transition count 209
Applied a total of 35 rules in 42 ms. Remains 112 /128 variables (removed 16) and now considering 209/240 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 112/128 places, 209/240 transitions.
Incomplete random walk after 10000 steps, including 2242 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 107 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 98 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 36 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 248458 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{0=1, 1=1, 6=1, 9=1, 10=1, 11=1, 13=1}
Probabilistic random walk after 248458 steps, saw 114389 distinct states, run finished after 3003 ms. (steps per millisecond=82 ) properties seen :7
Running SMT prover for 8 properties.
// Phase 1: matrix 209 rows 112 cols
[2023-03-18 22:45:10] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-18 22:45:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:45:10] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-18 22:45:10] [INFO ] After 333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 22:45:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:45:10] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:45:11] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-18 22:45:11] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-03-18 22:45:11] [INFO ] After 339ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-18 22:45:11] [INFO ] After 655ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 414 ms.
[2023-03-18 22:45:12] [INFO ] After 1405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 257 ms.
Support contains 9 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 209/209 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 108 transition count 175
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 108 transition count 175
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 14 place count 108 transition count 169
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 105 transition count 166
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 105 transition count 166
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 105 transition count 164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 103 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 103 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 103 transition count 160
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 102 transition count 159
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 102 transition count 159
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 101 transition count 158
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 101 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 100 transition count 157
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 100 transition count 157
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 40 place count 100 transition count 151
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 41 place count 99 transition count 150
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 99 transition count 150
Applied a total of 42 rules in 38 ms. Remains 99 /112 variables (removed 13) and now considering 150/209 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 99/112 places, 150/209 transitions.
Incomplete random walk after 10000 steps, including 2260 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 487 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 1038 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 507 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 494 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 471 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 290061 steps, run timeout after 3003 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 290061 steps, saw 128720 distinct states, run finished after 3004 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 150 rows 99 cols
[2023-03-18 22:45:16] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 22:45:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:45:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:45:16] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 22:45:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:45:16] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:45:16] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-18 22:45:16] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-18 22:45:16] [INFO ] After 199ms SMT Verify possible using 83 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-18 22:45:17] [INFO ] After 445ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 237 ms.
[2023-03-18 22:45:17] [INFO ] After 911ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 220 ms.
Support contains 9 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 150/150 transitions.
Applied a total of 0 rules in 10 ms. Remains 99 /99 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 99/99 places, 150/150 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 150/150 transitions.
Applied a total of 0 rules in 18 ms. Remains 99 /99 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2023-03-18 22:45:17] [INFO ] Invariant cache hit.
[2023-03-18 22:45:17] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-18 22:45:17] [INFO ] Invariant cache hit.
[2023-03-18 22:45:17] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-18 22:45:18] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2023-03-18 22:45:18] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 22:45:18] [INFO ] Invariant cache hit.
[2023-03-18 22:45:18] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 560 ms. Remains : 99/99 places, 150/150 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 99 transition count 145
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 95 transition count 145
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 9 place count 95 transition count 131
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 37 place count 81 transition count 131
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 53 place count 73 transition count 123
Applied a total of 53 rules in 28 ms. Remains 73 /99 variables (removed 26) and now considering 123/150 (removed 27) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 123 rows 73 cols
[2023-03-18 22:45:18] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 22:45:18] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:45:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 22:45:18] [INFO ] After 501ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 22:45:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:45:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:45:18] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-18 22:45:19] [INFO ] After 232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-18 22:45:19] [INFO ] After 393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Computed a total of 25 stabilizing places and 40 stable transitions
Graph (complete) has 490 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(G((G(p0)||(!(p0 U p1)&&p2)))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 117 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 117 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 117 transition count 155
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 35 place count 107 transition count 145
Iterating global reduction 1 with 10 rules applied. Total rules applied 45 place count 107 transition count 145
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 51 place count 107 transition count 139
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 60 place count 98 transition count 130
Iterating global reduction 2 with 9 rules applied. Total rules applied 69 place count 98 transition count 130
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 76 place count 98 transition count 123
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 80 place count 94 transition count 119
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 94 transition count 119
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 91 transition count 116
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 91 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 89 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 89 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 97 place count 89 transition count 110
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 99 place count 87 transition count 108
Iterating global reduction 4 with 2 rules applied. Total rules applied 101 place count 87 transition count 108
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 102 place count 86 transition count 107
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 86 transition count 107
Applied a total of 103 rules in 44 ms. Remains 86 /128 variables (removed 42) and now considering 107/240 (removed 133) transitions.
// Phase 1: matrix 107 rows 86 cols
[2023-03-18 22:45:19] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:45:19] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-18 22:45:19] [INFO ] Invariant cache hit.
[2023-03-18 22:45:19] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-18 22:45:19] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2023-03-18 22:45:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:45:19] [INFO ] Invariant cache hit.
[2023-03-18 22:45:20] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/128 places, 107/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 458 ms. Remains : 86/128 places, 107/240 transitions.
Stuttering acceptance computed with spot in 245 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(OR (AND p0 (NOT p2)) (AND p0 p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s81 1)), p2:(OR (LT s1 1) (LT s80 1)), p1:(OR (AND (GEQ s1 1) (GEQ s81 1)) (AND (GEQ s1 1) (GEQ s77 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 22511 reset in 248 ms.
Product exploration explored 100000 steps with 22438 reset in 244 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 281 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (OR (AND p0 (NOT p2)) (AND p0 p1)))), (X p0), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (X (AND p2 (NOT p1))), true, (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 p1))))), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))))), (X (X (AND p2 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 437 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Incomplete random walk after 10000 steps, including 2233 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 502 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 476 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 481 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 4) seen :0
Finished probabilistic random walk after 36354 steps, run visited all 4 properties in 210 ms. (steps per millisecond=173 )
Probabilistic random walk after 36354 steps, saw 16270 distinct states, run finished after 210 ms. (steps per millisecond=173 ) properties seen :4
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (OR (AND p0 (NOT p2)) (AND p0 p1)))), (X p0), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (X (AND p2 (NOT p1))), true, (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 p1))))), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))))), (X (X (AND p2 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (NOT p0)), (F (OR (AND p0 p1) (AND p0 (NOT p2)))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))))]
Property proved to be false thanks to negative knowledge :(F (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 10 factoid took 344 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-00 finished in 2885 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 116 transition count 147
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 116 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 116 transition count 145
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 106 transition count 135
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 106 transition count 135
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 51 place count 106 transition count 130
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 59 place count 98 transition count 122
Iterating global reduction 2 with 8 rules applied. Total rules applied 67 place count 98 transition count 122
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 72 place count 98 transition count 117
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 75 place count 95 transition count 114
Iterating global reduction 3 with 3 rules applied. Total rules applied 78 place count 95 transition count 114
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 93 transition count 112
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 93 transition count 112
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 91 transition count 109
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 91 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 88 place count 91 transition count 107
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 90 place count 89 transition count 105
Iterating global reduction 4 with 2 rules applied. Total rules applied 92 place count 89 transition count 105
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 88 transition count 104
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 88 transition count 104
Applied a total of 94 rules in 8 ms. Remains 88 /128 variables (removed 40) and now considering 104/240 (removed 136) transitions.
// Phase 1: matrix 104 rows 88 cols
[2023-03-18 22:45:22] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:45:22] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-18 22:45:22] [INFO ] Invariant cache hit.
[2023-03-18 22:45:22] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 22:45:22] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2023-03-18 22:45:22] [INFO ] Invariant cache hit.
[2023-03-18 22:45:22] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/128 places, 104/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 386 ms. Remains : 88/128 places, 104/240 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (LT s21 1) (LT s59 1)), p0:(OR (LT s1 1) (LT s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22495 reset in 233 ms.
Product exploration explored 100000 steps with 22469 reset in 125 ms.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 283 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 388 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2244 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1053 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2256275 steps, run timeout after 3001 ms. (steps per millisecond=751 ) properties seen :{}
Probabilistic random walk after 2256275 steps, saw 936079 distinct states, run finished after 3013 ms. (steps per millisecond=748 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 22:45:26] [INFO ] Invariant cache hit.
[2023-03-18 22:45:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:45:26] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 22:45:27] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:45:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-18 22:45:27] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 22:45:27] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:45:27] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 22:45:27] [INFO ] After 12ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 22:45:27] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-18 22:45:27] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 104/104 transitions.
Graph (complete) has 251 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 86 transition count 94
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 86 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 85 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 85 transition count 93
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 85 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 84 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 84 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 84 transition count 90
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 83 transition count 89
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 83 transition count 89
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 82 transition count 88
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 82 transition count 88
Applied a total of 15 rules in 26 ms. Remains 82 /88 variables (removed 6) and now considering 88/104 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 82/88 places, 88/104 transitions.
Incomplete random walk after 10000 steps, including 2216 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1062 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1891978 steps, run timeout after 3001 ms. (steps per millisecond=630 ) properties seen :{}
Probabilistic random walk after 1891978 steps, saw 793578 distinct states, run finished after 3001 ms. (steps per millisecond=630 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 88 rows 82 cols
[2023-03-18 22:45:30] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-18 22:45:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:45:30] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:45:30] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:45:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-18 22:45:30] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:45:30] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:45:30] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-18 22:45:30] [INFO ] After 13ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 22:45:30] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-18 22:45:30] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 88/88 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 82/82 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-18 22:45:30] [INFO ] Invariant cache hit.
[2023-03-18 22:45:30] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-18 22:45:30] [INFO ] Invariant cache hit.
[2023-03-18 22:45:30] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-18 22:45:30] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-18 22:45:30] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 22:45:30] [INFO ] Invariant cache hit.
[2023-03-18 22:45:30] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 82/82 places, 88/88 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 7 rules applied. Total rules applied 7 place count 82 transition count 81
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 77 transition count 81
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 12 place count 77 transition count 68
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 38 place count 64 transition count 68
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 58 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 57 transition count 67
Applied a total of 52 rules in 10 ms. Remains 57 /82 variables (removed 25) and now considering 67/88 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 67 rows 57 cols
[2023-03-18 22:45:30] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-18 22:45:30] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-18 22:45:30] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 22:45:30] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:45:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-18 22:45:30] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:45:30] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:45:30] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-18 22:45:30] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 170 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 88 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 104/104 transitions.
Applied a total of 0 rules in 1 ms. Remains 88 /88 variables (removed 0) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 88 cols
[2023-03-18 22:45:31] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:45:31] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-18 22:45:31] [INFO ] Invariant cache hit.
[2023-03-18 22:45:31] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 22:45:31] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-03-18 22:45:31] [INFO ] Invariant cache hit.
[2023-03-18 22:45:31] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 401 ms. Remains : 88/88 places, 104/104 transitions.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 283 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 203 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2229 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1023 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2409364 steps, run timeout after 3001 ms. (steps per millisecond=802 ) properties seen :{}
Probabilistic random walk after 2409364 steps, saw 998801 distinct states, run finished after 3003 ms. (steps per millisecond=802 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 22:45:35] [INFO ] Invariant cache hit.
[2023-03-18 22:45:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:45:35] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 22:45:35] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:45:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:45:35] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 22:45:35] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:45:35] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 22:45:35] [INFO ] After 31ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 22:45:35] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-18 22:45:35] [INFO ] After 130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 104/104 transitions.
Graph (complete) has 251 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 86 transition count 94
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 86 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 85 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 85 transition count 93
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 85 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 84 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 84 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 84 transition count 90
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 83 transition count 89
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 83 transition count 89
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 82 transition count 88
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 82 transition count 88
Applied a total of 15 rules in 11 ms. Remains 82 /88 variables (removed 6) and now considering 88/104 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 82/88 places, 88/104 transitions.
Incomplete random walk after 10000 steps, including 2238 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1058 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2377050 steps, run timeout after 3001 ms. (steps per millisecond=792 ) properties seen :{}
Probabilistic random walk after 2377050 steps, saw 998239 distinct states, run finished after 3001 ms. (steps per millisecond=792 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 88 rows 82 cols
[2023-03-18 22:45:38] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-18 22:45:38] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-18 22:45:38] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 22:45:38] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:45:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:45:38] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-18 22:45:38] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:45:38] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-18 22:45:38] [INFO ] After 13ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 22:45:38] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-18 22:45:38] [INFO ] After 114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 88/88 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 88/88 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-18 22:45:38] [INFO ] Invariant cache hit.
[2023-03-18 22:45:38] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-18 22:45:38] [INFO ] Invariant cache hit.
[2023-03-18 22:45:38] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-18 22:45:38] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-18 22:45:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:45:38] [INFO ] Invariant cache hit.
[2023-03-18 22:45:39] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 498 ms. Remains : 82/82 places, 88/88 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 7 rules applied. Total rules applied 7 place count 82 transition count 81
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 77 transition count 81
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 12 place count 77 transition count 68
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 38 place count 64 transition count 68
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 58 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 57 transition count 67
Applied a total of 52 rules in 22 ms. Remains 57 /82 variables (removed 25) and now considering 67/88 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 67 rows 57 cols
[2023-03-18 22:45:39] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-18 22:45:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-18 22:45:39] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:45:39] [INFO ] After 641ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:45:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-18 22:45:39] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:45:39] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:45:39] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-18 22:45:39] [INFO ] After 123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 266 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 22425 reset in 147 ms.
Product exploration explored 100000 steps with 22369 reset in 149 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 104/104 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 86 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 86 transition count 95
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 86 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 85 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 85 transition count 93
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 85 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 84 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 84 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 83 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 83 transition count 90
Applied a total of 12 rules in 17 ms. Remains 83 /88 variables (removed 5) and now considering 90/104 (removed 14) transitions.
[2023-03-18 22:45:41] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 90 rows 83 cols
[2023-03-18 22:45:41] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-18 22:45:41] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/88 places, 90/104 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 83/88 places, 90/104 transitions.
Built C files in :
/tmp/ltsmin15931040354707223092
[2023-03-18 22:45:41] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15931040354707223092
Running compilation step : cd /tmp/ltsmin15931040354707223092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 391 ms.
Running link step : cd /tmp/ltsmin15931040354707223092;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin15931040354707223092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18270634545776575552.hoa' '--buchi-type=spotba'
LTSmin run took 7217 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-01 finished in 26819 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 116 transition count 147
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 116 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 116 transition count 145
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 37 place count 105 transition count 134
Iterating global reduction 1 with 11 rules applied. Total rules applied 48 place count 105 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 54 place count 105 transition count 128
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 63 place count 96 transition count 119
Iterating global reduction 2 with 9 rules applied. Total rules applied 72 place count 96 transition count 119
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 78 place count 96 transition count 113
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 82 place count 92 transition count 109
Iterating global reduction 3 with 4 rules applied. Total rules applied 86 place count 92 transition count 109
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 89 transition count 106
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 89 transition count 106
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 94 place count 87 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 87 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 87 transition count 101
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 100 place count 85 transition count 99
Iterating global reduction 4 with 2 rules applied. Total rules applied 102 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 103 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 84 transition count 98
Applied a total of 104 rules in 30 ms. Remains 84 /128 variables (removed 44) and now considering 98/240 (removed 142) transitions.
// Phase 1: matrix 98 rows 84 cols
[2023-03-18 22:45:49] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 22:45:49] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-18 22:45:49] [INFO ] Invariant cache hit.
[2023-03-18 22:45:49] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 22:45:49] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2023-03-18 22:45:49] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 22:45:49] [INFO ] Invariant cache hit.
[2023-03-18 22:45:49] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/128 places, 98/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 411 ms. Remains : 84/128 places, 98/240 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-03 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 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-03 finished in 481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 115 transition count 136
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 115 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 115 transition count 135
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 38 place count 104 transition count 124
Iterating global reduction 1 with 11 rules applied. Total rules applied 49 place count 104 transition count 124
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 55 place count 104 transition count 118
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 64 place count 95 transition count 109
Iterating global reduction 2 with 9 rules applied. Total rules applied 73 place count 95 transition count 109
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 78 place count 95 transition count 104
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 82 place count 91 transition count 100
Iterating global reduction 3 with 4 rules applied. Total rules applied 86 place count 91 transition count 100
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 88 transition count 97
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 88 transition count 97
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 94 place count 86 transition count 94
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 86 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 97 place count 86 transition count 93
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 99 place count 84 transition count 91
Iterating global reduction 4 with 2 rules applied. Total rules applied 101 place count 84 transition count 91
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 102 place count 83 transition count 90
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 83 transition count 90
Applied a total of 103 rules in 23 ms. Remains 83 /128 variables (removed 45) and now considering 90/240 (removed 150) transitions.
// Phase 1: matrix 90 rows 83 cols
[2023-03-18 22:45:49] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 22:45:49] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-18 22:45:49] [INFO ] Invariant cache hit.
[2023-03-18 22:45:49] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-18 22:45:49] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2023-03-18 22:45:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:45:49] [INFO ] Invariant cache hit.
[2023-03-18 22:45:50] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/128 places, 90/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 342 ms. Remains : 83/128 places, 90/240 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s17 1) (GEQ s57 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 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-04 finished in 398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(!p0))||(F(!p0)&&G(F(p1)))))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 117 transition count 148
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 117 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 117 transition count 146
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 107 transition count 136
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 107 transition count 136
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 50 place count 107 transition count 130
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 58 place count 99 transition count 122
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 99 transition count 122
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 99 transition count 116
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 75 place count 96 transition count 113
Iterating global reduction 3 with 3 rules applied. Total rules applied 78 place count 96 transition count 113
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 93 transition count 110
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 93 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 85 place count 92 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 92 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 88 place count 92 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 89 place count 91 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 91 transition count 106
Applied a total of 90 rules in 17 ms. Remains 91 /128 variables (removed 37) and now considering 106/240 (removed 134) transitions.
// Phase 1: matrix 106 rows 91 cols
[2023-03-18 22:45:50] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:45:50] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-18 22:45:50] [INFO ] Invariant cache hit.
[2023-03-18 22:45:50] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 22:45:50] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2023-03-18 22:45:50] [INFO ] Invariant cache hit.
[2023-03-18 22:45:50] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/128 places, 106/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 376 ms. Remains : 91/128 places, 106/240 transitions.
Stuttering acceptance computed with spot in 314 ms :[p0, p0, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s28 1)), p1:(OR (LT s1 1) (LT s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22442 reset in 89 ms.
Product exploration explored 100000 steps with 22479 reset in 89 ms.
Computed a total of 20 stabilizing places and 25 stable transitions
Graph (complete) has 291 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Computed a total of 20 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 254 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2235 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2261609 steps, run timeout after 3001 ms. (steps per millisecond=753 ) properties seen :{}
Probabilistic random walk after 2261609 steps, saw 948950 distinct states, run finished after 3001 ms. (steps per millisecond=753 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 22:45:54] [INFO ] Invariant cache hit.
[2023-03-18 22:45:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:45:54] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 22:45:54] [INFO ] After 74ms 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 (NOT p0) p1), true, (X (X (NOT p0))), (G (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p1) p0)))
Knowledge based reduction with 4 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-05 finished in 4596 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U (p1 U p2))||(!X(X(p1)) U p1)))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 118 transition count 159
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 118 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 118 transition count 156
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 32 place count 109 transition count 147
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 109 transition count 147
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 46 place count 109 transition count 142
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 53 place count 102 transition count 135
Iterating global reduction 2 with 7 rules applied. Total rules applied 60 place count 102 transition count 135
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 63 place count 102 transition count 132
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 66 place count 99 transition count 129
Iterating global reduction 3 with 3 rules applied. Total rules applied 69 place count 99 transition count 129
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 71 place count 97 transition count 127
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 97 transition count 127
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 95 transition count 124
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 95 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 80 place count 95 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 82 place count 93 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 84 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 92 transition count 118
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 92 transition count 118
Applied a total of 86 rules in 14 ms. Remains 92 /128 variables (removed 36) and now considering 118/240 (removed 122) transitions.
// Phase 1: matrix 118 rows 92 cols
[2023-03-18 22:45:54] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:45:54] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-18 22:45:54] [INFO ] Invariant cache hit.
[2023-03-18 22:45:54] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-18 22:45:55] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2023-03-18 22:45:55] [INFO ] Invariant cache hit.
[2023-03-18 22:45:55] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/128 places, 118/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 531 ms. Remains : 92/128 places, 118/240 transitions.
Stuttering acceptance computed with spot in 472 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND (NOT p0) p1), true, (OR (NOT p0) (NOT p2)), true, p1, (OR (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 7}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 8}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p1 p0), acceptance={} source=2 dest: 8}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}, { cond=p1, acceptance={} source=3 dest: 6}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={0} source=7 dest: 7}, { cond=(AND p2 p0), acceptance={0} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s73 1)), p2:(AND (GEQ s1 1) (GEQ s86 1)), p0:(AND (GEQ s1 1) (GEQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, 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-d1m36-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-06 finished in 1042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((F(p1)&&(p2||X(G(!p3)))))))'
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 119 transition count 170
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 119 transition count 170
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 110 transition count 161
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 110 transition count 161
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 110 transition count 157
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 103 transition count 150
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 103 transition count 150
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 61 place count 103 transition count 143
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 100 transition count 140
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 100 transition count 140
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 69 place count 98 transition count 138
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 98 transition count 138
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 97 transition count 136
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 97 transition count 136
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 96 transition count 135
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 96 transition count 135
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 95 transition count 134
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 95 transition count 134
Applied a total of 77 rules in 12 ms. Remains 95 /128 variables (removed 33) and now considering 134/240 (removed 106) transitions.
// Phase 1: matrix 134 rows 95 cols
[2023-03-18 22:45:55] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:45:55] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-18 22:45:55] [INFO ] Invariant cache hit.
[2023-03-18 22:45:55] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-18 22:45:56] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2023-03-18 22:45:56] [INFO ] Invariant cache hit.
[2023-03-18 22:45:56] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/128 places, 134/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 507 ms. Remains : 95/128 places, 134/240 transitions.
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) p3)), (NOT p0), (OR (NOT p1) (AND (NOT p2) p3)), (NOT p1), p3, true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 4}, { cond=p3, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s74 1)), p1:(AND (GEQ s1 1) (GEQ s89 1)), p2:(AND (GEQ s1 1) (GEQ s87 1)), p3:(OR (LT s1 1) (LT s90 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]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-07 finished in 875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 115 transition count 136
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 115 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 115 transition count 135
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 39 place count 103 transition count 123
Iterating global reduction 1 with 12 rules applied. Total rules applied 51 place count 103 transition count 123
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 58 place count 103 transition count 116
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 68 place count 93 transition count 106
Iterating global reduction 2 with 10 rules applied. Total rules applied 78 place count 93 transition count 106
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 93 transition count 100
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 88 place count 89 transition count 96
Iterating global reduction 3 with 4 rules applied. Total rules applied 92 place count 89 transition count 96
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 95 place count 86 transition count 93
Iterating global reduction 3 with 3 rules applied. Total rules applied 98 place count 86 transition count 93
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 84 transition count 90
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 84 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 103 place count 84 transition count 89
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 105 place count 82 transition count 87
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 82 transition count 87
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 108 place count 81 transition count 86
Iterating global reduction 4 with 1 rules applied. Total rules applied 109 place count 81 transition count 86
Applied a total of 109 rules in 17 ms. Remains 81 /128 variables (removed 47) and now considering 86/240 (removed 154) transitions.
// Phase 1: matrix 86 rows 81 cols
[2023-03-18 22:45:56] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 22:45:56] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-18 22:45:56] [INFO ] Invariant cache hit.
[2023-03-18 22:45:56] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-18 22:45:56] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-18 22:45:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:45:56] [INFO ] Invariant cache hit.
[2023-03-18 22:45:56] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/128 places, 86/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 264 ms. Remains : 81/128 places, 86/240 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s69 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 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-08 finished in 329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1||G(p2))&&p0))))'
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 117 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 117 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 117 transition count 155
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 35 place count 107 transition count 145
Iterating global reduction 1 with 10 rules applied. Total rules applied 45 place count 107 transition count 145
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 50 place count 107 transition count 140
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 58 place count 99 transition count 132
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 99 transition count 132
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 99 transition count 126
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 75 place count 96 transition count 123
Iterating global reduction 3 with 3 rules applied. Total rules applied 78 place count 96 transition count 123
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 94 transition count 121
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 85 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 91 transition count 117
Applied a total of 88 rules in 36 ms. Remains 91 /128 variables (removed 37) and now considering 117/240 (removed 123) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-18 22:45:56] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:45:57] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-18 22:45:57] [INFO ] Invariant cache hit.
[2023-03-18 22:45:57] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-18 22:45:57] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2023-03-18 22:45:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:45:57] [INFO ] Invariant cache hit.
[2023-03-18 22:45:57] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/128 places, 117/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 363 ms. Remains : 91/128 places, 117/240 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s86 1)), p0:(AND (GEQ s3 1) (GEQ s27 1)), p2:(OR (LT s1 1) (LT s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-09 finished in 488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 116 transition count 138
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 116 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 116 transition count 137
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 36 place count 105 transition count 126
Iterating global reduction 1 with 11 rules applied. Total rules applied 47 place count 105 transition count 126
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 54 place count 105 transition count 119
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 63 place count 96 transition count 110
Iterating global reduction 2 with 9 rules applied. Total rules applied 72 place count 96 transition count 110
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 77 place count 96 transition count 105
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 81 place count 92 transition count 101
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 92 transition count 101
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 88 place count 89 transition count 98
Iterating global reduction 3 with 3 rules applied. Total rules applied 91 place count 89 transition count 98
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 87 transition count 96
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 87 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 97 place count 87 transition count 94
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 99 place count 85 transition count 92
Iterating global reduction 4 with 2 rules applied. Total rules applied 101 place count 85 transition count 92
Applied a total of 101 rules in 25 ms. Remains 85 /128 variables (removed 43) and now considering 92/240 (removed 148) transitions.
// Phase 1: matrix 92 rows 85 cols
[2023-03-18 22:45:57] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:45:57] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-18 22:45:57] [INFO ] Invariant cache hit.
[2023-03-18 22:45:57] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-18 22:45:57] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2023-03-18 22:45:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:45:57] [INFO ] Invariant cache hit.
[2023-03-18 22:45:57] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/128 places, 92/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 493 ms. Remains : 85/128 places, 92/240 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-10 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 s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-10 finished in 628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 116 transition count 147
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 116 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 116 transition count 145
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 37 place count 105 transition count 134
Iterating global reduction 1 with 11 rules applied. Total rules applied 48 place count 105 transition count 134
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 54 place count 105 transition count 128
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 63 place count 96 transition count 119
Iterating global reduction 2 with 9 rules applied. Total rules applied 72 place count 96 transition count 119
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 78 place count 96 transition count 113
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 82 place count 92 transition count 109
Iterating global reduction 3 with 4 rules applied. Total rules applied 86 place count 92 transition count 109
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 89 transition count 106
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 89 transition count 106
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 94 place count 87 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 87 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 87 transition count 101
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 100 place count 85 transition count 99
Iterating global reduction 4 with 2 rules applied. Total rules applied 102 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 103 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 84 transition count 98
Applied a total of 104 rules in 18 ms. Remains 84 /128 variables (removed 44) and now considering 98/240 (removed 142) transitions.
// Phase 1: matrix 98 rows 84 cols
[2023-03-18 22:45:58] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:45:58] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-18 22:45:58] [INFO ] Invariant cache hit.
[2023-03-18 22:45:58] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 22:45:58] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-18 22:45:58] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 22:45:58] [INFO ] Invariant cache hit.
[2023-03-18 22:45:58] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/128 places, 98/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 401 ms. Remains : 84/128 places, 98/240 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-11 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 22370 reset in 131 ms.
Product exploration explored 100000 steps with 22423 reset in 147 ms.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 269 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2233 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1119911 steps, run visited all 1 properties in 1775 ms. (steps per millisecond=630 )
Probabilistic random walk after 1119911 steps, saw 497311 distinct states, run finished after 1775 ms. (steps per millisecond=630 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 216 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 78 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 4 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-18 22:46:01] [INFO ] Invariant cache hit.
[2023-03-18 22:46:01] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-18 22:46:01] [INFO ] Invariant cache hit.
[2023-03-18 22:46:01] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 22:46:01] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2023-03-18 22:46:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:46:01] [INFO ] Invariant cache hit.
[2023-03-18 22:46:01] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 336 ms. Remains : 84/84 places, 98/98 transitions.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 269 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2209 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1119911 steps, run visited all 1 properties in 1642 ms. (steps per millisecond=682 )
Probabilistic random walk after 1119911 steps, saw 497311 distinct states, run finished after 1644 ms. (steps per millisecond=681 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 271 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22436 reset in 133 ms.
Product exploration explored 100000 steps with 22378 reset in 123 ms.
Built C files in :
/tmp/ltsmin4993076761999587523
[2023-03-18 22:46:03] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2023-03-18 22:46:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:46:03] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2023-03-18 22:46:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:46:03] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2023-03-18 22:46:03] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:46:03] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4993076761999587523
Running compilation step : cd /tmp/ltsmin4993076761999587523;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 267 ms.
Running link step : cd /tmp/ltsmin4993076761999587523;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin4993076761999587523;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2524282813950123073.hoa' '--buchi-type=spotba'
LTSmin run took 6407 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-11 finished in 12697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(!p1)))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 117 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 117 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 117 transition count 155
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 35 place count 107 transition count 145
Iterating global reduction 1 with 10 rules applied. Total rules applied 45 place count 107 transition count 145
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 50 place count 107 transition count 140
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 58 place count 99 transition count 132
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 99 transition count 132
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 73 place count 99 transition count 125
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 77 place count 95 transition count 121
Iterating global reduction 3 with 4 rules applied. Total rules applied 81 place count 95 transition count 121
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 84 place count 92 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 87 place count 92 transition count 118
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 90 transition count 115
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 90 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 94 place count 90 transition count 112
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 96 place count 88 transition count 110
Iterating global reduction 4 with 2 rules applied. Total rules applied 98 place count 88 transition count 110
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 87 transition count 109
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 87 transition count 109
Applied a total of 100 rules in 17 ms. Remains 87 /128 variables (removed 41) and now considering 109/240 (removed 131) transitions.
// Phase 1: matrix 109 rows 87 cols
[2023-03-18 22:46:10] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 22:46:10] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-18 22:46:10] [INFO ] Invariant cache hit.
[2023-03-18 22:46:10] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-18 22:46:11] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-18 22:46:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:46:11] [INFO ] Invariant cache hit.
[2023-03-18 22:46:11] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/128 places, 109/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 450 ms. Remains : 87/128 places, 109/240 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s81 1)), p0:(AND (GEQ s1 1) (GEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-12 finished in 594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 115 transition count 136
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 115 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 115 transition count 135
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 39 place count 103 transition count 123
Iterating global reduction 1 with 12 rules applied. Total rules applied 51 place count 103 transition count 123
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 58 place count 103 transition count 116
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 68 place count 93 transition count 106
Iterating global reduction 2 with 10 rules applied. Total rules applied 78 place count 93 transition count 106
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 93 transition count 100
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 89 place count 88 transition count 95
Iterating global reduction 3 with 5 rules applied. Total rules applied 94 place count 88 transition count 95
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 84 transition count 91
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 84 transition count 91
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 105 place count 81 transition count 87
Iterating global reduction 3 with 3 rules applied. Total rules applied 108 place count 81 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 110 place count 81 transition count 85
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 113 place count 78 transition count 82
Iterating global reduction 4 with 3 rules applied. Total rules applied 116 place count 78 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 117 place count 77 transition count 81
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 77 transition count 81
Applied a total of 118 rules in 14 ms. Remains 77 /128 variables (removed 51) and now considering 81/240 (removed 159) transitions.
// Phase 1: matrix 81 rows 77 cols
[2023-03-18 22:46:11] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 22:46:11] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-18 22:46:11] [INFO ] Invariant cache hit.
[2023-03-18 22:46:11] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-18 22:46:11] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-18 22:46:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:46:11] [INFO ] Invariant cache hit.
[2023-03-18 22:46:11] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/128 places, 81/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 375 ms. Remains : 77/128 places, 81/240 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s23 1)), p0:(OR (LT s1 1) (LT s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23022 reset in 190 ms.
Product exploration explored 100000 steps with 22914 reset in 167 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 240 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 212 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2262 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 22:46:12] [INFO ] Invariant cache hit.
[2023-03-18 22:46:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:46:12] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 22:46:12] [INFO ] After 61ms 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 (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 398 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 77 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-18 22:46:13] [INFO ] Invariant cache hit.
[2023-03-18 22:46:13] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-18 22:46:13] [INFO ] Invariant cache hit.
[2023-03-18 22:46:13] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-18 22:46:13] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-18 22:46:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:46:13] [INFO ] Invariant cache hit.
[2023-03-18 22:46:13] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 305 ms. Remains : 77/77 places, 81/81 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 240 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Finished random walk after 17 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23044 reset in 122 ms.
Product exploration explored 100000 steps with 23053 reset in 143 ms.
Built C files in :
/tmp/ltsmin6953068092151775678
[2023-03-18 22:46:14] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2023-03-18 22:46:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:46:14] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2023-03-18 22:46:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:46:14] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2023-03-18 22:46:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:46:14] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6953068092151775678
Running compilation step : cd /tmp/ltsmin6953068092151775678;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 206 ms.
Running link step : cd /tmp/ltsmin6953068092151775678;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin6953068092151775678;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17383652082521172763.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 81/81 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-18 22:46:29] [INFO ] Invariant cache hit.
[2023-03-18 22:46:29] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-18 22:46:29] [INFO ] Invariant cache hit.
[2023-03-18 22:46:29] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-18 22:46:30] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2023-03-18 22:46:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:46:30] [INFO ] Invariant cache hit.
[2023-03-18 22:46:30] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 412 ms. Remains : 77/77 places, 81/81 transitions.
Built C files in :
/tmp/ltsmin13895018602829902729
[2023-03-18 22:46:30] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2023-03-18 22:46:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:46:30] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2023-03-18 22:46:30] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:46:30] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2023-03-18 22:46:30] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:46:30] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13895018602829902729
Running compilation step : cd /tmp/ltsmin13895018602829902729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 203 ms.
Running link step : cd /tmp/ltsmin13895018602829902729;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin13895018602829902729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13406826633463436650.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 22:46:45] [INFO ] Flatten gal took : 7 ms
[2023-03-18 22:46:45] [INFO ] Flatten gal took : 8 ms
[2023-03-18 22:46:45] [INFO ] Time to serialize gal into /tmp/LTL13827472860220150314.gal : 3 ms
[2023-03-18 22:46:45] [INFO ] Time to serialize properties into /tmp/LTL1225837818826859524.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13827472860220150314.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17185341225262131480.hoa' '-atoms' '/tmp/LTL1225837818826859524.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL1225837818826859524.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17185341225262131480.hoa
Detected timeout of ITS tools.
[2023-03-18 22:47:00] [INFO ] Flatten gal took : 6 ms
[2023-03-18 22:47:00] [INFO ] Flatten gal took : 13 ms
[2023-03-18 22:47:00] [INFO ] Time to serialize gal into /tmp/LTL8610401778262818630.gal : 15 ms
[2023-03-18 22:47:00] [INFO ] Time to serialize properties into /tmp/LTL12139366214792515906.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8610401778262818630.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12139366214792515906.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((s1<1)||(l5<1))")||(G("((s4>=1)&&(l0>=1))"))))))
Formula 0 simplified : G(F!"((s4>=1)&&(l0>=1))" & FG!"((s1<1)||(l5<1))")
Detected timeout of ITS tools.
[2023-03-18 22:47:15] [INFO ] Flatten gal took : 13 ms
[2023-03-18 22:47:15] [INFO ] Applying decomposition
[2023-03-18 22:47:15] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10452140746698273724.txt' '-o' '/tmp/graph10452140746698273724.bin' '-w' '/tmp/graph10452140746698273724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10452140746698273724.bin' '-l' '-1' '-v' '-w' '/tmp/graph10452140746698273724.weights' '-q' '0' '-e' '0.001'
[2023-03-18 22:47:15] [INFO ] Decomposing Gal with order
[2023-03-18 22:47:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 22:47:15] [INFO ] Removed a total of 77 redundant transitions.
[2023-03-18 22:47:15] [INFO ] Flatten gal took : 49 ms
[2023-03-18 22:47:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 7 ms.
[2023-03-18 22:47:15] [INFO ] Time to serialize gal into /tmp/LTL5446231289514589552.gal : 3 ms
[2023-03-18 22:47:15] [INFO ] Time to serialize properties into /tmp/LTL4604967841651529290.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5446231289514589552.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4604967841651529290.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i6.u0.s1<1)||(i4.u2.l5<1))")||(G("((i4.u2.s4>=1)&&(i6.u0.l0>=1))"))))))
Formula 0 simplified : G(F!"((i4.u2.s4>=1)&&(i6.u0.l0>=1))" & FG!"((i6.u0.s1<1)||(i4.u2.l5<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2322706907092662061
[2023-03-18 22:47:30] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2322706907092662061
Running compilation step : cd /tmp/ltsmin2322706907092662061;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 288 ms.
Running link step : cd /tmp/ltsmin2322706907092662061;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin2322706907092662061;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-13 finished in 94722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))&&p0)))'
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 240/240 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 117 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 117 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 117 transition count 155
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 35 place count 107 transition count 145
Iterating global reduction 1 with 10 rules applied. Total rules applied 45 place count 107 transition count 145
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 50 place count 107 transition count 140
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 58 place count 99 transition count 132
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 99 transition count 132
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 99 transition count 126
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 75 place count 96 transition count 123
Iterating global reduction 3 with 3 rules applied. Total rules applied 78 place count 96 transition count 123
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 94 transition count 121
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 85 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 92 transition count 118
Applied a total of 86 rules in 16 ms. Remains 92 /128 variables (removed 36) and now considering 118/240 (removed 122) transitions.
// Phase 1: matrix 118 rows 92 cols
[2023-03-18 22:47:46] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:47:46] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-18 22:47:46] [INFO ] Invariant cache hit.
[2023-03-18 22:47:46] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-18 22:47:46] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2023-03-18 22:47:46] [INFO ] Invariant cache hit.
[2023-03-18 22:47:51] [INFO ] Dead Transitions using invariants and state equation in 4978 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/128 places, 118/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5370 ms. Remains : 92/128 places, 118/240 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m36-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s86 1)), p1:(AND (GEQ s12 1) (GEQ s28 1) (OR (LT s1 1) (LT s87 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m36-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m36-LTLFireability-14 finished in 5624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
[2023-03-18 22:47:51] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14750942668669066962
[2023-03-18 22:47:51] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2023-03-18 22:47:51] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:47:51] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2023-03-18 22:47:51] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:47:51] [INFO ] Applying decomposition
[2023-03-18 22:47:51] [INFO ] Flatten gal took : 10 ms
[2023-03-18 22:47:51] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2023-03-18 22:47:51] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:47:51] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14750942668669066962
Running compilation step : cd /tmp/ltsmin14750942668669066962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12060785634966190772.txt' '-o' '/tmp/graph12060785634966190772.bin' '-w' '/tmp/graph12060785634966190772.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12060785634966190772.bin' '-l' '-1' '-v' '-w' '/tmp/graph12060785634966190772.weights' '-q' '0' '-e' '0.001'
[2023-03-18 22:47:52] [INFO ] Decomposing Gal with order
[2023-03-18 22:47:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 22:47:52] [INFO ] Removed a total of 150 redundant transitions.
[2023-03-18 22:47:52] [INFO ] Flatten gal took : 31 ms
[2023-03-18 22:47:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 129 labels/synchronizations in 6 ms.
[2023-03-18 22:47:52] [INFO ] Time to serialize gal into /tmp/LTLFireability13283803658048217268.gal : 16 ms
[2023-03-18 22:47:52] [INFO ] Time to serialize properties into /tmp/LTLFireability15897641017083272011.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13283803658048217268.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15897641017083272011.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G(F(("((u0.s1<1)||(i1.u2.l5<1))")||(G("((i1.u2.s4>=1)&&(i6.u23.l0>=1))"))))))
Formula 0 simplified : G(F!"((i1.u2.s4>=1)&&(i6.u23.l0>=1))" & FG!"((u0.s1<1)||(i1.u2.l5<1))")
Compilation finished in 687 ms.
Running link step : cd /tmp/ltsmin14750942668669066962;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin14750942668669066962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-18 23:08:50] [INFO ] Flatten gal took : 33 ms
[2023-03-18 23:08:50] [INFO ] Time to serialize gal into /tmp/LTLFireability2357604967441956076.gal : 3 ms
[2023-03-18 23:08:50] [INFO ] Time to serialize properties into /tmp/LTLFireability11164976615447779900.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2357604967441956076.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11164976615447779900.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G(F(("((s1<1)||(l5<1))")||(G("((s4>=1)&&(l0>=1))"))))))
Formula 0 simplified : G(F!"((s4>=1)&&(l0>=1))" & FG!"((s1<1)||(l5<1))")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Initializing POR dependencies: labels 242, guards 240
pins2lts-mc-linux64( 1/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.033: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.033: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.055: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.058: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.107: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.297: LTL layer: formula: [](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))
pins2lts-mc-linux64( 2/ 8), 0.298: "[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.298: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.528: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.547: There are 243 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.547: State length is 129, there are 246 groups
pins2lts-mc-linux64( 0/ 8), 0.547: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.547: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.547: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.547: Visible groups: 0 / 246, labels: 2 / 243
pins2lts-mc-linux64( 0/ 8), 0.547: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.547: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.631: [Blue] ~48 levels ~960 states ~2576 transitions
pins2lts-mc-linux64( 5/ 8), 0.664: [Blue] ~47 levels ~1920 states ~5080 transitions
pins2lts-mc-linux64( 2/ 8), 0.837: [Blue] ~61 levels ~3840 states ~9552 transitions
pins2lts-mc-linux64( 1/ 8), 0.980: [Blue] ~92 levels ~7680 states ~17144 transitions
pins2lts-mc-linux64( 1/ 8), 1.223: [Blue] ~111 levels ~15360 states ~33960 transitions
pins2lts-mc-linux64( 1/ 8), 1.654: [Blue] ~149 levels ~30720 states ~65312 transitions
pins2lts-mc-linux64( 1/ 8), 2.514: [Blue] ~193 levels ~61440 states ~131368 transitions
pins2lts-mc-linux64( 1/ 8), 4.413: [Blue] ~193 levels ~122880 states ~259592 transitions
pins2lts-mc-linux64( 1/ 8), 8.692: [Blue] ~237 levels ~245760 states ~521024 transitions
pins2lts-mc-linux64( 1/ 8), 17.077: [Blue] ~281 levels ~491520 states ~1048856 transitions
pins2lts-mc-linux64( 1/ 8), 30.966: [Blue] ~325 levels ~983040 states ~2110664 transitions
pins2lts-mc-linux64( 1/ 8), 50.437: [Blue] ~369 levels ~1966080 states ~4237744 transitions
pins2lts-mc-linux64( 4/ 8), 75.378: [Blue] ~1340 levels ~3932160 states ~8163848 transitions
pins2lts-mc-linux64( 4/ 8), 122.946: [Blue] ~1615 levels ~7864320 states ~16345000 transitions
pins2lts-mc-linux64( 2/ 8), 213.674: [Blue] ~1359 levels ~15728640 states ~32358584 transitions
pins2lts-mc-linux64( 2/ 8), 413.155: [Blue] ~1644 levels ~31457280 states ~64771912 transitions
pins2lts-mc-linux64( 4/ 8), 805.171: [Blue] ~2684 levels ~62914560 states ~131106576 transitions
pins2lts-mc-linux64( 4/ 8), 1674.344: [Blue] ~65084 levels ~125829120 states ~271047408 transitions
pins2lts-mc-linux64( 1/ 8), 1882.874: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1883.194:
pins2lts-mc-linux64( 0/ 8), 1883.194: Explored 133242267 states 297737677 transitions, fanout: 2.235
pins2lts-mc-linux64( 0/ 8), 1883.194: Total exploration time 1882.590 sec (1882.430 sec minimum, 1882.519 sec on average)
pins2lts-mc-linux64( 0/ 8), 1883.194: States per second: 70776, Transitions per second: 158153
pins2lts-mc-linux64( 0/ 8), 1883.194:
pins2lts-mc-linux64( 0/ 8), 1883.194: State space has 134217420 states, 10 are accepting
pins2lts-mc-linux64( 0/ 8), 1883.194: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1883.194: blue states: 133242267 (99.27%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1883.194: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1883.194: all-red states: 10 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1883.194:
pins2lts-mc-linux64( 0/ 8), 1883.194: Total memory used for local state coloring: 4.1MB
pins2lts-mc-linux64( 0/ 8), 1883.194:
pins2lts-mc-linux64( 0/ 8), 1883.194: Queue width: 8B, total height: 269102, memory: 2.05MB
pins2lts-mc-linux64( 0/ 8), 1883.194: Tree memory: 1179.8MB, 9.2 B/state, compr.: 1.8%
pins2lts-mc-linux64( 0/ 8), 1883.194: Tree fill ratio (roots/leafs): 99.0%/60.0%
pins2lts-mc-linux64( 0/ 8), 1883.194: Stored 242 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1883.194: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1883.194: Est. total memory use: 1181.8MB (~1026.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14750942668669066962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14750942668669066962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-18 23:29:49] [INFO ] Flatten gal took : 15 ms
[2023-03-18 23:29:49] [INFO ] Input system was already deterministic with 240 transitions.
[2023-03-18 23:29:49] [INFO ] Transformed 128 places.
[2023-03-18 23:29:49] [INFO ] Transformed 240 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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
[2023-03-18 23:29:49] [INFO ] Time to serialize gal into /tmp/LTLFireability5297207746877062219.gal : 3 ms
[2023-03-18 23:29:49] [INFO ] Time to serialize properties into /tmp/LTLFireability6050103418957647463.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5297207746877062219.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6050103418957647463.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("((s1<1)||(l5<1))")||(G("((s4>=1)&&(l0>=1))"))))))
Formula 0 simplified : G(F!"((s4>=1)&&(l0>=1))" & FG!"((s1<1)||(l5<1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 10465044 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16035680 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d1m36"
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-5348"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d1m36, 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 r421-tajo-167905975200428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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