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-165286025500638.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 ShieldPPPt-PT-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025500638
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 792K
-rw-r--r-- 1 mcc users 5.6K Apr 29 13:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 29 13:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 13:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 13:36 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.9K May 9 08:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 9 08:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 29 13:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 29 13:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 29 13:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 13:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:55 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 376K 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 ShieldPPPt-PT-020B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654275132742

Running Version 202205111006
[2022-06-03 16:52:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-03 16:52:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 16:52:14] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2022-06-03 16:52:14] [INFO ] Transformed 1563 places.
[2022-06-03 16:52:14] [INFO ] Transformed 1423 transitions.
[2022-06-03 16:52:14] [INFO ] Found NUPN structural information;
[2022-06-03 16:52:14] [INFO ] Parsed PT model containing 1563 places and 1423 transitions in 344 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 549 ms. (steps per millisecond=18 ) properties (out of 13) seen :4
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1423 rows 1563 cols
[2022-06-03 16:52:15] [INFO ] Computed 221 place invariants in 42 ms
[2022-06-03 16:52:16] [INFO ] After 696ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-03 16:52:16] [INFO ] [Nat]Absence check using 221 positive place invariants in 82 ms returned sat
[2022-06-03 16:52:17] [INFO ] After 1235ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :5
[2022-06-03 16:52:18] [INFO ] Deduced a trap composed of 25 places in 302 ms of which 5 ms to minimize.
[2022-06-03 16:52:18] [INFO ] Deduced a trap composed of 21 places in 283 ms of which 2 ms to minimize.
[2022-06-03 16:52:19] [INFO ] Deduced a trap composed of 27 places in 261 ms of which 1 ms to minimize.
[2022-06-03 16:52:19] [INFO ] Deduced a trap composed of 25 places in 235 ms of which 1 ms to minimize.
[2022-06-03 16:52:19] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 1 ms to minimize.
[2022-06-03 16:52:19] [INFO ] Deduced a trap composed of 28 places in 220 ms of which 1 ms to minimize.
[2022-06-03 16:52:20] [INFO ] Deduced a trap composed of 43 places in 194 ms of which 2 ms to minimize.
[2022-06-03 16:52:20] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 1 ms to minimize.
[2022-06-03 16:52:20] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 1 ms to minimize.
[2022-06-03 16:52:20] [INFO ] Deduced a trap composed of 16 places in 192 ms of which 1 ms to minimize.
[2022-06-03 16:52:21] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 0 ms to minimize.
[2022-06-03 16:52:21] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 0 ms to minimize.
[2022-06-03 16:52:21] [INFO ] Deduced a trap composed of 36 places in 174 ms of which 1 ms to minimize.
[2022-06-03 16:52:21] [INFO ] Deduced a trap composed of 29 places in 166 ms of which 0 ms to minimize.
[2022-06-03 16:52:22] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 1 ms to minimize.
[2022-06-03 16:52:22] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 0 ms to minimize.
[2022-06-03 16:52:22] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 0 ms to minimize.
[2022-06-03 16:52:22] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 0 ms to minimize.
[2022-06-03 16:52:22] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 1 ms to minimize.
[2022-06-03 16:52:23] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 1 ms to minimize.
[2022-06-03 16:52:23] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 1 ms to minimize.
[2022-06-03 16:52:23] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 0 ms to minimize.
[2022-06-03 16:52:23] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 0 ms to minimize.
[2022-06-03 16:52:23] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 5836 ms
[2022-06-03 16:52:24] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 1 ms to minimize.
[2022-06-03 16:52:24] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 0 ms to minimize.
[2022-06-03 16:52:24] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 1 ms to minimize.
[2022-06-03 16:52:24] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 0 ms to minimize.
[2022-06-03 16:52:25] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 1 ms to minimize.
[2022-06-03 16:52:25] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 1 ms to minimize.
[2022-06-03 16:52:25] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 1 ms to minimize.
[2022-06-03 16:52:25] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 1 ms to minimize.
[2022-06-03 16:52:26] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 0 ms to minimize.
[2022-06-03 16:52:26] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 1 ms to minimize.
[2022-06-03 16:52:26] [INFO ] Deduced a trap composed of 32 places in 304 ms of which 1 ms to minimize.
[2022-06-03 16:52:27] [INFO ] Deduced a trap composed of 28 places in 295 ms of which 1 ms to minimize.
[2022-06-03 16:52:27] [INFO ] Deduced a trap composed of 35 places in 293 ms of which 0 ms to minimize.
[2022-06-03 16:52:27] [INFO ] Deduced a trap composed of 25 places in 291 ms of which 1 ms to minimize.
[2022-06-03 16:52:28] [INFO ] Deduced a trap composed of 20 places in 282 ms of which 1 ms to minimize.
[2022-06-03 16:52:28] [INFO ] Deduced a trap composed of 33 places in 276 ms of which 0 ms to minimize.
[2022-06-03 16:52:29] [INFO ] Deduced a trap composed of 35 places in 275 ms of which 1 ms to minimize.
[2022-06-03 16:52:29] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 1 ms to minimize.
[2022-06-03 16:52:29] [INFO ] Deduced a trap composed of 24 places in 273 ms of which 1 ms to minimize.
[2022-06-03 16:52:30] [INFO ] Deduced a trap composed of 20 places in 261 ms of which 1 ms to minimize.
[2022-06-03 16:52:30] [INFO ] Deduced a trap composed of 30 places in 246 ms of which 0 ms to minimize.
[2022-06-03 16:52:30] [INFO ] Deduced a trap composed of 23 places in 245 ms of which 1 ms to minimize.
[2022-06-03 16:52:31] [INFO ] Deduced a trap composed of 30 places in 253 ms of which 2 ms to minimize.
[2022-06-03 16:52:31] [INFO ] Deduced a trap composed of 27 places in 229 ms of which 0 ms to minimize.
[2022-06-03 16:52:31] [INFO ] Deduced a trap composed of 41 places in 242 ms of which 1 ms to minimize.
[2022-06-03 16:52:31] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 0 ms to minimize.
[2022-06-03 16:52:32] [INFO ] Deduced a trap composed of 36 places in 212 ms of which 0 ms to minimize.
[2022-06-03 16:52:32] [INFO ] Deduced a trap composed of 46 places in 209 ms of which 1 ms to minimize.
[2022-06-03 16:52:32] [INFO ] Deduced a trap composed of 34 places in 200 ms of which 1 ms to minimize.
[2022-06-03 16:52:32] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 1 ms to minimize.
[2022-06-03 16:52:33] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 0 ms to minimize.
[2022-06-03 16:52:33] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 0 ms to minimize.
[2022-06-03 16:52:33] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 3 ms to minimize.
[2022-06-03 16:52:33] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 0 ms to minimize.
[2022-06-03 16:52:34] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 0 ms to minimize.
[2022-06-03 16:52:34] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 1 ms to minimize.
[2022-06-03 16:52:34] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 10570 ms
[2022-06-03 16:52:34] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 1 ms to minimize.
[2022-06-03 16:52:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2022-06-03 16:52:35] [INFO ] Deduced a trap composed of 22 places in 197 ms of which 1 ms to minimize.
[2022-06-03 16:52:35] [INFO ] Deduced a trap composed of 18 places in 201 ms of which 1 ms to minimize.
[2022-06-03 16:52:35] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 0 ms to minimize.
[2022-06-03 16:52:36] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 1 ms to minimize.
[2022-06-03 16:52:36] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 1 ms to minimize.
[2022-06-03 16:52:36] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 2 ms to minimize.
[2022-06-03 16:52:36] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 2 ms to minimize.
[2022-06-03 16:52:37] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 2 ms to minimize.
[2022-06-03 16:52:37] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 1 ms to minimize.
[2022-06-03 16:52:37] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2430 ms
[2022-06-03 16:52:37] [INFO ] After 20859ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :5
Attempting to minimize the solution found.
Minimization took 611 ms.
[2022-06-03 16:52:38] [INFO ] After 22097ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :5
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 7939 ms.
Support contains 75 out of 1563 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1563/1563 places, 1423/1423 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 1563 transition count 1102
Reduce places removed 321 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 339 rules applied. Total rules applied 660 place count 1242 transition count 1084
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 678 place count 1224 transition count 1084
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 82 Pre rules applied. Total rules applied 678 place count 1224 transition count 1002
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 842 place count 1142 transition count 1002
Discarding 129 places :
Symmetric choice reduction at 3 with 129 rule applications. Total rules 971 place count 1013 transition count 873
Iterating global reduction 3 with 129 rules applied. Total rules applied 1100 place count 1013 transition count 873
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 1100 place count 1013 transition count 826
Deduced a syphon composed of 47 places in 5 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1194 place count 966 transition count 826
Performed 319 Post agglomeration using F-continuation condition.Transition count delta: 319
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1832 place count 647 transition count 507
Renaming transitions due to excessive name length > 1024 char.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 1930 place count 598 transition count 507
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1931 place count 598 transition count 506
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1932 place count 598 transition count 505
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1933 place count 597 transition count 505
Partial Free-agglomeration rule applied 49 times.
Drop transitions removed 49 transitions
Iterating global reduction 4 with 49 rules applied. Total rules applied 1982 place count 597 transition count 505
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1983 place count 596 transition count 504
Applied a total of 1983 rules in 597 ms. Remains 596 /1563 variables (removed 967) and now considering 504/1423 (removed 919) transitions.
Finished structural reductions, in 1 iterations. Remains : 596/1563 places, 504/1423 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 11358 ms. (steps per millisecond=88 ) properties (out of 5) seen :4
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3646 ms. (steps per millisecond=274 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 504 rows 596 cols
[2022-06-03 16:53:01] [INFO ] Computed 221 place invariants in 7 ms
[2022-06-03 16:53:01] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 16:53:01] [INFO ] [Nat]Absence check using 221 positive place invariants in 30 ms returned sat
[2022-06-03 16:53:02] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 16:53:02] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-03 16:53:02] [INFO ] After 85ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 16:53:02] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 0 ms to minimize.
[2022-06-03 16:53:02] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2022-06-03 16:53:02] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 0 ms to minimize.
[2022-06-03 16:53:02] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2022-06-03 16:53:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 419 ms
[2022-06-03 16:53:02] [INFO ] After 546ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2022-06-03 16:53:02] [INFO ] After 935ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 125 ms.
Support contains 20 out of 596 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 596/596 places, 504/504 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 596 transition count 490
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 582 transition count 488
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 580 transition count 488
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 32 place count 580 transition count 475
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 58 place count 567 transition count 475
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 41 rules applied. Total rules applied 99 place count 546 transition count 455
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 99 place count 546 transition count 453
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 544 transition count 453
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 117 place count 537 transition count 452
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 537 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 119 place count 536 transition count 451
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 121 place count 536 transition count 451
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 535 transition count 450
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 535 transition count 450
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 124 place count 535 transition count 450
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 4 with 11 rules applied. Total rules applied 135 place count 524 transition count 439
Applied a total of 135 rules in 163 ms. Remains 524 /596 variables (removed 72) and now considering 439/504 (removed 65) transitions.
Finished structural reductions, in 1 iterations. Remains : 524/596 places, 439/504 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5099 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Finished Best-First random walk after 579794 steps, including 1 resets, run visited all 1 properties in 2155 ms. (steps per millisecond=269 )
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 56439 ms.

BK_STOP 1654275190420

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="ShieldPPPt-PT-020B"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldPPPt-PT-020B, examination is ReachabilityCardinality"
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-165286025500638"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-020B.tgz
mv ShieldPPPt-PT-020B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;