fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r426-tajo-167905978900430
Last Updated
May 14, 2023

About the Execution of Marcie+red for SieveSingleMsgMbox-PT-d1m36

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8110.128 375715.00 388278.00 175.40 FFFTTTTFFFTFFTFT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978900430.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is SieveSingleMsgMbox-PT-d1m36, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978900430
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 7.5K Feb 26 10:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 10:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 10:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 10:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 26 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 10:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 10:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 450K 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 SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679352736565

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=SieveSingleMsgMbox-PT-d1m36
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 22:52:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 22:52:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 22:52:18] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2023-03-20 22:52:18] [INFO ] Transformed 1295 places.
[2023-03-20 22:52:18] [INFO ] Transformed 749 transitions.
[2023-03-20 22:52:18] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1036 places in 7 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2208 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 933 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 910 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 912 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 951 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 1035 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 425790 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{0=1}
Probabilistic random walk after 425790 steps, saw 196860 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :1
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 749 rows 259 cols
[2023-03-20 22:52:22] [INFO ] Computed 6 place invariants in 37 ms
[2023-03-20 22:52:22] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 22:52:22] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 22:52:22] [INFO ] After 159ms SMT Verify possible using state equation in real domain returned unsat :3 sat :1
[2023-03-20 22:52:22] [INFO ] State equation strengthened by 587 read => feed constraints.
[2023-03-20 22:52:22] [INFO ] After 166ms SMT Verify possible using 587 Read/Feed constraints in real domain returned unsat :3 sat :0 real:1
[2023-03-20 22:52:22] [INFO ] After 567ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2023-03-20 22:52:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 22:52:22] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2023-03-20 22:52:22] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-03-20 22:52:23] [INFO ] After 113ms SMT Verify possible using 587 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2023-03-20 22:52:23] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-20 22:52:23] [INFO ] After 504ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 241 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 241 transition count 507
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 303 place count 181 transition count 232
Iterating global reduction 1 with 60 rules applied. Total rules applied 363 place count 181 transition count 232
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 370 place count 181 transition count 225
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 414 place count 137 transition count 181
Iterating global reduction 2 with 44 rules applied. Total rules applied 458 place count 137 transition count 181
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 474 place count 137 transition count 165
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 500 place count 111 transition count 137
Iterating global reduction 3 with 26 rules applied. Total rules applied 526 place count 111 transition count 137
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 541 place count 111 transition count 122
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 549 place count 103 transition count 111
Iterating global reduction 4 with 8 rules applied. Total rules applied 557 place count 103 transition count 111
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 565 place count 95 transition count 103
Iterating global reduction 4 with 8 rules applied. Total rules applied 573 place count 95 transition count 103
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 578 place count 90 transition count 97
Iterating global reduction 4 with 5 rules applied. Total rules applied 583 place count 90 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 585 place count 90 transition count 95
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 590 place count 85 transition count 90
Iterating global reduction 5 with 5 rules applied. Total rules applied 595 place count 85 transition count 90
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 598 place count 82 transition count 87
Iterating global reduction 5 with 3 rules applied. Total rules applied 601 place count 82 transition count 87
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 602 place count 81 transition count 85
Iterating global reduction 5 with 1 rules applied. Total rules applied 603 place count 81 transition count 85
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 604 place count 80 transition count 84
Iterating global reduction 5 with 1 rules applied. Total rules applied 605 place count 80 transition count 84
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 606 place count 79 transition count 83
Iterating global reduction 5 with 1 rules applied. Total rules applied 607 place count 79 transition count 83
Applied a total of 607 rules in 69 ms. Remains 79 /259 variables (removed 180) and now considering 83/749 (removed 666) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 79/259 places, 83/749 transitions.
Incomplete random walk after 10000 steps, including 2240 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1033 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3261169 steps, run timeout after 3001 ms. (steps per millisecond=1086 ) properties seen :{}
Probabilistic random walk after 3261169 steps, saw 1507560 distinct states, run finished after 3002 ms. (steps per millisecond=1086 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 79 cols
[2023-03-20 22:52:26] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-20 22:52:26] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 22:52:26] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 22:52:26] [INFO ] After 42ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 22:52:26] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-20 22:52:26] [INFO ] After 17ms SMT Verify possible using 32 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 22:52:26] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 22:52:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 22:52:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 22:52:26] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 22:52:26] [INFO ] After 6ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 22:52:26] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-20 22:52:26] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 83/83 transitions.
Applied a total of 0 rules in 6 ms. Remains 79 /79 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 79/79 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 83/83 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-20 22:52:26] [INFO ] Invariant cache hit.
[2023-03-20 22:52:26] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-20 22:52:26] [INFO ] Invariant cache hit.
[2023-03-20 22:52:26] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-20 22:52:26] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-20 22:52:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 22:52:26] [INFO ] Invariant cache hit.
[2023-03-20 22:52:26] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 79/79 places, 83/83 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 79 transition count 77
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 75 transition count 77
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 10 place count 75 transition count 63
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 38 place count 61 transition count 63
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 48 place count 56 transition count 58
Applied a total of 48 rules in 8 ms. Remains 56 /79 variables (removed 23) and now considering 58/83 (removed 25) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 58 rows 56 cols
[2023-03-20 22:52:26] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-20 22:52:26] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 22:52:26] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 22:52:26] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 22:52:26] [INFO ] After 17ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-20 22:52:26] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2023-03-20 22:52:26] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 1 ms.
[2023-03-20 22:52:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 79 places, 83 transitions and 330 arcs took 1 ms.
[2023-03-20 22:52:26] [INFO ] Flatten gal took : 23 ms
Total runtime 8718 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: SieveSingleMsgMbox_PT_d1m36
(NrP: 79 NrTr: 83 NrArc: 330)

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

net check time: 0m 0.000sec

init dd package: 0m 3.089sec


RS generation: 5m24.953sec


-> reachability set: #nodes 57048 (5.7e+04) #states 11,132,998,531,267 (13)



starting MCC model checker
--------------------------

checking: AG [p67<=2]
normalized: ~ [E [true U ~ [p67<=2]]]

abstracting: (p67<=2)
states: 6,713,942,498,171 (12)
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m32.754sec

totally nodes used: 18455277 (1.8e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2508792539 709530506 3218323045
used/not used/entry size/cache size: 67097493 11371 16 1024MB
basic ops cache: hits/miss/sum: 24612794 5220139 29832933
used/not used/entry size/cache size: 7172369 9604847 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 528390 102919 631309
used/not used/entry size/cache size: 102364 8286244 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 52055652
1 12871116
2 1805931
3 225392
4 47332
5 24023
6 17459
7 5170
8 7639
9 6965
>= 10 42185

Total processing time: 6m 5.119sec


BK_STOP 1679353112280

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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.000sec

9857 28032 33250 72108 89289 154060 157518 149985 158015 135998 74559
iterations count:1103101 (13290), effective:29255 (352)

initing FirstDep: 0m 0.000sec


iterations count:14079 (169), effective:292 (3)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d1m36"
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 SieveSingleMsgMbox-PT-d1m36, 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 r426-tajo-167905978900430"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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