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.r222-tall-165286026101004.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 ShieldRVt-PT-030B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286026101004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 8.1K Apr 30 01:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 30 01:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 30 01:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 30 01:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 09:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 09:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 364K May 10 09:34 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 ShieldRVt-PT-030B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-030B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653079193533

Running Version 202205111006
[2022-05-20 20:39:54] [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-05-20 20:39:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 20:39:54] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2022-05-20 20:39:54] [INFO ] Transformed 1503 places.
[2022-05-20 20:39:54] [INFO ] Transformed 1503 transitions.
[2022-05-20 20:39:54] [INFO ] Found NUPN structural information;
[2022-05-20 20:39:54] [INFO ] Parsed PT model containing 1503 places and 1503 transitions in 244 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-030B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 1503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Discarding 318 places :
Symmetric choice reduction at 0 with 318 rule applications. Total rules 318 place count 1185 transition count 1185
Iterating global reduction 0 with 318 rules applied. Total rules applied 636 place count 1185 transition count 1185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 637 place count 1184 transition count 1184
Iterating global reduction 0 with 1 rules applied. Total rules applied 638 place count 1184 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 639 place count 1183 transition count 1183
Iterating global reduction 0 with 1 rules applied. Total rules applied 640 place count 1183 transition count 1183
Applied a total of 640 rules in 392 ms. Remains 1183 /1503 variables (removed 320) and now considering 1183/1503 (removed 320) transitions.
// Phase 1: matrix 1183 rows 1183 cols
[2022-05-20 20:39:55] [INFO ] Computed 121 place invariants in 26 ms
[2022-05-20 20:39:55] [INFO ] Implicit Places using invariants in 410 ms returned []
// Phase 1: matrix 1183 rows 1183 cols
[2022-05-20 20:39:55] [INFO ] Computed 121 place invariants in 6 ms
[2022-05-20 20:39:56] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1313 ms to find 0 implicit places.
// Phase 1: matrix 1183 rows 1183 cols
[2022-05-20 20:39:56] [INFO ] Computed 121 place invariants in 11 ms
[2022-05-20 20:39:57] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1183/1503 places, 1183/1503 transitions.
Finished structural reductions, in 1 iterations. Remains : 1183/1503 places, 1183/1503 transitions.
Support contains 34 out of 1183 places after structural reductions.
[2022-05-20 20:39:57] [INFO ] Flatten gal took : 108 ms
[2022-05-20 20:39:57] [INFO ] Flatten gal took : 59 ms
[2022-05-20 20:39:57] [INFO ] Input system was already deterministic with 1183 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 598 ms. (steps per millisecond=16 ) properties (out of 33) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 1183 rows 1183 cols
[2022-05-20 20:39:58] [INFO ] Computed 121 place invariants in 28 ms
[2022-05-20 20:39:59] [INFO ] [Real]Absence check using 121 positive place invariants in 38 ms returned sat
[2022-05-20 20:39:59] [INFO ] After 551ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-05-20 20:39:59] [INFO ] [Nat]Absence check using 121 positive place invariants in 45 ms returned sat
[2022-05-20 20:40:01] [INFO ] After 1011ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2022-05-20 20:40:01] [INFO ] Deduced a trap composed of 29 places in 211 ms of which 6 ms to minimize.
[2022-05-20 20:40:01] [INFO ] Deduced a trap composed of 37 places in 220 ms of which 2 ms to minimize.
[2022-05-20 20:40:01] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 2 ms to minimize.
[2022-05-20 20:40:02] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 1 ms to minimize.
[2022-05-20 20:40:02] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 2 ms to minimize.
[2022-05-20 20:40:02] [INFO ] Deduced a trap composed of 36 places in 186 ms of which 0 ms to minimize.
[2022-05-20 20:40:02] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 1 ms to minimize.
[2022-05-20 20:40:03] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 1 ms to minimize.
[2022-05-20 20:40:03] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 1 ms to minimize.
[2022-05-20 20:40:03] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 1 ms to minimize.
[2022-05-20 20:40:03] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 0 ms to minimize.
[2022-05-20 20:40:03] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 1 ms to minimize.
[2022-05-20 20:40:04] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 1 ms to minimize.
[2022-05-20 20:40:04] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 1 ms to minimize.
[2022-05-20 20:40:04] [INFO ] Deduced a trap composed of 46 places in 164 ms of which 1 ms to minimize.
[2022-05-20 20:40:04] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 1 ms to minimize.
[2022-05-20 20:40:05] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 1 ms to minimize.
[2022-05-20 20:40:05] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 1 ms to minimize.
[2022-05-20 20:40:05] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 0 ms to minimize.
[2022-05-20 20:40:05] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 0 ms to minimize.
[2022-05-20 20:40:05] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 1 ms to minimize.
[2022-05-20 20:40:05] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 1 ms to minimize.
[2022-05-20 20:40:05] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4860 ms
[2022-05-20 20:40:06] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 0 ms to minimize.
[2022-05-20 20:40:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2022-05-20 20:40:06] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 0 ms to minimize.
[2022-05-20 20:40:06] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 0 ms to minimize.
[2022-05-20 20:40:06] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 1 ms to minimize.
[2022-05-20 20:40:07] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 0 ms to minimize.
[2022-05-20 20:40:07] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 1 ms to minimize.
[2022-05-20 20:40:07] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 0 ms to minimize.
[2022-05-20 20:40:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1153 ms
[2022-05-20 20:40:07] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 1 ms to minimize.
[2022-05-20 20:40:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2022-05-20 20:40:07] [INFO ] Deduced a trap composed of 56 places in 151 ms of which 1 ms to minimize.
[2022-05-20 20:40:08] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 0 ms to minimize.
[2022-05-20 20:40:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 407 ms
[2022-05-20 20:40:08] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 1 ms to minimize.
[2022-05-20 20:40:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2022-05-20 20:40:08] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 1 ms to minimize.
[2022-05-20 20:40:08] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 2 ms to minimize.
[2022-05-20 20:40:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 402 ms
[2022-05-20 20:40:09] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 1 ms to minimize.
[2022-05-20 20:40:09] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 1 ms to minimize.
[2022-05-20 20:40:09] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 0 ms to minimize.
[2022-05-20 20:40:09] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 0 ms to minimize.
[2022-05-20 20:40:09] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 1 ms to minimize.
[2022-05-20 20:40:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 931 ms
[2022-05-20 20:40:10] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 0 ms to minimize.
[2022-05-20 20:40:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2022-05-20 20:40:10] [INFO ] After 10488ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 822 ms.
[2022-05-20 20:40:11] [INFO ] After 12025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 540 ms.
Support contains 17 out of 1183 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Drop transitions removed 321 transitions
Trivial Post-agglo rules discarded 321 transitions
Performed 321 trivial Post agglomeration. Transition count delta: 321
Iterating post reduction 0 with 321 rules applied. Total rules applied 321 place count 1183 transition count 862
Reduce places removed 321 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 323 rules applied. Total rules applied 644 place count 862 transition count 860
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 646 place count 860 transition count 860
Performed 226 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 226 Pre rules applied. Total rules applied 646 place count 860 transition count 634
Deduced a syphon composed of 226 places in 1 ms
Reduce places removed 226 places and 0 transitions.
Iterating global reduction 3 with 452 rules applied. Total rules applied 1098 place count 634 transition count 634
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1104 place count 628 transition count 628
Iterating global reduction 3 with 6 rules applied. Total rules applied 1110 place count 628 transition count 628
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1110 place count 628 transition count 623
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1120 place count 623 transition count 623
Performed 273 Post agglomeration using F-continuation condition.Transition count delta: 273
Deduced a syphon composed of 273 places in 1 ms
Reduce places removed 273 places and 0 transitions.
Iterating global reduction 3 with 546 rules applied. Total rules applied 1666 place count 350 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1667 place count 350 transition count 349
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1669 place count 349 transition count 348
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 4 with 160 rules applied. Total rules applied 1829 place count 269 transition count 418
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1830 place count 269 transition count 417
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 1833 place count 269 transition count 414
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1836 place count 266 transition count 414
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1838 place count 266 transition count 412
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1839 place count 265 transition count 411
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1840 place count 264 transition count 411
Applied a total of 1840 rules in 180 ms. Remains 264 /1183 variables (removed 919) and now considering 411/1183 (removed 772) transitions.
Finished structural reductions, in 1 iterations. Remains : 264/1183 places, 411/1183 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 411 rows 264 cols
[2022-05-20 20:40:12] [INFO ] Computed 120 place invariants in 2 ms
[2022-05-20 20:40:12] [INFO ] [Real]Absence check using 120 positive place invariants in 15 ms returned sat
[2022-05-20 20:40:12] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 20:40:12] [INFO ] [Nat]Absence check using 120 positive place invariants in 15 ms returned sat
[2022-05-20 20:40:13] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 20:40:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 20:40:13] [INFO ] After 102ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-20 20:40:13] [INFO ] After 287ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 107 ms.
[2022-05-20 20:40:13] [INFO ] After 710ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 88 ms.
Support contains 11 out of 264 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 264/264 places, 411/411 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 264 transition count 409
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 262 transition count 409
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 262 transition count 407
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 260 transition count 407
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 10 place count 259 transition count 406
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 255 transition count 412
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 255 transition count 411
Applied a total of 19 rules in 37 ms. Remains 255 /264 variables (removed 9) and now considering 411/411 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 255/264 places, 411/411 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 177454 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 177454 steps, saw 115186 distinct states, run finished after 3002 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 411 rows 255 cols
[2022-05-20 20:40:17] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:40:17] [INFO ] [Real]Absence check using 120 positive place invariants in 15 ms returned sat
[2022-05-20 20:40:17] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 20:40:17] [INFO ] [Nat]Absence check using 120 positive place invariants in 15 ms returned sat
[2022-05-20 20:40:17] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 20:40:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 20:40:17] [INFO ] After 106ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-20 20:40:17] [INFO ] After 284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 104 ms.
[2022-05-20 20:40:18] [INFO ] After 695ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 81 ms.
Support contains 11 out of 255 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 255/255 places, 411/411 transitions.
Applied a total of 0 rules in 7 ms. Remains 255 /255 variables (removed 0) and now considering 411/411 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 255/255 places, 411/411 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 255/255 places, 411/411 transitions.
Applied a total of 0 rules in 6 ms. Remains 255 /255 variables (removed 0) and now considering 411/411 (removed 0) transitions.
// Phase 1: matrix 411 rows 255 cols
[2022-05-20 20:40:18] [INFO ] Computed 120 place invariants in 2 ms
[2022-05-20 20:40:18] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 411 rows 255 cols
[2022-05-20 20:40:18] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:40:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 20:40:18] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2022-05-20 20:40:18] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 411 rows 255 cols
[2022-05-20 20:40:18] [INFO ] Computed 120 place invariants in 3 ms
[2022-05-20 20:40:18] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 255/255 places, 411/411 transitions.
Graph (trivial) has 108 edges and 255 vertex of which 4 / 255 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 845 edges and 253 vertex of which 251 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 105 edges and 249 vertex of which 4 / 249 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 247 transition count 402
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 104 edges and 245 vertex of which 6 / 245 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 242 transition count 393
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 102 edges and 239 vertex of which 8 / 239 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 235 transition count 382
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 98 edges and 231 vertex of which 8 / 231 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 227 transition count 368
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 94 edges and 223 vertex of which 8 / 223 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 219 transition count 354
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 90 edges and 215 vertex of which 8 / 215 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 211 transition count 340
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 86 edges and 207 vertex of which 8 / 207 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 203 transition count 326
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 82 edges and 199 vertex of which 8 / 199 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 195 transition count 312
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 78 edges and 191 vertex of which 8 / 191 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 187 transition count 298
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 72 edges and 184 vertex of which 4 / 184 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 165 place count 182 transition count 286
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 69 edges and 180 vertex of which 2 / 180 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 9 rules applied. Total rules applied 174 place count 179 transition count 280
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 179 place count 178 transition count 276
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 182 place count 176 transition count 275
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 186 place count 176 transition count 271
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 189 place count 176 transition count 268
Applied a total of 189 rules in 40 ms. Remains 176 /255 variables (removed 79) and now considering 268/411 (removed 143) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 268 rows 176 cols
[2022-05-20 20:40:18] [INFO ] Computed 81 place invariants in 2 ms
[2022-05-20 20:40:18] [INFO ] [Real]Absence check using 81 positive place invariants in 10 ms returned sat
[2022-05-20 20:40:18] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 20:40:18] [INFO ] [Nat]Absence check using 81 positive place invariants in 10 ms returned sat
[2022-05-20 20:40:19] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-20 20:40:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 20:40:19] [INFO ] After 69ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-20 20:40:19] [INFO ] After 184ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 73 ms.
[2022-05-20 20:40:19] [INFO ] After 471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2022-05-20 20:40:19] [INFO ] Flatten gal took : 15 ms
[2022-05-20 20:40:19] [INFO ] Flatten gal took : 13 ms
[2022-05-20 20:40:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality815787961396847184.gal : 9 ms
[2022-05-20 20:40:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10687519647273442732.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms13309790734513876515;'/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/ReachabilityCardinality815787961396847184.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10687519647273442732.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/ReachabilityCardinality10687519647273442732.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :8 after 96
Reachability property AtomicPropp24 is true.
Reachability property AtomicPropp18 is true.
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :96 after 172
Reachability property AtomicPropp29 is true.
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :172 after 216
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :216 after 258
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :258 after 981
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :981 after 16574
Reachability property AtomicPropp19 is true.
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :16574 after 2.5166e+07
Reachability property AtomicPropp14 is true.
Reachability property AtomicPropp7 is true.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2.5166e+07 after 7.24776e+09
Reachability property AtomicPropp0 is true.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7.24776e+09 after 1.04187e+11
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.04187e+11 after 2.08735e+12
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.08735e+12 after 1.0506e+20
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,1.10163e+26,0.104583,6600,2,585,26,12822,7,0,975,12298,0
Total reachable state count : 110163365069188703667093504

Verifying 8 reachability properties.
Reachability property AtomicPropp0 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
AtomicPropp0,6.52298e+10,0.105521,6864,2,345,26,12822,8,0,978,12298,0
Reachability property AtomicPropp7 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
AtomicPropp7,6.71089e+07,0.105901,6864,2,213,26,12822,9,0,980,12298,0
Reachability property AtomicPropp14 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
AtomicPropp14,1.00663e+08,0.106243,6864,2,219,26,12822,10,0,987,12298,0
Reachability property AtomicPropp18 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
AtomicPropp18,2.71791e+09,0.106466,6864,2,235,26,12822,11,0,989,12298,0
Reachability property AtomicPropp19 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
AtomicPropp19,16384,0.106697,6864,2,191,26,12822,12,0,991,12298,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,1.50995e+09,0.106956,6864,2,305,26,12822,13,0,993,12298,0
Reachability property AtomicPropp29 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
AtomicPropp29,6.0398e+08,0.107203,6864,2,222,26,12822,14,0,995,12298,0
Reachability property AtomicPropp32 does not hold.
No reachable states exhibit your property : AtomicPropp32

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,0,0.107433,6864,1,0,26,12822,14,0,997,12298,0
FORMULA ShieldRVt-PT-030B-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 362 stabilizing places and 362 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)||F(X(X(F(p1))))))&&X(p0)))'
Support contains 2 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1171 transition count 1171
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1171 transition count 1171
Applied a total of 24 rules in 54 ms. Remains 1171 /1183 variables (removed 12) and now considering 1171/1183 (removed 12) transitions.
// Phase 1: matrix 1171 rows 1171 cols
[2022-05-20 20:40:19] [INFO ] Computed 121 place invariants in 10 ms
[2022-05-20 20:40:20] [INFO ] Implicit Places using invariants in 258 ms returned []
// Phase 1: matrix 1171 rows 1171 cols
[2022-05-20 20:40:20] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 20:40:20] [INFO ] Implicit Places using invariants and state equation in 785 ms returned []
Implicit Place search using SMT with State Equation took 1053 ms to find 0 implicit places.
// Phase 1: matrix 1171 rows 1171 cols
[2022-05-20 20:40:20] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 20:40:21] [INFO ] Dead Transitions using invariants and state equation in 510 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1171/1183 places, 1171/1183 transitions.
Finished structural reductions, in 1 iterations. Remains : 1171/1183 places, 1171/1183 transitions.
Stuttering acceptance computed with spot in 358 ms :[true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(EQ s197 0), p0:(EQ s334 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-00 finished in 2044 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1172 transition count 1172
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1172 transition count 1172
Applied a total of 22 rules in 65 ms. Remains 1172 /1183 variables (removed 11) and now considering 1172/1183 (removed 11) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2022-05-20 20:40:21] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 20:40:22] [INFO ] Implicit Places using invariants in 258 ms returned []
// Phase 1: matrix 1172 rows 1172 cols
[2022-05-20 20:40:22] [INFO ] Computed 121 place invariants in 4 ms
[2022-05-20 20:40:23] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
// Phase 1: matrix 1172 rows 1172 cols
[2022-05-20 20:40:23] [INFO ] Computed 121 place invariants in 4 ms
[2022-05-20 20:40:23] [INFO ] Dead Transitions using invariants and state equation in 507 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1172/1183 places, 1172/1183 transitions.
Finished structural reductions, in 1 iterations. Remains : 1172/1183 places, 1172/1183 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-01 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s716 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]]
Product exploration explored 100000 steps with 8 reset in 407 ms.
Stack based approach found an accepted trace after 753 steps with 0 reset with depth 754 and stack size 754 in 4 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-01 finished in 2282 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||!(X(p1) U p1)))'
Support contains 2 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1172 transition count 1172
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1172 transition count 1172
Applied a total of 22 rules in 59 ms. Remains 1172 /1183 variables (removed 11) and now considering 1172/1183 (removed 11) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2022-05-20 20:40:24] [INFO ] Computed 121 place invariants in 8 ms
[2022-05-20 20:40:24] [INFO ] Implicit Places using invariants in 234 ms returned []
// Phase 1: matrix 1172 rows 1172 cols
[2022-05-20 20:40:24] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 20:40:25] [INFO ] Implicit Places using invariants and state equation in 973 ms returned []
Implicit Place search using SMT with State Equation took 1210 ms to find 0 implicit places.
// Phase 1: matrix 1172 rows 1172 cols
[2022-05-20 20:40:25] [INFO ] Computed 121 place invariants in 5 ms
[2022-05-20 20:40:25] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1172/1183 places, 1172/1183 transitions.
Finished structural reductions, in 1 iterations. Remains : 1172/1183 places, 1172/1183 transitions.
Stuttering acceptance computed with spot in 318 ms :[true, (AND p1 (NOT p0)), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s1169 1), p0:(EQ s615 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 630 ms.
Product exploration explored 100000 steps with 50000 reset in 618 ms.
Computed a total of 359 stabilizing places and 359 stable transitions
Computed a total of 359 stabilizing places and 359 stable transitions
Detected a total of 359/1172 stabilizing places and 359/1172 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p0))))
Knowledge based reduction with 7 factoid took 115 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-030B-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-030B-LTLFireability-02 finished in 3482 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p0))))'
Support contains 1 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1172 transition count 1172
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1172 transition count 1172
Applied a total of 22 rules in 59 ms. Remains 1172 /1183 variables (removed 11) and now considering 1172/1183 (removed 11) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2022-05-20 20:40:27] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 20:40:27] [INFO ] Implicit Places using invariants in 246 ms returned []
// Phase 1: matrix 1172 rows 1172 cols
[2022-05-20 20:40:27] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 20:40:28] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1082 ms to find 0 implicit places.
// Phase 1: matrix 1172 rows 1172 cols
[2022-05-20 20:40:28] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 20:40:29] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1172/1183 places, 1172/1183 transitions.
Finished structural reductions, in 1 iterations. Remains : 1172/1183 places, 1172/1183 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}]], initial=0, aps=[p0:(EQ s995 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 75796 steps with 8 reset in 276 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-03 finished in 2024 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1172 transition count 1172
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1172 transition count 1172
Applied a total of 22 rules in 54 ms. Remains 1172 /1183 variables (removed 11) and now considering 1172/1183 (removed 11) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2022-05-20 20:40:29] [INFO ] Computed 121 place invariants in 8 ms
[2022-05-20 20:40:29] [INFO ] Implicit Places using invariants in 252 ms returned []
// Phase 1: matrix 1172 rows 1172 cols
[2022-05-20 20:40:29] [INFO ] Computed 121 place invariants in 4 ms
[2022-05-20 20:40:30] [INFO ] Implicit Places using invariants and state equation in 875 ms returned []
Implicit Place search using SMT with State Equation took 1129 ms to find 0 implicit places.
// Phase 1: matrix 1172 rows 1172 cols
[2022-05-20 20:40:30] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 20:40:31] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1172/1183 places, 1172/1183 transitions.
Finished structural reductions, in 1 iterations. Remains : 1172/1183 places, 1172/1183 transitions.
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s489 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-05 finished in 1933 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(F(G((G(X(F(p0)))&&p1)))))))'
Support contains 2 out of 1183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 0 with 331 rules applied. Total rules applied 331 place count 1182 transition count 851
Reduce places removed 331 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 332 rules applied. Total rules applied 663 place count 851 transition count 850
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 664 place count 850 transition count 850
Performed 232 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 232 Pre rules applied. Total rules applied 664 place count 850 transition count 618
Deduced a syphon composed of 232 places in 0 ms
Reduce places removed 232 places and 0 transitions.
Iterating global reduction 3 with 464 rules applied. Total rules applied 1128 place count 618 transition count 618
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1136 place count 610 transition count 610
Iterating global reduction 3 with 8 rules applied. Total rules applied 1144 place count 610 transition count 610
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1144 place count 610 transition count 603
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1158 place count 603 transition count 603
Performed 268 Post agglomeration using F-continuation condition.Transition count delta: 268
Deduced a syphon composed of 268 places in 0 ms
Reduce places removed 268 places and 0 transitions.
Iterating global reduction 3 with 536 rules applied. Total rules applied 1694 place count 335 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1695 place count 335 transition count 334
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1697 place count 334 transition count 333
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 1873 place count 246 transition count 419
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1875 place count 244 transition count 417
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1876 place count 243 transition count 417
Applied a total of 1876 rules in 108 ms. Remains 243 /1183 variables (removed 940) and now considering 417/1183 (removed 766) transitions.
// Phase 1: matrix 417 rows 243 cols
[2022-05-20 20:40:31] [INFO ] Computed 120 place invariants in 2 ms
[2022-05-20 20:40:31] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 417 rows 243 cols
[2022-05-20 20:40:31] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:40:32] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2022-05-20 20:40:32] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 417 rows 243 cols
[2022-05-20 20:40:32] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:40:32] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 243/1183 places, 417/1183 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/1183 places, 417/1183 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s188 0), p0:(EQ s42 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 237 steps with 0 reset in 5 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-06 finished in 776 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(F(G(F(p0))))||p1))||X(p2)||p3)))'
Support contains 3 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1171 transition count 1171
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1171 transition count 1171
Applied a total of 24 rules in 56 ms. Remains 1171 /1183 variables (removed 12) and now considering 1171/1183 (removed 12) transitions.
// Phase 1: matrix 1171 rows 1171 cols
[2022-05-20 20:40:32] [INFO ] Computed 121 place invariants in 6 ms
[2022-05-20 20:40:32] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 1171 rows 1171 cols
[2022-05-20 20:40:32] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 20:40:33] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 1096 ms to find 0 implicit places.
// Phase 1: matrix 1171 rows 1171 cols
[2022-05-20 20:40:33] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 20:40:34] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1171/1183 places, 1171/1183 transitions.
Finished structural reductions, in 1 iterations. Remains : 1171/1183 places, 1171/1183 transitions.
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(EQ s487 1), p1:(EQ s834 0), p0:(EQ s150 0), p2:(EQ s834 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 53 reset in 375 ms.
Product exploration explored 100000 steps with 23 reset in 441 ms.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Detected a total of 358/1171 stabilizing places and 358/1171 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) p1 p0 (NOT p2)), (X (AND (NOT p3) p1)), (X (NOT (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 520 ms. Reduced automaton from 7 states, 14 edges and 4 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1171 rows 1171 cols
[2022-05-20 20:40:35] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 20:40:36] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 20:40:36] [INFO ] [Nat]Absence check using 121 positive place invariants in 33 ms returned sat
[2022-05-20 20:40:36] [INFO ] After 409ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 20:40:36] [INFO ] Deduced a trap composed of 34 places in 219 ms of which 0 ms to minimize.
[2022-05-20 20:40:37] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 1 ms to minimize.
[2022-05-20 20:40:37] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 0 ms to minimize.
[2022-05-20 20:40:37] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 1 ms to minimize.
[2022-05-20 20:40:37] [INFO ] Deduced a trap composed of 34 places in 196 ms of which 0 ms to minimize.
[2022-05-20 20:40:38] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 1 ms to minimize.
[2022-05-20 20:40:38] [INFO ] Deduced a trap composed of 25 places in 190 ms of which 1 ms to minimize.
[2022-05-20 20:40:38] [INFO ] Deduced a trap composed of 58 places in 179 ms of which 1 ms to minimize.
[2022-05-20 20:40:38] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 1 ms to minimize.
[2022-05-20 20:40:39] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 0 ms to minimize.
[2022-05-20 20:40:39] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 1 ms to minimize.
[2022-05-20 20:40:39] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 7 ms to minimize.
[2022-05-20 20:40:39] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 1 ms to minimize.
[2022-05-20 20:40:39] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 1 ms to minimize.
[2022-05-20 20:40:40] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 0 ms to minimize.
[2022-05-20 20:40:40] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 1 ms to minimize.
[2022-05-20 20:40:40] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 0 ms to minimize.
[2022-05-20 20:40:40] [INFO ] Deduced a trap composed of 53 places in 139 ms of which 0 ms to minimize.
[2022-05-20 20:40:40] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 2 ms to minimize.
[2022-05-20 20:40:40] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 0 ms to minimize.
[2022-05-20 20:40:41] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 2 ms to minimize.
[2022-05-20 20:40:41] [INFO ] Deduced a trap composed of 54 places in 124 ms of which 2 ms to minimize.
[2022-05-20 20:40:41] [INFO ] Deduced a trap composed of 55 places in 126 ms of which 1 ms to minimize.
[2022-05-20 20:40:41] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 0 ms to minimize.
[2022-05-20 20:40:41] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 0 ms to minimize.
[2022-05-20 20:40:41] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 1 ms to minimize.
[2022-05-20 20:40:42] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 1 ms to minimize.
[2022-05-20 20:40:42] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 5509 ms
[2022-05-20 20:40:42] [INFO ] After 5962ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2022-05-20 20:40:42] [INFO ] After 6178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 328 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=109 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p3) p1 p0 (NOT p2)), (X (AND (NOT p3) p1)), (X (NOT (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 11 factoid took 418 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1171 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1171/1171 places, 1171/1171 transitions.
Applied a total of 0 rules in 31 ms. Remains 1171 /1171 variables (removed 0) and now considering 1171/1171 (removed 0) transitions.
// Phase 1: matrix 1171 rows 1171 cols
[2022-05-20 20:40:42] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 20:40:43] [INFO ] Implicit Places using invariants in 248 ms returned []
// Phase 1: matrix 1171 rows 1171 cols
[2022-05-20 20:40:43] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 20:40:44] [INFO ] Implicit Places using invariants and state equation in 812 ms returned []
Implicit Place search using SMT with State Equation took 1065 ms to find 0 implicit places.
// Phase 1: matrix 1171 rows 1171 cols
[2022-05-20 20:40:44] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 20:40:44] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1171/1171 places, 1171/1171 transitions.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Detected a total of 358/1171 stabilizing places and 358/1171 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 455 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1171 rows 1171 cols
[2022-05-20 20:40:45] [INFO ] Computed 121 place invariants in 6 ms
[2022-05-20 20:40:45] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 20:40:45] [INFO ] [Nat]Absence check using 121 positive place invariants in 32 ms returned sat
[2022-05-20 20:40:46] [INFO ] After 433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 20:40:46] [INFO ] Deduced a trap composed of 34 places in 217 ms of which 0 ms to minimize.
[2022-05-20 20:40:46] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 1 ms to minimize.
[2022-05-20 20:40:46] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 1 ms to minimize.
[2022-05-20 20:40:47] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 0 ms to minimize.
[2022-05-20 20:40:47] [INFO ] Deduced a trap composed of 34 places in 189 ms of which 0 ms to minimize.
[2022-05-20 20:40:47] [INFO ] Deduced a trap composed of 29 places in 203 ms of which 0 ms to minimize.
[2022-05-20 20:40:47] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 1 ms to minimize.
[2022-05-20 20:40:48] [INFO ] Deduced a trap composed of 58 places in 166 ms of which 0 ms to minimize.
[2022-05-20 20:40:48] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 1 ms to minimize.
[2022-05-20 20:40:48] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 1 ms to minimize.
[2022-05-20 20:40:48] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 1 ms to minimize.
[2022-05-20 20:40:48] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 0 ms to minimize.
[2022-05-20 20:40:48] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 0 ms to minimize.
[2022-05-20 20:40:49] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 1 ms to minimize.
[2022-05-20 20:40:49] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 1 ms to minimize.
[2022-05-20 20:40:49] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 0 ms to minimize.
[2022-05-20 20:40:49] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 1 ms to minimize.
[2022-05-20 20:40:49] [INFO ] Deduced a trap composed of 53 places in 131 ms of which 1 ms to minimize.
[2022-05-20 20:40:50] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 0 ms to minimize.
[2022-05-20 20:40:50] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 1 ms to minimize.
[2022-05-20 20:40:50] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 0 ms to minimize.
[2022-05-20 20:40:50] [INFO ] Deduced a trap composed of 54 places in 116 ms of which 1 ms to minimize.
[2022-05-20 20:40:50] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 1 ms to minimize.
[2022-05-20 20:40:50] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 1 ms to minimize.
[2022-05-20 20:40:50] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 0 ms to minimize.
[2022-05-20 20:40:51] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 0 ms to minimize.
[2022-05-20 20:40:51] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 0 ms to minimize.
[2022-05-20 20:40:51] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 5150 ms
[2022-05-20 20:40:51] [INFO ] After 5619ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2022-05-20 20:40:51] [INFO ] After 5864ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 327 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=109 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 477 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 43 reset in 342 ms.
Product exploration explored 100000 steps with 93 reset in 359 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1171/1171 places, 1171/1171 transitions.
Performed 329 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 329 rules applied. Total rules applied 329 place count 1171 transition count 1171
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 120 Pre rules applied. Total rules applied 329 place count 1171 transition count 1291
Deduced a syphon composed of 449 places in 2 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 449 place count 1171 transition count 1291
Performed 356 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 805 places in 1 ms
Iterating global reduction 1 with 356 rules applied. Total rules applied 805 place count 1171 transition count 1291
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 806 place count 1171 transition count 1290
Renaming transitions due to excessive name length > 1024 char.
Discarding 240 places :
Symmetric choice reduction at 2 with 240 rule applications. Total rules 1046 place count 931 transition count 1050
Deduced a syphon composed of 565 places in 1 ms
Iterating global reduction 2 with 240 rules applied. Total rules applied 1286 place count 931 transition count 1050
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 566 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1287 place count 931 transition count 1050
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1289 place count 929 transition count 1048
Deduced a syphon composed of 564 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1291 place count 929 transition count 1048
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 665 places in 0 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1392 place count 929 transition count 1780
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1493 place count 828 transition count 1578
Deduced a syphon composed of 564 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1594 place count 828 transition count 1578
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -125
Deduced a syphon composed of 582 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 1612 place count 828 transition count 1703
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1630 place count 810 transition count 1667
Deduced a syphon composed of 564 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 1648 place count 810 transition count 1667
Deduced a syphon composed of 564 places in 1 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 1651 place count 810 transition count 1664
Deduced a syphon composed of 564 places in 0 ms
Applied a total of 1651 rules in 536 ms. Remains 810 /1171 variables (removed 361) and now considering 1664/1171 (removed -493) transitions.
[2022-05-20 20:40:53] [INFO ] Redundant transitions in 92 ms returned []
// Phase 1: matrix 1664 rows 810 cols
[2022-05-20 20:40:53] [INFO ] Computed 121 place invariants in 9 ms
[2022-05-20 20:40:54] [INFO ] Dead Transitions using invariants and state equation in 559 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 810/1171 places, 1664/1171 transitions.
Finished structural reductions, in 1 iterations. Remains : 810/1171 places, 1664/1171 transitions.
Stuttering criterion allowed to conclude after 3734 steps with 3 reset in 40 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-07 finished in 22201 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F(G(X((X(p0) U (p1 U p2)))))))))'
Support contains 5 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1171 transition count 1171
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1171 transition count 1171
Applied a total of 24 rules in 57 ms. Remains 1171 /1183 variables (removed 12) and now considering 1171/1183 (removed 12) transitions.
// Phase 1: matrix 1171 rows 1171 cols
[2022-05-20 20:40:54] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 20:40:54] [INFO ] Implicit Places using invariants in 267 ms returned []
// Phase 1: matrix 1171 rows 1171 cols
[2022-05-20 20:40:54] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 20:40:55] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
// Phase 1: matrix 1171 rows 1171 cols
[2022-05-20 20:40:55] [INFO ] Computed 121 place invariants in 5 ms
[2022-05-20 20:40:56] [INFO ] Dead Transitions using invariants and state equation in 537 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1171/1183 places, 1171/1183 transitions.
Finished structural reductions, in 1 iterations. Remains : 1171/1183 places, 1171/1183 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(NEQ s692 1), p1:(AND (EQ s272 1) (EQ s276 1) (EQ s289 1)), p0:(EQ s583 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 358 ms.
Product exploration explored 100000 steps with 4 reset in 424 ms.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Detected a total of 358/1171 stabilizing places and 358/1171 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 708 ms. Reduced automaton from 5 states, 12 edges and 3 AP to 4 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 163 ms :[(NOT p2), (AND (NOT p0) (NOT p2) p1), (NOT p2), (AND p0 (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1171 rows 1171 cols
[2022-05-20 20:40:58] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 20:40:58] [INFO ] [Real]Absence check using 121 positive place invariants in 36 ms returned sat
[2022-05-20 20:40:59] [INFO ] After 770ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 20:40:59] [INFO ] [Nat]Absence check using 121 positive place invariants in 36 ms returned sat
[2022-05-20 20:41:00] [INFO ] After 715ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 20:41:00] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 0 ms to minimize.
[2022-05-20 20:41:00] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 1 ms to minimize.
[2022-05-20 20:41:00] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 1 ms to minimize.
[2022-05-20 20:41:01] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 1 ms to minimize.
[2022-05-20 20:41:01] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 1 ms to minimize.
[2022-05-20 20:41:01] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 0 ms to minimize.
[2022-05-20 20:41:01] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 0 ms to minimize.
[2022-05-20 20:41:01] [INFO ] Deduced a trap composed of 56 places in 134 ms of which 1 ms to minimize.
[2022-05-20 20:41:02] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 1 ms to minimize.
[2022-05-20 20:41:02] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 1 ms to minimize.
[2022-05-20 20:41:02] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 1 ms to minimize.
[2022-05-20 20:41:02] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 0 ms to minimize.
[2022-05-20 20:41:02] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 0 ms to minimize.
[2022-05-20 20:41:02] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 1 ms to minimize.
[2022-05-20 20:41:02] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2561 ms
[2022-05-20 20:41:03] [INFO ] After 3547ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 177 ms.
[2022-05-20 20:41:03] [INFO ] After 3998ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 124 ms.
Support contains 5 out of 1171 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1171/1171 places, 1171/1171 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1171 transition count 844
Reduce places removed 327 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 328 rules applied. Total rules applied 655 place count 844 transition count 843
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 656 place count 843 transition count 843
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 237 Pre rules applied. Total rules applied 656 place count 843 transition count 606
Deduced a syphon composed of 237 places in 1 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 3 with 474 rules applied. Total rules applied 1130 place count 606 transition count 606
Performed 268 Post agglomeration using F-continuation condition.Transition count delta: 268
Deduced a syphon composed of 268 places in 0 ms
Reduce places removed 268 places and 0 transitions.
Iterating global reduction 3 with 536 rules applied. Total rules applied 1666 place count 338 transition count 338
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1667 place count 338 transition count 337
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1669 place count 337 transition count 336
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -88
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 1847 place count 248 transition count 424
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1848 place count 248 transition count 423
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1849 place count 247 transition count 422
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1850 place count 246 transition count 422
Applied a total of 1850 rules in 99 ms. Remains 246 /1171 variables (removed 925) and now considering 422/1171 (removed 749) transitions.
Finished structural reductions, in 1 iterations. Remains : 246/1171 places, 422/1171 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 182604 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 182604 steps, saw 118974 distinct states, run finished after 3002 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 422 rows 246 cols
[2022-05-20 20:41:06] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:41:07] [INFO ] [Real]Absence check using 120 positive place invariants in 12 ms returned sat
[2022-05-20 20:41:07] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 20:41:07] [INFO ] [Nat]Absence check using 120 positive place invariants in 14 ms returned sat
[2022-05-20 20:41:07] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 20:41:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-20 20:41:07] [INFO ] After 58ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-20 20:41:07] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 60 ms.
[2022-05-20 20:41:07] [INFO ] After 430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 3 properties in 61 ms.
Support contains 5 out of 246 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 246/246 places, 422/422 transitions.
Applied a total of 0 rules in 23 ms. Remains 246 /246 variables (removed 0) and now considering 422/422 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 246/246 places, 422/422 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 246/246 places, 422/422 transitions.
Applied a total of 0 rules in 6 ms. Remains 246 /246 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 246 cols
[2022-05-20 20:41:07] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:41:07] [INFO ] Implicit Places using invariants in 188 ms returned []
// Phase 1: matrix 422 rows 246 cols
[2022-05-20 20:41:07] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:41:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-20 20:41:08] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2022-05-20 20:41:08] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 422 rows 246 cols
[2022-05-20 20:41:08] [INFO ] Computed 120 place invariants in 2 ms
[2022-05-20 20:41:08] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 246/246 places, 422/422 transitions.
Graph (trivial) has 117 edges and 246 vertex of which 4 / 246 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 837 edges and 244 vertex of which 242 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 114 edges and 240 vertex of which 4 / 240 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 238 transition count 413
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 113 edges and 236 vertex of which 6 / 236 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 233 transition count 404
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 111 edges and 230 vertex of which 8 / 230 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 226 transition count 393
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 107 edges and 222 vertex of which 8 / 222 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 218 transition count 379
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 103 edges and 214 vertex of which 8 / 214 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 210 transition count 365
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 99 edges and 206 vertex of which 8 / 206 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 202 transition count 351
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 95 edges and 198 vertex of which 8 / 198 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 194 transition count 337
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 91 edges and 190 vertex of which 8 / 190 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 186 transition count 323
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 87 edges and 182 vertex of which 8 / 182 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 178 transition count 309
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 83 edges and 174 vertex of which 8 / 174 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 170 transition count 295
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 79 edges and 166 vertex of which 8 / 166 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 162 transition count 281
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 75 edges and 158 vertex of which 8 / 158 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 154 transition count 267
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 71 edges and 150 vertex of which 8 / 150 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 146 transition count 253
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 66 edges and 143 vertex of which 6 / 143 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 13 with 18 rules applied. Total rules applied 243 place count 140 transition count 239
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 64 edges and 137 vertex of which 6 / 137 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 14 with 15 rules applied. Total rules applied 258 place count 134 transition count 228
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 433 edges and 131 vertex of which 128 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Graph (trivial) has 60 edges and 128 vertex of which 6 / 128 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 15 with 15 rules applied. Total rules applied 273 place count 125 transition count 215
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 57 edges and 122 vertex of which 6 / 122 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 16 with 16 rules applied. Total rules applied 289 place count 119 transition count 203
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 55 edges and 116 vertex of which 8 / 116 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 15 rules applied. Total rules applied 304 place count 112 transition count 192
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 52 edges and 108 vertex of which 10 / 108 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 18 with 20 rules applied. Total rules applied 324 place count 103 transition count 177
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (trivial) has 46 edges and 98 vertex of which 8 / 98 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 19 with 25 rules applied. Total rules applied 349 place count 94 transition count 158
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 41 edges and 89 vertex of which 8 / 89 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 21 rules applied. Total rules applied 370 place count 85 transition count 143
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 37 edges and 81 vertex of which 6 / 81 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 389 place count 78 transition count 129
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 33 edges and 75 vertex of which 4 / 75 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 22 with 14 rules applied. Total rules applied 403 place count 73 transition count 119
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 30 edges and 71 vertex of which 2 / 71 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 23 with 9 rules applied. Total rules applied 412 place count 70 transition count 113
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 5 rules applied. Total rules applied 417 place count 69 transition count 109
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 25 with 2 Pre rules applied. Total rules applied 417 place count 69 transition count 107
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 25 with 6 rules applied. Total rules applied 423 place count 65 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 425 place count 64 transition count 106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 429 place count 64 transition count 102
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 26 with 3 rules applied. Total rules applied 432 place count 64 transition count 99
Applied a total of 432 rules in 50 ms. Remains 64 /246 variables (removed 182) and now considering 99/422 (removed 323) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 99 rows 64 cols
[2022-05-20 20:41:08] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-20 20:41:08] [INFO ] [Real]Absence check using 30 positive place invariants in 3 ms returned sat
[2022-05-20 20:41:08] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 20:41:08] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2022-05-20 20:41:08] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 20:41:08] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-20 20:41:08] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 20:41:08] [INFO ] Flatten gal took : 6 ms
[2022-05-20 20:41:08] [INFO ] Flatten gal took : 5 ms
[2022-05-20 20:41:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8845882898861825250.gal : 1 ms
[2022-05-20 20:41:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13062604904397058121.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14940837094120548898;'/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/ReachabilityCardinality8845882898861825250.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13062604904397058121.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/ReachabilityCardinality13062604904397058121.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 21
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :21 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 80
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :80 after 1036
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1036 after 16397
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :16397 after 3.35544e+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.24776e+09,0.026583,4312,2,98,12,3654,7,0,362,3911,0
Total reachable state count : 7247757312

Verifying 1 reachability properties.
Reachability property apf6 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
apf6,6.71089e+07,0.027228,4752,2,91,12,3654,7,0,371,3911,0
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) p1)), (F (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (F (NOT (OR p0 p2 p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p1)))]
Knowledge based reduction with 17 factoid took 797 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 4 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (AND (NOT p0) (NOT p2) p1), (NOT p2), (AND p0 (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), (AND (NOT p0) (NOT p2) p1), (NOT p2), (AND p0 (NOT p2) (NOT p1))]
Support contains 5 out of 1171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1171/1171 places, 1171/1171 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1170 transition count 843
Reduce places removed 327 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 328 rules applied. Total rules applied 655 place count 843 transition count 842
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 656 place count 842 transition count 842
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 237 Pre rules applied. Total rules applied 656 place count 842 transition count 605
Deduced a syphon composed of 237 places in 1 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 3 with 474 rules applied. Total rules applied 1130 place count 605 transition count 605
Performed 266 Post agglomeration using F-continuation condition.Transition count delta: 266
Deduced a syphon composed of 266 places in 0 ms
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 3 with 532 rules applied. Total rules applied 1662 place count 339 transition count 339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1663 place count 339 transition count 338
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1665 place count 338 transition count 337
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -88
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 1843 place count 249 transition count 425
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1845 place count 247 transition count 423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1846 place count 246 transition count 423
Applied a total of 1846 rules in 68 ms. Remains 246 /1171 variables (removed 925) and now considering 423/1171 (removed 748) transitions.
// Phase 1: matrix 423 rows 246 cols
[2022-05-20 20:41:09] [INFO ] Computed 120 place invariants in 2 ms
[2022-05-20 20:41:09] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 423 rows 246 cols
[2022-05-20 20:41:09] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:41:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-20 20:41:10] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2022-05-20 20:41:10] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 423 rows 246 cols
[2022-05-20 20:41:10] [INFO ] Computed 120 place invariants in 2 ms
[2022-05-20 20:41:10] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 246/1171 places, 423/1171 transitions.
Finished structural reductions, in 1 iterations. Remains : 246/1171 places, 423/1171 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/246 stabilizing places and 2/423 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (OR p0 p2 p1)), (X (NOT (OR p0 p2 p1))), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR p0 p2 p1))), (X (X (NOT (OR p0 p2 p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))))]
Knowledge based reduction with 10 factoid took 655 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 4 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 167 ms :[(NOT p2), (AND (NOT p0) (NOT p2) p1), (NOT p2), (AND p0 (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 423 rows 246 cols
[2022-05-20 20:41:11] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:41:11] [INFO ] [Real]Absence check using 120 positive place invariants in 25 ms returned sat
[2022-05-20 20:41:11] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 20:41:11] [INFO ] [Nat]Absence check using 120 positive place invariants in 17 ms returned sat
[2022-05-20 20:41:12] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 20:41:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-20 20:41:12] [INFO ] After 66ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-20 20:41:12] [INFO ] After 158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 55 ms.
[2022-05-20 20:41:12] [INFO ] After 474ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 3 properties in 43 ms.
Support contains 5 out of 246 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 246/246 places, 423/423 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 246 transition count 422
Applied a total of 1 rules in 6 ms. Remains 246 /246 variables (removed 0) and now considering 422/423 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 246/246 places, 422/423 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 714683 steps, run timeout after 3001 ms. (steps per millisecond=238 ) properties seen :{}
Probabilistic random walk after 714683 steps, saw 271309 distinct states, run finished after 3009 ms. (steps per millisecond=237 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 422 rows 246 cols
[2022-05-20 20:41:15] [INFO ] Computed 120 place invariants in 2 ms
[2022-05-20 20:41:15] [INFO ] [Real]Absence check using 120 positive place invariants in 12 ms returned sat
[2022-05-20 20:41:15] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 20:41:15] [INFO ] [Nat]Absence check using 120 positive place invariants in 12 ms returned sat
[2022-05-20 20:41:15] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 20:41:15] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-20 20:41:15] [INFO ] After 16ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 20:41:15] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-20 20:41:15] [INFO ] After 204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 246 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 246/246 places, 422/422 transitions.
Applied a total of 0 rules in 9 ms. Remains 246 /246 variables (removed 0) and now considering 422/422 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 246/246 places, 422/422 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 246/246 places, 422/422 transitions.
Applied a total of 0 rules in 10 ms. Remains 246 /246 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 246 cols
[2022-05-20 20:41:15] [INFO ] Computed 120 place invariants in 2 ms
[2022-05-20 20:41:15] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 422 rows 246 cols
[2022-05-20 20:41:15] [INFO ] Computed 120 place invariants in 0 ms
[2022-05-20 20:41:16] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-20 20:41:16] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2022-05-20 20:41:16] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 422 rows 246 cols
[2022-05-20 20:41:16] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:41:16] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 246/246 places, 422/422 transitions.
Graph (trivial) has 117 edges and 246 vertex of which 4 / 246 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 837 edges and 244 vertex of which 242 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 114 edges and 240 vertex of which 4 / 240 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 238 transition count 413
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 113 edges and 236 vertex of which 6 / 236 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 233 transition count 404
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 111 edges and 230 vertex of which 8 / 230 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 226 transition count 393
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 107 edges and 222 vertex of which 8 / 222 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 218 transition count 379
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 103 edges and 214 vertex of which 8 / 214 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 210 transition count 365
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 99 edges and 206 vertex of which 8 / 206 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 202 transition count 351
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 95 edges and 198 vertex of which 8 / 198 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 194 transition count 337
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 91 edges and 190 vertex of which 8 / 190 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 186 transition count 323
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 87 edges and 182 vertex of which 8 / 182 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 178 transition count 309
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 83 edges and 174 vertex of which 8 / 174 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 170 transition count 295
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 79 edges and 166 vertex of which 8 / 166 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 162 transition count 281
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 75 edges and 158 vertex of which 8 / 158 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 154 transition count 267
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 71 edges and 150 vertex of which 8 / 150 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 146 transition count 253
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 66 edges and 143 vertex of which 6 / 143 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 13 with 18 rules applied. Total rules applied 243 place count 140 transition count 239
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 64 edges and 137 vertex of which 6 / 137 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 14 with 15 rules applied. Total rules applied 258 place count 134 transition count 228
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 433 edges and 131 vertex of which 128 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Graph (trivial) has 60 edges and 128 vertex of which 6 / 128 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 15 with 15 rules applied. Total rules applied 273 place count 125 transition count 215
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 57 edges and 122 vertex of which 6 / 122 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 16 with 16 rules applied. Total rules applied 289 place count 119 transition count 203
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 55 edges and 116 vertex of which 8 / 116 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 15 rules applied. Total rules applied 304 place count 112 transition count 192
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 52 edges and 108 vertex of which 10 / 108 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 18 with 20 rules applied. Total rules applied 324 place count 103 transition count 177
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (trivial) has 46 edges and 98 vertex of which 8 / 98 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 19 with 25 rules applied. Total rules applied 349 place count 94 transition count 158
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 41 edges and 89 vertex of which 8 / 89 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 21 rules applied. Total rules applied 370 place count 85 transition count 143
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 37 edges and 81 vertex of which 6 / 81 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 389 place count 78 transition count 129
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 33 edges and 75 vertex of which 4 / 75 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 22 with 14 rules applied. Total rules applied 403 place count 73 transition count 119
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 30 edges and 71 vertex of which 2 / 71 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 23 with 9 rules applied. Total rules applied 412 place count 70 transition count 113
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 5 rules applied. Total rules applied 417 place count 69 transition count 109
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 25 with 2 Pre rules applied. Total rules applied 417 place count 69 transition count 107
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 25 with 6 rules applied. Total rules applied 423 place count 65 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 425 place count 64 transition count 106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 429 place count 64 transition count 102
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 26 with 3 rules applied. Total rules applied 432 place count 64 transition count 99
Applied a total of 432 rules in 43 ms. Remains 64 /246 variables (removed 182) and now considering 99/422 (removed 323) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 99 rows 64 cols
[2022-05-20 20:41:16] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-20 20:41:16] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2022-05-20 20:41:16] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 20:41:16] [INFO ] [Nat]Absence check using 30 positive place invariants in 3 ms returned sat
[2022-05-20 20:41:16] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 20:41:16] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-20 20:41:16] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 20:41:16] [INFO ] Flatten gal took : 8 ms
[2022-05-20 20:41:16] [INFO ] Flatten gal took : 5 ms
[2022-05-20 20:41:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10702005771802397868.gal : 3 ms
[2022-05-20 20:41:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4436773559306000373.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2950610054588615943;'/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/ReachabilityCardinality10702005771802397868.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4436773559306000373.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/ReachabilityCardinality4436773559306000373.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 21
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :21 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 80
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :80 after 1036
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1036 after 16397
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :16397 after 3.35544e+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.24776e+09,0.037999,4308,2,98,12,3654,7,0,362,3911,0
Total reachable state count : 7247757312

Verifying 1 reachability properties.
Reachability property apf6 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
apf6,6.71089e+07,0.038693,4748,2,91,12,3654,7,0,371,3911,0
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (OR p0 p2 p1)), (X (NOT (OR p0 p2 p1))), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR p0 p2 p1))), (X (X (NOT (OR p0 p2 p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (F (AND (NOT p0) (NOT p2) p1)), (F (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (F (NOT (OR p0 p2 p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p1)))]
Knowledge based reduction with 10 factoid took 719 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 4 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (AND (NOT p0) (NOT p2) p1), (NOT p2), (AND p0 (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 301 ms :[(NOT p2), (AND (NOT p0) (NOT p2) p1), (NOT p2), (AND p0 (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (AND (NOT p0) (NOT p2) p1), (NOT p2), (AND p0 (NOT p2) (NOT p1))]
Stuttering criterion allowed to conclude after 3142 steps with 2 reset in 19 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-08 finished in 23426 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(!((G(p1)&&p2)||X(p3))))))'
Support contains 4 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1173 transition count 1173
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1173 transition count 1173
Applied a total of 20 rules in 66 ms. Remains 1173 /1183 variables (removed 10) and now considering 1173/1183 (removed 10) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2022-05-20 20:41:18] [INFO ] Computed 121 place invariants in 5 ms
[2022-05-20 20:41:18] [INFO ] Implicit Places using invariants in 232 ms returned []
// Phase 1: matrix 1173 rows 1173 cols
[2022-05-20 20:41:18] [INFO ] Computed 121 place invariants in 6 ms
[2022-05-20 20:41:19] [INFO ] Implicit Places using invariants and state equation in 818 ms returned []
Implicit Place search using SMT with State Equation took 1051 ms to find 0 implicit places.
// Phase 1: matrix 1173 rows 1173 cols
[2022-05-20 20:41:19] [INFO ] Computed 121 place invariants in 6 ms
[2022-05-20 20:41:19] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1173/1183 places, 1173/1183 transitions.
Finished structural reductions, in 1 iterations. Remains : 1173/1183 places, 1173/1183 transitions.
Stuttering acceptance computed with spot in 535 ms :[(OR p3 (AND p1 p2)), (OR p3 (AND p1 p2)), (OR p3 (AND p1 p2)), p1, p3, true, p3, (OR (AND p1 p2) (AND p1 p3)), p3, (OR (AND p1 p3) (AND p1 p2)), (AND p1 p3), (AND p1 p3), (AND p1 p3)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 7}, { cond=p0, acceptance={} source=2 dest: 8}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 9}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=p3, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 p1 p3), acceptance={} source=6 dest: 3}, { cond=p3, acceptance={} source=6 dest: 4}], [{ cond=(AND p2 p1), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p0) p3), acceptance={0} source=8 dest: 6}, { cond=(AND (NOT p0) p2 p1 p3), acceptance={0} source=8 dest: 7}, { cond=(AND p0 p3), acceptance={0} source=8 dest: 8}, { cond=(AND p0 p2 p1 p3), acceptance={0} source=8 dest: 9}], [{ cond=(AND (NOT p0) p2 p1), acceptance={0} source=9 dest: 7}, { cond=(AND p0 p2 p1), acceptance={0} source=9 dest: 9}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=9 dest: 11}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=9 dest: 12}], [{ cond=(AND p1 p3), acceptance={} source=10 dest: 3}], [{ cond=(AND p2 p1 p3), acceptance={} source=11 dest: 3}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=11 dest: 10}], [{ cond=(AND (NOT p0) p2 p1 p3), acceptance={0} source=12 dest: 7}, { cond=(AND p0 p2 p1 p3), acceptance={0} source=12 dest: 9}, { cond=(AND (NOT p0) (NOT p2) p1 p3), acceptance={0} source=12 dest: 11}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={0} source=12 dest: 12}]], initial=0, aps=[p0:(EQ s680 1), p2:(EQ s289 1), p1:(EQ s652 1), p3:(NEQ s156 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-09 finished in 2176 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(X((F(G(!F(p0)))&&p1)))) U p0))'
Support contains 2 out of 1183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 0 with 331 rules applied. Total rules applied 331 place count 1182 transition count 851
Reduce places removed 331 places and 0 transitions.
Iterating post reduction 1 with 331 rules applied. Total rules applied 662 place count 851 transition count 851
Performed 232 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 232 Pre rules applied. Total rules applied 662 place count 851 transition count 619
Deduced a syphon composed of 232 places in 1 ms
Reduce places removed 232 places and 0 transitions.
Iterating global reduction 2 with 464 rules applied. Total rules applied 1126 place count 619 transition count 619
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1135 place count 610 transition count 610
Iterating global reduction 2 with 9 rules applied. Total rules applied 1144 place count 610 transition count 610
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1144 place count 610 transition count 602
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1160 place count 602 transition count 602
Performed 266 Post agglomeration using F-continuation condition.Transition count delta: 266
Deduced a syphon composed of 266 places in 0 ms
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 2 with 532 rules applied. Total rules applied 1692 place count 336 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1693 place count 336 transition count 335
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1695 place count 335 transition count 334
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 1871 place count 247 transition count 420
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1873 place count 245 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1874 place count 244 transition count 418
Applied a total of 1874 rules in 75 ms. Remains 244 /1183 variables (removed 939) and now considering 418/1183 (removed 765) transitions.
// Phase 1: matrix 418 rows 244 cols
[2022-05-20 20:41:20] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:41:20] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 418 rows 244 cols
[2022-05-20 20:41:20] [INFO ] Computed 120 place invariants in 0 ms
[2022-05-20 20:41:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 20:41:20] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2022-05-20 20:41:20] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 418 rows 244 cols
[2022-05-20 20:41:20] [INFO ] Computed 120 place invariants in 0 ms
[2022-05-20 20:41:20] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 244/1183 places, 418/1183 transitions.
Finished structural reductions, in 1 iterations. Remains : 244/1183 places, 418/1183 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (OR (NOT p1) p0), p0]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s115 1), p1:(EQ s201 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-10 finished in 695 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((F(G(G(p0)))&&p1))&&(X(p2)||p2))))'
Support contains 3 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1173 transition count 1173
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1173 transition count 1173
Applied a total of 20 rules in 59 ms. Remains 1173 /1183 variables (removed 10) and now considering 1173/1183 (removed 10) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2022-05-20 20:41:20] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 20:41:21] [INFO ] Implicit Places using invariants in 234 ms returned []
// Phase 1: matrix 1173 rows 1173 cols
[2022-05-20 20:41:21] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 20:41:22] [INFO ] Implicit Places using invariants and state equation in 926 ms returned []
Implicit Place search using SMT with State Equation took 1162 ms to find 0 implicit places.
// Phase 1: matrix 1173 rows 1173 cols
[2022-05-20 20:41:22] [INFO ] Computed 121 place invariants in 6 ms
[2022-05-20 20:41:22] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1173/1183 places, 1173/1183 transitions.
Finished structural reductions, in 1 iterations. Remains : 1173/1183 places, 1173/1183 transitions.
Stuttering acceptance computed with spot in 651 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (AND p1 (NOT p2)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s293 1), p1:(EQ s635 1), p0:(EQ s1101 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33375 reset in 533 ms.
Product exploration explored 100000 steps with 33154 reset in 483 ms.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Detected a total of 358/1173 stabilizing places and 358/1173 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 305 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p0)), (AND p1 (NOT p2)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1173 rows 1173 cols
[2022-05-20 20:41:24] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 20:41:25] [INFO ] [Real]Absence check using 121 positive place invariants in 37 ms returned sat
[2022-05-20 20:41:25] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 20:41:25] [INFO ] [Nat]Absence check using 121 positive place invariants in 37 ms returned sat
[2022-05-20 20:41:26] [INFO ] After 591ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 20:41:26] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 1 ms to minimize.
[2022-05-20 20:41:26] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 0 ms to minimize.
[2022-05-20 20:41:26] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 1 ms to minimize.
[2022-05-20 20:41:26] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 1 ms to minimize.
[2022-05-20 20:41:26] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 1 ms to minimize.
[2022-05-20 20:41:27] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 1 ms to minimize.
[2022-05-20 20:41:27] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 0 ms to minimize.
[2022-05-20 20:41:27] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 0 ms to minimize.
[2022-05-20 20:41:27] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 1 ms to minimize.
[2022-05-20 20:41:27] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 1 ms to minimize.
[2022-05-20 20:41:27] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1865 ms
[2022-05-20 20:41:28] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 1 ms to minimize.
[2022-05-20 20:41:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2022-05-20 20:41:28] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 0 ms to minimize.
[2022-05-20 20:41:28] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 1 ms to minimize.
[2022-05-20 20:41:28] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 1 ms to minimize.
[2022-05-20 20:41:28] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 1 ms to minimize.
[2022-05-20 20:41:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 648 ms
[2022-05-20 20:41:28] [INFO ] After 3425ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 125 ms.
[2022-05-20 20:41:28] [INFO ] After 3793ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 65 ms.
Support contains 2 out of 1173 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Drop transitions removed 328 transitions
Trivial Post-agglo rules discarded 328 transitions
Performed 328 trivial Post agglomeration. Transition count delta: 328
Iterating post reduction 0 with 328 rules applied. Total rules applied 328 place count 1173 transition count 845
Reduce places removed 328 places and 0 transitions.
Iterating post reduction 1 with 328 rules applied. Total rules applied 656 place count 845 transition count 845
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 239 Pre rules applied. Total rules applied 656 place count 845 transition count 606
Deduced a syphon composed of 239 places in 0 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 2 with 478 rules applied. Total rules applied 1134 place count 606 transition count 606
Performed 272 Post agglomeration using F-continuation condition.Transition count delta: 272
Deduced a syphon composed of 272 places in 0 ms
Reduce places removed 272 places and 0 transitions.
Iterating global reduction 2 with 544 rules applied. Total rules applied 1678 place count 334 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1679 place count 334 transition count 333
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1681 place count 333 transition count 332
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 1857 place count 245 transition count 417
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1858 place count 245 transition count 416
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1859 place count 245 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1860 place count 244 transition count 415
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1861 place count 244 transition count 414
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1862 place count 243 transition count 413
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1863 place count 242 transition count 413
Applied a total of 1863 rules in 62 ms. Remains 242 /1173 variables (removed 931) and now considering 413/1173 (removed 760) transitions.
Finished structural reductions, in 1 iterations. Remains : 242/1173 places, 413/1173 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 355076 steps, run timeout after 3012 ms. (steps per millisecond=117 ) properties seen :{1=1}
Probabilistic random walk after 355076 steps, saw 238367 distinct states, run finished after 3012 ms. (steps per millisecond=117 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 413 rows 242 cols
[2022-05-20 20:41:32] [INFO ] Computed 120 place invariants in 0 ms
[2022-05-20 20:41:32] [INFO ] [Real]Absence check using 120 positive place invariants in 13 ms returned sat
[2022-05-20 20:41:32] [INFO ] After 104ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-20 20:41:32] [INFO ] After 124ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 20:41:32] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 20:41:32] [INFO ] [Nat]Absence check using 120 positive place invariants in 12 ms returned sat
[2022-05-20 20:41:32] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 20:41:32] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-20 20:41:32] [INFO ] After 238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 57 steps, including 2 resets, run visited all 2 properties in 3 ms. (steps per millisecond=19 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 382 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p0)), (AND p1 (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p0)), (AND p1 (NOT p2)), (NOT p0)]
// Phase 1: matrix 1173 rows 1173 cols
[2022-05-20 20:41:33] [INFO ] Computed 121 place invariants in 6 ms
[2022-05-20 20:41:33] [INFO ] [Real]Absence check using 121 positive place invariants in 73 ms returned sat
[2022-05-20 20:41:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 20:41:36] [INFO ] [Real]Absence check using state equation in 2121 ms returned sat
[2022-05-20 20:41:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 20:41:36] [INFO ] [Nat]Absence check using 121 positive place invariants in 71 ms returned sat
[2022-05-20 20:41:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 20:41:38] [INFO ] [Nat]Absence check using state equation in 2235 ms returned sat
[2022-05-20 20:41:38] [INFO ] Computed and/alt/rep : 1172/1714/1172 causal constraints (skipped 0 transitions) in 57 ms.
[2022-05-20 20:41:51] [INFO ] Deduced a trap composed of 15 places in 349 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 20:41:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
// Phase 1: matrix 1173 rows 1173 cols
[2022-05-20 20:41:51] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 20:41:51] [INFO ] [Real]Absence check using 121 positive place invariants in 9 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 9 factoid took 234 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA ShieldRVt-PT-030B-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-030B-LTLFireability-11 finished in 31252 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(!p1)))'
Support contains 2 out of 1183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Drop transitions removed 333 transitions
Trivial Post-agglo rules discarded 333 transitions
Performed 333 trivial Post agglomeration. Transition count delta: 333
Iterating post reduction 0 with 333 rules applied. Total rules applied 333 place count 1183 transition count 850
Reduce places removed 333 places and 0 transitions.
Iterating post reduction 1 with 333 rules applied. Total rules applied 666 place count 850 transition count 850
Performed 231 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 231 Pre rules applied. Total rules applied 666 place count 850 transition count 619
Deduced a syphon composed of 231 places in 1 ms
Reduce places removed 231 places and 0 transitions.
Iterating global reduction 2 with 462 rules applied. Total rules applied 1128 place count 619 transition count 619
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1137 place count 610 transition count 610
Iterating global reduction 2 with 9 rules applied. Total rules applied 1146 place count 610 transition count 610
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1146 place count 610 transition count 603
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1160 place count 603 transition count 603
Performed 270 Post agglomeration using F-continuation condition.Transition count delta: 270
Deduced a syphon composed of 270 places in 0 ms
Reduce places removed 270 places and 0 transitions.
Iterating global reduction 2 with 540 rules applied. Total rules applied 1700 place count 333 transition count 333
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1701 place count 333 transition count 332
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1703 place count 332 transition count 331
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 1879 place count 244 transition count 417
Applied a total of 1879 rules in 70 ms. Remains 244 /1183 variables (removed 939) and now considering 417/1183 (removed 766) transitions.
// Phase 1: matrix 417 rows 244 cols
[2022-05-20 20:41:52] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 20:41:52] [INFO ] Implicit Places using invariants in 148 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 150 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 243/1183 places, 417/1183 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 417/417 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 243/1183 places, 417/1183 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s58 1), p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 28 reset in 455 ms.
Product exploration explored 100000 steps with 22 reset in 453 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/243 stabilizing places and 1/417 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 514 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 50 ms :[true, p1]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 734150 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :{}
Probabilistic random walk after 734150 steps, saw 516466 distinct states, run finished after 3001 ms. (steps per millisecond=244 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 417 rows 243 cols
[2022-05-20 20:41:56] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:41:57] [INFO ] [Real]Absence check using 120 positive place invariants in 18 ms returned sat
[2022-05-20 20:41:57] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 20:41:57] [INFO ] [Nat]Absence check using 120 positive place invariants in 14 ms returned sat
[2022-05-20 20:41:57] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 20:41:57] [INFO ] State equation strengthened by 292 read => feed constraints.
[2022-05-20 20:41:57] [INFO ] After 200ms SMT Verify possible using 292 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 20:41:57] [INFO ] After 227ms 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-05-20 20:41:57] [INFO ] After 417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 243 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 243/243 places, 417/417 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 243 transition count 416
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 242 transition count 415
Applied a total of 2 rules in 13 ms. Remains 242 /243 variables (removed 1) and now considering 415/417 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 242/243 places, 415/417 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Finished probabilistic random walk after 257472 steps, run visited all 1 properties in 1108 ms. (steps per millisecond=232 )
Probabilistic random walk after 257472 steps, saw 169760 distinct states, run finished after 1109 ms. (steps per millisecond=232 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 15 factoid took 200 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA ShieldRVt-PT-030B-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-030B-LTLFireability-13 finished in 6881 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U G(p0))))'
Support contains 1 out of 1183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 333 transitions
Trivial Post-agglo rules discarded 333 transitions
Performed 333 trivial Post agglomeration. Transition count delta: 333
Iterating post reduction 0 with 333 rules applied. Total rules applied 333 place count 1182 transition count 849
Reduce places removed 333 places and 0 transitions.
Iterating post reduction 1 with 333 rules applied. Total rules applied 666 place count 849 transition count 849
Performed 231 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 231 Pre rules applied. Total rules applied 666 place count 849 transition count 618
Deduced a syphon composed of 231 places in 1 ms
Reduce places removed 231 places and 0 transitions.
Iterating global reduction 2 with 462 rules applied. Total rules applied 1128 place count 618 transition count 618
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1136 place count 610 transition count 610
Iterating global reduction 2 with 8 rules applied. Total rules applied 1144 place count 610 transition count 610
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1144 place count 610 transition count 602
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1160 place count 602 transition count 602
Performed 268 Post agglomeration using F-continuation condition.Transition count delta: 268
Deduced a syphon composed of 268 places in 1 ms
Reduce places removed 268 places and 0 transitions.
Iterating global reduction 2 with 536 rules applied. Total rules applied 1696 place count 334 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1697 place count 334 transition count 333
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1699 place count 333 transition count 332
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -88
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1877 place count 244 transition count 420
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1879 place count 242 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1880 place count 241 transition count 418
Applied a total of 1880 rules in 83 ms. Remains 241 /1183 variables (removed 942) and now considering 418/1183 (removed 765) transitions.
// Phase 1: matrix 418 rows 241 cols
[2022-05-20 20:41:59] [INFO ] Computed 120 place invariants in 2 ms
[2022-05-20 20:41:59] [INFO ] Implicit Places using invariants in 142 ms returned []
// Phase 1: matrix 418 rows 241 cols
[2022-05-20 20:41:59] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:41:59] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2022-05-20 20:41:59] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 418 rows 241 cols
[2022-05-20 20:41:59] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:41:59] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 241/1183 places, 418/1183 transitions.
Finished structural reductions, in 1 iterations. Remains : 241/1183 places, 418/1183 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s164 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-14 finished in 900 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U ((F(p0) U true)&&F(p0))))'
Support contains 1 out of 1183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 332 transitions
Trivial Post-agglo rules discarded 332 transitions
Performed 332 trivial Post agglomeration. Transition count delta: 332
Iterating post reduction 0 with 332 rules applied. Total rules applied 332 place count 1182 transition count 850
Reduce places removed 332 places and 0 transitions.
Iterating post reduction 1 with 332 rules applied. Total rules applied 664 place count 850 transition count 850
Performed 232 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 232 Pre rules applied. Total rules applied 664 place count 850 transition count 618
Deduced a syphon composed of 232 places in 1 ms
Reduce places removed 232 places and 0 transitions.
Iterating global reduction 2 with 464 rules applied. Total rules applied 1128 place count 618 transition count 618
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1137 place count 609 transition count 609
Iterating global reduction 2 with 9 rules applied. Total rules applied 1146 place count 609 transition count 609
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1146 place count 609 transition count 601
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1162 place count 601 transition count 601
Performed 266 Post agglomeration using F-continuation condition.Transition count delta: 266
Deduced a syphon composed of 266 places in 0 ms
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 2 with 532 rules applied. Total rules applied 1694 place count 335 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1695 place count 335 transition count 334
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1697 place count 334 transition count 333
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -88
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1875 place count 245 transition count 421
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1877 place count 243 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1878 place count 242 transition count 419
Applied a total of 1878 rules in 86 ms. Remains 242 /1183 variables (removed 941) and now considering 419/1183 (removed 764) transitions.
// Phase 1: matrix 419 rows 242 cols
[2022-05-20 20:41:59] [INFO ] Computed 120 place invariants in 2 ms
[2022-05-20 20:42:00] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 419 rows 242 cols
[2022-05-20 20:42:00] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:42:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 20:42:00] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2022-05-20 20:42:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 419 rows 242 cols
[2022-05-20 20:42:00] [INFO ] Computed 120 place invariants in 0 ms
[2022-05-20 20:42:00] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 242/1183 places, 419/1183 transitions.
Finished structural reductions, in 1 iterations. Remains : 242/1183 places, 419/1183 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s169 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 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-15 finished in 669 ms.
All properties solved by simple procedures.
Total runtime 125887 ms.

BK_STOP 1653079320670

--------------------
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="ShieldRVt-PT-030B"
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 ShieldRVt-PT-030B, 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 r222-tall-165286026101004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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