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.r362-smll-167891812100022.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 RobotManipulation-PT-00005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r362-smll-167891812100022
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-01
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-02
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-03
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-04
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-05
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-06
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-07
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-08
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-09
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-10
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-11
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-12
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-13
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-14
FORMULA_NAME RobotManipulation-PT-00005-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678978174066

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=RobotManipulation-PT-00005
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 14:49:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 14:49:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 14:49:38] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2023-03-16 14:49:38] [INFO ] Transformed 15 places.
[2023-03-16 14:49:38] [INFO ] Transformed 11 transitions.
[2023-03-16 14:49:38] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 13) seen :8
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 11 rows 15 cols
[2023-03-16 14:49:39] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-16 14:49:39] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-16 14:49:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 14:49:39] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 14:49:39] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 1932 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: 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 4.131sec


RS generation: 0m 0.014sec


-> reachability set: #nodes 1827 (1.8e+03) #states 184,756 (5)



starting MCC model checker
--------------------------

checking: EF [10<=moved]
normalized: E [true U 10<=moved]

abstracting: (10<=moved)
states: 2
-> the formula is TRUE

FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: EF [~ [off<=5]]
normalized: E [true U ~ [off<=5]]

abstracting: (off<=5)
states: 180,356 (5)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

checking: EF [~ [off<=7]]
normalized: E [true U ~ [off<=7]]

abstracting: (off<=7)
states: 184,286 (5)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AG [p_i1<=11]
normalized: ~ [E [true U ~ [p_i1<=11]]]

abstracting: (p_i1<=11)
states: 184,756 (5)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [p_m<=p_m]
normalized: ~ [E [true U ~ [p_m<=p_m]]]

abstracting: (p_m<=p_m)
states: 184,756 (5)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [move<=move]
normalized: ~ [E [true U ~ [move<=move]]]

abstracting: (move<=move)
states: 184,756 (5)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [r_stopped<=moved]
normalized: E [true U r_stopped<=moved]

abstracting: (r_stopped<=moved)
states: 99,144 (4)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: AG [r_active<=r_active]
normalized: ~ [E [true U ~ [r_active<=r_active]]]

abstracting: (r_active<=r_active)
states: 184,756 (5)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [10<=off] | p_m<=p_rel]]
normalized: ~ [E [true U ~ [[~ [10<=off] | p_m<=p_rel]]]]

abstracting: (p_m<=p_rel)
states: 50,204 (4)
abstracting: (10<=off)
states: 12
-> the formula is TRUE

FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[10<=p_rel | [[p_sc<=8 & [[moved<=moved & [[~ [[11<=initialized | initialize<=initialize]] & 4<=p_i1] | r_stopped<=access]] & [[9<=off & moved<=moved] & ~ [p_sc<=10]]]] | ~ [11<=p_rel]]]]
normalized: ~ [E [true U ~ [[[~ [11<=p_rel] | [[[~ [p_sc<=10] & [9<=off & moved<=moved]] & [[[~ [[11<=initialized | initialize<=initialize]] & 4<=p_i1] | r_stopped<=access] & moved<=moved]] & p_sc<=8]] | 10<=p_rel]]]]

abstracting: (10<=p_rel)
states: 2
abstracting: (p_sc<=8)
states: 184,736 (5)
abstracting: (moved<=moved)
states: 184,756 (5)
abstracting: (r_stopped<=access)
states: 184,756 (5)
abstracting: (4<=p_i1)
states: 35,750 (4)
abstracting: (initialize<=initialize)
states: 184,756 (5)
abstracting: (11<=initialized)
states: 0
abstracting: (moved<=moved)
states: 184,756 (5)
abstracting: (9<=off)
states: 101
abstracting: (p_sc<=10)
states: 184,756 (5)
abstracting: (11<=p_rel)
states: 0
-> the formula is TRUE

FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [~ [[[[[~ [p_m<=p_i1] | access<=r_moving] | [[~ [initialized<=p_sc] | ~ [[r_stopped<=move & 2<=initialize]]] | ~ [move<=access]]] | ~ [[[[access<=6 & ~ [r_stopped<=10]] | [~ [initialized<=r_moving] | [off<=r_moving | 3<=p_i2]]] & ~ [[~ [p_i1<=initialize] & ~ [p_m<=move]]]]]] | p_i1<=4]]]
normalized: E [true U ~ [[[~ [[~ [[~ [p_m<=move] & ~ [p_i1<=initialize]]] & [[[off<=r_moving | 3<=p_i2] | ~ [initialized<=r_moving]] | [~ [r_stopped<=10] & access<=6]]]] | [[~ [move<=access] | [~ [[r_stopped<=move & 2<=initialize]] | ~ [initialized<=p_sc]]] | [~ [p_m<=p_i1] | access<=r_moving]]] | p_i1<=4]]]

abstracting: (p_i1<=4)
states: 165,737 (5)
abstracting: (access<=r_moving)
states: 20,504 (4)
abstracting: (p_m<=p_i1)
states: 77,264 (4)
abstracting: (initialized<=p_sc)
states: 120,344 (5)
abstracting: (2<=initialize)
states: 97,240 (4)
abstracting: (r_stopped<=move)
states: 99,144 (4)
abstracting: (move<=access)
states: 173,096 (5)
abstracting: (access<=6)
states: 137,654 (5)
abstracting: (r_stopped<=10)
states: 184,756 (5)
abstracting: (initialized<=r_moving)
states: 120,344 (5)
abstracting: (3<=p_i2)
states: 100,100 (5)
abstracting: (off<=r_moving)
states: 99,144 (4)
abstracting: (p_i1<=initialize)
states: 102,572 (5)
abstracting: (p_m<=move)
states: 38,896 (4)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.106sec

checking: AG [~ [[~ [[[[~ [3<=p_i2] & 4<=p_rel] | 7<=initialized] | [~ [[p_m<=7 & p_rel<=11]] | p_rdy<=7]]] & [~ [[[[moved<=off & [[p_rdy<=7 & 6<=p_i1] | 1<=r_stopped]] & [[[move<=11 | p_i2<=p_rdy] & 8<=r_active] | ~ [7<=r_active]]] | [[3<=move & [[r_active<=moved | r_active<=p_sc] & [p_i2<=initialize | p_i1<=9]]] | [5<=initialize | initialized<=move]]]] & move<=move]]]]
normalized: ~ [E [true U [[move<=move & ~ [[[[5<=initialize | initialized<=move] | [3<=move & [[p_i2<=initialize | p_i1<=9] & [r_active<=moved | r_active<=p_sc]]]] | [[~ [7<=r_active] | [8<=r_active & [move<=11 | p_i2<=p_rdy]]] & [moved<=off & [1<=r_stopped | [p_rdy<=7 & 6<=p_i1]]]]]]] & ~ [[[p_rdy<=7 | ~ [[p_m<=7 & p_rel<=11]]] | [7<=initialized | [4<=p_rel & ~ [3<=p_i2]]]]]]]]

abstracting: (3<=p_i2)
states: 100,100 (5)
abstracting: (4<=p_rel)
states: 10,010 (4)
abstracting: (7<=initialized)
states: 440
abstracting: (p_rel<=11)
states: 184,756 (5)
abstracting: (p_m<=7)
states: 181,334 (5)
abstracting: (p_rdy<=7)
states: 184,646 (5)
abstracting: (6<=p_i1)
states: 9,152 (3)
abstracting: (p_rdy<=7)
states: 184,646 (5)
abstracting: (1<=r_stopped)
states: 121,550 (5)
abstracting: (moved<=off)
states: 131,350 (5)
abstracting: (p_i2<=p_rdy)
states: 52,842 (4)
abstracting: (move<=11)
states: 184,756 (5)
abstracting: (8<=r_active)
states: 102,674 (5)
abstracting: (7<=r_active)
states: 133,562 (5)
abstracting: (r_active<=p_sc)
states: 352
abstracting: (r_active<=moved)
states: 352
abstracting: (p_i1<=9)
states: 184,664 (5)
abstracting: (p_i2<=initialize)
states: 87,516 (4)
abstracting: (3<=move)
states: 22,880 (4)
abstracting: (initialized<=move)
states: 120,344 (5)
abstracting: (5<=initialize)
states: 19,019 (4)
abstracting: (move<=move)
states: 184,756 (5)
-> the formula is FALSE

FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: AG [[~ [[[[[6<=p_rel & [~ [r_moving<=6] & [[r_active<=access | 1<=initialized] | [p_i1<=p_sc | p_i2<=p_rdy]]]] | [p_i2<=p_i2 & ~ [p_rel<=10]]] & r_active<=p_rel] & [7<=initialize | 10<=p_sc]]] | [~ [[p_i1<=p_i2 | [[[[~ [p_sc<=p_rel] & [2<=move | off<=initialized]] & [r_active<=7 | ~ [access<=3]]] | ~ [[2<=r_moving & 9<=p_rdy]]] & [[r_moving<=p_m & ~ [r_moving<=0]] & p_rdy<=2]]]] | [[[[initialized<=3 | [~ [5<=r_moving] & ~ [p_sc<=r_active]]] & [[~ [[access<=8 & r_moving<=11]] | ~ [p_i1<=4]] | 6<=off]] | ~ [[[[[move<=p_i2 & r_stopped<=10] | ~ [p_i1<=p_m]] & ~ [[3<=p_i2 | moved<=r_stopped]]] & ~ [3<=p_rdy]]]] & ~ [5<=initialize]]]]]
normalized: ~ [E [true U ~ [[[[~ [5<=initialize] & [~ [[~ [3<=p_rdy] & [~ [[3<=p_i2 | moved<=r_stopped]] & [~ [p_i1<=p_m] | [move<=p_i2 & r_stopped<=10]]]]] | [[6<=off | [~ [p_i1<=4] | ~ [[access<=8 & r_moving<=11]]]] & [initialized<=3 | [~ [p_sc<=r_active] & ~ [5<=r_moving]]]]]] | ~ [[p_i1<=p_i2 | [[p_rdy<=2 & [r_moving<=p_m & ~ [r_moving<=0]]] & [~ [[2<=r_moving & 9<=p_rdy]] | [[r_active<=7 | ~ [access<=3]] & [[2<=move | off<=initialized] & ~ [p_sc<=p_rel]]]]]]]] | ~ [[[7<=initialize | 10<=p_sc] & [r_active<=p_rel & [[p_i2<=p_i2 & ~ [p_rel<=10]] | [6<=p_rel & [[[p_i1<=p_sc | p_i2<=p_rdy] | [r_active<=access | 1<=initialized]] & ~ [r_moving<=6]]]]]]]]]]]

abstracting: (r_moving<=6)
states: 184,316 (5)
abstracting: (1<=initialized)
states: 97,240 (4)
abstracting: (r_active<=access)
states: 44,924 (4)
abstracting: (p_i2<=p_rdy)
states: 52,842 (4)
abstracting: (p_i1<=p_sc)
states: 81,372 (4)
abstracting: (6<=p_rel)
states: 1,430 (3)
abstracting: (p_rel<=10)
states: 184,756 (5)
abstracting: (p_i2<=p_i2)
states: 184,756 (5)
abstracting: (r_active<=p_rel)
states: 352
abstracting: (10<=p_sc)
states: 2
abstracting: (7<=initialize)
states: 3,905 (3)
abstracting: (p_sc<=p_rel)
states: 120,344 (5)
abstracting: (off<=initialized)
states: 99,144 (4)
abstracting: (2<=move)
states: 48,620 (4)
abstracting: (access<=3)
states: 47,102 (4)
abstracting: (r_active<=7)
states: 82,082 (4)
abstracting: (9<=p_rdy)
states: 20
abstracting: (2<=r_moving)
states: 48,620 (4)
abstracting: (r_moving<=0)
states: 87,516 (4)
abstracting: (r_moving<=p_m)
states: 184,756 (5)
abstracting: (p_rdy<=2)
states: 161,876 (5)
abstracting: (p_i1<=p_i2)
states: 123,794 (5)
abstracting: (5<=r_moving)
states: 4,004 (3)
abstracting: (p_sc<=r_active)
states: 184,756 (5)
abstracting: (initialized<=3)
states: 174,746 (5)
abstracting: (r_moving<=11)
states: 184,756 (5)
abstracting: (access<=8)
states: 175,604 (5)
abstracting: (p_i1<=4)
states: 165,737 (5)
abstracting: (6<=off)
states: 4,400 (3)
abstracting: (r_stopped<=10)
states: 184,756 (5)
abstracting: (move<=p_i2)
states: 156,226 (5)
abstracting: (p_i1<=p_m)
states: 131,234 (5)
abstracting: (moved<=r_stopped)
states: 131,350 (5)
abstracting: (3<=p_i2)
states: 100,100 (5)
abstracting: (3<=p_rdy)
states: 22,880 (4)
abstracting: (5<=initialize)
states: 19,019 (4)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.077sec

