About the Execution of Marcie+red for ShieldIIPs-PT-002B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5518.315 | 21379.00 | 33992.00 | 50.20 | TTFTFTFTTTTTTTTF | normal |
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-167903717400030.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 ShieldIIPs-PT-002B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717400030
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.5K Feb 25 15:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 15:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 15:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 15:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 15:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:54 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 33K 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 ShieldIIPs-PT-002B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-002B-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679484486792
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=ShieldIIPs-PT-002B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 11:28:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 11:28:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 11:28:11] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-22 11:28:11] [INFO ] Transformed 123 places.
[2023-03-22 11:28:11] [INFO ] Transformed 121 transitions.
[2023-03-22 11:28:11] [INFO ] Found NUPN structural information;
[2023-03-22 11:28:11] [INFO ] Parsed PT model containing 123 places and 121 transitions and 362 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 29 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 11) seen :8
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :1
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 121 rows 123 cols
[2023-03-22 11:28:11] [INFO ] Computed 19 place invariants in 5 ms
[2023-03-22 11:28:12] [INFO ] After 372ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 11:28:12] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-22 11:28:12] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 11:28:12] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 9 ms to minimize.
[2023-03-22 11:28:12] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2023-03-22 11:28:12] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2023-03-22 11:28:12] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2023-03-22 11:28:12] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2023-03-22 11:28:12] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2023-03-22 11:28:12] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2023-03-22 11:28:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 617 ms
[2023-03-22 11:28:13] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2023-03-22 11:28:13] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2023-03-22 11:28:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 178 ms
[2023-03-22 11:28:13] [INFO ] After 974ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-22 11:28:13] [INFO ] After 1178ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 26 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 121/121 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 123 transition count 118
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 120 transition count 116
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 118 transition count 116
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 10 place count 118 transition count 106
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 30 place count 108 transition count 106
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 38 place count 100 transition count 98
Iterating global reduction 3 with 8 rules applied. Total rules applied 46 place count 100 transition count 98
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 46 place count 100 transition count 97
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 99 transition count 97
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 88 place count 79 transition count 77
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 98 place count 79 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 78 transition count 76
Applied a total of 99 rules in 69 ms. Remains 78 /123 variables (removed 45) and now considering 76/121 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 78/123 places, 76/121 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2237866 steps, run timeout after 3001 ms. (steps per millisecond=745 ) properties seen :{}
Probabilistic random walk after 2237866 steps, saw 419920 distinct states, run finished after 3002 ms. (steps per millisecond=745 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 76 rows 78 cols
[2023-03-22 11:28:16] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-22 11:28:16] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 11:28:16] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-22 11:28:16] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 11:28:16] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2023-03-22 11:28:16] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2023-03-22 11:28:16] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2023-03-22 11:28:17] [INFO ] Deduced a trap composed of 14 places in 711 ms of which 22 ms to minimize.
[2023-03-22 11:28:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1026 ms
[2023-03-22 11:28:17] [INFO ] After 1148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-22 11:28:17] [INFO ] After 1228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 26 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 76/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 78/78 places, 76/76 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 76/76 transitions.
Applied a total of 0 rules in 11 ms. Remains 78 /78 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2023-03-22 11:28:17] [INFO ] Invariant cache hit.
[2023-03-22 11:28:18] [INFO ] Implicit Places using invariants in 594 ms returned []
[2023-03-22 11:28:18] [INFO ] Invariant cache hit.
[2023-03-22 11:28:18] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
[2023-03-22 11:28:18] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 11:28:18] [INFO ] Invariant cache hit.
[2023-03-22 11:28:18] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 887 ms. Remains : 78/78 places, 76/76 transitions.
Applied a total of 0 rules in 4 ms. Remains 78 /78 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 11:28:18] [INFO ] Invariant cache hit.
[2023-03-22 11:28:18] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 11:28:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-03-22 11:28:18] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 11:28:18] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2023-03-22 11:28:18] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2023-03-22 11:28:19] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2023-03-22 11:28:19] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2023-03-22 11:28:19] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2023-03-22 11:28:19] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 26 ms to minimize.
[2023-03-22 11:28:19] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 12 ms to minimize.
[2023-03-22 11:28:19] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 709 ms
[2023-03-22 11:28:19] [INFO ] After 780ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-22 11:28:19] [INFO ] After 883ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 11:28:19] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 19 ms.
[2023-03-22 11:28:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 78 places, 76 transitions and 290 arcs took 3 ms.
[2023-03-22 11:28:19] [INFO ] Flatten gal took : 48 ms
Total runtime 9047 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: ShieldIIPs_PT_002B
(NrP: 78 NrTr: 76 NrArc: 290)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 3.034sec
RS generation: 0m 2.319sec
-> reachability set: #nodes 10574 (1.1e+04) #states 867,077,194 (8)
starting MCC model checker
--------------------------
checking: AG [[[[p66<=0 & 0<=p66] | [p76<=1 & 1<=p76]] | [[p6<=0 & 0<=p6] | [[[[[[0<=p70 & p70<=0] & [p50<=1 & 1<=p50]] | [p60<=1 & 1<=p60]] | [p63<=0 & 0<=p63]] & [[p3<=0 & 0<=p3] | [p38<=1 & 1<=p38]]] | [[[p34<=0 & 0<=p34] | [p5<=1 & 1<=p5]] & [[[p1<=1 & 1<=p1] | [[p61<=0 & 0<=p61] | [p62<=1 & 1<=p62]]] | [[p21<=1 & 1<=p21] | [[[p40<=0 & 0<=p40] & [p48<=1 & 1<=p48]] | [[[p17<=1 & 1<=p17] & [[p3<=0 & 0<=p3] | [p45<=1 & 1<=p45]]] & [[[p35<=1 & 1<=p35] | [[p43<=0 & 0<=p43] & [[p56<=1 & 1<=p56] & [p8<=0 & 0<=p8]]]] & [[p72<=1 & 1<=p72] | [[p74<=0 & 0<=p74] | [p25<=1 & 1<=p25]]]]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[[[[[p35<=1 & 1<=p35] | [[p43<=0 & 0<=p43] & [[p8<=0 & 0<=p8] & [p56<=1 & 1<=p56]]]] & [[[p25<=1 & 1<=p25] | [p74<=0 & 0<=p74]] | [p72<=1 & 1<=p72]]] & [[p17<=1 & 1<=p17] & [[p45<=1 & 1<=p45] | [p3<=0 & 0<=p3]]]] | [[p48<=1 & 1<=p48] & [p40<=0 & 0<=p40]]] | [p21<=1 & 1<=p21]] | [[[p62<=1 & 1<=p62] | [p61<=0 & 0<=p61]] | [p1<=1 & 1<=p1]]] & [[p5<=1 & 1<=p5] | [p34<=0 & 0<=p34]]] | [[[p38<=1 & 1<=p38] | [p3<=0 & 0<=p3]] & [[p63<=0 & 0<=p63] | [[p60<=1 & 1<=p60] | [[p50<=1 & 1<=p50] & [0<=p70 & p70<=0]]]]]] | [p6<=0 & 0<=p6]] | [[p76<=1 & 1<=p76] | [p66<=0 & 0<=p66]]]]]]
abstracting: (0<=p66)
states: 867,077,194 (8)
abstracting: (p66<=0)
states: 867,076,750 (8)
abstracting: (1<=p76)
states: 169,311,062 (8)
abstracting: (p76<=1)
states: 867,077,194 (8)
abstracting: (0<=p6)
states: 867,077,194 (8)
abstracting: (p6<=0)
states: 866,795,816 (8)
abstracting: (p70<=0)
states: 690,053,898 (8)
abstracting: (0<=p70)
states: 867,077,194 (8)
abstracting: (1<=p50)
states: 282,315,568 (8)
abstracting: (p50<=1)
states: 867,077,194 (8)
abstracting: (1<=p60)
states: 158,001,480 (8)
abstracting: (p60<=1)
states: 867,077,194 (8)
abstracting: (0<=p63)
states: 867,077,194 (8)
abstracting: (p63<=0)
states: 859,166,660 (8)
abstracting: (0<=p3)
states: 867,077,194 (8)
abstracting: (p3<=0)
states: 586,864,158 (8)
abstracting: (1<=p38)
states: 129,299,842 (8)
abstracting: (p38<=1)
states: 867,077,194 (8)
abstracting: (0<=p34)
states: 867,077,194 (8)
abstracting: (p34<=0)
states: 751,767,578 (8)
abstracting: (1<=p5)
states: 33,618 (4)
abstracting: (p5<=1)
states: 867,077,194 (8)
abstracting: (1<=p1)
states: 293,516,200 (8)
abstracting: (p1<=1)
states: 867,077,194 (8)
abstracting: (0<=p61)
states: 867,077,194 (8)
abstracting: (p61<=0)
states: 692,108,660 (8)
abstracting: (1<=p62)
states: 174,968,534 (8)
abstracting: (p62<=1)
states: 867,077,194 (8)
abstracting: (1<=p21)
states: 119,843,308 (8)
abstracting: (p21<=1)
states: 867,077,194 (8)
abstracting: (0<=p40)
states: 867,077,194 (8)
abstracting: (p40<=0)
states: 867,077,157 (8)
abstracting: (1<=p48)
states: 141,476,680 (8)
abstracting: (p48<=1)
states: 867,077,194 (8)
abstracting: (0<=p3)
states: 867,077,194 (8)
abstracting: (p3<=0)
states: 586,864,158 (8)
abstracting: (1<=p45)
states: 286,664,210 (8)
abstracting: (p45<=1)
states: 867,077,194 (8)
abstracting: (1<=p17)
states: 286,234,182 (8)
abstracting: (p17<=1)
states: 867,077,194 (8)
abstracting: (1<=p72)
states: 703
abstracting: (p72<=1)
states: 867,077,194 (8)
abstracting: (0<=p74)
states: 867,077,194 (8)
abstracting: (p74<=0)
states: 698,788,198 (8)
abstracting: (1<=p25)
states: 127,667,614 (8)
abstracting: (p25<=1)
states: 867,077,194 (8)
abstracting: (1<=p56)
states: 433,537,857 (8)
abstracting: (p56<=1)
states: 867,077,194 (8)
abstracting: (0<=p8)
states: 867,077,194 (8)
abstracting: (p8<=0)
states: 418,527,430 (8)
abstracting: (0<=p43)
states: 867,077,194 (8)
abstracting: (p43<=0)
states: 867,076,972 (8)
abstracting: (1<=p35)
states: 117,166,832 (8)
abstracting: (p35<=1)
states: 867,077,194 (8)
-> the formula is TRUE
FORMULA ShieldIIPs-PT-002B-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.223sec
totally nodes used: 1044021 (1.0e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 3147926 7700309 10848235
used/not used/entry size/cache size: 8036090 59072774 16 1024MB
basic ops cache: hits/miss/sum: 179810 486098 665908
used/not used/entry size/cache size: 869968 15907248 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: 32477 89514 121991
used/not used/entry size/cache size: 89245 8299363 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 66155790
1 874314
2 67883
3 9679
4 1096
5 92
6 10
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 7.923sec
BK_STOP 1679484508171
--------------------
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
iterations count:56604 (744), effective:8238 (108)
initing FirstDep: 0m 0.000sec
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="ShieldIIPs-PT-002B"
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 ShieldIIPs-PT-002B, 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-167903717400030"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-002B.tgz
mv ShieldIIPs-PT-002B 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 '
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 ;