About the Execution of Marcie+red for ResAllocation-PT-R010C002
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5449.884 | 8693.00 | 12341.00 | 266.60 | FFFTFFFTTTFTFTTF | 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.r330-tall-167889203700742.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 ResAllocation-PT-R010C002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203700742
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.8K Feb 25 15:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 15:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 15:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 15:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 15:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 15:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 15:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 15:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 43K 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 ResAllocation-PT-R010C002-ReachabilityCardinality-00
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-01
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-02
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-03
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-04
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-05
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-06
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-07
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-08
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-09
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-10
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-11
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-12
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-13
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-14
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679181651007
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=ResAllocation-PT-R010C002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:20:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 23:20:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:20:52] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2023-03-18 23:20:52] [INFO ] Transformed 40 places.
[2023-03-18 23:20:52] [INFO ] Transformed 22 transitions.
[2023-03-18 23:20:52] [INFO ] Parsed PT model containing 40 places and 22 transitions and 100 arcs in 88 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 296 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 14) seen :1
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 79 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :0
Probably explored full state space saw : 6144 states, properties seen :0
Probabilistic random walk after 26624 steps, saw 6144 distinct states, run finished after 197 ms. (steps per millisecond=135 ) properties seen :0
Explored full state space saw : 6144 states, properties seen :0
Exhaustive walk after 26624 steps, saw 6144 distinct states, run finished after 167 ms. (steps per millisecond=159 ) properties seen :0
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 1866 ms.
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: ResAllocation_PT_R010C002
(NrP: 40 NrTr: 22 NrArc: 100)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.715sec
RS generation: 0m 0.002sec
-> reachability set: #nodes 116 (1.2e+02) #states 6,144 (3)
starting MCC model checker
--------------------------
checking: EF [~ [r_1_7<=1]]
normalized: E [true U ~ [r_1_7<=1]]
abstracting: (r_1_7<=1)
states: 6,144 (3)
-> the formula is FALSE
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [r_0_9<=1]
normalized: ~ [E [true U ~ [r_0_9<=1]]]
abstracting: (r_0_9<=1)
states: 6,144 (3)
-> the formula is TRUE
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [r_1_5<=1]]
normalized: E [true U ~ [r_1_5<=1]]
abstracting: (r_1_5<=1)
states: 6,144 (3)
-> the formula is FALSE
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [p_1_7<=1]
normalized: ~ [E [true U ~ [p_1_7<=1]]]
abstracting: (p_1_7<=1)
states: 6,144 (3)
-> the formula is TRUE
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [p_1_8<=1]
normalized: ~ [E [true U ~ [p_1_8<=1]]]
abstracting: (p_1_8<=1)
states: 6,144 (3)
-> the formula is TRUE
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [1<=r_1_6]]
normalized: E [true U ~ [1<=r_1_6]]
abstracting: (1<=r_1_6)
states: 4,096 (3)
-> the formula is TRUE
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [~ [1<=r_1_4]]
normalized: ~ [E [true U 1<=r_1_4]]
abstracting: (1<=r_1_4)
states: 4,608 (3)
-> the formula is FALSE
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [[p_1_1<=1 | r_1_4<=1]]]
normalized: E [true U ~ [[p_1_1<=1 | r_1_4<=1]]]
abstracting: (r_1_4<=1)
states: 6,144 (3)
abstracting: (p_1_1<=1)
states: 6,144 (3)
-> the formula is FALSE
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [r_0_4<=r_1_3]
normalized: E [true U r_0_4<=r_1_3]
abstracting: (r_0_4<=r_1_3)
states: 5,504 (3)
-> the formula is TRUE
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[r_0_4<=1 | [[p_0_5<=1 | [r_1_4<=1 & r_1_9<=0]] & r_0_9<=p_0_9]]]
normalized: ~ [E [true U ~ [[r_0_4<=1 | [r_0_9<=p_0_9 & [p_0_5<=1 | [r_1_4<=1 & r_1_9<=0]]]]]]]
abstracting: (r_1_9<=0)
states: 2,816 (3)
abstracting: (r_1_4<=1)
states: 6,144 (3)
abstracting: (p_0_5<=1)
states: 6,144 (3)
abstracting: (r_0_9<=p_0_9)
states: 3,328 (3)
abstracting: (r_0_4<=1)
states: 6,144 (3)
-> the formula is TRUE
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [[[p_0_3<=r_1_6 | [[[[[[1<=p_1_0 | 1<=r_0_5] & ~ [r_0_5<=r_1_3]] & p_1_3<=1] & ~ [r_0_3<=p_1_5]] | [~ [[1<=r_1_5 | [p_0_9<=r_1_8 & p_0_6<=p_1_1]]] & ~ [1<=r_0_3]]] | ~ [r_0_0<=0]]] | 1<=r_1_2]]]
normalized: E [true U ~ [[[[~ [r_0_0<=0] | [[~ [1<=r_0_3] & ~ [[[p_0_9<=r_1_8 & p_0_6<=p_1_1] | 1<=r_1_5]]] | [~ [r_0_3<=p_1_5] & [[~ [r_0_5<=r_1_3] & [1<=p_1_0 | 1<=r_0_5]] & p_1_3<=1]]]] | p_0_3<=r_1_6] | 1<=r_1_2]]]
abstracting: (1<=r_1_2)
states: 5,120 (3)
abstracting: (p_0_3<=r_1_6)
states: 5,632 (3)
abstracting: (p_1_3<=1)
states: 6,144 (3)
abstracting: (1<=r_0_5)
states: 2,816 (3)
abstracting: (1<=p_1_0)
states: 512
abstracting: (r_0_5<=r_1_3)
states: 5,504 (3)
abstracting: (r_0_3<=p_1_5)
states: 4,096 (3)
abstracting: (1<=r_1_5)
states: 4,352 (3)
abstracting: (p_0_6<=p_1_1)
states: 4,864 (3)
abstracting: (p_0_9<=r_1_8)
states: 6,144 (3)
abstracting: (1<=r_0_3)
states: 2,816 (3)
abstracting: (r_0_0<=0)
states: 3,328 (3)
-> the formula is FALSE
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[[[~ [[[[r_1_9<=0 | ~ [[r_0_3<=1 | r_1_0<=0]]] | r_1_2<=0] | 1<=p_0_0]] & ~ [p_0_2<=0]] & [[1<=p_1_8 & ~ [[[[~ [p_1_2<=p_0_5] & ~ [1<=p_0_6]] & 1<=p_1_3] & [r_1_6<=p_0_7 & 1<=p_1_0]]]] & p_0_0<=1]] & [~ [p_0_3<=1] & 1<=p_0_6]]]
normalized: E [true U [[~ [p_0_3<=1] & 1<=p_0_6] & [[[~ [[[r_1_6<=p_0_7 & 1<=p_1_0] & [[~ [1<=p_0_6] & ~ [p_1_2<=p_0_5]] & 1<=p_1_3]]] & 1<=p_1_8] & p_0_0<=1] & [~ [p_0_2<=0] & ~ [[[[~ [[r_0_3<=1 | r_1_0<=0]] | r_1_9<=0] | r_1_2<=0] | 1<=p_0_0]]]]]]
abstracting: (1<=p_0_0)
states: 2,816 (3)
abstracting: (r_1_2<=0)
states: 1,024 (3)
abstracting: (r_1_9<=0)
states: 2,816 (3)
abstracting: (r_1_0<=0)
states: 512
abstracting: (r_0_3<=1)
states: 6,144 (3)
abstracting: (p_0_2<=0)
states: 3,840 (3)
abstracting: (p_0_0<=1)
states: 6,144 (3)
abstracting: (1<=p_1_8)
states: 2,560 (3)
abstracting: (1<=p_1_3)
states: 1,280 (3)
abstracting: (p_1_2<=p_0_5)
states: 5,120 (3)
abstracting: (1<=p_0_6)
states: 1,280 (3)
abstracting: (1<=p_1_0)
states: 512
abstracting: (r_1_6<=p_0_7)
states: 3,072 (3)
abstracting: (1<=p_0_6)
states: 1,280 (3)
abstracting: (p_0_3<=1)
states: 6,144 (3)
-> the formula is FALSE
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[[r_1_6<=1 & [[[~ [[[[p_1_7<=1 | r_0_0<=0] & ~ [p_1_4<=0]] | p_1_3<=0]] | [[[[r_0_8<=p_0_3 & 1<=p_0_6] & r_0_6<=r_0_1] | ~ [r_0_1<=0]] | p_1_9<=r_1_9]] | ~ [p_1_7<=1]] | [~ [p_0_7<=r_1_8] & [~ [1<=p_0_6] & [[~ [[1<=p_0_6 | 1<=p_0_0]] | [[p_1_1<=0 & r_0_2<=r_1_7] & [r_0_2<=1 & 1<=r_1_8]]] | 1<=r_0_0]]]]] | p_0_6<=r_0_3]]
normalized: ~ [E [true U ~ [[[[[~ [p_1_7<=1] | [[[~ [r_0_1<=0] | [[r_0_8<=p_0_3 & 1<=p_0_6] & r_0_6<=r_0_1]] | p_1_9<=r_1_9] | ~ [[[~ [p_1_4<=0] & [p_1_7<=1 | r_0_0<=0]] | p_1_3<=0]]]] | [[[1<=r_0_0 | [[[r_0_2<=1 & 1<=r_1_8] & [p_1_1<=0 & r_0_2<=r_1_7]] | ~ [[1<=p_0_6 | 1<=p_0_0]]]] & ~ [1<=p_0_6]] & ~ [p_0_7<=r_1_8]]] & r_1_6<=1] | p_0_6<=r_0_3]]]]
abstracting: (p_0_6<=r_0_3)
states: 5,504 (3)
abstracting: (r_1_6<=1)
states: 6,144 (3)
abstracting: (p_0_7<=r_1_8)
states: 5,888 (3)
abstracting: (1<=p_0_6)
states: 1,280 (3)
abstracting: (1<=p_0_0)
states: 2,816 (3)
abstracting: (1<=p_0_6)
states: 1,280 (3)
abstracting: (r_0_2<=r_1_7)
states: 5,120 (3)
abstracting: (p_1_1<=0)
states: 5,376 (3)
abstracting: (1<=r_1_8)
states: 3,584 (3)
abstracting: (r_0_2<=1)
states: 6,144 (3)
abstracting: (1<=r_0_0)
states: 2,816 (3)
abstracting: (p_1_3<=0)
states: 4,864 (3)
abstracting: (r_0_0<=0)
states: 3,328 (3)
abstracting: (p_1_7<=1)
states: 6,144 (3)
abstracting: (p_1_4<=0)
states: 4,608 (3)
abstracting: (p_1_9<=r_1_9)
states: 3,328 (3)
abstracting: (r_0_6<=r_0_1)
states: 4,608 (3)
abstracting: (1<=p_0_6)
states: 1,280 (3)
abstracting: (r_0_8<=p_0_3)
states: 4,224 (3)
abstracting: (r_0_1<=0)
states: 3,328 (3)
abstracting: (p_1_7<=1)
states: 6,144 (3)
-> the formula is TRUE
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[~ [[[[~ [[p_0_2<=1 & ~ [[r_0_7<=r_1_7 | p_0_6<=0]]]] | 1<=p_1_6] & [[r_1_3<=1 | p_0_8<=r_0_4] | ~ [[r_0_0<=0 & 1<=p_0_9]]]] | [1<=p_1_3 & [1<=r_1_2 | [[[[r_0_2<=r_0_0 & p_0_5<=r_1_7] | [p_1_1<=r_0_4 & 1<=r_0_0]] & p_1_5<=p_0_4] & [~ [[p_1_6<=r_1_7 & 1<=p_1_6]] & ~ [[r_1_8<=0 & r_0_7<=1]]]]]]]] & p_0_8<=p_1_0]]
normalized: E [true U [~ [[[[[[~ [[r_1_8<=0 & r_0_7<=1]] & ~ [[p_1_6<=r_1_7 & 1<=p_1_6]]] & [[[p_1_1<=r_0_4 & 1<=r_0_0] | [r_0_2<=r_0_0 & p_0_5<=r_1_7]] & p_1_5<=p_0_4]] | 1<=r_1_2] & 1<=p_1_3] | [[~ [[r_0_0<=0 & 1<=p_0_9]] | [r_1_3<=1 | p_0_8<=r_0_4]] & [~ [[~ [[r_0_7<=r_1_7 | p_0_6<=0]] & p_0_2<=1]] | 1<=p_1_6]]]] & p_0_8<=p_1_0]]
abstracting: (p_0_8<=p_1_0)
states: 5,376 (3)
abstracting: (1<=p_1_6)
states: 2,048 (3)
abstracting: (p_0_2<=1)
states: 6,144 (3)
abstracting: (p_0_6<=0)
states: 4,864 (3)
abstracting: (r_0_7<=r_1_7)
states: 6,144 (3)
abstracting: (p_0_8<=r_0_4)
states: 5,760 (3)
abstracting: (r_1_3<=1)
states: 6,144 (3)
abstracting: (1<=p_0_9)
states: 512
abstracting: (r_0_0<=0)
states: 3,328 (3)
abstracting: (1<=p_1_3)
states: 1,280 (3)
abstracting: (1<=r_1_2)
states: 5,120 (3)
abstracting: (p_1_5<=p_0_4)
states: 4,608 (3)
abstracting: (p_0_5<=r_1_7)
states: 5,760 (3)
abstracting: (r_0_2<=r_0_0)
states: 4,608 (3)
abstracting: (1<=r_0_0)
states: 2,816 (3)
abstracting: (p_1_1<=r_0_4)
states: 5,760 (3)
abstracting: (1<=p_1_6)
states: 2,048 (3)
abstracting: (p_1_6<=r_1_7)
states: 5,120 (3)
abstracting: (r_0_7<=1)
states: 6,144 (3)
abstracting: (r_1_8<=0)
states: 2,560 (3)
-> the formula is FALSE
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[[1<=p_1_7 & [[~ [[p_1_8<=0 & ~ [[~ [1<=r_1_0] | ~ [r_0_1<=r_0_0]]]]] & ~ [r_0_4<=p_1_0]] & [[r_0_7<=1 | r_1_4<=r_1_5] & ~ [1<=p_1_0]]]] & [~ [[~ [[r_1_9<=p_1_9 | [[~ [1<=p_0_7] | ~ [p_0_1<=0]] | [[r_1_9<=0 | 1<=p_0_6] | ~ [1<=p_0_1]]]]] | [[p_0_0<=0 | r_1_7<=0] | ~ [[[[p_0_0<=r_0_2 & 1<=r_0_0] | [p_0_7<=0 | r_0_6<=0]] | [~ [1<=p_0_2] & [1<=p_0_1 & r_0_3<=1]]]]]]] | [p_0_4<=1 & ~ [p_0_0<=p_0_0]]]]]
normalized: E [true U [[[~ [p_0_0<=p_0_0] & p_0_4<=1] | ~ [[[~ [[[[1<=p_0_1 & r_0_3<=1] & ~ [1<=p_0_2]] | [[p_0_7<=0 | r_0_6<=0] | [p_0_0<=r_0_2 & 1<=r_0_0]]]] | [p_0_0<=0 | r_1_7<=0]] | ~ [[[[~ [1<=p_0_1] | [r_1_9<=0 | 1<=p_0_6]] | [~ [p_0_1<=0] | ~ [1<=p_0_7]]] | r_1_9<=p_1_9]]]]] & [[[~ [1<=p_1_0] & [r_0_7<=1 | r_1_4<=r_1_5]] & [~ [r_0_4<=p_1_0] & ~ [[~ [[~ [r_0_1<=r_0_0] | ~ [1<=r_1_0]]] & p_1_8<=0]]]] & 1<=p_1_7]]]
abstracting: (1<=p_1_7)
states: 2,304 (3)
abstracting: (p_1_8<=0)
states: 3,584 (3)
abstracting: (1<=r_1_0)
states: 5,632 (3)
abstracting: (r_0_1<=r_0_0)
states: 4,608 (3)
abstracting: (r_0_4<=p_1_0)
states: 3,584 (3)
abstracting: (r_1_4<=r_1_5)
states: 5,120 (3)
abstracting: (r_0_7<=1)
states: 6,144 (3)
abstracting: (1<=p_1_0)
states: 512
abstracting: (r_1_9<=p_1_9)
states: 2,816 (3)
abstracting: (1<=p_0_7)
states: 1,024 (3)
abstracting: (p_0_1<=0)
states: 3,584 (3)
abstracting: (1<=p_0_6)
states: 1,280 (3)
abstracting: (r_1_9<=0)
states: 2,816 (3)
abstracting: (1<=p_0_1)
states: 2,560 (3)
abstracting: (r_1_7<=0)
states: 2,304 (3)
abstracting: (p_0_0<=0)
states: 3,328 (3)
abstracting: (1<=r_0_0)
states: 2,816 (3)
abstracting: (p_0_0<=r_0_2)
states: 4,608 (3)
abstracting: (r_0_6<=0)
states: 3,328 (3)
abstracting: (p_0_7<=0)
states: 5,120 (3)
abstracting: (1<=p_0_2)
states: 2,304 (3)
abstracting: (r_0_3<=1)
states: 6,144 (3)
abstracting: (1<=p_0_1)
states: 2,560 (3)
abstracting: (p_0_4<=1)
states: 6,144 (3)
abstracting: (p_0_0<=p_0_0)
states: 6,144 (3)
-> the formula is FALSE
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[[[~ [p_0_7<=r_1_4] & [r_0_1<=1 & [[r_1_6<=r_1_7 | ~ [1<=r_0_4]] | [p_1_6<=1 & ~ [[[1<=p_0_5 | r_0_1<=r_0_4] | r_0_7<=0]]]]]] & [[[[1<=r_1_9 | [~ [[p_0_5<=0 | p_0_0<=1]] & [p_1_8<=0 & ~ [p_0_4<=0]]]] & ~ [p_0_4<=0]] & ~ [[[p_1_8<=p_0_8 & [1<=p_0_4 & r_0_8<=1]] & [[r_0_8<=r_1_3 & p_1_5<=p_0_2] | [p_1_1<=0 & p_1_6<=p_1_8]]]]] | [~ [[r_1_3<=1 & [1<=r_0_1 & 1<=p_0_8]]] & r_0_9<=0]]] & [[[1<=r_1_6 & [[~ [[1<=p_0_9 | r_0_6<=p_1_5]] & [p_1_1<=0 & ~ [[r_1_4<=r_1_3 | r_1_9<=r_0_9]]]] | [[1<=p_0_0 | [[1<=p_0_1 | 1<=r_0_4] & [r_0_2<=0 & r_1_0<=p_0_6]]] & ~ [[[p_0_9<=p_1_6 | p_1_5<=p_1_4] & [p_1_5<=p_0_4 | 1<=p_0_5]]]]]] & ~ [r_0_5<=r_1_1]] & ~ [[~ [[~ [[r_0_3<=1 | 1<=p_1_0]] | [[[p_1_7<=p_1_7 | p_0_7<=1] | [p_0_8<=1 | p_1_6<=0]] & [[p_0_9<=p_0_9 | r_1_6<=0] & ~ [r_0_3<=p_1_3]]]]] & 1<=r_0_8]]]]]
normalized: E [true U [[~ [[1<=r_0_8 & ~ [[[[~ [r_0_3<=p_1_3] & [p_0_9<=p_0_9 | r_1_6<=0]] & [[p_0_8<=1 | p_1_6<=0] | [p_1_7<=p_1_7 | p_0_7<=1]]] | ~ [[r_0_3<=1 | 1<=p_1_0]]]]]] & [~ [r_0_5<=r_1_1] & [1<=r_1_6 & [[~ [[[p_1_5<=p_0_4 | 1<=p_0_5] & [p_0_9<=p_1_6 | p_1_5<=p_1_4]]] & [1<=p_0_0 | [[r_0_2<=0 & r_1_0<=p_0_6] & [1<=p_0_1 | 1<=r_0_4]]]] | [[p_1_1<=0 & ~ [[r_1_4<=r_1_3 | r_1_9<=r_0_9]]] & ~ [[1<=p_0_9 | r_0_6<=p_1_5]]]]]]] & [[[r_0_9<=0 & ~ [[r_1_3<=1 & [1<=r_0_1 & 1<=p_0_8]]]] | [~ [[[[p_1_1<=0 & p_1_6<=p_1_8] | [r_0_8<=r_1_3 & p_1_5<=p_0_2]] & [p_1_8<=p_0_8 & [1<=p_0_4 & r_0_8<=1]]]] & [~ [p_0_4<=0] & [1<=r_1_9 | [[p_1_8<=0 & ~ [p_0_4<=0]] & ~ [[p_0_5<=0 | p_0_0<=1]]]]]]] & [[r_0_1<=1 & [[p_1_6<=1 & ~ [[r_0_7<=0 | [1<=p_0_5 | r_0_1<=r_0_4]]]] | [r_1_6<=r_1_7 | ~ [1<=r_0_4]]]] & ~ [p_0_7<=r_1_4]]]]]
abstracting: (p_0_7<=r_1_4)
states: 6,144 (3)
abstracting: (1<=r_0_4)
states: 2,816 (3)
abstracting: (r_1_6<=r_1_7)
states: 4,864 (3)
abstracting: (r_0_1<=r_0_4)
states: 4,608 (3)
abstracting: (1<=p_0_5)
states: 1,536 (3)
abstracting: (r_0_7<=0)
states: 3,328 (3)
abstracting: (p_1_6<=1)
states: 6,144 (3)
abstracting: (r_0_1<=1)
states: 6,144 (3)
abstracting: (p_0_0<=1)
states: 6,144 (3)
abstracting: (p_0_5<=0)
states: 4,608 (3)
abstracting: (p_0_4<=0)
states: 4,352 (3)
abstracting: (p_1_8<=0)
states: 3,584 (3)
abstracting: (1<=r_1_9)
states: 3,328 (3)
abstracting: (p_0_4<=0)
states: 4,352 (3)
abstracting: (r_0_8<=1)
states: 6,144 (3)
abstracting: (1<=p_0_4)
states: 1,792 (3)
abstracting: (p_1_8<=p_0_8)
states: 3,584 (3)
abstracting: (p_1_5<=p_0_2)
states: 4,864 (3)
abstracting: (r_0_8<=r_1_3)
states: 5,504 (3)
abstracting: (p_1_6<=p_1_8)
states: 5,120 (3)
abstracting: (p_1_1<=0)
states: 5,376 (3)
abstracting: (1<=p_0_8)
states: 768
abstracting: (1<=r_0_1)
states: 2,816 (3)
abstracting: (r_1_3<=1)
states: 6,144 (3)
abstracting: (r_0_9<=0)
states: 3,328 (3)
abstracting: (r_0_6<=p_1_5)
states: 4,224 (3)
abstracting: (1<=p_0_9)
states: 512
abstracting: (r_1_9<=r_0_9)
states: 5,632 (3)
abstracting: (r_1_4<=r_1_3)
states: 5,504 (3)
abstracting: (p_1_1<=0)
states: 5,376 (3)
abstracting: (1<=r_0_4)
states: 2,816 (3)
abstracting: (1<=p_0_1)
states: 2,560 (3)
abstracting: (r_1_0<=p_0_6)
states: 1,792 (3)
abstracting: (r_0_2<=0)
states: 3,328 (3)
abstracting: (1<=p_0_0)
states: 2,816 (3)
abstracting: (p_1_5<=p_1_4)
states: 5,120 (3)
abstracting: (p_0_9<=p_1_6)
states: 5,632 (3)
abstracting: (1<=p_0_5)
states: 1,536 (3)
abstracting: (p_1_5<=p_0_4)
states: 4,608 (3)
abstracting: (1<=r_1_6)
states: 4,096 (3)
abstracting: (r_0_5<=r_1_1)
states: 5,760 (3)
abstracting: (1<=p_1_0)
states: 512
abstracting: (r_0_3<=1)
states: 6,144 (3)
abstracting: (p_0_7<=1)
states: 6,144 (3)
abstracting: (p_1_7<=p_1_7)
states: 6,144 (3)
abstracting: (p_1_6<=0)
states: 4,096 (3)
abstracting: (p_0_8<=1)
states: 6,144 (3)
abstracting: (r_1_6<=0)
states: 2,048 (3)
abstracting: (p_0_9<=p_0_9)
states: 6,144 (3)
abstracting: (r_0_3<=p_1_3)
states: 3,328 (3)
abstracting: (1<=r_0_8)
states: 2,816 (3)
-> the formula is FALSE
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
totally nodes used: 8706 (8.7e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 3268 12751 16019
used/not used/entry size/cache size: 15623 67093241 16 1024MB
basic ops cache: hits/miss/sum: 3695 15686 19381
used/not used/entry size/cache size: 29888 16747328 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: 924 2441 3365
used/not used/entry size/cache size: 2441 8386167 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 67100218
1 8586
2 60
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 4.301sec
BK_STOP 1679181659700
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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.000sec
iterations count:434 (19), effective:110 (5)
initing FirstDep: 0m 0.000sec
iterations count:60 (2), effective:14 (0)
iterations count:36 (1), effective:5 (0)
iterations count:42 (1), effective:6 (0)
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="ResAllocation-PT-R010C002"
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 ResAllocation-PT-R010C002, 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 r330-tall-167889203700742"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R010C002.tgz
mv ResAllocation-PT-R010C002 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 ;