Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r394-oct2-167903717700286.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldIIPt-PT-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717700286
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 7.9K Feb 25 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 338K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679501105647

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 16:05:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 16:05:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 16:05:08] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2023-03-22 16:05:08] [INFO ] Transformed 1403 places.
[2023-03-22 16:05:08] [INFO ] Transformed 1303 transitions.
[2023-03-22 16:05:08] [INFO ] Found NUPN structural information;
[2023-03-22 16:05:08] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 227 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 12) seen :5
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1303 rows 1403 cols
[2023-03-22 16:05:09] [INFO ] Computed 181 place invariants in 19 ms
[2023-03-22 16:05:09] [INFO ] After 559ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 16:05:10] [INFO ] [Nat]Absence check using 181 positive place invariants in 81 ms returned sat
[2023-03-22 16:05:11] [INFO ] After 1169ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-22 16:05:12] [INFO ] Deduced a trap composed of 22 places in 351 ms of which 5 ms to minimize.
[2023-03-22 16:05:12] [INFO ] Deduced a trap composed of 18 places in 345 ms of which 2 ms to minimize.
[2023-03-22 16:05:12] [INFO ] Deduced a trap composed of 24 places in 305 ms of which 1 ms to minimize.
[2023-03-22 16:05:13] [INFO ] Deduced a trap composed of 24 places in 321 ms of which 1 ms to minimize.
[2023-03-22 16:05:13] [INFO ] Deduced a trap composed of 26 places in 274 ms of which 1 ms to minimize.
[2023-03-22 16:05:13] [INFO ] Deduced a trap composed of 34 places in 271 ms of which 1 ms to minimize.
[2023-03-22 16:05:14] [INFO ] Deduced a trap composed of 25 places in 256 ms of which 1 ms to minimize.
[2023-03-22 16:05:14] [INFO ] Deduced a trap composed of 12 places in 286 ms of which 1 ms to minimize.
[2023-03-22 16:05:14] [INFO ] Deduced a trap composed of 30 places in 336 ms of which 1 ms to minimize.
[2023-03-22 16:05:15] [INFO ] Deduced a trap composed of 28 places in 228 ms of which 6 ms to minimize.
[2023-03-22 16:05:15] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 0 ms to minimize.
[2023-03-22 16:05:15] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 1 ms to minimize.
[2023-03-22 16:05:15] [INFO ] Deduced a trap composed of 28 places in 195 ms of which 1 ms to minimize.
[2023-03-22 16:05:15] [INFO ] Deduced a trap composed of 27 places in 193 ms of which 0 ms to minimize.
[2023-03-22 16:05:16] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 1 ms to minimize.
[2023-03-22 16:05:16] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 0 ms to minimize.
[2023-03-22 16:05:16] [INFO ] Deduced a trap composed of 18 places in 234 ms of which 2 ms to minimize.
[2023-03-22 16:05:16] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 0 ms to minimize.
[2023-03-22 16:05:17] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 1 ms to minimize.
[2023-03-22 16:05:17] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 0 ms to minimize.
[2023-03-22 16:05:17] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 4 ms to minimize.
[2023-03-22 16:05:17] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 1 ms to minimize.
[2023-03-22 16:05:18] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 1 ms to minimize.
[2023-03-22 16:05:18] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 0 ms to minimize.
[2023-03-22 16:05:18] [INFO ] Deduced a trap composed of 36 places in 182 ms of which 1 ms to minimize.
[2023-03-22 16:05:18] [INFO ] Deduced a trap composed of 29 places in 172 ms of which 1 ms to minimize.
[2023-03-22 16:05:18] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 0 ms to minimize.
[2023-03-22 16:05:19] [INFO ] Deduced a trap composed of 30 places in 191 ms of which 0 ms to minimize.
[2023-03-22 16:05:19] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 0 ms to minimize.
[2023-03-22 16:05:19] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 0 ms to minimize.
[2023-03-22 16:05:19] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 1 ms to minimize.
[2023-03-22 16:05:19] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 1 ms to minimize.
[2023-03-22 16:05:19] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 1 ms to minimize.
[2023-03-22 16:05:20] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 5 ms to minimize.
[2023-03-22 16:05:20] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2023-03-22 16:05:20] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 0 ms to minimize.
[2023-03-22 16:05:20] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2023-03-22 16:05:20] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 1 ms to minimize.
[2023-03-22 16:05:20] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 0 ms to minimize.
[2023-03-22 16:05:20] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 6 ms to minimize.
[2023-03-22 16:05:21] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 0 ms to minimize.
[2023-03-22 16:05:21] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 1 ms to minimize.
[2023-03-22 16:05:21] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 0 ms to minimize.
[2023-03-22 16:05:21] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
[2023-03-22 16:05:21] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 0 ms to minimize.
[2023-03-22 16:05:21] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2023-03-22 16:05:21] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 0 ms to minimize.
[2023-03-22 16:05:21] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 10378 ms
[2023-03-22 16:05:22] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2023-03-22 16:05:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-22 16:05:22] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 1 ms to minimize.
[2023-03-22 16:05:22] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 0 ms to minimize.
[2023-03-22 16:05:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 310 ms
[2023-03-22 16:05:22] [INFO ] After 12381ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 261 ms.
[2023-03-22 16:05:23] [INFO ] After 13453ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 376 ms.
Support contains 12 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1303/1303 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 1403 transition count 970
Reduce places removed 333 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 335 rules applied. Total rules applied 668 place count 1070 transition count 968
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 669 place count 1069 transition count 968
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 82 Pre rules applied. Total rules applied 669 place count 1069 transition count 886
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 833 place count 987 transition count 886
Discarding 135 places :
Symmetric choice reduction at 3 with 135 rule applications. Total rules 968 place count 852 transition count 751
Iterating global reduction 3 with 135 rules applied. Total rules applied 1103 place count 852 transition count 751
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 1103 place count 852 transition count 693
Deduced a syphon composed of 58 places in 3 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1219 place count 794 transition count 693
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 1 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 3 with 674 rules applied. Total rules applied 1893 place count 457 transition count 356
Renaming transitions due to excessive name length > 1024 char.
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 2007 place count 400 transition count 392
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2008 place count 400 transition count 391
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 2011 place count 400 transition count 388
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 2014 place count 397 transition count 388
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 5 with 21 rules applied. Total rules applied 2035 place count 397 transition count 388
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2036 place count 396 transition count 387
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2038 place count 394 transition count 387
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2038 place count 394 transition count 386
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2040 place count 393 transition count 386
Applied a total of 2040 rules in 291 ms. Remains 393 /1403 variables (removed 1010) and now considering 386/1303 (removed 917) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 291 ms. Remains : 393/1403 places, 386/1303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 6) seen :4
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 386 rows 393 cols
[2023-03-22 16:05:23] [INFO ] Computed 179 place invariants in 3 ms
[2023-03-22 16:05:24] [INFO ] [Real]Absence check using 179 positive place invariants in 63 ms returned sat
[2023-03-22 16:05:24] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 16:05:24] [INFO ] [Nat]Absence check using 179 positive place invariants in 54 ms returned sat
[2023-03-22 16:05:24] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 16:05:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 16:05:24] [INFO ] After 28ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 16:05:24] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-22 16:05:24] [INFO ] After 548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 386/386 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 393 transition count 380
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 387 transition count 380
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 387 transition count 379
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 386 transition count 379
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 384 transition count 377
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 2 with 2 rules applied. Total rules applied 20 place count 383 transition count 378
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 383 transition count 377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 382 transition count 377
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 380 transition count 375
Applied a total of 24 rules in 53 ms. Remains 380 /393 variables (removed 13) and now considering 375/386 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 380/393 places, 375/386 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 263052 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 263052 steps, saw 176843 distinct states, run finished after 3003 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 375 rows 380 cols
[2023-03-22 16:05:27] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-22 16:05:28] [INFO ] [Real]Absence check using 179 positive place invariants in 53 ms returned sat
[2023-03-22 16:05:28] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 16:05:28] [INFO ] [Nat]Absence check using 179 positive place invariants in 20 ms returned sat
[2023-03-22 16:05:28] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 16:05:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 16:05:28] [INFO ] After 21ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 16:05:28] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-22 16:05:28] [INFO ] After 344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 375/375 transitions.
Applied a total of 0 rules in 8 ms. Remains 380 /380 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 380/380 places, 375/375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 375/375 transitions.
Applied a total of 0 rules in 10 ms. Remains 380 /380 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2023-03-22 16:05:28] [INFO ] Invariant cache hit.
[2023-03-22 16:05:28] [INFO ] Implicit Places using invariants in 456 ms returned [369]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 458 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 379/380 places, 375/375 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 378 transition count 374
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 378 transition count 374
Applied a total of 2 rules in 10 ms. Remains 378 /379 variables (removed 1) and now considering 374/375 (removed 1) transitions.
// Phase 1: matrix 374 rows 378 cols
[2023-03-22 16:05:28] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-22 16:05:29] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-03-22 16:05:29] [INFO ] Invariant cache hit.
[2023-03-22 16:05:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 16:05:29] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 378/380 places, 374/375 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1089 ms. Remains : 378/380 places, 374/375 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 317785 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{}
Probabilistic random walk after 317785 steps, saw 222857 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 16:05:32] [INFO ] Invariant cache hit.
[2023-03-22 16:05:32] [INFO ] [Real]Absence check using 178 positive place invariants in 32 ms returned sat
[2023-03-22 16:05:32] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 16:05:32] [INFO ] [Nat]Absence check using 178 positive place invariants in 37 ms returned sat
[2023-03-22 16:05:33] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 16:05:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 16:05:33] [INFO ] After 23ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 16:05:33] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-22 16:05:33] [INFO ] After 386ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 374/374 transitions.
Applied a total of 0 rules in 7 ms. Remains 378 /378 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 378/378 places, 374/374 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 374/374 transitions.
Applied a total of 0 rules in 7 ms. Remains 378 /378 variables (removed 0) and now considering 374/374 (removed 0) transitions.
[2023-03-22 16:05:33] [INFO ] Invariant cache hit.
[2023-03-22 16:05:33] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-22 16:05:33] [INFO ] Invariant cache hit.
[2023-03-22 16:05:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 16:05:33] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
[2023-03-22 16:05:34] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-22 16:05:34] [INFO ] Invariant cache hit.
[2023-03-22 16:05:34] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1004 ms. Remains : 378/378 places, 374/374 transitions.
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 378 transition count 374
Applied a total of 39 rules in 14 ms. Remains 378 /378 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 374 rows 378 cols
[2023-03-22 16:05:34] [INFO ] Computed 178 place invariants in 3 ms
[2023-03-22 16:05:34] [INFO ] [Real]Absence check using 178 positive place invariants in 25 ms returned sat
[2023-03-22 16:05:34] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 16:05:34] [INFO ] [Nat]Absence check using 178 positive place invariants in 32 ms returned sat
[2023-03-22 16:05:34] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 16:05:34] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-22 16:05:34] [INFO ] After 61ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 16:05:34] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-22 16:05:34] [INFO ] After 341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-22 16:05:34] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 15 ms.
[2023-03-22 16:05:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 378 places, 374 transitions and 1835 arcs took 5 ms.
[2023-03-22 16:05:35] [INFO ] Flatten gal took : 85 ms
Total runtime 27018 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldIIPt_PT_020B
(NrP: 378 NrTr: 374 NrArc: 1835)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.012sec

net check time: 0m 0.000sec

init dd package: 0m 2.820sec


before gc: list nodes free: 60900

after gc: idd nodes used:5462, unused:63994538; list nodes free:285184423

before gc: list nodes free: 492093

after gc: idd nodes used:2554, unused:63997446; list nodes free:287295625

before gc: list nodes free: 1529420

after gc: idd nodes used:6810, unused:63993190; list nodes free:289371985

before gc: list nodes free: 2541322

after gc: idd nodes used:3404, unused:63996596; list nodes free:289388319

before gc: list nodes free: 777861

after gc: idd nodes used:7055, unused:63992945; list nodes free:289370790

before gc: list nodes free: 276388

after gc: idd nodes used:3504, unused:63996496; list nodes free:289388097

before gc: list nodes free: 2158952

after gc: idd nodes used:4749, unused:63995251; list nodes free:289381617

before gc: list nodes free: 444478

after gc: idd nodes used:6034, unused:63993966; list nodes free:289375524

before gc: list nodes free: 2012454

after gc: idd nodes used:7221, unused:63992779; list nodes free:291467075

before gc: list nodes free: 1429608

after gc: idd nodes used:8775, unused:63991225; list nodes free:291459513

before gc: list nodes free: 1413240

after gc: idd nodes used:7630, unused:63992370; list nodes free:291465281

before gc: list nodes free: 1458541

after gc: idd nodes used:8609, unused:63991391; list nodes free:291460306

before gc: list nodes free: 1657319

after gc: idd nodes used:6735, unused:63993265; list nodes free:291469454

before gc: list nodes free: 2878577

after gc: idd nodes used:2964, unused:63997036; list nodes free:291487660

before gc: list nodes free: 3856135

after gc: idd nodes used:4119, unused:63995881; list nodes free:291481806

before gc: list nodes free: 370331

after gc: idd nodes used:3635, unused:63996365; list nodes free:291484562

before gc: list nodes free: 417871

after gc: idd nodes used:6508, unused:63993492; list nodes free:291470098

before gc: list nodes free: 1923090

after gc: idd nodes used:6607, unused:63993393; list nodes free:293566976

before gc: list nodes free: 1571750

after gc: idd nodes used:8227, unused:63991773; list nodes free:293558922
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6127604 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16096776 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.001sec

1151 2327 1969 3459 1451 2230 3107 3580 3867 3649 2155 1842 2495 2819 3260 2345 4414 4490 4642 4999 3917 4067 3623 3064 1917 1922 2718 2330 2877 3955 5208 5500 5436 5819 5737 4924 4352 3843 2754 1916 2210 2089 2387 2798 2403 3010 3603 2657 4829 4449 5151 4999 5655 3549 6017 6364 6650 6842 6865 6724 6587 5318 6012 5897 6018 5771 5291 4893 3937 3508 2165 1924 2173 2352 1889 2390 2262 2374 2281 2266 2297 2383 2289 2169 2357 3032 3239 2434 2535 3818 3294 2742 4335 3858 3317 4901 4584 2810 4362 5329 4210 3496 5179 5587 5586 5703 3581 5602 5913 3912 6126 5306 6267 6645 6799 5055 6260 6397 6338 5710 6522 5819 6499 6241 5906 5297 6038 5149 5724 5016 5363 4644 5025 4424 4149 3954 3562 2955 2244 2390 2533 2367 2470 2580 2314 2538 2552 2516 2452 2464 2457 2382 2541 2574 2200 3459 3257 3412 3208 3257 2910 3395 2874 3681 4718 4640 4134 4669 4047 2736 2934 4948 5002 4728 5000 4659 4159 4453 3599 5691 5099 5681 5363 5194 5142 5239 6111 5913 5346 6042 5900 5495 5383 4041 6478 6801 5713 6802 6586 6180 6213 6627 7206 6908 6878 6896 6136 6544 6928 6995 7766 7772 6899 6543 5339 7926 8042 7550 6841 7835 7071 7059 8424 8554 7862 8311 7020 6182 7345 8608 8123 8670 8436 7460 6742 7614 8874 8545 8349 8399 7534 7525 7614 8570 8893 8718 7118 6900 7160 8635 8805 8943 8921 7510 7466 8527 8195 8592 8483 8851 7217 7207 8416 8457 8928 8776 6779 7101 8274 8436 8134 8307 8483 6230 5818 8503 8027 8168 7519 6094 6489 6802 7723 7598 8166 8026 5908 5966 7631 7968 5971 7854 5310 5586 7192 6848 6780 6682 4755 4780 6921 6760 6788 6988 4470 6165 5513 5803 5642 3685 5589 5681 5885 5822 4855 4491 5014 4931 4202 4408 4371 3880 3501 3313 2483 2635 2697 2432 2706 2727 2549 2602 2633 2536 2587 2739 2640 2724 2594 2538 2749 2726 2396 2739 2572 2651 2624 2639 2763 2742 2718 2744 2767 2724 2499 2438 2948 3180 2769 3434 3734 3722 2930 3683 3718 3175 3720 3680 3113 3399 2970 2867 3885 3656 2965 5011 5020 4723 4848 5039 4779 4788 5047 4984 3703 3863 3458 4561 4303 3251 3292 5107 5335 4643 5309 5133 4548 5085 5333 4838 4602 4598 3438 5101 5138 3713 6129 5379 6132 6112 6080 6143 6157 6129 5885 5473 5471 3917 5186 5557 3996 6639 6221 6624 6670 6655 5684 6655 5995 5669 5546 5634 4226 6168 5449 6170 6679 7051 7374 5632 7396 7376 5883 7402 7412 5434 6371 5828 6653 6696 4576 7794 7460 7854 7821 7783 7803 7705

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="ShieldIIPt-PT-020B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is ShieldIIPt-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 r394-oct2-167903717700286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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