checking: EF [~ [[[[~ [[[off<=p_i1 | [[r_moving<=1 | 4<=p_i2] & ~ [8<=r_moving]]] & p_i1<=4]] | ~ [[[[~ [10<=p_m] | ~ [1<=p_sc]] | [[access<=11 | 1<=moved] & ~ [1<=p_m]]] | p_i2<=access]]] | ~ [[~ [[~ [[p_i2<=r_moving | p_rel<=6]] | [[8<=off | 7<=p_i2] | [p_rdy<=move & initialized<=3]]]] & [~ [[[r_moving<=p_i2 & p_rel<=p_i2] & p_m<=p_i2]] & [~ [6<=p_rel] & 10<=initialized]]]]] | ~ [[~ [[~ [[11<=p_i2 | [4<=r_moving & off<=p_sc]]] | ~ [2<=p_m]]] & [[~ [p_i1<=p_rel] & [[~ [p_rdy<=access] & [p_i1<=p_rdy | 4<=initialized]] & [r_active<=initialize & ~ [off<=4]]]] | [p_i1<=3 | [[[8<=p_i2 | p_m<=2] | [move<=8 & 2<=p_m]] & [[10<=r_stopped | r_stopped<=4] & 8<=r_moving]]]]]]]]]
normalized: E [true U ~ [[~ [[[[p_i1<=3 | [[8<=r_moving & [10<=r_stopped | r_stopped<=4]] & [[move<=8 & 2<=p_m] | [8<=p_i2 | p_m<=2]]]] | [[[r_active<=initialize & ~ [off<=4]] & [[p_i1<=p_rdy | 4<=initialized] & ~ [p_rdy<=access]]] & ~ [p_i1<=p_rel]]] & ~ [[~ [2<=p_m] | ~ [[11<=p_i2 | [4<=r_moving & off<=p_sc]]]]]]] | [~ [[[[10<=initialized & ~ [6<=p_rel]] & ~ [[p_m<=p_i2 & [r_moving<=p_i2 & p_rel<=p_i2]]]] & ~ [[[[p_rdy<=move & initialized<=3] | [8<=off | 7<=p_i2]] | ~ [[p_i2<=r_moving | p_rel<=6]]]]]] | [~ [[p_i2<=access | [[~ [1<=p_m] & [access<=11 | 1<=moved]] | [~ [1<=p_sc] | ~ [10<=p_m]]]]] | ~ [[p_i1<=4 & [off<=p_i1 | [~ [8<=r_moving] & [r_moving<=1 | 4<=p_i2]]]]]]]]]]

