Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.1K Jun 7 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 7 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 7 17:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 7 17:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Jun 6 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 6 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 7.6K Jun 7 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 7 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Jun 7 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 1.1M Jun 6 12:11 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654960675817

Running Version 202205111006
[2022-06-11 15:17:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 15:17:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 15:17:57] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2022-06-11 15:17:57] [INFO ] Transformed 2398 places.
[2022-06-11 15:17:57] [INFO ] Transformed 1954 transitions.
[2022-06-11 15:17:57] [INFO ] Parsed PT model containing 2398 places and 1954 transitions in 326 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1984 places in 18 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 947 place count 295 transition count 717
Iterating global reduction 1 with 94 rules applied. Total rules applied 1041 place count 295 transition count 717
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 1055 place count 295 transition count 703
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 1117 place count 233 transition count 641
Iterating global reduction 2 with 62 rules applied. Total rules applied 1179 place count 233 transition count 641
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 1203 place count 233 transition count 617
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1233 place count 203 transition count 582
Iterating global reduction 3 with 30 rules applied. Total rules applied 1263 place count 203 transition count 582
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 3 with 90 rules applied. Total rules applied 1353 place count 203 transition count 492
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1357 place count 199 transition count 482
Iterating global reduction 4 with 4 rules applied. Total rules applied 1361 place count 199 transition count 482
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1365 place count 195 transition count 478
Iterating global reduction 4 with 4 rules applied. Total rules applied 1369 place count 195 transition count 478
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1370 place count 194 transition count 477
Iterating global reduction 4 with 1 rules applied. Total rules applied 1371 place count 194 transition count 477
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1372 place count 193 transition count 476
Iterating global reduction 4 with 1 rules applied. Total rules applied 1373 place count 193 transition count 476
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1374 place count 192 transition count 475
Iterating global reduction 4 with 1 rules applied. Total rules applied 1375 place count 192 transition count 475
Applied a total of 1375 rules in 123 ms. Remains 192 /414 variables (removed 222) and now considering 475/1954 (removed 1479) transitions.
// Phase 1: matrix 475 rows 192 cols
[2022-06-11 15:17:57] [INFO ] Computed 5 place invariants in 23 ms
[2022-06-11 15:17:57] [INFO ] Implicit Places using invariants in 286 ms returned []
// Phase 1: matrix 475 rows 192 cols
[2022-06-11 15:17:57] [INFO ] Computed 5 place invariants in 18 ms
[2022-06-11 15:17:58] [INFO ] State equation strengthened by 329 read => feed constraints.
[2022-06-11 15:17:59] [INFO ] Implicit Places using invariants and state equation in 1186 ms returned []
Implicit Place search using SMT with State Equation took 1502 ms to find 0 implicit places.
// Phase 1: matrix 475 rows 192 cols
[2022-06-11 15:17:59] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 15:17:59] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 192/414 places, 475/1954 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/414 places, 475/1954 transitions.
Support contains 30 out of 192 places after structural reductions.
[2022-06-11 15:17:59] [INFO ] Flatten gal took : 59 ms
[2022-06-11 15:17:59] [INFO ] Flatten gal took : 29 ms
[2022-06-11 15:17:59] [INFO ] Input system was already deterministic with 475 transitions.
Incomplete random walk after 10000 steps, including 2294 resets, run finished after 778 ms. (steps per millisecond=12 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 105 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 33) seen :0
Interrupted probabilistic random walk after 181803 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{5=1, 7=1, 10=1, 12=1, 13=1, 16=1, 17=1, 18=1, 22=1, 23=1, 28=1, 29=1, 30=1, 31=1}
Probabilistic random walk after 181803 steps, saw 85056 distinct states, run finished after 3007 ms. (steps per millisecond=60 ) properties seen :14
Running SMT prover for 19 properties.
// Phase 1: matrix 475 rows 192 cols
[2022-06-11 15:18:03] [INFO ] Computed 5 place invariants in 6 ms
[2022-06-11 15:18:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:18:04] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 5 ms returned sat
[2022-06-11 15:18:04] [INFO ] After 723ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:18
[2022-06-11 15:18:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-06-11 15:18:05] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 11 ms returned sat
[2022-06-11 15:18:07] [INFO ] After 2018ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :18
[2022-06-11 15:18:07] [INFO ] State equation strengthened by 329 read => feed constraints.
[2022-06-11 15:18:09] [INFO ] After 2427ms SMT Verify possible using 329 Read/Feed constraints in natural domain returned unsat :1 sat :18
[2022-06-11 15:18:09] [INFO ] Deduced a trap composed of 79 places in 50 ms of which 3 ms to minimize.
[2022-06-11 15:18:09] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
[2022-06-11 15:18:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
[2022-06-11 15:18:11] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2022-06-11 15:18:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2022-06-11 15:18:12] [INFO ] After 5075ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :18
Attempting to minimize the solution found.
Minimization took 1687 ms.
[2022-06-11 15:18:13] [INFO ] After 9269ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :18
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 255 ms.
Support contains 18 out of 192 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 192/192 places, 475/475 transitions.
Graph (complete) has 774 edges and 192 vertex of which 191 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 191 transition count 473
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 15 place count 179 transition count 329
Iterating global reduction 1 with 12 rules applied. Total rules applied 27 place count 179 transition count 329
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 39 place count 167 transition count 317
Iterating global reduction 1 with 12 rules applied. Total rules applied 51 place count 167 transition count 317
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 167 transition count 310
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 62 place count 163 transition count 302
Iterating global reduction 2 with 4 rules applied. Total rules applied 66 place count 163 transition count 302
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 163 transition count 300
Applied a total of 68 rules in 56 ms. Remains 163 /192 variables (removed 29) and now considering 300/475 (removed 175) transitions.
Finished structural reductions, in 1 iterations. Remains : 163/192 places, 300/475 transitions.
Incomplete random walk after 10000 steps, including 2236 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 103 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 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 44 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 51 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 40 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 47 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 56 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 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 56 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 176833 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{0=1}
Probabilistic random walk after 176833 steps, saw 81333 distinct states, run finished after 3005 ms. (steps per millisecond=58 ) properties seen :1
Running SMT prover for 17 properties.
// Phase 1: matrix 300 rows 163 cols
[2022-06-11 15:18:17] [INFO ] Computed 4 place invariants in 6 ms
[2022-06-11 15:18:18] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 15:18:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 15:18:18] [INFO ] After 379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2022-06-11 15:18:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:18:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:18:19] [INFO ] After 598ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2022-06-11 15:18:19] [INFO ] State equation strengthened by 181 read => feed constraints.
[2022-06-11 15:18:20] [INFO ] After 1396ms SMT Verify possible using 181 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2022-06-11 15:18:20] [INFO ] Deduced a trap composed of 78 places in 52 ms of which 1 ms to minimize.
[2022-06-11 15:18:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2022-06-11 15:18:21] [INFO ] Deduced a trap composed of 76 places in 49 ms of which 1 ms to minimize.
[2022-06-11 15:18:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2022-06-11 15:18:22] [INFO ] After 2983ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 1437 ms.
[2022-06-11 15:18:23] [INFO ] After 5145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 0 properties in 499 ms.
Support contains 17 out of 163 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 163/163 places, 300/300 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 162 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 162 transition count 287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 161 transition count 286
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 161 transition count 286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 160 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 160 transition count 284
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 160 transition count 283
Applied a total of 7 rules in 30 ms. Remains 160 /163 variables (removed 3) and now considering 283/300 (removed 17) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/163 places, 283/300 transitions.
Incomplete random walk after 10000 steps, including 2256 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 101 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 98 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 241284 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{7=1, 9=1, 15=1}
Probabilistic random walk after 241284 steps, saw 109570 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :3
Running SMT prover for 14 properties.
// Phase 1: matrix 283 rows 160 cols
[2022-06-11 15:18:27] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 15:18:27] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 15:18:27] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 15:18:27] [INFO ] After 301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-06-11 15:18:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:18:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 15:18:28] [INFO ] After 500ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2022-06-11 15:18:28] [INFO ] State equation strengthened by 167 read => feed constraints.
[2022-06-11 15:18:29] [INFO ] After 862ms SMT Verify possible using 167 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2022-06-11 15:18:29] [INFO ] Deduced a trap composed of 78 places in 46 ms of which 1 ms to minimize.
[2022-06-11 15:18:29] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2022-06-11 15:18:29] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 0 ms to minimize.
[2022-06-11 15:18:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 387 ms
[2022-06-11 15:18:31] [INFO ] After 2635ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1528 ms.
[2022-06-11 15:18:32] [INFO ] After 4772ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 398 ms.
Support contains 14 out of 160 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 283/283 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 158 transition count 269
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 158 transition count 269
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 156 transition count 266
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 156 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 156 transition count 265
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 155 transition count 263
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 155 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 155 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 154 transition count 261
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 154 transition count 261
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 153 transition count 260
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 153 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 152 transition count 259
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 152 transition count 259
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 25 place count 152 transition count 252
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 151 transition count 251
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 151 transition count 251
Applied a total of 27 rules in 37 ms. Remains 151 /160 variables (removed 9) and now considering 251/283 (removed 32) transitions.
Finished structural reductions, in 1 iterations. Remains : 151/160 places, 251/283 transitions.
Incomplete random walk after 10000 steps, including 2227 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 1066 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 443 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 480 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 459 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 517 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 436 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 459 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 465 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 247783 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 247783 steps, saw 108605 distinct states, run finished after 3003 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 251 rows 151 cols
[2022-06-11 15:18:37] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 15:18:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:18:37] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 15:18:38] [INFO ] After 292ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-06-11 15:18:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:18:38] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 15:18:38] [INFO ] After 433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2022-06-11 15:18:38] [INFO ] State equation strengthened by 143 read => feed constraints.
[2022-06-11 15:18:39] [INFO ] After 1244ms SMT Verify possible using 143 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2022-06-11 15:18:40] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2022-06-11 15:18:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2022-06-11 15:18:41] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2022-06-11 15:18:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2022-06-11 15:18:41] [INFO ] After 2788ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 2045 ms.
[2022-06-11 15:18:43] [INFO ] After 5383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 382 ms.
Support contains 14 out of 151 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 151/151 places, 251/251 transitions.
Applied a total of 0 rules in 9 ms. Remains 151 /151 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 151/151 places, 251/251 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 151/151 places, 251/251 transitions.
Applied a total of 0 rules in 11 ms. Remains 151 /151 variables (removed 0) and now considering 251/251 (removed 0) transitions.
// Phase 1: matrix 251 rows 151 cols
[2022-06-11 15:18:43] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 15:18:43] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 251 rows 151 cols
[2022-06-11 15:18:43] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 15:18:43] [INFO ] State equation strengthened by 143 read => feed constraints.
[2022-06-11 15:18:44] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
[2022-06-11 15:18:44] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 251 rows 151 cols
[2022-06-11 15:18:44] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 15:18:44] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 151/151 places, 251/251 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 151 transition count 245
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 146 transition count 245
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 11 place count 146 transition count 225
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 51 place count 126 transition count 225
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 75 place count 114 transition count 213
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 113 transition count 222
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 113 transition count 222
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 113 transition count 221
Applied a total of 81 rules in 24 ms. Remains 113 /151 variables (removed 38) and now considering 221/251 (removed 30) transitions.
Running SMT prover for 14 properties.
// Phase 1: matrix 221 rows 113 cols
[2022-06-11 15:18:44] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 15:18:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:18:44] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 15:18:44] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-06-11 15:18:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:18:44] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 15:18:45] [INFO ] After 425ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2022-06-11 15:18:45] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2022-06-11 15:18:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2022-06-11 15:18:45] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 0 ms to minimize.
[2022-06-11 15:18:45] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 0 ms to minimize.
[2022-06-11 15:18:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2022-06-11 15:18:45] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2022-06-11 15:18:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2022-06-11 15:18:46] [INFO ] After 1147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 465 ms.
[2022-06-11 15:18:46] [INFO ] After 1694ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
[2022-06-11 15:18:46] [INFO ] Flatten gal took : 15 ms
[2022-06-11 15:18:46] [INFO ] Flatten gal took : 13 ms
[2022-06-11 15:18:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13059195823284744583.gal : 7 ms
[2022-06-11 15:18:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15376595147196391198.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms4906554949425070018;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13059195823284744583.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15376595147196391198.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality15376595147196391198.prop.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :9 after 28
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :28 after 35
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :35 after 47
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :47 after 144
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :144 after 246
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :246 after 356
Reachability property AtomicPropp8 is true.
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :356 after 1498
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :1498 after 3328
Reachability property AtomicPropp6 is true.
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :3328 after 18072
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :18072 after 54564
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :54564 after 332332
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :332332 after 3.46615e+06
SDD proceeding with computation,12 properties remain. new max is 8192
SDD size :3.46615e+06 after 3.84975e+07
SDD proceeding with computation,12 properties remain. new max is 16384
SDD size :3.84975e+07 after 1.895e+08
SDD proceeding with computation,12 properties remain. new max is 32768
SDD size :1.895e+08 after 4.92362e+08
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,7.80202e+08,13.7904,301512,2,14360,23,841423,17,0,679,878189,0
Total reachable state count : 780202216

Verifying 14 reachability properties.
Reachability property AtomicPropp1 does not hold.
No reachable states exhibit your property : AtomicPropp1

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp1,0,13.7949,301512,1,0,23,841423,17,0,680,878189,0
Reachability property AtomicPropp2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp2,502,13.7958,301512,2,677,23,841423,17,0,682,878189,0
Reachability property AtomicPropp3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp3,502,13.7963,301512,2,677,23,841423,17,0,683,878189,0
Reachability property AtomicPropp4 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp4,502,13.7967,301512,2,677,23,841423,17,0,684,878189,0
Reachability property AtomicPropp6 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp6,696,13.7974,301512,2,1161,23,841423,18,0,701,878189,0
Reachability property AtomicPropp8 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp8,700,13.7981,301512,2,1240,23,841423,19,0,702,878189,0
Reachability property AtomicPropp11 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp11,502,13.7986,301512,2,677,23,841423,19,0,702,878189,0
Reachability property AtomicPropp15 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp15,502,13.799,301512,2,677,23,841423,19,0,703,878189,0
Reachability property AtomicPropp20 does not hold.
No reachable states exhibit your property : AtomicPropp20

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp20,0,13.8026,301512,1,0,23,841423,19,0,703,878189,0
Reachability property AtomicPropp21 does not hold.
No reachable states exhibit your property : AtomicPropp21

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp21,0,13.803,301512,1,0,23,841423,19,0,703,878189,0
Reachability property AtomicPropp24 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp24,502,13.8033,301512,2,677,23,841423,19,0,704,878189,0
Reachability property AtomicPropp25 does not hold.
No reachable states exhibit your property : AtomicPropp25

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp25,0,13.8036,301512,1,0,23,841423,19,0,704,878189,0
Reachability property AtomicPropp26 does not hold.
No reachable states exhibit your property : AtomicPropp26

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp26,0,13.8038,301512,1,0,23,841423,19,0,704,878189,0
Reachability property AtomicPropp32 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp32,502,13.8042,301512,2,677,23,841423,19,0,705,878189,0
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 50 stabilizing places and 64 stable transitions
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 475/475 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 166 transition count 228
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 166 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 166 transition count 227
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 78 place count 141 transition count 200
Iterating global reduction 1 with 25 rules applied. Total rules applied 103 place count 141 transition count 200
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 115 place count 141 transition count 188
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 129 place count 127 transition count 164
Iterating global reduction 2 with 14 rules applied. Total rules applied 143 place count 127 transition count 164
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 152 place count 127 transition count 155
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 157 place count 122 transition count 150
Iterating global reduction 3 with 5 rules applied. Total rules applied 162 place count 122 transition count 150
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 167 place count 117 transition count 145
Iterating global reduction 3 with 5 rules applied. Total rules applied 172 place count 117 transition count 145
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 176 place count 113 transition count 140
Iterating global reduction 3 with 4 rules applied. Total rules applied 180 place count 113 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 182 place count 113 transition count 138
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 185 place count 110 transition count 135
Iterating global reduction 4 with 3 rules applied. Total rules applied 188 place count 110 transition count 135
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 190 place count 108 transition count 131
Iterating global reduction 4 with 2 rules applied. Total rules applied 192 place count 108 transition count 131
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 194 place count 106 transition count 129
Iterating global reduction 4 with 2 rules applied. Total rules applied 196 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 197 place count 105 transition count 128
Iterating global reduction 4 with 1 rules applied. Total rules applied 198 place count 105 transition count 128
Applied a total of 198 rules in 48 ms. Remains 105 /192 variables (removed 87) and now considering 128/475 (removed 347) transitions.
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 15:19:00] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 15:19:01] [INFO ] Implicit Places using invariants in 482 ms returned []
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 15:19:01] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 15:19:01] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-11 15:19:01] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
[2022-06-11 15:19:01] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 128 rows 105 cols
[2022-06-11 15:19:01] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 15:19:01] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/192 places, 128/475 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/192 places, 128/475 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22585 reset in 259 ms.
Product exploration explored 100000 steps with 22521 reset in 169 ms.
Computed a total of 22 stabilizing places and 24 stable transitions
Computed a total of 22 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 301 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2284 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16074 steps, run visited all 1 properties in 39 ms. (steps per millisecond=412 )
Probabilistic random walk after 16074 steps, saw 8113 distinct states, run finished after 40 ms. (steps per millisecond=401 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-00 finished in 2218 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G(X(p1))))))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 475/475 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 167 transition count 241
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 167 transition count 241
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 167 transition count 240
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 75 place count 143 transition count 214
Iterating global reduction 1 with 24 rules applied. Total rules applied 99 place count 143 transition count 214
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 109 place count 143 transition count 204
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 122 place count 130 transition count 182
Iterating global reduction 2 with 13 rules applied. Total rules applied 135 place count 130 transition count 182
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 143 place count 130 transition count 174
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 147 place count 126 transition count 170
Iterating global reduction 3 with 4 rules applied. Total rules applied 151 place count 126 transition count 170
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 155 place count 122 transition count 166
Iterating global reduction 3 with 4 rules applied. Total rules applied 159 place count 122 transition count 166
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 162 place count 119 transition count 162
Iterating global reduction 3 with 3 rules applied. Total rules applied 165 place count 119 transition count 162
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 167 place count 117 transition count 160
Iterating global reduction 3 with 2 rules applied. Total rules applied 169 place count 117 transition count 160
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 171 place count 115 transition count 156
Iterating global reduction 3 with 2 rules applied. Total rules applied 173 place count 115 transition count 156
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 175 place count 113 transition count 154
Iterating global reduction 3 with 2 rules applied. Total rules applied 177 place count 113 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 178 place count 112 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 179 place count 112 transition count 153
Applied a total of 179 rules in 15 ms. Remains 112 /192 variables (removed 80) and now considering 153/475 (removed 322) transitions.
// Phase 1: matrix 153 rows 112 cols
[2022-06-11 15:19:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:19:03] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 153 rows 112 cols
[2022-06-11 15:19:03] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 15:19:03] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-11 15:19:03] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
// Phase 1: matrix 153 rows 112 cols
[2022-06-11 15:19:03] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:19:03] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/192 places, 153/475 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/192 places, 153/475 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-01 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=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s106 1)), p1:(OR (LT s1 1) (LT s107 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 22305 reset in 136 ms.
Product exploration explored 100000 steps with 22498 reset in 182 ms.
Computed a total of 22 stabilizing places and 24 stable transitions
Computed a total of 22 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 6 states, 8 edges and 2 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2211 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3930 steps, run visited all 1 properties in 8 ms. (steps per millisecond=491 )
Probabilistic random walk after 3930 steps, saw 1952 distinct states, run finished after 8 ms. (steps per millisecond=491 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 112 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 153/153 transitions.
Applied a total of 0 rules in 1 ms. Remains 112 /112 variables (removed 0) and now considering 153/153 (removed 0) transitions.
// Phase 1: matrix 153 rows 112 cols
[2022-06-11 15:19:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:19:04] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 153 rows 112 cols
[2022-06-11 15:19:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:19:05] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-11 15:19:05] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
// Phase 1: matrix 153 rows 112 cols
[2022-06-11 15:19:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:19:05] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/112 places, 153/153 transitions.
Computed a total of 22 stabilizing places and 24 stable transitions
Computed a total of 22 stabilizing places and 24 stable transitions
Knowledge obtained : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2241 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 451 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3930 steps, run visited all 1 properties in 8 ms. (steps per millisecond=491 )
Probabilistic random walk after 3930 steps, saw 1952 distinct states, run finished after 8 ms. (steps per millisecond=491 ) properties seen :1
Knowledge obtained : [p1, true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 22387 reset in 161 ms.
Product exploration explored 100000 steps with 22509 reset in 146 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 600 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 153/153 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 111 transition count 140
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 140
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 110 transition count 139
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 110 transition count 139
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 110 transition count 138
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 109 transition count 136
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 109 transition count 136
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 109 transition count 135
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 108 transition count 134
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 108 transition count 134
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 107 transition count 133
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 107 transition count 133
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 106 transition count 132
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 106 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 105 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 105 transition count 129
Applied a total of 18 rules in 34 ms. Remains 105 /112 variables (removed 7) and now considering 129/153 (removed 24) transitions.
[2022-06-11 15:19:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 15:19:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:19:07] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/112 places, 129/153 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/112 places, 129/153 transitions.
Product exploration explored 100000 steps with 22378 reset in 524 ms.
Product exploration explored 100000 steps with 22409 reset in 279 ms.
Built C files in :
/tmp/ltsmin11334730921554536896
[2022-06-11 15:19:08] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11334730921554536896
Running compilation step : cd /tmp/ltsmin11334730921554536896;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 952 ms.
Running link step : cd /tmp/ltsmin11334730921554536896;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11334730921554536896;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13529603000725545124.hoa' '--buchi-type=spotba'
LTSmin run took 1410 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-01 finished in 7707 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||X(G(!(F(p1) U p2)))))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 475/475 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 167 transition count 219
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 167 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 167 transition count 218
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 75 place count 143 transition count 192
Iterating global reduction 1 with 24 rules applied. Total rules applied 99 place count 143 transition count 192
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 109 place count 143 transition count 182
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 123 place count 129 transition count 156
Iterating global reduction 2 with 14 rules applied. Total rules applied 137 place count 129 transition count 156
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 146 place count 129 transition count 147
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 152 place count 123 transition count 141
Iterating global reduction 3 with 6 rules applied. Total rules applied 158 place count 123 transition count 141
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 163 place count 118 transition count 136
Iterating global reduction 3 with 5 rules applied. Total rules applied 168 place count 118 transition count 136
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 172 place count 114 transition count 131
Iterating global reduction 3 with 4 rules applied. Total rules applied 176 place count 114 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 178 place count 114 transition count 129
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 182 place count 110 transition count 125
Iterating global reduction 4 with 4 rules applied. Total rules applied 186 place count 110 transition count 125
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 187 place count 109 transition count 124
Iterating global reduction 4 with 1 rules applied. Total rules applied 188 place count 109 transition count 124
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 189 place count 108 transition count 123
Iterating global reduction 4 with 1 rules applied. Total rules applied 190 place count 108 transition count 123
Applied a total of 190 rules in 19 ms. Remains 108 /192 variables (removed 84) and now considering 123/475 (removed 352) transitions.
// Phase 1: matrix 123 rows 108 cols
[2022-06-11 15:19:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:19:10] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 123 rows 108 cols
[2022-06-11 15:19:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:19:11] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-06-11 15:19:11] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
// Phase 1: matrix 123 rows 108 cols
[2022-06-11 15:19:11] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 15:19:11] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/192 places, 123/475 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/192 places, 123/475 transitions.
Stuttering acceptance computed with spot in 189 ms :[true, (AND p2 (NOT p0)), p2, (AND p2 (NOT p0)), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(AND (GEQ s1 1) (GEQ s59 1)), p0:(OR (LT s1 1) (LT s63 1) (LT s1 1) (LT s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22268 reset in 371 ms.
Product exploration explored 100000 steps with 22341 reset in 151 ms.
Computed a total of 27 stabilizing places and 31 stable transitions
Computed a total of 27 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (AND p0 (NOT p2))), (X (X (NOT p2))), true, (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 470 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 5 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 346 ms :[true, (AND p2 (NOT p0)), p2, (NOT p0), (AND p2 (NOT p0))]
Incomplete random walk after 10000 steps, including 2275 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 483 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 470 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 459 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 407817 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 407817 steps, saw 194163 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 123 rows 108 cols
[2022-06-11 15:19:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:19:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:19:16] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2022-06-11 15:19:16] [INFO ] After 360ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2022-06-11 15:19:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:19:16] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 15:19:16] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2022-06-11 15:19:16] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-06-11 15:19:17] [INFO ] After 159ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2022-06-11 15:19:17] [INFO ] Deduced a trap composed of 50 places in 250 ms of which 6 ms to minimize.
[2022-06-11 15:19:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2022-06-11 15:19:17] [INFO ] After 605ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 126 ms.
[2022-06-11 15:19:17] [INFO ] After 888ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 46 ms.
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 108/108 places, 123/123 transitions.
Graph (complete) has 308 edges and 108 vertex of which 107 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 107 transition count 121
Applied a total of 3 rules in 5 ms. Remains 107 /108 variables (removed 1) and now considering 121/123 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 107/108 places, 121/123 transitions.
Incomplete random walk after 10000 steps, including 2251 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 468 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 461 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 334114 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 334114 steps, saw 158376 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 121 rows 107 cols
[2022-06-11 15:19:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:19:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 15:19:21] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 15:19:21] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-11 15:19:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 15:19:21] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 15:19:21] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-11 15:19:21] [INFO ] State equation strengthened by 47 read => feed constraints.
[2022-06-11 15:19:21] [INFO ] After 89ms SMT Verify possible using 47 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-11 15:19:21] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 0 ms to minimize.
[2022-06-11 15:19:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2022-06-11 15:19:21] [INFO ] After 309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 115 ms.
[2022-06-11 15:19:21] [INFO ] After 588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 57 ms.
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 107/107 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 107 /107 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 107/107 places, 121/121 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 107/107 places, 121/121 transitions.
Applied a total of 0 rules in 5 ms. Remains 107 /107 variables (removed 0) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 107 cols
[2022-06-11 15:19:21] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 15:19:21] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 121 rows 107 cols
[2022-06-11 15:19:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:19:22] [INFO ] State equation strengthened by 47 read => feed constraints.
[2022-06-11 15:19:22] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2022-06-11 15:19:22] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 121 rows 107 cols
[2022-06-11 15:19:22] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:19:22] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 107/107 places, 121/121 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 107 transition count 115
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 102 transition count 115
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 11 place count 102 transition count 97
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 47 place count 84 transition count 97
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 78 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 77 transition count 99
Applied a total of 61 rules in 18 ms. Remains 77 /107 variables (removed 30) and now considering 99/121 (removed 22) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 99 rows 77 cols
[2022-06-11 15:19:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:19:22] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 15:19:22] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 15:19:22] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-11 15:19:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 15:19:22] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:19:22] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-11 15:19:23] [INFO ] Deduced a trap composed of 13 places in 777 ms of which 0 ms to minimize.
[2022-06-11 15:19:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 787 ms
[2022-06-11 15:19:24] [INFO ] Deduced a trap composed of 37 places in 387 ms of which 0 ms to minimize.
[2022-06-11 15:19:24] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 0 ms to minimize.
[2022-06-11 15:19:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 492 ms
[2022-06-11 15:19:24] [INFO ] After 1498ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 61 ms.
[2022-06-11 15:19:24] [INFO ] After 1593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2022-06-11 15:19:24] [INFO ] Flatten gal took : 6 ms
[2022-06-11 15:19:24] [INFO ] Flatten gal took : 6 ms
[2022-06-11 15:19:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2418574801551580584.gal : 1 ms
[2022-06-11 15:19:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8246875540224050843.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms14072231811559985301;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2418574801551580584.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8246875540224050843.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality8246875540224050843.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :9 after 28
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :28 after 46
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :46 after 210
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :210 after 268
Reachability property apf5 is true.
Reachability property apf4 is true.
Reachability property apf0 is true.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :268 after 512
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :512 after 1368
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1368 after 2600
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2600 after 3426
Reachability property apf2 is true.
Reachability property apf1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,25970,0.16928,11100,2,2745,17,25041,6,0,408,17501,0
Total reachable state count : 25970

Verifying 5 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,68,0.171217,11364,2,216,17,25041,7,0,412,17501,0
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,24,0.172897,11364,2,160,17,25041,8,0,415,17501,0
Reachability property apf2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf2,24,0.173135,11364,2,160,17,25041,8,0,415,17501,0
Reachability property apf4 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf4,44,0.17471,11364,2,215,17,25041,9,0,423,17501,0
Reachability property apf5 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf5,24,0.17507,11364,2,160,17,25041,10,0,424,17501,0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (AND p0 (NOT p2))), (X (X (NOT p2))), true, (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (G (NOT (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 332 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 108 cols
[2022-06-11 15:19:24] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 15:19:24] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 123 rows 108 cols
[2022-06-11 15:19:24] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 15:19:25] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-06-11 15:19:25] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
// Phase 1: matrix 123 rows 108 cols
[2022-06-11 15:19:25] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:19:25] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 123/123 transitions.
Computed a total of 27 stabilizing places and 31 stable transitions
Computed a total of 27 stabilizing places and 31 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2315 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 463 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2361618 steps, run timeout after 3001 ms. (steps per millisecond=786 ) properties seen :{}
Probabilistic random walk after 2361618 steps, saw 1105168 distinct states, run finished after 3001 ms. (steps per millisecond=786 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 108 cols
[2022-06-11 15:19:28] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 15:19:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:19:28] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 15:19:28] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 15:19:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 15:19:28] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 15:19:28] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 15:19:28] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-06-11 15:19:28] [INFO ] After 21ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 15:19:28] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 10 ms to minimize.
[2022-06-11 15:19:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2022-06-11 15:19:28] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-06-11 15:19:28] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 108/108 places, 123/123 transitions.
Graph (complete) has 308 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 107 transition count 121
Applied a total of 3 rules in 24 ms. Remains 107 /108 variables (removed 1) and now considering 121/123 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 107/108 places, 121/123 transitions.
Incomplete random walk after 10000 steps, including 2240 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2224844 steps, run timeout after 3001 ms. (steps per millisecond=741 ) properties seen :{}
Probabilistic random walk after 2224844 steps, saw 1042401 distinct states, run finished after 3001 ms. (steps per millisecond=741 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 107 cols
[2022-06-11 15:19:31] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:19:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 15:19:31] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 15:19:31] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 15:19:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 15:19:31] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 15:19:32] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 15:19:32] [INFO ] State equation strengthened by 47 read => feed constraints.
[2022-06-11 15:19:32] [INFO ] After 21ms SMT Verify possible using 47 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 15:19:32] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 1 ms to minimize.
[2022-06-11 15:19:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2022-06-11 15:19:32] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-06-11 15:19:32] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 107/107 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 107 /107 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 107/107 places, 121/121 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 107/107 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 107 /107 variables (removed 0) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 107 cols
[2022-06-11 15:19:32] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 15:19:32] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 121 rows 107 cols
[2022-06-11 15:19:32] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 15:19:32] [INFO ] State equation strengthened by 47 read => feed constraints.
[2022-06-11 15:19:32] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2022-06-11 15:19:32] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 121 rows 107 cols
[2022-06-11 15:19:32] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 15:19:32] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 107/107 places, 121/121 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 107 transition count 115
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 102 transition count 115
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 11 place count 102 transition count 97
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 47 place count 84 transition count 97
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 78 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 77 transition count 99
Applied a total of 61 rules in 7 ms. Remains 77 /107 variables (removed 30) and now considering 99/121 (removed 22) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 99 rows 77 cols
[2022-06-11 15:19:32] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:19:32] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 15:19:32] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:19:32] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 15:19:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 15:19:32] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 15:19:32] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 15:19:32] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-06-11 15:19:32] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 15:19:32] [INFO ] Flatten gal took : 6 ms
[2022-06-11 15:19:32] [INFO ] Flatten gal took : 8 ms
[2022-06-11 15:19:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17598497874332949634.gal : 3 ms
[2022-06-11 15:19:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4382988041738903837.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14381818358365031795;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17598497874332949634.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4382988041738903837.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality4382988041738903837.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 46
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :46 after 210
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :210 after 268
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :268 after 512
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :512 after 1920
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1920 after 3311
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,25539,0.172977,10572,2,2503,14,23230,6,0,408,16026,0
Total reachable state count : 25539

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,24,0.174763,10572,2,160,14,23230,7,0,414,16026,0
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22477 reset in 150 ms.
Product exploration explored 100000 steps with 22385 reset in 115 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 123/123 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2022-06-11 15:19:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 123 rows 108 cols
[2022-06-11 15:19:33] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 15:19:34] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 123/123 transitions.
Product exploration explored 100000 steps with 22529 reset in 227 ms.
Product exploration explored 100000 steps with 22602 reset in 246 ms.
Built C files in :
/tmp/ltsmin6803371454458149964
[2022-06-11 15:19:34] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6803371454458149964
Running compilation step : cd /tmp/ltsmin6803371454458149964;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 584 ms.
Running link step : cd /tmp/ltsmin6803371454458149964;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin6803371454458149964;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17921961627237814265.hoa' '--buchi-type=spotba'
LTSmin run took 4335 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-02 finished in 28981 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(X(p0))))||G((G(p2)&&p1)))))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 475/475 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 167 transition count 241
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 167 transition count 241
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 167 transition count 240
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 75 place count 143 transition count 214
Iterating global reduction 1 with 24 rules applied. Total rules applied 99 place count 143 transition count 214
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 109 place count 143 transition count 204
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 122 place count 130 transition count 182
Iterating global reduction 2 with 13 rules applied. Total rules applied 135 place count 130 transition count 182
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 143 place count 130 transition count 174
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 147 place count 126 transition count 170
Iterating global reduction 3 with 4 rules applied. Total rules applied 151 place count 126 transition count 170
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 155 place count 122 transition count 166
Iterating global reduction 3 with 4 rules applied. Total rules applied 159 place count 122 transition count 166
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 162 place count 119 transition count 162
Iterating global reduction 3 with 3 rules applied. Total rules applied 165 place count 119 transition count 162
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 167 place count 117 transition count 160
Iterating global reduction 3 with 2 rules applied. Total rules applied 169 place count 117 transition count 160
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 171 place count 115 transition count 156
Iterating global reduction 3 with 2 rules applied. Total rules applied 173 place count 115 transition count 156
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 175 place count 113 transition count 154
Iterating global reduction 3 with 2 rules applied. Total rules applied 177 place count 113 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 178 place count 112 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 179 place count 112 transition count 153
Applied a total of 179 rules in 18 ms. Remains 112 /192 variables (removed 80) and now considering 153/475 (removed 322) transitions.
// Phase 1: matrix 153 rows 112 cols
[2022-06-11 15:19:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:19:39] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 153 rows 112 cols
[2022-06-11 15:19:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:19:39] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-11 15:19:39] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
// Phase 1: matrix 153 rows 112 cols
[2022-06-11 15:19:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:19:39] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/192 places, 153/475 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/192 places, 153/475 transitions.
Stuttering acceptance computed with spot in 775 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), (NOT p0), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p2 p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 p1), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND p2 p1), acceptance={} source=7 dest: 8}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND p2 p1), acceptance={} source=8 dest: 9}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={} source=9 dest: 6}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=9 dest: 10}], [{ cond=(OR (AND (NOT p2) p0) (AND p0 (NOT p1))), acceptance={} source=10 dest: 6}, { cond=(AND p2 p0 p1), acceptance={} source=10 dest: 10}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s106 1)), p1:(AND (GEQ s1 1) (GEQ s107 1)), p0:(AND (GEQ s1 1) (GEQ s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-04 finished in 1154 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 475/475 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 166 transition count 216
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 166 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 166 transition count 215
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 79 place count 140 transition count 187
Iterating global reduction 1 with 26 rules applied. Total rules applied 105 place count 140 transition count 187
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 117 place count 140 transition count 175
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 131 place count 126 transition count 151
Iterating global reduction 2 with 14 rules applied. Total rules applied 145 place count 126 transition count 151
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 154 place count 126 transition count 142
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 159 place count 121 transition count 137
Iterating global reduction 3 with 5 rules applied. Total rules applied 164 place count 121 transition count 137
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 169 place count 116 transition count 132
Iterating global reduction 3 with 5 rules applied. Total rules applied 174 place count 116 transition count 132
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 178 place count 112 transition count 127
Iterating global reduction 3 with 4 rules applied. Total rules applied 182 place count 112 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 183 place count 112 transition count 126
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 186 place count 109 transition count 123
Iterating global reduction 4 with 3 rules applied. Total rules applied 189 place count 109 transition count 123
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 191 place count 107 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 193 place count 107 transition count 119
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 195 place count 105 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 197 place count 105 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 198 place count 104 transition count 116
Iterating global reduction 4 with 1 rules applied. Total rules applied 199 place count 104 transition count 116
Applied a total of 199 rules in 11 ms. Remains 104 /192 variables (removed 88) and now considering 116/475 (removed 359) transitions.
// Phase 1: matrix 116 rows 104 cols
[2022-06-11 15:19:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:19:40] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 116 rows 104 cols
[2022-06-11 15:19:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:19:40] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-11 15:19:41] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 104 cols
[2022-06-11 15:19:41] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:19:41] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 104/192 places, 116/475 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/192 places, 116/475 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s24 1) (LT s70 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 243 ms.
Product exploration explored 100000 steps with 33333 reset in 184 ms.
Computed a total of 22 stabilizing places and 24 stable transitions
Computed a total of 22 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 52 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-06 finished in 927 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(X(p0)))||G(p1)))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 475/475 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 167 transition count 241
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 167 transition count 241
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 167 transition count 240
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 75 place count 143 transition count 214
Iterating global reduction 1 with 24 rules applied. Total rules applied 99 place count 143 transition count 214
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 110 place count 143 transition count 203
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 123 place count 130 transition count 181
Iterating global reduction 2 with 13 rules applied. Total rules applied 136 place count 130 transition count 181
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 144 place count 130 transition count 173
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 148 place count 126 transition count 169
Iterating global reduction 3 with 4 rules applied. Total rules applied 152 place count 126 transition count 169
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 156 place count 122 transition count 165
Iterating global reduction 3 with 4 rules applied. Total rules applied 160 place count 122 transition count 165
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 163 place count 119 transition count 161
Iterating global reduction 3 with 3 rules applied. Total rules applied 166 place count 119 transition count 161
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 168 place count 117 transition count 159
Iterating global reduction 3 with 2 rules applied. Total rules applied 170 place count 117 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 172 place count 115 transition count 155
Iterating global reduction 3 with 2 rules applied. Total rules applied 174 place count 115 transition count 155
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 176 place count 113 transition count 153
Iterating global reduction 3 with 2 rules applied. Total rules applied 178 place count 113 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 179 place count 112 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 180 place count 112 transition count 152
Applied a total of 180 rules in 21 ms. Remains 112 /192 variables (removed 80) and now considering 152/475 (removed 323) transitions.
// Phase 1: matrix 152 rows 112 cols
[2022-06-11 15:19:41] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 15:19:41] [INFO ] Implicit Places using invariants in 208 ms returned []
// Phase 1: matrix 152 rows 112 cols
[2022-06-11 15:19:41] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 15:19:42] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-11 15:19:42] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2022-06-11 15:19:42] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 152 rows 112 cols
[2022-06-11 15:19:42] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 15:19:42] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/192 places, 152/475 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/192 places, 152/475 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s107 1)), p0:(AND (GEQ s1 1) (GEQ s106 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 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-07 finished in 730 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U F((X(p1) U p2)))||(G(p3)&&X(p0))))'
Support contains 4 out of 192 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 475/475 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 169 transition count 267
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 169 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 169 transition count 266
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 69 place count 147 transition count 242
Iterating global reduction 1 with 22 rules applied. Total rules applied 91 place count 147 transition count 242
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 101 place count 147 transition count 232
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 112 place count 136 transition count 214
Iterating global reduction 2 with 11 rules applied. Total rules applied 123 place count 136 transition count 214
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 130 place count 136 transition count 207
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 134 place count 132 transition count 203
Iterating global reduction 3 with 4 rules applied. Total rules applied 138 place count 132 transition count 203
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 142 place count 128 transition count 199
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 128 transition count 199
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 150 place count 124 transition count 194
Iterating global reduction 3 with 4 rules applied. Total rules applied 154 place count 124 transition count 194
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 159 place count 124 transition count 189
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 162 place count 121 transition count 186
Iterating global reduction 4 with 3 rules applied. Total rules applied 165 place count 121 transition count 186
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 167 place count 119 transition count 182
Iterating global reduction 4 with 2 rules applied. Total rules applied 169 place count 119 transition count 182
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 171 place count 117 transition count 180
Iterating global reduction 4 with 2 rules applied. Total rules applied 173 place count 117 transition count 180
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 174 place count 116 transition count 179
Iterating global reduction 4 with 1 rules applied. Total rules applied 175 place count 116 transition count 179
Applied a total of 175 rules in 17 ms. Remains 116 /192 variables (removed 76) and now considering 179/475 (removed 296) transitions.
// Phase 1: matrix 179 rows 116 cols
[2022-06-11 15:19:42] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:19:42] [INFO ] Implicit Places using invariants in 276 ms returned []
// Phase 1: matrix 179 rows 116 cols
[2022-06-11 15:19:42] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 15:19:42] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-06-11 15:19:43] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
// Phase 1: matrix 179 rows 116 cols
[2022-06-11 15:19:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:19:43] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116/192 places, 179/475 transitions.
Finished structural reductions, in 1 iterations. Remains : 116/192 places, 179/475 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p3 (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p3) (NOT p2)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 3}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p3:(AND (GEQ s1 1) (GEQ s110 1)), p2:(AND (GEQ s1 1) (GEQ s109 1)), p0:(AND (GEQ s1 1) (GEQ s111 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-08 finished in 839 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(F(G((X(p0)||p0))))))'
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 475/475 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 166 transition count 228
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 166 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 166 transition count 227
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 78 place count 141 transition count 200
Iterating global reduction 1 with 25 rules applied. Total rules applied 103 place count 141 transition count 200
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 114 place count 141 transition count 189
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 128 place count 127 transition count 165
Iterating global reduction 2 with 14 rules applied. Total rules applied 142 place count 127 transition count 165
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 151 place count 127 transition count 156
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 156 place count 122 transition count 151
Iterating global reduction 3 with 5 rules applied. Total rules applied 161 place count 122 transition count 151
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 166 place count 117 transition count 146
Iterating global reduction 3 with 5 rules applied. Total rules applied 171 place count 117 transition count 146
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 175 place count 113 transition count 141
Iterating global reduction 3 with 4 rules applied. Total rules applied 179 place count 113 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 181 place count 113 transition count 139
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 184 place count 110 transition count 136
Iterating global reduction 4 with 3 rules applied. Total rules applied 187 place count 110 transition count 136
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 189 place count 108 transition count 132
Iterating global reduction 4 with 2 rules applied. Total rules applied 191 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 193 place count 106 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 195 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 196 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 197 place count 105 transition count 129
Applied a total of 197 rules in 17 ms. Remains 105 /192 variables (removed 87) and now considering 129/475 (removed 346) transitions.
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 15:19:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:19:43] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 15:19:43] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 15:19:43] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-11 15:19:43] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 15:19:43] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 15:19:43] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/192 places, 129/475 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/192 places, 129/475 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-10 finished in 488 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 475/475 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 166 transition count 228
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 166 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 166 transition count 227
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 78 place count 141 transition count 200
Iterating global reduction 1 with 25 rules applied. Total rules applied 103 place count 141 transition count 200
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 114 place count 141 transition count 189
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 128 place count 127 transition count 165
Iterating global reduction 2 with 14 rules applied. Total rules applied 142 place count 127 transition count 165
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 151 place count 127 transition count 156
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 156 place count 122 transition count 151
Iterating global reduction 3 with 5 rules applied. Total rules applied 161 place count 122 transition count 151
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 166 place count 117 transition count 146
Iterating global reduction 3 with 5 rules applied. Total rules applied 171 place count 117 transition count 146
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 175 place count 113 transition count 141
Iterating global reduction 3 with 4 rules applied. Total rules applied 179 place count 113 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 181 place count 113 transition count 139
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 184 place count 110 transition count 136
Iterating global reduction 4 with 3 rules applied. Total rules applied 187 place count 110 transition count 136
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 189 place count 108 transition count 132
Iterating global reduction 4 with 2 rules applied. Total rules applied 191 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 193 place count 106 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 195 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 196 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 197 place count 105 transition count 129
Applied a total of 197 rules in 23 ms. Remains 105 /192 variables (removed 87) and now considering 129/475 (removed 346) transitions.
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 15:19:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:19:43] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 15:19:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:19:43] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-11 15:19:44] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2022-06-11 15:19:44] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 15:19:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:19:44] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/192 places, 129/475 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/192 places, 129/475 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s100 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-d2m18-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-14 finished in 426 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(((X(X(!p0))&&!p1) U G(p2)))&&X(p3)))'
Support contains 5 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 475/475 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 169 transition count 267
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 169 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 169 transition count 266
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 69 place count 147 transition count 242
Iterating global reduction 1 with 22 rules applied. Total rules applied 91 place count 147 transition count 242
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 101 place count 147 transition count 232
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 112 place count 136 transition count 214
Iterating global reduction 2 with 11 rules applied. Total rules applied 123 place count 136 transition count 214
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 129 place count 136 transition count 208
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 132 place count 133 transition count 205
Iterating global reduction 3 with 3 rules applied. Total rules applied 135 place count 133 transition count 205
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 138 place count 130 transition count 202
Iterating global reduction 3 with 3 rules applied. Total rules applied 141 place count 130 transition count 202
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 144 place count 127 transition count 198
Iterating global reduction 3 with 3 rules applied. Total rules applied 147 place count 127 transition count 198
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 149 place count 125 transition count 196
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 125 transition count 196
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 153 place count 123 transition count 192
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 123 transition count 192
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 157 place count 121 transition count 190
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 121 transition count 190
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 160 place count 120 transition count 189
Iterating global reduction 3 with 1 rules applied. Total rules applied 161 place count 120 transition count 189
Applied a total of 161 rules in 20 ms. Remains 120 /192 variables (removed 72) and now considering 189/475 (removed 286) transitions.
// Phase 1: matrix 189 rows 120 cols
[2022-06-11 15:19:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:19:44] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 189 rows 120 cols
[2022-06-11 15:19:44] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 15:19:44] [INFO ] State equation strengthened by 104 read => feed constraints.
[2022-06-11 15:19:44] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
// Phase 1: matrix 189 rows 120 cols
[2022-06-11 15:19:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 15:19:44] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/192 places, 189/475 transitions.
Finished structural reductions, in 1 iterations. Remains : 120/192 places, 189/475 transitions.
Stuttering acceptance computed with spot in 322 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), true, p0, (NOT p2), (NOT p2), (AND p0 (NOT p2)), p0, (AND (NOT p2) p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p3) (AND (NOT p2) p1)), acceptance={} source=1 dest: 2}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p3 p2 p1), acceptance={} source=1 dest: 4}, { cond=(AND p3 (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND p3 p2 (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 7}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p2 p1), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 7}, { cond=p2, acceptance={} source=6 dest: 8}], [{ cond=p0, acceptance={} source=7 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=8 dest: 2}, { cond=(AND p2 p0), acceptance={} source=8 dest: 4}]], initial=0, aps=[p3:(OR (LT s1 1) (LT s115 1)), p2:(AND (GEQ s1 1) (GEQ s111 1)), p1:(AND (GEQ s1 1) (GEQ s113 1)), p0:(AND (GEQ s1 1) (GEQ s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 2 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLFireability-15 finished in 804 ms.
All properties solved by simple procedures.
Total runtime 107972 ms.

BK_STOP 1654960785458

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d2m18"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d2m18, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-165472283000956"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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