About the Execution of Marcie for RobotManipulation-PT-00005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5450.531 | 5781.00 | 5988.00 | 61.20 | TTTTFFTTFFTFTTFT | 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.r353-smll-167891800400017.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 RobotManipulation-PT-00005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r353-smll-167891800400017
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.5K Feb 26 05:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 05:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 05:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 26 05:36 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.8K Feb 25 16:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 05:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 05:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 05:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.4K 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 RobotManipulation-PT-00005-CTLCardinality-00
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-01
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-02
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-03
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-04
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-05
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-06
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-07
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-08
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-09
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-10
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-11
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-12
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-13
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-14
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678948387253
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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RobotManipulation-PT-00005
Not applying reductions.
Model is PT
CTLCardinality 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=CTLCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: RobotManipulation_PT_00005
(NrP: 15 NrTr: 11 NrArc: 34)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.313sec
RS generation: 0m 0.013sec
-> reachability set: #nodes 1827 (1.8e+03) #states 184,756 (5)
starting MCC model checker
--------------------------
checking: ~ [AX [r_stopped<=2]]
normalized: EX [~ [r_stopped<=2]]
abstracting: (r_stopped<=2)
states: 142,571 (5)
.-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: AF [AG [EF [EF [[r_stopped<=7 & 4<=p_m]]]]]
normalized: ~ [EG [E [true U ~ [E [true U E [true U [r_stopped<=7 & 4<=p_m]]]]]]]
abstracting: (4<=p_m)
states: 68,354 (4)
abstracting: (r_stopped<=7)
states: 184,286 (5)
.
EG iterations: 1
-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.019sec
checking: ~ [EF [AX [~ [[5<=p_i2 | A [3<=initialize U initialize<=6]]]]]]
normalized: ~ [E [true U ~ [EX [[[~ [EG [~ [initialize<=6]]] & ~ [E [~ [initialize<=6] U [~ [3<=initialize] & ~ [initialize<=6]]]]] | 5<=p_i2]]]]]
abstracting: (5<=p_i2)
states: 42,614 (4)
abstracting: (initialize<=6)
states: 180,851 (5)
abstracting: (3<=initialize)
states: 61,490 (4)
abstracting: (initialize<=6)
states: 180,851 (5)
abstracting: (initialize<=6)
states: 180,851 (5)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: AF [EG [[moved<=r_active | ~ [p_rdy<=0]]]]
normalized: ~ [EG [~ [EG [[~ [p_rdy<=0] | moved<=r_active]]]]]
abstracting: (moved<=r_active)
states: 184,756 (5)
abstracting: (p_rdy<=0)
states: 87,516 (4)
EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: E [6<=p_i2 U ~ [EF [AX [[~ [2<=p_m] & ~ [moved<=off]]]]]]
normalized: E [6<=p_i2 U ~ [E [true U ~ [EX [~ [[~ [moved<=off] & ~ [2<=p_m]]]]]]]]
abstracting: (2<=p_m)
states: 138,710 (5)
abstracting: (moved<=off)
states: 131,350 (5)
.abstracting: (6<=p_i2)
states: 24,002 (4)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: E [p_m<=r_moving U move<=p_sc]
normalized: E [p_m<=r_moving U move<=p_sc]
abstracting: (move<=p_sc)
states: 120,344 (5)
abstracting: (p_m<=r_moving)
states: 38,896 (4)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.019sec
checking: [EX [[AX [~ [10<=moved]] & [AF [AG [move<=p_sc]] & ~ [EF [~ [7<=moved]]]]]] & EF [AG [EF [EF [6<=initialize]]]]]
normalized: [E [true U ~ [E [true U ~ [E [true U E [true U 6<=initialize]]]]]] & EX [[[~ [E [true U ~ [7<=moved]]] & ~ [EG [E [true U ~ [move<=p_sc]]]]] & ~ [EX [10<=moved]]]]]
abstracting: (10<=moved)
states: 2
.abstracting: (move<=p_sc)
states: 120,344 (5)
EG iterations: 0
abstracting: (7<=moved)
states: 440
.abstracting: (6<=initialize)
states: 9,152 (3)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.041sec
checking: [E [AF [initialized<=9] U ~ [A [~ [EF [10<=initialized]] U EX [[move<=3 & 5<=initialized]]]]] & [AG [~ [AG [AX [initialized<=8]]]] | EX [AG [access<=p_rdy]]]]
normalized: [[EX [~ [E [true U ~ [access<=p_rdy]]]] | ~ [E [true U ~ [E [true U EX [~ [initialized<=8]]]]]]] & E [~ [EG [~ [initialized<=9]]] U ~ [[~ [EG [~ [EX [[move<=3 & 5<=initialized]]]]] & ~ [E [~ [EX [[move<=3 & 5<=initialized]]] U [E [true U 10<=initialized] & ~ [EX [[move<=3 & 5<=initialized]]]]]]]]]]
abstracting: (5<=initialized)
states: 4,004 (3)
abstracting: (move<=3)
states: 174,746 (5)
.abstracting: (10<=initialized)
states: 2
abstracting: (5<=initialized)
states: 4,004 (3)
abstracting: (move<=3)
states: 174,746 (5)
.abstracting: (5<=initialized)
states: 4,004 (3)
abstracting: (move<=3)
states: 174,746 (5)
..
EG iterations: 1
abstracting: (initialized<=9)
states: 184,754 (5)
...
EG iterations: 3
abstracting: (initialized<=8)
states: 184,736 (5)
.abstracting: (access<=p_rdy)
states: 6,006 (3)
.-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.024sec
checking: ~ [AG [AF [[[[EX [initialized<=access] | [initialized<=initialized | 1<=p_i2]] & AF [6<=move]] | initialize<=11]]]]
normalized: E [true U EG [~ [[initialize<=11 | [~ [EG [~ [6<=move]]] & [[initialized<=initialized | 1<=p_i2] | EX [initialized<=access]]]]]]]
abstracting: (initialized<=access)
states: 184,756 (5)
.abstracting: (1<=p_i2)
states: 165,308 (5)
abstracting: (initialized<=initialized)
states: 184,756 (5)
abstracting: (6<=move)
states: 1,430 (3)
.
EG iterations: 1
abstracting: (initialize<=11)
states: 184,756 (5)
.
EG iterations: 1
-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: EX [EF [[AX [~ [A [3<=initialized U p_m<=3]]] & [[~ [[moved<=11 & 4<=r_moving]] & r_stopped<=p_sc] | [~ [initialize<=0] & r_stopped<=move]]]]]
normalized: EX [E [true U [[[r_stopped<=move & ~ [initialize<=0]] | [r_stopped<=p_sc & ~ [[moved<=11 & 4<=r_moving]]]] & ~ [EX [[~ [EG [~ [p_m<=3]]] & ~ [E [~ [p_m<=3] U [~ [3<=initialized] & ~ [p_m<=3]]]]]]]]]]
abstracting: (p_m<=3)
states: 116,402 (5)
abstracting: (3<=initialized)
states: 22,880 (4)
abstracting: (p_m<=3)
states: 116,402 (5)
abstracting: (p_m<=3)
states: 116,402 (5)
.
EG iterations: 1
.abstracting: (4<=r_moving)
states: 10,010 (4)
abstracting: (moved<=11)
states: 184,756 (5)
abstracting: (r_stopped<=p_sc)
states: 99,144 (4)
abstracting: (initialize<=0)
states: 43,758 (4)
abstracting: (r_stopped<=move)
states: 99,144 (4)
.-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.036sec
checking: AX [EG [[[[AF [7<=p_i1] | [[p_i2<=1 | p_i2<=off] | AF [initialized<=11]]] | [AG [11<=move] & EF [r_stopped<=p_m]]] | [[E [6<=access U p_m<=8] & AG [1<=p_rel]] | r_stopped<=2]]]]
normalized: ~ [EX [~ [EG [[[r_stopped<=2 | [~ [E [true U ~ [1<=p_rel]]] & E [6<=access U p_m<=8]]] | [[E [true U r_stopped<=p_m] & ~ [E [true U ~ [11<=move]]]] | [[~ [EG [~ [initialized<=11]]] | [p_i2<=1 | p_i2<=off]] | ~ [EG [~ [7<=p_i1]]]]]]]]]]
abstracting: (7<=p_i1)
states: 3,905 (3)
.
EG iterations: 1
abstracting: (p_i2<=off)
states: 60,172 (4)
abstracting: (p_i2<=1)
states: 50,336 (4)
abstracting: (initialized<=11)
states: 184,756 (5)
.
EG iterations: 1
abstracting: (11<=move)
states: 0
abstracting: (r_stopped<=p_m)
states: 143,036 (5)
abstracting: (p_m<=8)
states: 183,854 (5)
abstracting: (6<=access)
states: 76,502 (4)
abstracting: (1<=p_rel)
states: 97,240 (4)
abstracting: (r_stopped<=2)
states: 142,571 (5)
EG iterations: 0
.-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.024sec
checking: E [~ [AF [A [[[p_m<=7 & 6<=access] & ~ [off<=p_rel]] U off<=p_sc]]] U [AF [EG [~ [A [move<=10 U p_i2<=9]]]] | E [~ [[[~ [move<=r_stopped] & [move<=6 | r_moving<=1]] | AG [r_stopped<=4]]] U ~ [AG [EF [move<=7]]]]]]
normalized: E [EG [~ [[~ [EG [~ [off<=p_sc]]] & ~ [E [~ [off<=p_sc] U [~ [[~ [off<=p_rel] & [p_m<=7 & 6<=access]]] & ~ [off<=p_sc]]]]]]] U [E [~ [[~ [E [true U ~ [r_stopped<=4]]] | [[move<=6 | r_moving<=1] & ~ [move<=r_stopped]]]] U E [true U ~ [E [true U move<=7]]]] | ~ [EG [~ [EG [~ [[~ [EG [~ [p_i2<=9]]] & ~ [E [~ [p_i2<=9] U [~ [move<=10] & ~ [p_i2<=9]]]]]]]]]]]]
abstracting: (p_i2<=9)
states: 184,294 (5)
abstracting: (move<=10)
states: 184,756 (5)
abstracting: (p_i2<=9)
states: 184,294 (5)
abstracting: (p_i2<=9)
states: 184,294 (5)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
abstracting: (move<=7)
states: 184,646 (5)
abstracting: (move<=r_stopped)
states: 131,350 (5)
abstracting: (r_moving<=1)
states: 136,136 (5)
abstracting: (move<=6)
states: 184,316 (5)
abstracting: (r_stopped<=4)
states: 174,317 (5)
abstracting: (off<=p_sc)
states: 99,144 (4)
abstracting: (6<=access)
states: 76,502 (4)
abstracting: (p_m<=7)
states: 181,334 (5)
abstracting: (off<=p_rel)
states: 99,144 (4)
abstracting: (off<=p_sc)
states: 99,144 (4)
abstracting: (off<=p_sc)
states: 99,144 (4)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.072sec
checking: EF [~ [[[E [~ [A [r_stopped<=10 U moved<=p_i1]] U [[access<=r_moving | p_rel<=7] | p_m<=0]] | ~ [EX [r_stopped<=p_i1]]] | [~ [EF [[p_i2<=p_sc & 8<=initialized]]] | [~ [[EX [p_sc<=off] | 1<=p_sc]] & ~ [initialized<=8]]]]]]
normalized: E [true U ~ [[[[~ [initialized<=8] & ~ [[1<=p_sc | EX [p_sc<=off]]]] | ~ [E [true U [p_i2<=p_sc & 8<=initialized]]]] | [~ [EX [r_stopped<=p_i1]] | E [~ [[~ [EG [~ [moved<=p_i1]]] & ~ [E [~ [moved<=p_i1] U [~ [r_stopped<=10] & ~ [moved<=p_i1]]]]]] U [p_m<=0 | [access<=r_moving | p_rel<=7]]]]]]]
abstracting: (p_rel<=7)
states: 184,646 (5)
abstracting: (access<=r_moving)
states: 20,504 (4)
abstracting: (p_m<=0)
states: 16,016 (4)
abstracting: (moved<=p_i1)
states: 141,544 (5)
abstracting: (r_stopped<=10)
states: 184,756 (5)
abstracting: (moved<=p_i1)
states: 141,544 (5)
abstracting: (moved<=p_i1)
states: 141,544 (5)
.
EG iterations: 1
abstracting: (r_stopped<=p_i1)
states: 136,136 (5)
.abstracting: (8<=initialized)
states: 110
abstracting: (p_i2<=p_sc)
states: 52,842 (4)
abstracting: (p_sc<=off)
states: 131,350 (5)
.abstracting: (1<=p_sc)
states: 97,240 (4)
abstracting: (initialized<=8)
states: 184,736 (5)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.046sec
checking: ~ [[EX [[AX [[AF [p_sc<=r_active] & ~ [6<=p_i1]]] | AG [AF [p_m<=p_m]]]] & [EG [~ [[EX [4<=off] & EG [r_active<=4]]]] & [AG [[[AG [p_i2<=access] & [access<=7 | r_stopped<=off]] & E [off<=initialized U p_i2<=11]]] | AF [[~ [EX [moved<=access]] | p_rel<=8]]]]]]
normalized: ~ [[[[~ [EG [~ [[p_rel<=8 | ~ [EX [moved<=access]]]]]] | ~ [E [true U ~ [[E [off<=initialized U p_i2<=11] & [[access<=7 | r_stopped<=off] & ~ [E [true U ~ [p_i2<=access]]]]]]]]] & EG [~ [[EG [r_active<=4] & EX [4<=off]]]]] & EX [[~ [E [true U EG [~ [p_m<=p_m]]]] | ~ [EX [~ [[~ [6<=p_i1] & ~ [EG [~ [p_sc<=r_active]]]]]]]]]]]
abstracting: (p_sc<=r_active)
states: 184,756 (5)
.
EG iterations: 1
abstracting: (6<=p_i1)
states: 9,152 (3)
.abstracting: (p_m<=p_m)
states: 184,756 (5)
.
EG iterations: 1
.abstracting: (4<=off)
states: 22,022 (4)
.abstracting: (r_active<=4)
states: 14,300 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p_i2<=access)
states: 165,308 (5)
abstracting: (r_stopped<=off)
states: 110,150 (5)
abstracting: (access<=7)
states: 160,754 (5)
abstracting: (p_i2<=11)
states: 184,756 (5)
abstracting: (off<=initialized)
states: 99,144 (4)
abstracting: (moved<=access)
states: 173,096 (5)
.abstracting: (p_rel<=8)
states: 184,736 (5)
.
EG iterations: 1
-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.047sec
checking: EX [[EX [E [[3<=p_m & A [initialized<=p_rdy U r_moving<=11]] U [6<=p_sc | [r_active<=move & access<=p_sc]]]] & ~ [[A [~ [5<=move] U [AF [r_stopped<=initialize] & [p_sc<=1 | off<=11]]] | [AF [EG [7<=p_m]] & [~ [[10<=r_active | 5<=p_sc]] | [E [p_sc<=p_rdy U p_i1<=access] | r_active<=initialize]]]]]]]
normalized: EX [[~ [[[~ [EG [~ [[~ [EG [~ [r_stopped<=initialize]]] & [p_sc<=1 | off<=11]]]]] & ~ [E [~ [[~ [EG [~ [r_stopped<=initialize]]] & [p_sc<=1 | off<=11]]] U [5<=move & ~ [[~ [EG [~ [r_stopped<=initialize]]] & [p_sc<=1 | off<=11]]]]]]] | [[[r_active<=initialize | E [p_sc<=p_rdy U p_i1<=access]] | ~ [[10<=r_active | 5<=p_sc]]] & ~ [EG [~ [EG [7<=p_m]]]]]]] & EX [E [[3<=p_m & [~ [EG [~ [r_moving<=11]]] & ~ [E [~ [r_moving<=11] U [~ [initialized<=p_rdy] & ~ [r_moving<=11]]]]]] U [6<=p_sc | [r_active<=move & access<=p_sc]]]]]]
abstracting: (access<=p_sc)
states: 20,504 (4)
abstracting: (r_active<=move)
states: 352
abstracting: (6<=p_sc)
states: 1,430 (3)
abstracting: (r_moving<=11)
states: 184,756 (5)
abstracting: (initialized<=p_rdy)
states: 120,344 (5)
abstracting: (r_moving<=11)
states: 184,756 (5)
abstracting: (r_moving<=11)
states: 184,756 (5)
.
EG iterations: 1
abstracting: (3<=p_m)
states: 102,674 (5)
.abstracting: (7<=p_m)
states: 9,470 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (5<=p_sc)
states: 4,004 (3)
abstracting: (10<=r_active)
states: 27,456 (4)
abstracting: (p_i1<=access)
states: 176,748 (5)
abstracting: (p_sc<=p_rdy)
states: 120,344 (5)
abstracting: (r_active<=initialize)
states: 10,856 (4)
abstracting: (off<=11)
states: 184,756 (5)
abstracting: (p_sc<=1)
states: 136,136 (5)
abstracting: (r_stopped<=initialize)
states: 136,136 (5)
.
EG iterations: 1
abstracting: (5<=move)
states: 4,004 (3)
abstracting: (off<=11)
states: 184,756 (5)
abstracting: (p_sc<=1)
states: 136,136 (5)
abstracting: (r_stopped<=initialize)
states: 136,136 (5)
.
EG iterations: 1
abstracting: (off<=11)
states: 184,756 (5)
abstracting: (p_sc<=1)
states: 136,136 (5)
abstracting: (r_stopped<=initialize)
states: 136,136 (5)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.086sec
checking: E [A [AF [[initialize<=initialized | [r_moving<=7 | [10<=r_moving | p_rel<=11]]]] U AF [~ [[11<=r_active | [r_active<=initialize | 10<=r_active]]]]] U [[[[[[EF [p_m<=2] | [1<=move & r_active<=6]] & [~ [p_m<=2] | EG [p_rdy<=11]]] & p_rel<=access] | [11<=r_moving & [10<=p_m | p_i2<=9]]] | AX [~ [AX [p_i1<=p_rel]]]] & [move<=2 | [[[~ [p_m<=p_i2] & [r_moving<=p_i1 | [6<=p_i2 | p_sc<=5]]] & EF [6<=move]] & AG [~ [move<=initialized]]]]]]
normalized: E [[~ [EG [EG [[11<=r_active | [r_active<=initialize | 10<=r_active]]]]] & ~ [E [EG [[11<=r_active | [r_active<=initialize | 10<=r_active]]] U [EG [~ [[initialize<=initialized | [r_moving<=7 | [10<=r_moving | p_rel<=11]]]]] & EG [[11<=r_active | [r_active<=initialize | 10<=r_active]]]]]]] U [[move<=2 | [~ [E [true U move<=initialized]] & [E [true U 6<=move] & [[r_moving<=p_i1 | [6<=p_i2 | p_sc<=5]] & ~ [p_m<=p_i2]]]]] & [~ [EX [~ [EX [~ [p_i1<=p_rel]]]]] | [[11<=r_moving & [10<=p_m | p_i2<=9]] | [p_rel<=access & [[EG [p_rdy<=11] | ~ [p_m<=2]] & [[1<=move & r_active<=6] | E [true U p_m<=2]]]]]]]]
abstracting: (p_m<=2)
states: 82,082 (4)
abstracting: (r_active<=6)
states: 51,194 (4)
abstracting: (1<=move)
states: 97,240 (4)
abstracting: (p_m<=2)
states: 82,082 (4)
abstracting: (p_rdy<=11)
states: 184,756 (5)
EG iterations: 0
abstracting: (p_rel<=access)
states: 173,096 (5)
abstracting: (p_i2<=9)
states: 184,294 (5)
abstracting: (10<=p_m)
states: 132
abstracting: (11<=r_moving)
states: 0
abstracting: (p_i1<=p_rel)
states: 81,372 (4)
..abstracting: (p_m<=p_i2)
states: 101,774 (5)
abstracting: (p_sc<=5)
states: 183,326 (5)
abstracting: (6<=p_i2)
states: 24,002 (4)
abstracting: (r_moving<=p_i1)
states: 141,544 (5)
abstracting: (6<=move)
states: 1,430 (3)
abstracting: (move<=initialized)
states: 120,344 (5)
abstracting: (move<=2)
states: 161,876 (5)
abstracting: (10<=r_active)
states: 27,456 (4)
abstracting: (r_active<=initialize)
states: 10,856 (4)
abstracting: (11<=r_active)
states: 0
..................................
EG iterations: 34
abstracting: (p_rel<=11)
states: 184,756 (5)
abstracting: (10<=r_moving)
states: 2
abstracting: (r_moving<=7)
states: 184,646 (5)
abstracting: (initialize<=initialized)
states: 81,372 (4)
.
EG iterations: 1
abstracting: (10<=r_active)
states: 27,456 (4)
abstracting: (r_active<=initialize)
states: 10,856 (4)
abstracting: (11<=r_active)
states: 0
..................................
EG iterations: 34
abstracting: (10<=r_active)
states: 27,456 (4)
abstracting: (r_active<=initialize)
states: 10,856 (4)
abstracting: (11<=r_active)
states: 0
..................................
EG iterations: 34
.
EG iterations: 1
-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.264sec
totally nodes used: 273998 (2.7e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 813766 677691 1491457
used/not used/entry size/cache size: 871058 66237806 16 1024MB
basic ops cache: hits/miss/sum: 471430 414874 886304
used/not used/entry size/cache size: 696082 16081134 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: 60435 44645 105080
used/not used/entry size/cache size: 44577 8344031 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 66875833
1 217264
2 9439
3 2675
4 971
5 617
6 712
7 194
8 206
9 159
>= 10 794
Total processing time: 0m 5.652sec
BK_STOP 1678948393034
--------------------
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:433 (39), effective:101 (9)
initing FirstDep: 0m 0.000sec
iterations count:131 (11), effective:28 (2)
iterations count:11 (1), effective:0 (0)
iterations count:11 (1), effective:0 (0)
iterations count:11 (1), effective:0 (0)
iterations count:103 (9), effective:14 (1)
iterations count:51 (4), effective:4 (0)
iterations count:198 (18), effective:41 (3)
iterations count:11 (1), effective:0 (0)
iterations count:11 (1), effective:0 (0)
iterations count:411 (37), effective:90 (8)
iterations count:11 (1), effective:0 (0)
iterations count:35 (3), effective:6 (0)
iterations count:367 (33), effective:80 (7)
iterations count:42 (3), effective:6 (0)
iterations count:27 (2), effective:4 (0)
iterations count:183 (16), effective:48 (4)
iterations count:11 (1), effective:0 (0)
iterations count:71 (6), effective:20 (1)
iterations count:11 (1), effective:0 (0)
iterations count:51 (4), effective:10 (0)
iterations count:14 (1), effective:3 (0)
iterations count:201 (18), effective:40 (3)
iterations count:195 (17), effective:54 (4)
iterations count:229 (20), effective:53 (4)
iterations count:25 (2), effective:4 (0)
iterations count:73 (6), effective:21 (1)
iterations count:11 (1), effective:0 (0)
iterations count:11 (1), effective:0 (0)
iterations count:341 (31), effective:77 (7)
iterations count:13 (1), effective:1 (0)
iterations count:221 (20), effective:45 (4)
iterations count:115 (10), effective:24 (2)
iterations count:263 (23), effective:54 (4)
iterations count:21 (1), effective:10 (0)
iterations count:49 (4), effective:18 (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="RobotManipulation-PT-00005"
export BK_EXAMINATION="CTLCardinality"
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 RobotManipulation-PT-00005, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r353-smll-167891800400017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-00005.tgz
mv RobotManipulation-PT-00005 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;