abstracting: (4<=p_i2)
states: 68,354 (4)
abstracting: (r_moving<=1)
states: 136,136 (5)
abstracting: (8<=r_moving)
states: 110
abstracting: (off<=p_i1)
states: 136,136 (5)
abstracting: (p_i1<=4)
states: 165,737 (5)
abstracting: (10<=p_m)
states: 132
abstracting: (1<=p_sc)
states: 97,240 (4)
abstracting: (1<=moved)
states: 97,240 (4)
abstracting: (access<=11)
states: 184,756 (5)
abstracting: (1<=p_m)
states: 168,740 (5)
abstracting: (p_i2<=access)
states: 165,308 (5)
abstracting: (p_rel<=6)
states: 184,316 (5)
abstracting: (p_i2<=r_moving)
states: 52,842 (4)
abstracting: (7<=p_i2)
states: 11,990 (4)
abstracting: (8<=off)
states: 470
abstracting: (initialized<=3)
states: 174,746 (5)
abstracting: (p_rdy<=move)
states: 120,344 (5)
abstracting: (p_rel<=p_i2)
states: 156,226 (5)
abstracting: (r_moving<=p_i2)
states: 156,226 (5)
abstracting: (p_m<=p_i2)
states: 101,774 (5)
abstracting: (6<=p_rel)
states: 1,430 (3)
abstracting: (10<=initialized)
states: 2
abstracting: (off<=p_sc)
states: 99,144 (4)
abstracting: (4<=r_moving)
states: 10,010 (4)
abstracting: (11<=p_i2)
states: 66
abstracting: (2<=p_m)
states: 138,710 (5)
abstracting: (p_i1<=p_rel)
states: 81,372 (4)
abstracting: (p_rdy<=access)
states: 184,756 (5)
abstracting: (4<=initialized)
states: 10,010 (4)
abstracting: (p_i1<=p_rdy)
states: 81,372 (4)
abstracting: (off<=4)
states: 174,317 (5)
abstracting: (r_active<=initialize)
states: 10,856 (4)
abstracting: (p_m<=2)
states: 82,082 (4)
abstracting: (8<=p_i2)
states: 5,150 (3)
abstracting: (2<=p_m)
states: 138,710 (5)
abstracting: (move<=8)
states: 184,736 (5)
abstracting: (r_stopped<=4)
states: 174,317 (5)
abstracting: (10<=r_stopped)
states: 12
abstracting: (8<=r_moving)
states: 110
abstracting: (p_i1<=3)
states: 149,006 (5)
-> the formula is FALSE

FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.076sec

checking: AG [[[[~ [p_rdy<=4] & [~ [off<=move] & ~ [8<=p_i2]]] | [[initialize<=p_rel & [off<=4 & [[[[p_i2<=move | r_moving<=r_stopped] | [p_rel<=r_stopped & r_active<=7]] & ~ [[4<=off & initialize<=2]]] & [[[moved<=r_moving & p_i2<=access] & ~ [r_moving<=0]] & [[initialize<=2 | moved<=moved] | [p_sc<=access | p_rdy<=moved]]]]]] | ~ [p_rel<=2]]] | [~ [[[[p_rdy<=p_i1 | [r_active<=9 & [p_i2<=5 & moved<=p_rdy]]] | [~ [[4<=initialized | r_active<=1]] | [2<=r_stopped | [p_i1<=r_stopped | 5<=p_m]]]] & [move<=0 | ~ [[[initialized<=p_rdy & p_rel<=r_moving] & 1<=p_rel]]]]] | [~ [r_stopped<=p_m] & ~ [[~ [3<=access] & [~ [[~ [p_rdy<=access] | 8<=r_moving]] & r_active<=p_rdy]]]]]]]
normalized: ~ [E [true U ~ [[[[~ [[[r_active<=p_rdy & ~ [[8<=r_moving | ~ [p_rdy<=access]]]] & ~ [3<=access]]] & ~ [r_stopped<=p_m]] | ~ [[[move<=0 | ~ [[1<=p_rel & [initialized<=p_rdy & p_rel<=r_moving]]]] & [[[2<=r_stopped | [p_i1<=r_stopped | 5<=p_m]] | ~ [[4<=initialized | r_active<=1]]] | [p_rdy<=p_i1 | [r_active<=9 & [p_i2<=5 & moved<=p_rdy]]]]]]] | [[~ [p_rel<=2] | [initialize<=p_rel & [off<=4 & [[[[p_sc<=access | p_rdy<=moved] | [initialize<=2 | moved<=moved]] & [~ [r_moving<=0] & [moved<=r_moving & p_i2<=access]]] & [~ [[4<=off & initialize<=2]] & [[p_rel<=r_stopped & r_active<=7] | [p_i2<=move | r_moving<=r_stopped]]]]]]] | [[~ [8<=p_i2] & ~ [off<=move]] & ~ [p_rdy<=4]]]]]]]

