About the Execution of Marcie for ResAllocation-PT-R003C015
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5450.115 | 5074.00 | 4970.00 | 100.00 | TTTTTTTTTFFFFTFT | 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.r321-tall-167889192500702.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 marcie
Input is ResAllocation-PT-R003C015, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r321-tall-167889192500702
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.8K Feb 25 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 15:19 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.8K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 15:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:44 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 107K 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-R003C015-ReachabilityCardinality-00
FORMULA_NAME ResAllocation-PT-R003C015-ReachabilityCardinality-01
FORMULA_NAME ResAllocation-PT-R003C015-ReachabilityCardinality-02
FORMULA_NAME ResAllocation-PT-R003C015-ReachabilityCardinality-03
FORMULA_NAME ResAllocation-PT-R003C015-ReachabilityCardinality-04
FORMULA_NAME ResAllocation-PT-R003C015-ReachabilityCardinality-05
FORMULA_NAME ResAllocation-PT-R003C015-ReachabilityCardinality-06
FORMULA_NAME ResAllocation-PT-R003C015-ReachabilityCardinality-07
FORMULA_NAME ResAllocation-PT-R003C015-ReachabilityCardinality-08
FORMULA_NAME ResAllocation-PT-R003C015-ReachabilityCardinality-09
FORMULA_NAME ResAllocation-PT-R003C015-ReachabilityCardinality-10
FORMULA_NAME ResAllocation-PT-R003C015-ReachabilityCardinality-11
FORMULA_NAME ResAllocation-PT-R003C015-ReachabilityCardinality-12
FORMULA_NAME ResAllocation-PT-R003C015-ReachabilityCardinality-13
FORMULA_NAME ResAllocation-PT-R003C015-ReachabilityCardinality-14
FORMULA_NAME ResAllocation-PT-R003C015-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678940763576
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=marcie
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R003C015
Not applying reductions.
Model is PT
ReachabilityCardinality PT
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//../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: ResAllocation_PT_R003C015
(NrP: 90 NrTr: 60 NrArc: 264)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.887sec
RS generation: 0m 0.005sec
-> reachability set: #nodes 586 (5.9e+02) #states 578,878,464 (8)
starting MCC model checker
--------------------------
checking: AG [p_13_0<=1]
normalized: ~ [E [true U ~ [p_13_0<=1]]]
abstracting: (p_13_0<=1)
states: 578,878,464 (8)
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AG [r_12_2<=1]
normalized: ~ [E [true U ~ [r_12_2<=1]]]
abstracting: (r_12_2<=1)
states: 578,878,464 (8)
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [r_4_2<=1]
normalized: ~ [E [true U ~ [r_4_2<=1]]]
abstracting: (r_4_2<=1)
states: 578,878,464 (8)
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [r_1_2<=0]]
normalized: ~ [E [true U r_1_2<=0]]
abstracting: (r_1_2<=0)
states: 278,709,760 (8)
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: EF [p_11_0<=1]
normalized: E [true U p_11_0<=1]
abstracting: (p_11_0<=1)
states: 578,878,464 (8)
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[r_11_2<=0 & 1<=r_6_2]]
normalized: ~ [E [true U ~ [[r_11_2<=0 & 1<=r_6_2]]]]
abstracting: (1<=r_6_2)
states: 277,919,232 (8)
abstracting: (r_11_2<=0)
states: 311,671,808 (8)
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
checking: AG [~ [r_14_2<=p_11_2]]
normalized: ~ [E [true U r_14_2<=p_11_2]]
abstracting: (r_14_2<=p_11_2)
states: 329,526,272 (8)
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [~ [[~ [r_4_1<=1] & [1<=r_11_2 & ~ [1<=p_5_1]]]]]
normalized: ~ [E [true U [[~ [1<=p_5_1] & 1<=r_11_2] & ~ [r_4_1<=1]]]]
abstracting: (r_4_1<=1)
states: 578,878,464 (8)
abstracting: (1<=r_11_2)
states: 267,206,656 (8)
abstracting: (1<=p_5_1)
states: 144,236,544 (8)
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[1<=r_7_0 & [~ [1<=p_9_0] & p_5_2<=p_11_0]]]
normalized: ~ [E [true U ~ [[1<=r_7_0 & [p_5_2<=p_11_0 & ~ [1<=p_9_0]]]]]]
abstracting: (1<=p_9_0)
states: 72,609,792 (7)
abstracting: (p_5_2<=p_11_0)
states: 383,262,720 (8)
abstracting: (1<=r_7_0)
states: 278,227,968 (8)
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: AG [~ [[[~ [[p_10_2<=0 & p_13_2<=r_1_2]] | 1<=r_2_2] & ~ [p_6_1<=1]]]]
normalized: ~ [E [true U [~ [p_6_1<=1] & [~ [[p_10_2<=0 & p_13_2<=r_1_2]] | 1<=r_2_2]]]]
abstracting: (1<=r_2_2)
states: 267,206,656 (8)
abstracting: (p_13_2<=r_1_2)
states: 491,847,936 (8)
abstracting: (p_10_2<=0)
states: 496,941,056 (8)
abstracting: (p_6_1<=1)
states: 578,878,464 (8)
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [[[[[~ [[p_12_2<=0 & p_5_0<=1]] | r_9_1<=0] & ~ [p_11_0<=1]] & ~ [r_11_2<=1]] | [~ [[[1<=p_9_2 & ~ [[~ [r_0_2<=r_4_0] | r_5_2<=1]]] & ~ [r_14_0<=1]]] | r_3_2<=p_11_0]]]
normalized: ~ [E [true U ~ [[[r_3_2<=p_11_0 | ~ [[~ [r_14_0<=1] & [1<=p_9_2 & ~ [[r_5_2<=1 | ~ [r_0_2<=r_4_0]]]]]]] | [~ [r_11_2<=1] & [~ [p_11_0<=1] & [r_9_1<=0 | ~ [[p_12_2<=0 & p_5_0<=1]]]]]]]]]
abstracting: (p_5_0<=1)
states: 578,878,464 (8)
abstracting: (p_12_2<=0)
states: 480,975,872 (8)
abstracting: (r_9_1<=0)
states: 300,812,800 (8)
abstracting: (p_11_0<=1)
states: 578,878,464 (8)
abstracting: (r_11_2<=1)
states: 578,878,464 (8)
abstracting: (r_0_2<=r_4_0)
states: 459,023,616 (8)
abstracting: (r_5_2<=1)
states: 578,878,464 (8)
abstracting: (1<=p_9_2)
states: 221,420,544 (8)
abstracting: (r_14_0<=1)
states: 578,878,464 (8)
abstracting: (r_3_2<=p_11_0)
states: 328,126,464 (8)
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [~ [[[p_9_0<=p_7_0 | r_12_0<=p_7_1] | ~ [[[[[[r_10_0<=1 & r_9_0<=r_13_0] & [r_1_1<=p_7_1 | 1<=r_4_2]] | 1<=r_8_2] & [1<=r_4_2 | [[1<=p_14_2 | 1<=p_12_2] | [p_13_0<=p_13_2 & 1<=r_14_2]]]] | [1<=p_1_0 | [[r_10_2<=r_5_1 & p_1_2<=0] & ~ [1<=r_1_1]]]]]]]]
normalized: ~ [E [true U [~ [[[[~ [1<=r_1_1] & [r_10_2<=r_5_1 & p_1_2<=0]] | 1<=p_1_0] | [[[[p_13_0<=p_13_2 & 1<=r_14_2] | [1<=p_14_2 | 1<=p_12_2]] | 1<=r_4_2] & [[[r_1_1<=p_7_1 | 1<=r_4_2] & [r_10_0<=1 & r_9_0<=r_13_0]] | 1<=r_8_2]]]] | [p_9_0<=p_7_0 | r_12_0<=p_7_1]]]]
abstracting: (r_12_0<=p_7_1)
states: 360,732,160 (8)
abstracting: (p_9_0<=p_7_0)
states: 527,203,328 (8)
abstracting: (1<=r_8_2)
states: 279,429,120 (8)
abstracting: (r_9_0<=r_13_0)
states: 428,850,176 (8)
abstracting: (r_10_0<=1)
states: 578,878,464 (8)
abstracting: (1<=r_4_2)
states: 275,520,512 (8)
abstracting: (r_1_1<=p_7_1)
states: 353,109,248 (8)
abstracting: (1<=r_4_2)
states: 275,520,512 (8)
abstracting: (1<=p_12_2)
states: 97,902,592 (7)
abstracting: (1<=p_14_2)
states: 168,312,832 (8)
abstracting: (1<=r_14_2)
states: 410,565,632 (8)
abstracting: (p_13_0<=p_13_2)
states: 556,200,448 (8)
abstracting: (1<=p_1_0)
states: 45,356,032 (7)
abstracting: (p_1_2<=0)
states: 398,071,296 (8)
abstracting: (r_10_2<=r_5_1)
states: 434,947,072 (8)
abstracting: (1<=r_1_1)
states: 304,235,008 (8)
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.023sec
checking: EF [[p_3_2<=0 & [[[r_12_0<=r_1_2 & ~ [p_8_1<=0]] & [[[[[~ [1<=r_12_1] & r_13_2<=p_3_1] & [[r_10_0<=1 & p_9_0<=p_10_2] | [p_2_2<=1 | p_0_1<=r_8_1]]] | [[~ [r_0_2<=r_13_0] & p_6_2<=r_3_2] | [p_7_0<=r_3_0 & p_6_0<=p_7_1]]] | [r_13_2<=0 | [[~ [1<=r_0_2] | [p_0_1<=1 | p_8_1<=r_12_2]] | p_2_2<=0]]] & [~ [[r_9_2<=0 | ~ [1<=p_2_1]]] & [~ [p_11_2<=0] | [p_0_1<=p_6_2 | 1<=r_13_0]]]]] & [~ [[r_2_1<=1 | [p_14_0<=1 & [p_4_0<=r_0_1 | 1<=p_8_0]]]] | p_14_2<=0]]]]
normalized: E [true U [[[~ [[[[p_4_0<=r_0_1 | 1<=p_8_0] & p_14_0<=1] | r_2_1<=1]] | p_14_2<=0] & [[[[[p_0_1<=p_6_2 | 1<=r_13_0] | ~ [p_11_2<=0]] & ~ [[~ [1<=p_2_1] | r_9_2<=0]]] & [[[[[p_0_1<=1 | p_8_1<=r_12_2] | ~ [1<=r_0_2]] | p_2_2<=0] | r_13_2<=0] | [[[p_7_0<=r_3_0 & p_6_0<=p_7_1] | [~ [r_0_2<=r_13_0] & p_6_2<=r_3_2]] | [[[p_2_2<=1 | p_0_1<=r_8_1] | [r_10_0<=1 & p_9_0<=p_10_2]] & [~ [1<=r_12_1] & r_13_2<=p_3_1]]]]] & [~ [p_8_1<=0] & r_12_0<=r_1_2]]] & p_3_2<=0]]
abstracting: (p_3_2<=0)
states: 365,109,248 (8)
abstracting: (r_12_0<=r_1_2)
states: 437,773,824 (8)
abstracting: (p_8_1<=0)
states: 427,242,496 (8)
abstracting: (r_13_2<=p_3_1)
states: 402,428,416 (8)
abstracting: (1<=r_12_1)
states: 304,235,008 (8)
abstracting: (p_9_0<=p_10_2)
states: 506,268,672 (8)
abstracting: (r_10_0<=1)
states: 578,878,464 (8)
abstracting: (p_0_1<=r_8_1)
states: 462,160,896 (8)
abstracting: (p_2_2<=1)
states: 578,878,464 (8)
abstracting: (p_6_2<=r_3_2)
states: 532,061,184 (8)
abstracting: (r_0_2<=r_13_0)
states: 454,999,040 (8)
abstracting: (p_6_0<=p_7_1)
states: 397,978,624 (8)
abstracting: (p_7_0<=r_3_0)
states: 544,033,280 (8)
abstracting: (r_13_2<=0)
states: 349,120,000 (8)
abstracting: (p_2_2<=0)
states: 480,975,872 (8)
abstracting: (1<=r_0_2)
states: 229,758,464 (8)
abstracting: (p_8_1<=r_12_2)
states: 503,687,168 (8)
abstracting: (p_0_1<=1)
states: 578,878,464 (8)
abstracting: (r_9_2<=0)
states: 303,357,952 (8)
abstracting: (1<=p_2_1)
states: 174,430,208 (8)
abstracting: (p_11_2<=0)
states: 365,109,248 (8)
abstracting: (1<=r_13_0)
states: 266,761,216 (8)
abstracting: (p_0_1<=p_6_2)
states: 382,616,576 (8)
abstracting: (p_14_2<=0)
states: 410,565,632 (8)
abstracting: (r_2_1<=1)
states: 578,878,464 (8)
abstracting: (p_14_0<=1)
states: 578,878,464 (8)
abstracting: (1<=p_8_0)
states: 226,552,832 (8)
abstracting: (p_4_0<=r_0_1)
states: 449,826,560 (8)
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.063sec
checking: EF [[[[[[[[[1<=r_0_2 | [1<=r_12_0 & 1<=p_7_2]] & r_6_2<=p_10_2] | [~ [p_9_2<=1] | [[1<=p_12_0 & r_13_1<=1] & r_1_0<=0]]] & ~ [[1<=r_2_0 | p_11_0<=r_1_2]]] & [~ [r_13_2<=0] | ~ [[[1<=p_1_0 | r_7_0<=1] & ~ [1<=p_9_2]]]]] & ~ [[~ [p_5_0<=0] & [[~ [r_13_2<=0] & p_3_2<=r_7_1] & p_11_1<=1]]]] | [~ [r_13_0<=r_5_2] & [p_10_0<=1 & r_13_0<=0]]] & [~ [1<=p_14_2] | [[[r_6_2<=p_8_0 & p_7_0<=0] | [~ [[[~ [p_12_2<=r_13_2] & [p_11_2<=r_1_1 | 1<=p_10_2]] & p_8_1<=r_12_0]] | p_2_1<=r_7_1]] & ~ [r_10_2<=p_3_0]]]]]
normalized: E [true U [[[~ [r_10_2<=p_3_0] & [[~ [[[[p_11_2<=r_1_1 | 1<=p_10_2] & ~ [p_12_2<=r_13_2]] & p_8_1<=r_12_0]] | p_2_1<=r_7_1] | [r_6_2<=p_8_0 & p_7_0<=0]]] | ~ [1<=p_14_2]] & [[[p_10_0<=1 & r_13_0<=0] & ~ [r_13_0<=r_5_2]] | [~ [[[[~ [r_13_2<=0] & p_3_2<=r_7_1] & p_11_1<=1] & ~ [p_5_0<=0]]] & [[~ [[~ [1<=p_9_2] & [1<=p_1_0 | r_7_0<=1]]] | ~ [r_13_2<=0]] & [~ [[1<=r_2_0 | p_11_0<=r_1_2]] & [[[[1<=p_12_0 & r_13_1<=1] & r_1_0<=0] | ~ [p_9_2<=1]] | [[[1<=r_12_0 & 1<=p_7_2] | 1<=r_0_2] & r_6_2<=p_10_2]]]]]]]]
abstracting: (r_6_2<=p_10_2)
states: 343,293,952 (8)
abstracting: (1<=r_0_2)
states: 229,758,464 (8)
abstracting: (1<=p_7_2)
states: 222,930,432 (8)
abstracting: (1<=r_12_0)
states: 293,114,880 (8)
abstracting: (p_9_2<=1)
states: 578,878,464 (8)
abstracting: (r_1_0<=0)
states: 285,763,584 (8)
abstracting: (r_13_1<=1)
states: 578,878,464 (8)
abstracting: (1<=p_12_0)
states: 240,407,552 (8)
abstracting: (p_11_0<=r_1_2)
states: 547,226,624 (8)
abstracting: (1<=r_2_0)
states: 272,586,752 (8)
abstracting: (r_13_2<=0)
states: 349,120,000 (8)
abstracting: (r_7_0<=1)
states: 578,878,464 (8)
abstracting: (1<=p_1_0)
states: 45,356,032 (7)
abstracting: (1<=p_9_2)
states: 221,420,544 (8)
abstracting: (p_5_0<=0)
states: 506,268,672 (8)
abstracting: (p_11_1<=1)
states: 578,878,464 (8)
abstracting: (p_3_2<=r_7_1)
states: 467,318,272 (8)
abstracting: (r_13_2<=0)
states: 349,120,000 (8)
abstracting: (r_13_0<=r_5_2)
states: 440,815,616 (8)
abstracting: (r_13_0<=0)
states: 312,117,248 (8)
abstracting: (p_10_0<=1)
states: 578,878,464 (8)
abstracting: (1<=p_14_2)
states: 168,312,832 (8)
abstracting: (p_7_0<=0)
states: 504,780,800 (8)
abstracting: (r_6_2<=p_8_0)
states: 409,934,848 (8)
abstracting: (p_2_1<=r_7_1)
states: 490,321,920 (8)
abstracting: (p_8_1<=r_12_0)
states: 502,356,992 (8)
abstracting: (p_12_2<=r_13_2)
states: 529,927,168 (8)
abstracting: (1<=p_10_2)
states: 81,937,408 (7)
abstracting: (p_11_2<=r_1_1)
states: 477,549,056 (8)
abstracting: (r_10_2<=p_3_0)
states: 328,126,464 (8)
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.061sec
checking: EF [[[1<=p_9_2 | [[~ [[[[1<=p_2_0 | p_0_1<=p_12_2] & ~ [1<=p_6_1]] & [[1<=r_5_0 | 1<=r_8_0] & [1<=r_6_1 | p_10_2<=r_3_0]]]] | ~ [[~ [[p_7_2<=r_13_1 | p_14_2<=r_1_0]] | ~ [[p_1_1<=r_0_0 | p_9_0<=0]]]]] & [1<=r_3_0 | [r_2_1<=0 & p_13_0<=1]]]] | [p_5_1<=0 & [[~ [[1<=r_14_1 | [r_6_0<=p_0_2 & [p_10_2<=0 | [p_14_2<=r_13_1 & p_7_2<=1]]]]] & ~ [[r_7_1<=p_3_1 & ~ [p_5_0<=0]]]] | [~ [[[~ [1<=p_4_1] & [p_10_1<=1 | 1<=r_14_1]] & [p_8_2<=p_4_1 | 1<=p_1_1]]] | ~ [[p_7_2<=p_11_2 & [~ [[r_11_0<=p_13_0 & r_4_1<=0]] & p_4_2<=0]]]]]]]]
normalized: E [true U [[[[~ [[[[1<=r_6_1 | p_10_2<=r_3_0] & [1<=r_5_0 | 1<=r_8_0]] & [~ [1<=p_6_1] & [1<=p_2_0 | p_0_1<=p_12_2]]]] | ~ [[~ [[p_1_1<=r_0_0 | p_9_0<=0]] | ~ [[p_7_2<=r_13_1 | p_14_2<=r_1_0]]]]] & [1<=r_3_0 | [r_2_1<=0 & p_13_0<=1]]] | 1<=p_9_2] | [p_5_1<=0 & [[~ [[p_7_2<=p_11_2 & [p_4_2<=0 & ~ [[r_11_0<=p_13_0 & r_4_1<=0]]]]] | ~ [[[p_8_2<=p_4_1 | 1<=p_1_1] & [[p_10_1<=1 | 1<=r_14_1] & ~ [1<=p_4_1]]]]] | [~ [[r_7_1<=p_3_1 & ~ [p_5_0<=0]]] & ~ [[1<=r_14_1 | [r_6_0<=p_0_2 & [p_10_2<=0 | [p_14_2<=r_13_1 & p_7_2<=1]]]]]]]]]]
abstracting: (p_7_2<=1)
states: 578,878,464 (8)
abstracting: (p_14_2<=r_13_1)
states: 494,722,048 (8)
abstracting: (p_10_2<=0)
states: 496,941,056 (8)
abstracting: (r_6_0<=p_0_2)
states: 381,138,944 (8)
abstracting: (1<=r_14_1)
states: 350,884,864 (8)
abstracting: (p_5_0<=0)
states: 506,268,672 (8)
abstracting: (r_7_1<=p_3_1)
states: 361,007,616 (8)
abstracting: (1<=p_4_1)
states: 156,576,256 (8)
abstracting: (1<=r_14_1)
states: 350,884,864 (8)
abstracting: (p_10_1<=1)
states: 578,878,464 (8)
abstracting: (1<=p_1_1)
states: 100,213,248 (8)
abstracting: (p_8_2<=p_4_1)
states: 525,425,664 (8)
abstracting: (r_4_1<=0)
states: 300,812,800 (8)
abstracting: (r_11_0<=p_13_0)
states: 338,470,912 (8)
abstracting: (p_4_2<=0)
states: 496,941,056 (8)
abstracting: (p_7_2<=p_11_2)
states: 441,097,216 (8)
abstracting: (p_5_1<=0)
states: 434,641,920 (8)
abstracting: (1<=p_9_2)
states: 221,420,544 (8)
abstracting: (p_13_0<=1)
states: 578,878,464 (8)
abstracting: (r_2_1<=0)
states: 308,766,720 (8)
abstracting: (1<=r_3_0)
states: 283,248,128 (8)
abstracting: (p_14_2<=r_1_0)
states: 495,776,768 (8)
abstracting: (p_7_2<=r_13_1)
states: 452,213,504 (8)
abstracting: (p_9_0<=0)
states: 506,268,672 (8)
abstracting: (p_1_1<=r_0_0)
states: 517,432,832 (8)
abstracting: (p_0_1<=p_12_2)
states: 389,473,280 (8)
abstracting: (1<=p_2_0)
states: 240,407,552 (8)
abstracting: (1<=p_6_1)
states: 151,635,968 (8)
abstracting: (1<=r_8_0)
states: 279,715,840 (8)
abstracting: (1<=r_5_0)
states: 279,715,840 (8)
abstracting: (p_10_2<=r_3_0)
states: 536,732,160 (8)
abstracting: (1<=r_6_1)
states: 280,910,336 (8)
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.083sec
checking: EF [[~ [[[[p_11_2<=1 | 1<=r_10_0] | 1<=r_3_2] | 1<=p_13_0]] | [1<=p_11_1 & [[[[[[r_4_0<=0 | 1<=p_7_1] | [~ [1<=r_12_2] & r_0_2<=r_13_2]] | [~ [p_2_2<=r_10_2] & p_4_2<=r_2_0]] & ~ [[[~ [1<=r_6_0] & [p_12_2<=r_12_1 & 1<=r_5_1]] & [[r_6_2<=1 | 1<=r_14_0] & [r_1_0<=p_5_2 & p_6_0<=r_9_2]]]]] & ~ [[1<=p_11_1 & [1<=r_7_1 | [~ [r_4_2<=1] & [p_7_1<=r_7_2 | 1<=p_9_2]]]]]] & [[~ [[[[p_11_0<=p_3_0 & p_7_2<=p_0_0] | [r_2_2<=r_5_2 | p_3_0<=r_11_0]] & [~ [r_12_0<=p_13_1] | r_9_1<=0]]] | [p_9_0<=0 | [[p_8_2<=0 | [1<=p_0_2 & 1<=r_0_2]] | [[r_2_2<=0 | r_13_0<=p_10_1] | ~ [1<=r_7_1]]]]] & [~ [[r_14_2<=0 | r_9_1<=p_11_0]] | r_14_0<=0]]]]]]
normalized: E [true U [[1<=p_11_1 & [[[r_14_0<=0 | ~ [[r_14_2<=0 | r_9_1<=p_11_0]]] & [[p_9_0<=0 | [[~ [1<=r_7_1] | [r_2_2<=0 | r_13_0<=p_10_1]] | [p_8_2<=0 | [1<=p_0_2 & 1<=r_0_2]]]] | ~ [[[r_9_1<=0 | ~ [r_12_0<=p_13_1]] & [[r_2_2<=r_5_2 | p_3_0<=r_11_0] | [p_11_0<=p_3_0 & p_7_2<=p_0_0]]]]]] & [~ [[1<=p_11_1 & [1<=r_7_1 | [[p_7_1<=r_7_2 | 1<=p_9_2] & ~ [r_4_2<=1]]]]] & [~ [[[[r_1_0<=p_5_2 & p_6_0<=r_9_2] & [r_6_2<=1 | 1<=r_14_0]] & [[p_12_2<=r_12_1 & 1<=r_5_1] & ~ [1<=r_6_0]]]] & [[p_4_2<=r_2_0 & ~ [p_2_2<=r_10_2]] | [[r_0_2<=r_13_2 & ~ [1<=r_12_2]] | [r_4_0<=0 | 1<=p_7_1]]]]]]] | ~ [[1<=p_13_0 | [1<=r_3_2 | [p_11_2<=1 | 1<=r_10_0]]]]]]
abstracting: (1<=r_10_0)
states: 283,248,128 (8)
abstracting: (p_11_2<=1)
states: 578,878,464 (8)
abstracting: (1<=r_3_2)
states: 283,171,840 (8)
abstracting: (1<=p_13_0)
states: 45,356,032 (7)
abstracting: (1<=p_7_1)
states: 146,332,160 (8)
abstracting: (r_4_0<=0)
states: 302,355,968 (8)
abstracting: (1<=r_12_2)
states: 300,168,704 (8)
abstracting: (r_0_2<=r_13_2)
states: 440,312,064 (8)
abstracting: (p_2_2<=r_10_2)
states: 528,727,040 (8)
abstracting: (p_4_2<=r_2_0)
states: 539,691,008 (8)
abstracting: (1<=r_6_0)
states: 278,227,968 (8)
abstracting: (1<=r_5_1)
states: 283,005,952 (8)
abstracting: (p_12_2<=r_12_1)
states: 529,927,168 (8)
abstracting: (1<=r_14_0)
states: 312,117,248 (8)
abstracting: (r_6_2<=1)
states: 578,878,464 (8)
abstracting: (p_6_0<=r_9_2)
states: 461,004,800 (8)
abstracting: (r_1_0<=p_5_2)
states: 399,202,304 (8)
abstracting: (r_4_2<=1)
states: 578,878,464 (8)
abstracting: (1<=p_9_2)
states: 221,420,544 (8)
abstracting: (p_7_1<=r_7_2)
states: 505,712,384 (8)
abstracting: (1<=r_7_1)
states: 280,910,336 (8)
abstracting: (1<=p_11_1)
states: 134,336,512 (8)
abstracting: (p_7_2<=p_0_0)
states: 458,449,920 (8)
abstracting: (p_11_0<=p_3_0)
states: 520,674,304 (8)
abstracting: (p_3_0<=r_11_0)
states: 543,929,344 (8)
abstracting: (r_2_2<=r_5_2)
states: 444,943,872 (8)
abstracting: (r_12_0<=p_13_1)
states: 331,119,616 (8)
abstracting: (r_9_1<=0)
states: 300,812,800 (8)
abstracting: (1<=r_0_2)
states: 229,758,464 (8)
abstracting: (1<=p_0_2)
states: 168,312,832 (8)
abstracting: (p_8_2<=0)
states: 500,849,664 (8)
abstracting: (r_13_0<=p_10_1)
states: 386,472,448 (8)
abstracting: (r_2_2<=0)
states: 311,671,808 (8)
abstracting: (1<=r_7_1)
states: 280,910,336 (8)
abstracting: (p_9_0<=0)
states: 506,268,672 (8)
abstracting: (r_9_1<=p_11_0)
states: 340,789,760 (8)
abstracting: (r_14_2<=0)
states: 168,312,832 (8)
abstracting: (r_14_0<=0)
states: 266,761,216 (8)
abstracting: (1<=p_11_1)
states: 134,336,512 (8)
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C015-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.057sec
totally nodes used: 277791 (2.8e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 125757 670545 796302
used/not used/entry size/cache size: 861503 66247361 16 1024MB
basic ops cache: hits/miss/sum: 57044 308973 366017
used/not used/entry size/cache size: 638301 16138915 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: 5883 31121 37004
used/not used/entry size/cache size: 31092 8357516 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 66843201
1 254334
2 10570
3 720
4 38
5 1
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.027sec
BK_STOP 1678940768650
--------------------
content from stderr:
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:459 (7), effective:90 (1)
initing FirstDep: 0m 0.000sec
iterations count:64 (1), effective:2 (0)
iterations count:60 (1), effective:0 (0)
iterations count:128 (2), effective:11 (0)
iterations count:79 (1), effective:3 (0)
iterations count:141 (2), effective:13 (0)
iterations count:202 (3), effective:23 (0)
iterations count:344 (5), effective:47 (0)
iterations count:389 (6), effective:55 (0)
iterations count:226 (3), effective:31 (0)
iterations count:397 (6), effective:57 (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-R003C015"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
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 marcie"
echo " Input is ResAllocation-PT-R003C015, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r321-tall-167889192500702"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C015.tgz
mv ResAllocation-PT-R003C015 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 ;