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-167903718100638.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 ShieldPPPt-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-167903718100638
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 21:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 21:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 21:08 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 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 21:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 21:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 376K 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 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 1679526696418

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=ShieldPPPt-PT-020B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 23:11:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 23:11:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 23:11:38] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2023-03-22 23:11:38] [INFO ] Transformed 1563 places.
[2023-03-22 23:11:38] [INFO ] Transformed 1423 transitions.
[2023-03-22 23:11:38] [INFO ] Found NUPN structural information;
[2023-03-22 23:11:38] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 12) seen :8
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) 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
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
Running SMT prover for 4 properties.
// Phase 1: matrix 1423 rows 1563 cols
[2023-03-22 23:11:39] [INFO ] Computed 221 place invariants in 21 ms
[2023-03-22 23:11:40] [INFO ] After 718ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 23:11:40] [INFO ] [Nat]Absence check using 221 positive place invariants in 98 ms returned sat
[2023-03-22 23:11:42] [INFO ] After 1165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 23:11:42] [INFO ] Deduced a trap composed of 30 places in 485 ms of which 7 ms to minimize.
[2023-03-22 23:11:43] [INFO ] Deduced a trap composed of 16 places in 388 ms of which 2 ms to minimize.
[2023-03-22 23:11:43] [INFO ] Deduced a trap composed of 37 places in 457 ms of which 1 ms to minimize.
[2023-03-22 23:11:44] [INFO ] Deduced a trap composed of 25 places in 369 ms of which 14 ms to minimize.
[2023-03-22 23:11:44] [INFO ] Deduced a trap composed of 23 places in 323 ms of which 1 ms to minimize.
[2023-03-22 23:11:45] [INFO ] Deduced a trap composed of 23 places in 329 ms of which 1 ms to minimize.
[2023-03-22 23:11:45] [INFO ] Deduced a trap composed of 24 places in 301 ms of which 1 ms to minimize.
[2023-03-22 23:11:45] [INFO ] Deduced a trap composed of 19 places in 273 ms of which 0 ms to minimize.
[2023-03-22 23:11:46] [INFO ] Deduced a trap composed of 28 places in 340 ms of which 1 ms to minimize.
[2023-03-22 23:11:46] [INFO ] Deduced a trap composed of 31 places in 299 ms of which 2 ms to minimize.
[2023-03-22 23:11:47] [INFO ] Deduced a trap composed of 35 places in 300 ms of which 3 ms to minimize.
[2023-03-22 23:11:47] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 3 ms to minimize.
[2023-03-22 23:11:47] [INFO ] Deduced a trap composed of 33 places in 339 ms of which 1 ms to minimize.
[2023-03-22 23:11:48] [INFO ] Deduced a trap composed of 35 places in 254 ms of which 0 ms to minimize.
[2023-03-22 23:11:48] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 0 ms to minimize.
[2023-03-22 23:11:48] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 1 ms to minimize.
[2023-03-22 23:11:48] [INFO ] Deduced a trap composed of 26 places in 312 ms of which 1 ms to minimize.
[2023-03-22 23:11:49] [INFO ] Deduced a trap composed of 25 places in 254 ms of which 1 ms to minimize.
[2023-03-22 23:11:49] [INFO ] Deduced a trap composed of 24 places in 237 ms of which 1 ms to minimize.
[2023-03-22 23:11:49] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 1 ms to minimize.
[2023-03-22 23:11:50] [INFO ] Deduced a trap composed of 34 places in 260 ms of which 1 ms to minimize.
[2023-03-22 23:11:50] [INFO ] Deduced a trap composed of 25 places in 257 ms of which 0 ms to minimize.
[2023-03-22 23:11:50] [INFO ] Deduced a trap composed of 29 places in 208 ms of which 1 ms to minimize.
[2023-03-22 23:11:51] [INFO ] Deduced a trap composed of 27 places in 215 ms of which 2 ms to minimize.
[2023-03-22 23:11:51] [INFO ] Deduced a trap composed of 20 places in 253 ms of which 3 ms to minimize.
[2023-03-22 23:11:51] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 1 ms to minimize.
[2023-03-22 23:11:51] [INFO ] Deduced a trap composed of 36 places in 220 ms of which 1 ms to minimize.
[2023-03-22 23:11:52] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 0 ms to minimize.
[2023-03-22 23:11:52] [INFO ] Deduced a trap composed of 35 places in 239 ms of which 14 ms to minimize.
[2023-03-22 23:11:52] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 1 ms to minimize.
[2023-03-22 23:11:52] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 1 ms to minimize.
[2023-03-22 23:11:53] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 1 ms to minimize.
[2023-03-22 23:11:53] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 1 ms to minimize.
[2023-03-22 23:11:53] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 6 ms to minimize.
[2023-03-22 23:11:53] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 1 ms to minimize.
[2023-03-22 23:11:53] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 0 ms to minimize.
[2023-03-22 23:11:54] [INFO ] Deduced a trap composed of 43 places in 193 ms of which 0 ms to minimize.
[2023-03-22 23:11:54] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 11960 ms
[2023-03-22 23:11:55] [INFO ] Deduced a trap composed of 46 places in 339 ms of which 1 ms to minimize.
[2023-03-22 23:11:55] [INFO ] Deduced a trap composed of 31 places in 207 ms of which 1 ms to minimize.
[2023-03-22 23:11:55] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 5 ms to minimize.
[2023-03-22 23:11:55] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 1 ms to minimize.
[2023-03-22 23:11:55] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 0 ms to minimize.
[2023-03-22 23:11:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1467 ms
[2023-03-22 23:11:56] [INFO ] After 15206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 413 ms.
[2023-03-22 23:11:56] [INFO ] After 16433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 148 ms.
Support contains 14 out of 1563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Drop transitions removed 374 transitions
Trivial Post-agglo rules discarded 374 transitions
Performed 374 trivial Post agglomeration. Transition count delta: 374
Iterating post reduction 0 with 374 rules applied. Total rules applied 374 place count 1563 transition count 1049
Reduce places removed 374 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 376 rules applied. Total rules applied 750 place count 1189 transition count 1047
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 752 place count 1188 transition count 1046
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 753 place count 1187 transition count 1046
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 81 Pre rules applied. Total rules applied 753 place count 1187 transition count 965
Deduced a syphon composed of 81 places in 3 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 4 with 162 rules applied. Total rules applied 915 place count 1106 transition count 965
Discarding 136 places :
Symmetric choice reduction at 4 with 136 rule applications. Total rules 1051 place count 970 transition count 829
Iterating global reduction 4 with 136 rules applied. Total rules applied 1187 place count 970 transition count 829
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 1187 place count 970 transition count 771
Deduced a syphon composed of 58 places in 5 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1303 place count 912 transition count 771
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 336
Deduced a syphon composed of 336 places in 1 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 4 with 672 rules applied. Total rules applied 1975 place count 576 transition count 435
Renaming transitions due to excessive name length > 1024 char.
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 2089 place count 519 transition count 435
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2090 place count 519 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2091 place count 518 transition count 434
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 5 with 58 rules applied. Total rules applied 2149 place count 518 transition count 434
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2150 place count 517 transition count 433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2151 place count 516 transition count 433
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 2151 place count 516 transition count 431
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 2155 place count 514 transition count 431
Applied a total of 2155 rules in 428 ms. Remains 514 /1563 variables (removed 1049) and now considering 431/1423 (removed 992) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 429 ms. Remains : 514/1563 places, 431/1423 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) 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 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 209651 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 209651 steps, saw 175930 distinct states, run finished after 3003 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 431 rows 514 cols
[2023-03-22 23:12:00] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-22 23:12:00] [INFO ] [Real]Absence check using 220 positive place invariants in 39 ms returned sat
[2023-03-22 23:12:00] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 23:12:00] [INFO ] [Nat]Absence check using 220 positive place invariants in 42 ms returned sat
[2023-03-22 23:12:01] [INFO ] After 283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 23:12:01] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-22 23:12:01] [INFO ] After 128ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 23:12:01] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 2 ms to minimize.
[2023-03-22 23:12:01] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2023-03-22 23:12:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 387 ms
[2023-03-22 23:12:01] [INFO ] After 673ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-22 23:12:01] [INFO ] After 1245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 20 ms.
Support contains 14 out of 514 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 514/514 places, 431/431 transitions.
Applied a total of 0 rules in 22 ms. Remains 514 /514 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 514/514 places, 431/431 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 514/514 places, 431/431 transitions.
Applied a total of 0 rules in 19 ms. Remains 514 /514 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2023-03-22 23:12:01] [INFO ] Invariant cache hit.
[2023-03-22 23:12:02] [INFO ] Implicit Places using invariants in 396 ms returned [497, 501]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 410 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 512/514 places, 431/431 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 510 transition count 429
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 429
Applied a total of 4 rules in 28 ms. Remains 510 /512 variables (removed 2) and now considering 429/431 (removed 2) transitions.
// Phase 1: matrix 429 rows 510 cols
[2023-03-22 23:12:02] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-22 23:12:02] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-03-22 23:12:02] [INFO ] Invariant cache hit.
[2023-03-22 23:12:02] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 23:12:03] [INFO ] Implicit Places using invariants and state equation in 703 ms returned []
Implicit Place search using SMT with State Equation took 984 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 510/514 places, 429/431 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1452 ms. Remains : 510/514 places, 429/431 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 235793 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 235793 steps, saw 197841 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-22 23:12:06] [INFO ] Invariant cache hit.
[2023-03-22 23:12:07] [INFO ] [Real]Absence check using 218 positive place invariants in 26 ms returned sat
[2023-03-22 23:12:07] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 23:12:07] [INFO ] [Nat]Absence check using 218 positive place invariants in 27 ms returned sat
[2023-03-22 23:12:07] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 23:12:07] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 23:12:07] [INFO ] After 65ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 23:12:07] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2023-03-22 23:12:07] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2023-03-22 23:12:07] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
[2023-03-22 23:12:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 420 ms
[2023-03-22 23:12:08] [INFO ] After 616ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-22 23:12:08] [INFO ] After 1072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 58 ms.
Support contains 14 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 429/429 transitions.
Applied a total of 0 rules in 13 ms. Remains 510 /510 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 510/510 places, 429/429 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 429/429 transitions.
Applied a total of 0 rules in 10 ms. Remains 510 /510 variables (removed 0) and now considering 429/429 (removed 0) transitions.
[2023-03-22 23:12:08] [INFO ] Invariant cache hit.
[2023-03-22 23:12:08] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-22 23:12:08] [INFO ] Invariant cache hit.
[2023-03-22 23:12:08] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 23:12:09] [INFO ] Implicit Places using invariants and state equation in 794 ms returned []
Implicit Place search using SMT with State Equation took 1168 ms to find 0 implicit places.
[2023-03-22 23:12:09] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-22 23:12:09] [INFO ] Invariant cache hit.
[2023-03-22 23:12:09] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1517 ms. Remains : 510/510 places, 429/429 transitions.
Partial Free-agglomeration rule applied 110 times.
Drop transitions removed 110 transitions
Iterating global reduction 0 with 110 rules applied. Total rules applied 110 place count 510 transition count 429
Applied a total of 110 rules in 48 ms. Remains 510 /510 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 429 rows 510 cols
[2023-03-22 23:12:09] [INFO ] Computed 218 place invariants in 3 ms
[2023-03-22 23:12:10] [INFO ] [Real]Absence check using 218 positive place invariants in 79 ms returned sat
[2023-03-22 23:12:10] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 23:12:10] [INFO ] [Nat]Absence check using 218 positive place invariants in 53 ms returned sat
[2023-03-22 23:12:10] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 23:12:10] [INFO ] State equation strengthened by 104 read => feed constraints.
[2023-03-22 23:12:10] [INFO ] After 130ms SMT Verify possible using 104 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 23:12:10] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 0 ms to minimize.
[2023-03-22 23:12:10] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 1 ms to minimize.
[2023-03-22 23:12:10] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 1 ms to minimize.
[2023-03-22 23:12:11] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 0 ms to minimize.
[2023-03-22 23:12:11] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 0 ms to minimize.
[2023-03-22 23:12:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 617 ms
[2023-03-22 23:12:11] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 0 ms to minimize.
[2023-03-22 23:12:11] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2023-03-22 23:12:11] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 1 ms to minimize.
[2023-03-22 23:12:11] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 0 ms to minimize.
[2023-03-22 23:12:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 619 ms
[2023-03-22 23:12:11] [INFO ] After 1483ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-22 23:12:11] [INFO ] After 1955ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-22 23:12:12] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 10 ms.
[2023-03-22 23:12:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 510 places, 429 transitions and 1848 arcs took 7 ms.
[2023-03-22 23:12:12] [INFO ] Flatten gal took : 92 ms
Total runtime 33740 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: ShieldPPPt_PT_020B
(NrP: 510 NrTr: 429 NrArc: 1848)

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

net check time: 0m 0.000sec

init dd package: 0m 2.833sec


before gc: list nodes free: 339994

after gc: idd nodes used:238083, unused:63761917; list nodes free:288302206

before gc: list nodes free: 108249

after gc: idd nodes used:326843, unused:63673157; list nodes free:292075218

before gc: list nodes free: 920423

after gc: idd nodes used:268907, unused:63731093; list nodes free:296540213

before gc: list nodes free: 1193416

after gc: idd nodes used:336795, unused:63663205; list nodes free:296205655

before gc: list nodes free: 1163411

after gc: idd nodes used:474655, unused:63525345; list nodes free:295509611

before gc: list nodes free: 1852352

after gc: idd nodes used:396687, unused:63603313; list nodes free:298011832
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6026108 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095296 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

244902 174986 108282 343734 337438

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="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 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 r394-oct2-167903718100638"
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 ;