abstracting: (p_rdy<=4)
states: 180,752 (5)
abstracting: (off<=move)
states: 99,144 (4)
abstracting: (8<=p_i2)
states: 5,150 (3)
abstracting: (r_moving<=r_stopped)
states: 131,350 (5)
abstracting: (p_i2<=move)
states: 52,842 (4)
abstracting: (r_active<=7)
states: 82,082 (4)
abstracting: (p_rel<=r_stopped)
states: 131,350 (5)
abstracting: (initialize<=2)
states: 123,266 (5)
abstracting: (4<=off)
states: 22,022 (4)
abstracting: (p_i2<=access)
states: 165,308 (5)
abstracting: (moved<=r_moving)
states: 120,344 (5)
abstracting: (r_moving<=0)
states: 87,516 (4)
abstracting: (moved<=moved)
states: 184,756 (5)
abstracting: (initialize<=2)
states: 123,266 (5)
abstracting: (p_rdy<=moved)
states: 120,344 (5)
abstracting: (p_sc<=access)
states: 173,096 (5)
abstracting: (off<=4)
states: 174,317 (5)
abstracting: (initialize<=p_rel)
states: 81,372 (4)
abstracting: (p_rel<=2)
states: 161,876 (5)
abstracting: (moved<=p_rdy)
states: 120,344 (5)
abstracting: (p_i2<=5)
states: 160,754 (5)
abstracting: (r_active<=9)
states: 157,300 (5)
abstracting: (p_rdy<=p_i1)
states: 141,544 (5)
abstracting: (r_active<=1)
states: 542
abstracting: (4<=initialized)
states: 10,010 (4)
abstracting: (5<=p_m)
states: 40,634 (4)
abstracting: (p_i1<=r_stopped)
states: 92,378 (4)
abstracting: (2<=r_stopped)
states: 74,360 (4)
abstracting: (p_rel<=r_moving)
states: 120,344 (5)
abstracting: (initialized<=p_rdy)
states: 120,344 (5)
abstracting: (1<=p_rel)
states: 97,240 (4)
abstracting: (move<=0)
states: 87,516 (4)
abstracting: (r_stopped<=p_m)
states: 143,036 (5)
abstracting: (3<=access)
states: 160,754 (5)
abstracting: (p_rdy<=access)
states: 184,756 (5)
abstracting: (8<=r_moving)
states: 110
abstracting: (r_active<=p_rdy)
states: 352
-> the formula is FALSE

FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.147sec

checking: EF [[[[~ [access<=p_rdy] & [~ [moved<=8] & ~ [[[[[7<=r_stopped & 11<=access] & [initialize<=4 & p_i1<=0]] & [11<=moved & 5<=move]] & p_i1<=3]]]] | [[~ [[[[[1<=p_sc & r_moving<=p_sc] & [p_rdy<=11 & 8<=p_rel]] | [[2<=p_rel & 1<=access] | ~ [p_rel<=7]]] & [[~ [p_sc<=initialized] & [r_active<=p_i2 | 7<=moved]] & [[5<=p_i2 & 7<=r_active] | 4<=access]]]] & [[[~ [r_active<=r_stopped] | ~ [r_moving<=p_i2]] & [p_rel<=0 & initialized<=4]] | ~ [p_sc<=p_rdy]]] & 4<=r_moving]] & [[move<=2 | p_i2<=10] | [[~ [[[r_moving<=off & ~ [[11<=r_stopped & p_m<=9]]] | [~ [[off<=r_active | initialize<=p_sc]] & [[r_moving<=5 | 2<=off] & [off<=9 & moved<=p_rel]]]]] & [[7<=moved | ~ [8<=r_active]] & p_rel<=7]] & [initialized<=0 | ~ [[p_rel<=initialize | r_stopped<=access]]]]]]]
normalized: E [true U [[[[initialized<=0 | ~ [[p_rel<=initialize | r_stopped<=access]]] & [[p_rel<=7 & [7<=moved | ~ [8<=r_active]]] & ~ [[[[[off<=9 & moved<=p_rel] & [r_moving<=5 | 2<=off]] & ~ [[off<=r_active | initialize<=p_sc]]] | [r_moving<=off & ~ [[11<=r_stopped & p_m<=9]]]]]]] | [move<=2 | p_i2<=10]] & [[4<=r_moving & [[~ [p_sc<=p_rdy] | [[p_rel<=0 & initialized<=4] & [~ [r_moving<=p_i2] | ~ [r_active<=r_stopped]]]] & ~ [[[[4<=access | [5<=p_i2 & 7<=r_active]] & [[r_active<=p_i2 | 7<=moved] & ~ [p_sc<=initialized]]] & [[~ [p_rel<=7] | [2<=p_rel & 1<=access]] | [[p_rdy<=11 & 8<=p_rel] & [1<=p_sc & r_moving<=p_sc]]]]]]] | [[~ [[p_i1<=3 & [[11<=moved & 5<=move] & [[initialize<=4 & p_i1<=0] & [7<=r_stopped & 11<=access]]]]] & ~ [moved<=8]] & ~ [access<=p_rdy]]]]]

