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

About the Execution of Marcie+red for ShieldRVt-PT-003B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5448.552 12415.00 18520.00 60.10 TFFTTTFTFTTFFFFT 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-167905978600223.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 ShieldRVt-PT-003B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978600223
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.5K Feb 25 22:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 22:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 22:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 22:49 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.3K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 22:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 25 22:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 22:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 22:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:03 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 36K 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 ShieldRVt-PT-003B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-003B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-003B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-003B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-003B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-003B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-003B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-003B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-003B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-003B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-003B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-003B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-003B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-003B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-003B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-003B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679346413900

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-003B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 21:06:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 21:06:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:06:55] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2023-03-20 21:06:55] [INFO ] Transformed 153 places.
[2023-03-20 21:06:55] [INFO ] Transformed 153 transitions.
[2023-03-20 21:06:55] [INFO ] Found NUPN structural information;
[2023-03-20 21:06:55] [INFO ] Parsed PT model containing 153 places and 153 transitions and 360 arcs in 86 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 16) seen :10
FORMULA ShieldRVt-PT-003B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-003B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-003B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-003B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-003B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-003B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-003B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-003B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-003B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-003B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) 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 6) seen :1
FORMULA ShieldRVt-PT-003B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :1
FORMULA ShieldRVt-PT-003B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 153 rows 153 cols
[2023-03-20 21:06:56] [INFO ] Computed 13 place invariants in 7 ms
[2023-03-20 21:06:56] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 21:06:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-20 21:06:56] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-20 21:06:56] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 6 ms to minimize.
[2023-03-20 21:06:56] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2023-03-20 21:06:56] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2023-03-20 21:06:56] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2023-03-20 21:06:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 185 ms
[2023-03-20 21:06:56] [INFO ] After 318ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-20 21:06:56] [INFO ] After 430ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
FORMULA ShieldRVt-PT-003B-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVt-PT-003B-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
FORMULA ShieldRVt-PT-003B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 10 ms.
Support contains 29 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 153/153 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 153 transition count 127
Reduce places removed 26 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 30 rules applied. Total rules applied 56 place count 127 transition count 123
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 60 place count 123 transition count 123
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 60 place count 123 transition count 109
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 88 place count 109 transition count 109
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 105 place count 92 transition count 92
Iterating global reduction 3 with 17 rules applied. Total rules applied 122 place count 92 transition count 92
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 122 place count 92 transition count 89
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 128 place count 89 transition count 89
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 168 place count 69 transition count 69
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 174 place count 66 transition count 71
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 175 place count 66 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 65 transition count 70
Applied a total of 176 rules in 56 ms. Remains 65 /153 variables (removed 88) and now considering 70/153 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 65/153 places, 70/153 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3059161 steps, run timeout after 3001 ms. (steps per millisecond=1019 ) properties seen :{}
Probabilistic random walk after 3059161 steps, saw 840476 distinct states, run finished after 3002 ms. (steps per millisecond=1019 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 65 cols
[2023-03-20 21:07:00] [INFO ] Computed 13 place invariants in 7 ms
[2023-03-20 21:07:00] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 21:07:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-20 21:07:00] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 21:07:00] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-20 21:07:00] [INFO ] After 11ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 21:07:00] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-20 21:07:00] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 29 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 70/70 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 65/65 places, 70/70 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 70/70 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2023-03-20 21:07:00] [INFO ] Invariant cache hit.
[2023-03-20 21:07:00] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-20 21:07:00] [INFO ] Invariant cache hit.
[2023-03-20 21:07:00] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-20 21:07:00] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-20 21:07:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 21:07:00] [INFO ] Invariant cache hit.
[2023-03-20 21:07:00] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 65/65 places, 70/70 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 65 transition count 66
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 65 transition count 66
Applied a total of 5 rules in 5 ms. Remains 65 /65 variables (removed 0) and now considering 66/70 (removed 4) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 65 cols
[2023-03-20 21:07:00] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-20 21:07:00] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 21:07:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-20 21:07:00] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 21:07:00] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-20 21:07:00] [INFO ] After 104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-20 21:07:00] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-20 21:07:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 65 places, 70 transitions and 226 arcs took 2 ms.
[2023-03-20 21:07:00] [INFO ] Flatten gal took : 29 ms
Total runtime 5245 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldRVt_PT_003B
(NrP: 65 NrTr: 70 NrArc: 226)

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

