About the Execution of Marcie for RobotManipulation-PT-00001
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5448.203 | 6569.00 | 6061.00 | 288.70 | FFFFTTTTFFTFFFTT | 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-167891800400006.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-00001, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r353-smll-167891800400006
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 9.0K Feb 26 05:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 26 05:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 05:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 05:34 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 4.0K Feb 25 16:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 11K Feb 26 05:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 26 05:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 05:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 05:34 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-00001-ReachabilityCardinality-00
FORMULA_NAME RobotManipulation-PT-00001-ReachabilityCardinality-01
FORMULA_NAME RobotManipulation-PT-00001-ReachabilityCardinality-02
FORMULA_NAME RobotManipulation-PT-00001-ReachabilityCardinality-03
FORMULA_NAME RobotManipulation-PT-00001-ReachabilityCardinality-04
FORMULA_NAME RobotManipulation-PT-00001-ReachabilityCardinality-05
FORMULA_NAME RobotManipulation-PT-00001-ReachabilityCardinality-06
FORMULA_NAME RobotManipulation-PT-00001-ReachabilityCardinality-07
FORMULA_NAME RobotManipulation-PT-00001-ReachabilityCardinality-08
FORMULA_NAME RobotManipulation-PT-00001-ReachabilityCardinality-09
FORMULA_NAME RobotManipulation-PT-00001-ReachabilityCardinality-10
FORMULA_NAME RobotManipulation-PT-00001-ReachabilityCardinality-11
FORMULA_NAME RobotManipulation-PT-00001-ReachabilityCardinality-12
FORMULA_NAME RobotManipulation-PT-00001-ReachabilityCardinality-13
FORMULA_NAME RobotManipulation-PT-00001-ReachabilityCardinality-14
FORMULA_NAME RobotManipulation-PT-00001-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678948330069
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=RobotManipulation-PT-00001
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: RobotManipulation_PT_00001
(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 4.739sec
RS generation: 0m 0.000sec
-> reachability set: #nodes 107 (1.1e+02) #states 110
starting MCC model checker
--------------------------
checking: EF [3<=p_sc]
normalized: E [true U 3<=p_sc]
abstracting: (3<=p_sc)
states: 0
-> the formula is FALSE
FORMULA RobotManipulation-PT-00001-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [2<=r_moving]
normalized: ~ [E [true U ~ [2<=r_moving]]]
abstracting: (2<=r_moving)
states: 2
-> the formula is FALSE
FORMULA RobotManipulation-PT-00001-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [~ [access<=2]]
normalized: E [true U ~ [access<=2]]
abstracting: (access<=2)
states: 110
-> the formula is FALSE
FORMULA RobotManipulation-PT-00001-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [p_m<=r_moving]
normalized: ~ [E [true U ~ [p_m<=r_moving]]]
abstracting: (p_m<=r_moving)
states: 72
-> the formula is FALSE
FORMULA RobotManipulation-PT-00001-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[move<=2 & 1<=access]]
normalized: ~ [E [true U ~ [[move<=2 & 1<=access]]]]
abstracting: (1<=access)
states: 80
abstracting: (move<=2)
states: 110
-> the formula is FALSE
FORMULA RobotManipulation-PT-00001-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [[~ [initialized<=2] & r_active<=2]]]
normalized: E [true U ~ [[~ [initialized<=2] & r_active<=2]]]
abstracting: (r_active<=2)
states: 110
abstracting: (initialized<=2)
states: 110
-> the formula is TRUE
FORMULA RobotManipulation-PT-00001-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [p_i1<=r_moving]
normalized: ~ [E [true U ~ [p_i1<=r_moving]]]
abstracting: (p_i1<=r_moving)
states: 54
-> the formula is FALSE
FORMULA RobotManipulation-PT-00001-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[1<=moved | r_active<=r_active]]
normalized: ~ [E [true U ~ [[1<=moved | r_active<=r_active]]]]
abstracting: (r_active<=r_active)
states: 110
abstracting: (1<=moved)
states: 20
-> the formula is TRUE
FORMULA RobotManipulation-PT-00001-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [[~ [[~ [[[[r_stopped<=p_i1 & p_i1<=0] & 1<=moved] | ~ [move<=0]]] | ~ [2<=initialized]]] & ~ [[[2<=move & [1<=r_stopped & access<=1]] & 3<=p_i2]]]]]
normalized: E [true U ~ [[~ [[~ [[~ [move<=0] | [[r_stopped<=p_i1 & p_i1<=0] & 1<=moved]]] | ~ [2<=initialized]]] & ~ [[[[1<=r_stopped & access<=1] & 2<=move] & 3<=p_i2]]]]]
abstracting: (3<=p_i2)
states: 6
abstracting: (2<=move)
states: 2
abstracting: (access<=1)
states: 80
abstracting: (1<=r_stopped)
states: 29
abstracting: (2<=initialized)
states: 2
abstracting: (1<=moved)
states: 20
abstracting: (p_i1<=0)
states: 45
abstracting: (r_stopped<=p_i1)
states: 100
abstracting: (move<=0)
states: 90
-> the formula is TRUE
FORMULA RobotManipulation-PT-00001-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [~ [[~ [[[move<=access | [p_sc<=3 | [~ [moved<=3] | p_rel<=2]]] & [[~ [[p_sc<=r_stopped | p_sc<=off]] & ~ [1<=moved]] & [r_active<=initialized | 1<=move]]]] & [[2<=off & p_sc<=1] | access<=0]]]]
normalized: E [true U ~ [[~ [[[[r_active<=initialized | 1<=move] & [~ [1<=moved] & ~ [[p_sc<=r_stopped | p_sc<=off]]]] & [[[~ [moved<=3] | p_rel<=2] | p_sc<=3] | move<=access]]] & [[2<=off & p_sc<=1] | access<=0]]]]
abstracting: (access<=0)
states: 30
abstracting: (p_sc<=1)
states: 108
abstracting: (2<=off)
states: 4
abstracting: (move<=access)
states: 100
abstracting: (p_sc<=3)
states: 110
abstracting: (p_rel<=2)
states: 110
abstracting: (moved<=3)
states: 110
abstracting: (p_sc<=off)
states: 93
abstracting: (p_sc<=r_stopped)
states: 93
abstracting: (1<=moved)
states: 20
abstracting: (1<=move)
states: 20
abstracting: (r_active<=initialized)
states: 16
-> the formula is TRUE
FORMULA RobotManipulation-PT-00001-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [~ [[[[[[~ [1<=off] & ~ [1<=p_m]] & [~ [p_rdy<=p_i2] | ~ [r_moving<=3]]] & [~ [p_i1<=off] | ~ [[moved<=access & p_rdy<=0]]]] & ~ [[~ [p_i1<=0] | [[p_rdy<=0 & 2<=r_moving] & [p_m<=3 | r_active<=r_active]]]]] & 3<=move]]]
normalized: ~ [E [true U [[~ [[[[p_m<=3 | r_active<=r_active] & [p_rdy<=0 & 2<=r_moving]] | ~ [p_i1<=0]]] & [[~ [[moved<=access & p_rdy<=0]] | ~ [p_i1<=off]] & [[~ [r_moving<=3] | ~ [p_rdy<=p_i2]] & [~ [1<=p_m] & ~ [1<=off]]]]] & 3<=move]]]
abstracting: (3<=move)
states: 0
abstracting: (1<=off)
states: 29
abstracting: (1<=p_m)
states: 54
abstracting: (p_rdy<=p_i2)
states: 101
abstracting: (r_moving<=3)
states: 110
abstracting: (p_i1<=off)
states: 55
abstracting: (p_rdy<=0)
states: 90
abstracting: (moved<=access)
states: 100
abstracting: (p_i1<=0)
states: 45
abstracting: (2<=r_moving)
states: 2
abstracting: (p_rdy<=0)
states: 90
abstracting: (r_active<=r_active)
states: 110
abstracting: (p_m<=3)
states: 110
-> the formula is TRUE
FORMULA RobotManipulation-PT-00001-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [~ [[~ [[[[~ [[initialize<=1 & r_active<=2]] & 3<=r_moving] & [r_active<=1 | [[3<=p_i1 | moved<=1] | p_rel<=2]]] | ~ [[[[[r_active<=3 | 3<=p_i1] & [initialized<=1 & p_rel<=1]] & r_active<=0] & 1<=moved]]]] & [~ [[initialized<=access | [p_rel<=move | [~ [p_rdy<=3] & ~ [[2<=initialized & 2<=access]]]]]] | ~ [p_rel<=1]]]]]
normalized: E [true U ~ [[[~ [p_rel<=1] | ~ [[[[~ [[2<=initialized & 2<=access]] & ~ [p_rdy<=3]] | p_rel<=move] | initialized<=access]]] & ~ [[~ [[[[[initialized<=1 & p_rel<=1] & [r_active<=3 | 3<=p_i1]] & r_active<=0] & 1<=moved]] | [[[[3<=p_i1 | moved<=1] | p_rel<=2] | r_active<=1] & [~ [[initialize<=1 & r_active<=2]] & 3<=r_moving]]]]]]]
abstracting: (3<=r_moving)
states: 0
abstracting: (r_active<=2)
states: 110
abstracting: (initialize<=1)
states: 90
abstracting: (r_active<=1)
states: 46
abstracting: (p_rel<=2)
states: 110
abstracting: (moved<=1)
states: 108
abstracting: (3<=p_i1)
states: 3
abstracting: (1<=moved)
states: 20
abstracting: (r_active<=0)
states: 9
abstracting: (3<=p_i1)
states: 3
abstracting: (r_active<=3)
states: 110
abstracting: (p_rel<=1)
states: 108
abstracting: (initialized<=1)
states: 108
abstracting: (initialized<=access)
states: 110
abstracting: (p_rel<=move)
states: 92
abstracting: (p_rdy<=3)
states: 110
abstracting: (2<=access)
states: 30
abstracting: (2<=initialized)
states: 2
abstracting: (p_rel<=1)
states: 108
-> the formula is TRUE
FORMULA RobotManipulation-PT-00001-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[[~ [[[~ [moved<=p_rdy] & [r_moving<=p_m | [[~ [3<=p_rdy] | [p_rel<=p_sc & p_sc<=0]] & off<=2]]] & [[p_rdy<=p_i2 & ~ [[~ [p_i2<=1] & p_i2<=moved]]] | ~ [r_moving<=1]]]] & [[~ [[access<=p_rdy | [[~ [r_moving<=p_rel] | p_rdy<=off] & 3<=p_m]]] & ~ [p_rdy<=2]] | p_m<=2]] | ~ [moved<=3]]]
normalized: E [true U [~ [moved<=3] | [[[~ [p_rdy<=2] & ~ [[[[~ [r_moving<=p_rel] | p_rdy<=off] & 3<=p_m] | access<=p_rdy]]] | p_m<=2] & ~ [[[~ [r_moving<=1] | [~ [[~ [p_i2<=1] & p_i2<=moved]] & p_rdy<=p_i2]] & [[[[[p_rel<=p_sc & p_sc<=0] | ~ [3<=p_rdy]] & off<=2] | r_moving<=p_m] & ~ [moved<=p_rdy]]]]]]]
abstracting: (moved<=p_rdy)
states: 92
abstracting: (r_moving<=p_m)
states: 110
abstracting: (off<=2)
states: 110
abstracting: (3<=p_rdy)
states: 0
abstracting: (p_sc<=0)
states: 90
abstracting: (p_rel<=p_sc)
states: 92
abstracting: (p_rdy<=p_i2)
states: 101
abstracting: (p_i2<=moved)
states: 45
abstracting: (p_i2<=1)
states: 80
abstracting: (r_moving<=1)
states: 108
abstracting: (p_m<=2)
states: 110
abstracting: (access<=p_rdy)
states: 42
abstracting: (3<=p_m)
states: 0
abstracting: (p_rdy<=off)
states: 93
abstracting: (r_moving<=p_rel)
states: 92
abstracting: (p_rdy<=2)
states: 110
abstracting: (moved<=3)
states: 110
-> the formula is TRUE
FORMULA RobotManipulation-PT-00001-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [[~ [[~ [[[~ [p_i2<=p_rel] & 2<=p_i2] & [~ [2<=p_rel] & [3<=p_i1 | 1<=p_rel]]]] | [~ [1<=r_moving] & p_i1<=r_stopped]]] & [[[access<=2 | ~ [p_rdy<=2]] | [[2<=initialize & [[[~ [r_active<=moved] & access<=3] & ~ [[3<=initialize | p_sc<=2]]] | [2<=move & ~ [p_sc<=p_rel]]]] & [move<=3 | [[p_rel<=1 | [[p_i1<=1 | 2<=access] | [3<=initialized | r_moving<=2]]] & [[moved<=p_rel & p_rel<=p_i1] | 1<=p_i2]]]]] & [2<=p_m | ~ [2<=p_i1]]]]]
normalized: ~ [E [true U ~ [[~ [[~ [[[2<=p_i2 & ~ [p_i2<=p_rel]] & [[3<=p_i1 | 1<=p_rel] & ~ [2<=p_rel]]]] | [~ [1<=r_moving] & p_i1<=r_stopped]]] & [[~ [2<=p_i1] | 2<=p_m] & [[[[[[moved<=p_rel & p_rel<=p_i1] | 1<=p_i2] & [[[3<=initialized | r_moving<=2] | [p_i1<=1 | 2<=access]] | p_rel<=1]] | move<=3] & [[[~ [p_sc<=p_rel] & 2<=move] | [~ [[3<=initialize | p_sc<=2]] & [~ [r_active<=moved] & access<=3]]] & 2<=initialize]] | [~ [p_rdy<=2] | access<=2]]]]]]]
abstracting: (access<=2)
states: 110
abstracting: (p_rdy<=2)
states: 110
abstracting: (2<=initialize)
states: 20
abstracting: (access<=3)
states: 110
abstracting: (r_active<=moved)
states: 16
abstracting: (p_sc<=2)
states: 110
abstracting: (3<=initialize)
states: 3
abstracting: (2<=move)
states: 2
abstracting: (p_sc<=p_rel)
states: 92
abstracting: (move<=3)
states: 110
abstracting: (p_rel<=1)
states: 108
abstracting: (2<=access)
states: 30
abstracting: (p_i1<=1)
states: 90
abstracting: (r_moving<=2)
states: 110
abstracting: (3<=initialized)
states: 0
abstracting: (1<=p_i2)
states: 74
abstracting: (p_rel<=p_i1)
states: 100
abstracting: (moved<=p_rel)
states: 92
abstracting: (2<=p_m)
states: 12
abstracting: (2<=p_i1)
states: 20
abstracting: (p_i1<=r_stopped)
states: 55
abstracting: (1<=r_moving)
states: 20
abstracting: (2<=p_rel)
states: 2
abstracting: (1<=p_rel)
states: 20
abstracting: (3<=p_i1)
states: 3
abstracting: (p_i2<=p_rel)
states: 45
abstracting: (2<=p_i2)
states: 30
-> the formula is FALSE
FORMULA RobotManipulation-PT-00001-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [[[[~ [p_m<=1] | ~ [[~ [[[move<=0 & initialized<=move] | [p_rdy<=1 | initialized<=r_moving]]] & 1<=initialize]]] | [~ [[[~ [p_m<=1] & ~ [3<=move]] & [[[p_i2<=2 & [p_i2<=2 | 1<=p_i2]] & [[p_i1<=p_rel | moved<=2] | [initialize<=1 | p_sc<=p_m]]] | p_m<=1]]] | move<=2]] & ~ [[[[[[~ [initialize<=r_active] | [[2<=p_rel | off<=1] & [3<=r_moving | p_rel<=1]]] | [~ [[moved<=r_stopped | access<=0]] & [~ [access<=move] | [3<=access & 2<=p_i1]]]] & [[1<=off | ~ [p_rdy<=moved]] | ~ [[~ [move<=access] | [initialize<=3 & access<=2]]]]] | [1<=access | 1<=p_m]] & [~ [[[~ [[p_rdy<=r_active & p_i2<=0]] & [1<=p_m & [p_i2<=3 | 3<=p_rel]]] & p_i1<=initialized]] & [~ [2<=p_i2] | [[~ [[r_stopped<=p_rdy & 3<=r_active]] | 1<=moved] & [r_moving<=p_i1 & ~ [[r_moving<=2 | move<=2]]]]]]]]]]
normalized: ~ [E [true U ~ [[~ [[[[[[~ [[r_moving<=2 | move<=2]] & r_moving<=p_i1] & [~ [[r_stopped<=p_rdy & 3<=r_active]] | 1<=moved]] | ~ [2<=p_i2]] & ~ [[[[[p_i2<=3 | 3<=p_rel] & 1<=p_m] & ~ [[p_rdy<=r_active & p_i2<=0]]] & p_i1<=initialized]]] & [[1<=access | 1<=p_m] | [[~ [[[initialize<=3 & access<=2] | ~ [move<=access]]] | [~ [p_rdy<=moved] | 1<=off]] & [[[[3<=access & 2<=p_i1] | ~ [access<=move]] & ~ [[moved<=r_stopped | access<=0]]] | [[[3<=r_moving | p_rel<=1] & [2<=p_rel | off<=1]] | ~ [initialize<=r_active]]]]]]] & [[~ [[[[[[initialize<=1 | p_sc<=p_m] | [p_i1<=p_rel | moved<=2]] & [[p_i2<=2 | 1<=p_i2] & p_i2<=2]] | p_m<=1] & [~ [3<=move] & ~ [p_m<=1]]]] | move<=2] | [~ [[~ [[[p_rdy<=1 | initialized<=r_moving] | [move<=0 & initialized<=move]]] & 1<=initialize]] | ~ [p_m<=1]]]]]]]
abstracting: (p_m<=1)
states: 98
abstracting: (1<=initialize)
states: 65
abstracting: (initialized<=move)
states: 92
abstracting: (move<=0)
states: 90
abstracting: (initialized<=r_moving)
states: 92
abstracting: (p_rdy<=1)
states: 108
abstracting: (move<=2)
states: 110
abstracting: (p_m<=1)
states: 98
abstracting: (3<=move)
states: 0
abstracting: (p_m<=1)
states: 98
abstracting: (p_i2<=2)
states: 104
abstracting: (1<=p_i2)
states: 74
abstracting: (p_i2<=2)
states: 104
abstracting: (moved<=2)
states: 110
abstracting: (p_i1<=p_rel)
states: 54
abstracting: (p_sc<=p_m)
states: 96
abstracting: (initialize<=1)
states: 90
abstracting: (initialize<=r_active)
states: 94
abstracting: (off<=1)
states: 106
abstracting: (2<=p_rel)
states: 2
abstracting: (p_rel<=1)
states: 108
abstracting: (3<=r_moving)
states: 0
abstracting: (access<=0)
states: 30
abstracting: (moved<=r_stopped)
states: 93
abstracting: (access<=move)
states: 40
abstracting: (2<=p_i1)
states: 20
abstracting: (3<=access)
states: 0
abstracting: (1<=off)
states: 29
abstracting: (p_rdy<=moved)
states: 92
abstracting: (move<=access)
states: 100
abstracting: (access<=2)
states: 110
abstracting: (initialize<=3)
states: 110
abstracting: (1<=p_m)
states: 54
abstracting: (1<=access)
states: 80
abstracting: (p_i1<=initialized)
states: 54
abstracting: (p_i2<=0)
states: 36
abstracting: (p_rdy<=r_active)
states: 110
abstracting: (1<=p_m)
states: 54
abstracting: (3<=p_rel)
states: 0
abstracting: (p_i2<=3)
states: 110
abstracting: (2<=p_i2)
states: 30
abstracting: (1<=moved)
states: 20
abstracting: (3<=r_active)
states: 0
abstracting: (r_stopped<=p_rdy)
states: 84
abstracting: (r_moving<=p_i1)
states: 100
abstracting: (move<=2)
states: 110
abstracting: (r_moving<=2)
states: 110
-> the formula is FALSE
FORMULA RobotManipulation-PT-00001-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AG [[[[~ [[[2<=r_active & ~ [[[p_i2<=r_stopped | r_moving<=r_moving] & ~ [access<=1]]]] & [p_m<=moved & [~ [[2<=access & moved<=2]] & [~ [1<=off] & move<=3]]]]] | [~ [[[[initialized<=p_m | 3<=p_i1] | initialize<=move] & p_i2<=p_rdy]] & ~ [r_stopped<=2]]] | ~ [[~ [[[[initialize<=3 | 3<=p_i2] & p_m<=3] & [[2<=p_m | p_i1<=3] & [1<=r_moving | 2<=p_rel]]]] & 2<=off]]] & [[initialized<=2 & [[~ [2<=access] & [~ [[[2<=initialize | move<=r_moving] | 1<=p_rel]] | ~ [3<=r_active]]] & [off<=initialize & [[[[p_rdy<=1 & r_stopped<=0] | access<=r_active] & 3<=p_i2] | [initialize<=2 & [~ [3<=moved] | ~ [p_rdy<=off]]]]]]] & [~ [[[[2<=r_stopped & r_stopped<=1] | [[~ [r_moving<=0] | ~ [move<=2]] & [[3<=initialized | 2<=p_i1] | [access<=1 | r_moving<=0]]]] | [[[~ [r_moving<=0] | 3<=p_rel] | [~ [initialize<=initialized] | [2<=initialize | 3<=r_stopped]]] & [[[moved<=0 & r_stopped<=r_active] & [initialize<=r_stopped | initialize<=move]] & [r_stopped<=3 & [p_rdy<=1 | access<=r_active]]]]]] & ~ [[p_i2<=initialized & [[~ [[r_moving<=0 | 1<=r_stopped]] & [~ [p_m<=p_i2] | [p_i1<=3 | initialized<=r_stopped]]] & [[[p_rel<=access & 2<=off] & [access<=2 & 1<=p_sc]] & access<=2]]]]]]]]
normalized: ~ [E [true U ~ [[[~ [[~ [[[[1<=r_moving | 2<=p_rel] & [2<=p_m | p_i1<=3]] & [[initialize<=3 | 3<=p_i2] & p_m<=3]]] & 2<=off]] | [[~ [r_stopped<=2] & ~ [[[[initialized<=p_m | 3<=p_i1] | initialize<=move] & p_i2<=p_rdy]]] | ~ [[[[[~ [1<=off] & move<=3] & ~ [[2<=access & moved<=2]]] & p_m<=moved] & [~ [[~ [access<=1] & [p_i2<=r_stopped | r_moving<=r_moving]]] & 2<=r_active]]]]] & [[~ [[[[[[access<=2 & 1<=p_sc] & [p_rel<=access & 2<=off]] & access<=2] & [[[p_i1<=3 | initialized<=r_stopped] | ~ [p_m<=p_i2]] & ~ [[r_moving<=0 | 1<=r_stopped]]]] & p_i2<=initialized]] & ~ [[[[[[p_rdy<=1 | access<=r_active] & r_stopped<=3] & [[initialize<=r_stopped | initialize<=move] & [moved<=0 & r_stopped<=r_active]]] & [[[2<=initialize | 3<=r_stopped] | ~ [initialize<=initialized]] | [~ [r_moving<=0] | 3<=p_rel]]] | [[[[access<=1 | r_moving<=0] | [3<=initialized | 2<=p_i1]] & [~ [move<=2] | ~ [r_moving<=0]]] | [2<=r_stopped & r_stopped<=1]]]]] & [[[[[[~ [p_rdy<=off] | ~ [3<=moved]] & initialize<=2] | [[[p_rdy<=1 & r_stopped<=0] | access<=r_active] & 3<=p_i2]] & off<=initialize] & [[~ [3<=r_active] | ~ [[[2<=initialize | move<=r_moving] | 1<=p_rel]]] & ~ [2<=access]]] & initialized<=2]]]]]]
abstracting: (initialized<=2)
states: 110
abstracting: (2<=access)
states: 30
abstracting: (1<=p_rel)
states: 20
abstracting: (move<=r_moving)
states: 92
abstracting: (2<=initialize)
states: 20
abstracting: (3<=r_active)
states: 0
abstracting: (off<=initialize)
states: 100
abstracting: (3<=p_i2)
states: 6
abstracting: (access<=r_active)
states: 93
abstracting: (r_stopped<=0)
states: 81
abstracting: (p_rdy<=1)
states: 108
abstracting: (initialize<=2)
states: 107
abstracting: (3<=moved)
states: 0
abstracting: (p_rdy<=off)
states: 93
abstracting: (r_stopped<=1)
states: 106
abstracting: (2<=r_stopped)
states: 4
abstracting: (r_moving<=0)
states: 90
abstracting: (move<=2)
states: 110
abstracting: (2<=p_i1)
states: 20
abstracting: (3<=initialized)
states: 0
abstracting: (r_moving<=0)
states: 90
abstracting: (access<=1)
states: 80
abstracting: (3<=p_rel)
states: 0
abstracting: (r_moving<=0)
states: 90
abstracting: (initialize<=initialized)
states: 54
abstracting: (3<=r_stopped)
states: 0
abstracting: (2<=initialize)
states: 20
abstracting: (r_stopped<=r_active)
states: 103
abstracting: (moved<=0)
states: 90
abstracting: (initialize<=move)
states: 54
abstracting: (initialize<=r_stopped)
states: 55
abstracting: (r_stopped<=3)
states: 110
abstracting: (access<=r_active)
states: 93
abstracting: (p_rdy<=1)
states: 108
abstracting: (p_i2<=initialized)
states: 45
abstracting: (1<=r_stopped)
states: 29
abstracting: (r_moving<=0)
states: 90
abstracting: (p_m<=p_i2)
states: 83
abstracting: (initialized<=r_stopped)
states: 93
abstracting: (p_i1<=3)
states: 110
abstracting: (access<=2)
states: 110
abstracting: (2<=off)
states: 4
abstracting: (p_rel<=access)
states: 100
abstracting: (1<=p_sc)
states: 20
abstracting: (access<=2)
states: 110
abstracting: (2<=r_active)
states: 64
abstracting: (r_moving<=r_moving)
states: 110
abstracting: (p_i2<=r_stopped)
states: 46
abstracting: (access<=1)
states: 80
abstracting: (p_m<=moved)
states: 72
abstracting: (moved<=2)
states: 110
abstracting: (2<=access)
states: 30
abstracting: (move<=3)
states: 110
abstracting: (1<=off)
states: 29
abstracting: (p_i2<=p_rdy)
states: 45
abstracting: (initialize<=move)
states: 54
abstracting: (3<=p_i1)
states: 3
abstracting: (initialized<=p_m)
states: 96
abstracting: (r_stopped<=2)
states: 110
abstracting: (2<=off)
states: 4
abstracting: (p_m<=3)
states: 110
abstracting: (3<=p_i2)
states: 6
abstracting: (initialize<=3)
states: 110
abstracting: (p_i1<=3)
states: 110
abstracting: (2<=p_m)
states: 12
abstracting: (2<=p_rel)
states: 2
abstracting: (1<=r_moving)
states: 20
-> the formula is FALSE
FORMULA RobotManipulation-PT-00001-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
totally nodes used: 3147 (3.1e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2620 4646 7266
used/not used/entry size/cache size: 5322 67103542 16 1024MB
basic ops cache: hits/miss/sum: 4173 11757 15930
used/not used/entry size/cache size: 18401 16758815 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: 1112 1440 2552
used/not used/entry size/cache size: 1440 8387168 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 67105960
1 2806
2 36
3 22
4 23
5 5
6 8
7 0
8 3
9 0
>= 10 1
Total processing time: 0m 6.495sec
BK_STOP 1678948336638
--------------------
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:97 (8), effective:21 (1)
initing FirstDep: 0m 0.000sec
iterations count:13 (1), effective:1 (0)
iterations count:43 (3), effective:8 (0)
iterations count:43 (3), effective:10 (0)
iterations count:11 (1), effective:0 (0)
iterations count:57 (5), effective:11 (1)
iterations count:11 (1), effective:0 (0)
iterations count:41 (3), effective:6 (0)
iterations count:11 (1), effective:0 (0)
iterations count:38 (3), effective:6 (0)
iterations count:11 (1), effective:0 (0)
iterations count:74 (6), effective:13 (1)
iterations count:73 (6), effective:15 (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-00001"
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 RobotManipulation-PT-00001, 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 r353-smll-167891800400006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-00001.tgz
mv RobotManipulation-PT-00001 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 ;