abstracting: (access<=p_rdy)
states: 6,006 (3)
abstracting: (moved<=8)
states: 184,736 (5)
abstracting: (11<=access)
states: 0
abstracting: (7<=r_stopped)
states: 1,595 (3)
abstracting: (p_i1<=0)
states: 43,758 (4)
abstracting: (initialize<=4)
states: 165,737 (5)
abstracting: (5<=move)
states: 4,004 (3)
abstracting: (11<=moved)
states: 0
abstracting: (p_i1<=3)
states: 149,006 (5)
abstracting: (r_moving<=p_sc)
states: 120,344 (5)
abstracting: (1<=p_sc)
states: 97,240 (4)
abstracting: (8<=p_rel)
states: 110
abstracting: (p_rdy<=11)
states: 184,756 (5)
abstracting: (1<=access)
states: 182,754 (5)
abstracting: (2<=p_rel)
states: 48,620 (4)
abstracting: (p_rel<=7)
states: 184,646 (5)
abstracting: (p_sc<=initialized)
states: 120,344 (5)
abstracting: (7<=moved)
states: 440
abstracting: (r_active<=p_i2)
states: 17,302 (4)
abstracting: (7<=r_active)
states: 133,562 (5)
abstracting: (5<=p_i2)
states: 42,614 (4)
abstracting: (4<=access)
states: 137,654 (5)
abstracting: (r_active<=r_stopped)
states: 13,409 (4)
abstracting: (r_moving<=p_i2)
states: 156,226 (5)
abstracting: (initialized<=4)
states: 180,752 (5)
abstracting: (p_rel<=0)
states: 87,516 (4)
abstracting: (p_sc<=p_rdy)
states: 120,344 (5)
abstracting: (4<=r_moving)
states: 10,010 (4)
abstracting: (p_i2<=10)
states: 184,690 (5)
abstracting: (move<=2)
states: 161,876 (5)
abstracting: (p_m<=9)
states: 184,624 (5)
abstracting: (11<=r_stopped)
states: 0
abstracting: (r_moving<=off)
states: 131,350 (5)
abstracting: (initialize<=p_sc)
states: 81,372 (4)
abstracting: (off<=r_active)
states: 184,756 (5)
abstracting: (2<=off)
states: 74,360 (4)
abstracting: (r_moving<=5)
states: 183,326 (5)
abstracting: (moved<=p_rel)
states: 120,344 (5)
abstracting: (off<=9)
states: 184,744 (5)
abstracting: (8<=r_active)
states: 102,674 (5)
abstracting: (7<=moved)
states: 440
abstracting: (p_rel<=7)
states: 184,646 (5)
abstracting: (r_stopped<=access)
states: 184,756 (5)
abstracting: (p_rel<=initialize)
states: 141,544 (5)
abstracting: (initialized<=0)
states: 87,516 (4)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00005-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.135sec

totally nodes used: 179049 (1.8e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 346819 248086 594905
used/not used/entry size/cache size: 305853 66803011 16 1024MB
basic ops cache: hits/miss/sum: 452225 450746 902971
used/not used/entry size/cache size: 750920 16026296 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: 94103 69385 163488
used/not used/entry size/cache size: 69250 8319358 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 66950707
1 149060
2 6547
3 1401
4 376
5 179
6 127
7 49
8 24
9 17
>= 10 377

Total processing time: 0m 6.589sec


BK_STOP 1678978187864

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:433 (39), effective:101 (9)

initing FirstDep: 0m 0.000sec


iterations count:341 (31), effective:90 (8)

iterations count:257 (23), effective:54 (4)

iterations count:339 (30), effective:72 (6)

iterations count:86 (7), effective:30 (2)

iterations count:401 (36), effective:92 (8)

iterations count:378 (34), effective:84 (7)

iterations count:144 (13), effective:49 (4)

iterations count:216 (19), effective:57 (5)

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="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 RobotManipulation-PT-00005, 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 r362-smll-167891812100022"
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 [ "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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;