net check time: 0m 0.000sec

init dd package: 0m 3.170sec


RS generation: 0m 0.037sec


-> reachability set: #nodes 1643 (1.6e+03) #states 51,979,478 (7)



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

checking: AG [[[[p4<=0 & 0<=p4] | [[p21<=0 & 0<=p21] | [p59<=1 & 1<=p59]]] | [[[[[[[[[p47<=1 & 1<=p47] & [[p48<=1 & 1<=p48] & [p58<=1 & 1<=p58]]] | [p39<=0 & 0<=p39]] | [[p24<=0 & 0<=p24] | [p12<=0 & 0<=p12]]] | [[p55<=0 & 0<=p55] | [[p10<=1 & 1<=p10] | [p42<=1 & 1<=p42]]]] & [[[[p14<=0 & 0<=p14] | [p17<=0 & 0<=p17]] | [[p29<=0 & 0<=p29] | [p44<=0 & 0<=p44]]] & [[p39<=1 & 1<=p39] | [[p28<=0 & 0<=p28] & [[p63<=1 & 1<=p63] | [p57<=0 & 0<=p57]]]]]] & [[p45<=0 & 0<=p45] & [[p36<=0 & 0<=p36] & [p52<=0 & 0<=p52]]]] | [[p22<=0 & 0<=p22] & [[p41<=0 & 0<=p41] & [[[p31<=0 & 0<=p31] | [p43<=0 & 0<=p43]] | [[p18<=0 & 0<=p18] | [p34<=0 & 0<=p34]]]]]] | [p51<=1 & 1<=p51]]]]
normalized: ~ [E [true U ~ [[[[p51<=1 & 1<=p51] | [[[p22<=0 & 0<=p22] & [[[[p18<=0 & 0<=p18] | [p34<=0 & 0<=p34]] | [[p43<=0 & 0<=p43] | [p31<=0 & 0<=p31]]] & [p41<=0 & 0<=p41]]] | [[[p45<=0 & 0<=p45] & [[p52<=0 & 0<=p52] & [p36<=0 & 0<=p36]]] & [[[[[[p57<=0 & 0<=p57] | [p63<=1 & 1<=p63]] & [p28<=0 & 0<=p28]] | [p39<=1 & 1<=p39]] & [[[p44<=0 & 0<=p44] | [p29<=0 & 0<=p29]] | [[p17<=0 & 0<=p17] | [p14<=0 & 0<=p14]]]] & [[[[p42<=1 & 1<=p42] | [p10<=1 & 1<=p10]] | [p55<=0 & 0<=p55]] | [[[p12<=0 & 0<=p12] | [p24<=0 & 0<=p24]] | [[p39<=0 & 0<=p39] | [[[p58<=1 & 1<=p58] & [p48<=1 & 1<=p48]] & [p47<=1 & 1<=p47]]]]]]]]] | [[[p59<=1 & 1<=p59] | [p21<=0 & 0<=p21]] | [p4<=0 & 0<=p4]]]]]]

abstracting: (0<=p4)
states: 51,979,478 (7)
abstracting: (p4<=0)
states: 51,672,442 (7)
abstracting: (0<=p21)
states: 51,979,478 (7)
abstracting: (p21<=0)
states: 41,594,936 (7)
abstracting: (1<=p59)
states: 87
abstracting: (p59<=1)
states: 51,979,478 (7)
abstracting: (1<=p47)
states: 6,323,901 (6)
abstracting: (p47<=1)
states: 51,979,478 (7)
abstracting: (1<=p48)
states: 16,613,604 (7)
abstracting: (p48<=1)
states: 51,979,478 (7)
abstracting: (1<=p58)
states: 7,561,500 (6)
abstracting: (p58<=1)
states: 51,979,478 (7)
abstracting: (0<=p39)
states: 51,979,478 (7)
abstracting: (p39<=0)
states: 50,164,691 (7)
abstracting: (0<=p24)
states: 51,979,478 (7)
abstracting: (p24<=0)
states: 34,591,478 (7)
abstracting: (0<=p12)
states: 51,979,478 (7)
abstracting: (p12<=0)
states: 45,170,654 (7)
abstracting: (0<=p55)
states: 51,979,478 (7)
abstracting: (p55<=0)
states: 44,417,978 (7)
abstracting: (1<=p10)
states: 11,136,424 (7)
abstracting: (p10<=1)
states: 51,979,478 (7)
abstracting: (1<=p42)
states: 6,323,814 (6)
abstracting: (p42<=1)
states: 51,979,478 (7)
abstracting: (0<=p14)
states: 51,979,478 (7)
abstracting: (p14<=0)
states: 37,120,454 (7)
abstracting: (0<=p17)
states: 51,979,478 (7)
abstracting: (p17<=0)
states: 34,649,558 (7)
abstracting: (0<=p29)
states: 51,979,478 (7)
abstracting: (p29<=0)
states: 43,318,238 (7)
abstracting: (0<=p44)
states: 51,979,478 (7)
abstracting: (p44<=0)
states: 45,655,664 (7)
abstracting: (1<=p39)
states: 1,814,787 (6)
abstracting: (p39<=1)
states: 51,979,478 (7)
abstracting: (0<=p28)
states: 51,979,478 (7)
abstracting: (p28<=0)
states: 43,318,238 (7)
abstracting: (1<=p63)
states: 12,940,851 (7)
abstracting: (p63<=1)
states: 51,979,478 (7)
abstracting: (0<=p57)
states: 51,979,478 (7)
abstracting: (p57<=0)
states: 44,417,978 (7)
abstracting: (0<=p36)
states: 51,979,478 (7)
abstracting: (p36<=0)
states: 41,716,022 (7)
abstracting: (0<=p52)
states: 51,979,478 (7)
abstracting: (p52<=0)
states: 45,367,790 (7)
abstracting: (0<=p45)
states: 51,979,478 (7)
abstracting: (p45<=0)
states: 45,655,664 (7)
abstracting: (0<=p41)
states: 51,979,478 (7)
abstracting: (p41<=0)
states: 46,081,688 (7)
abstracting: (0<=p31)
states: 51,979,478 (7)
abstracting: (p31<=0)
states: 43,318,238 (7)
abstracting: (0<=p43)
states: 51,979,478 (7)
abstracting: (p43<=0)
states: 45,655,664 (7)
abstracting: (0<=p34)
states: 51,979,478 (7)
abstracting: (p34<=0)
states: 41,554,574 (7)
abstracting: (0<=p18)
states: 51,979,478 (7)
abstracting: (p18<=0)
states: 51,971,666 (7)
abstracting: (0<=p22)
states: 51,979,478 (7)
abstracting: (p22<=0)
states: 41,594,936 (7)
abstracting: (1<=p51)
states: 87
abstracting: (p51<=1)
states: 51,979,478 (7)
-> the formula is FALSE

FORMULA ShieldRVt-PT-003B-ReachabilityFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.052sec

totally nodes used: 66698 (6.7e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 88114 237163 325277
used/not used/entry size/cache size: 273729 66835135 16 1024MB
basic ops cache: hits/miss/sum: 28883 79741 108624
used/not used/entry size/cache size: 153811 16623405 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: 7286 17528 24814
used/not used/entry size/cache size: 17528 8371080 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 67043642
1 63786
2 1396
3 40
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.466sec


BK_STOP 1679346426315

--------------------
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 ReachabilityFireability -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


iterations count:4670 (66), effective:917 (13)

initing FirstDep: 0m 0.000sec


iterations count:747 (10), effective:123 (1)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-003B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldRVt-PT-003B, examination is ReachabilityFireability"
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-167905978600223"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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