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-167891812000009.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-00002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r362-smll-167891812000009
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 8.0K Feb 26 05:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 05:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 05:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 05:35 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.1K Feb 25 16:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Feb 25 16:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 05:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Feb 26 05:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 05:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 05:36 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.3K 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-00002-CTLCardinality-00
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-01
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-02
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-03
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-04
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-05
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-06
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-07
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-08
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-09
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-10
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-11
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-12
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-13
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-14
FORMULA_NAME RobotManipulation-PT-00002-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678978009250

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RobotManipulation-PT-00002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 14:46:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 14:46:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 14:46:53] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2023-03-16 14:46:53] [INFO ] Transformed 15 places.
[2023-03-16 14:46:53] [INFO ] Transformed 11 transitions.
[2023-03-16 14:46:53] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 226 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 34 ms.
Initial state reduction rules removed 4 formulas.
FORMULA RobotManipulation-PT-00002-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00002-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00002-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00002-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00002-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 19 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 15 cols
[2023-03-16 14:46:53] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-16 14:46:53] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-16 14:46:53] [INFO ] Invariant cache hit.
[2023-03-16 14:46:53] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2023-03-16 14:46:53] [INFO ] Invariant cache hit.
[2023-03-16 14:46:54] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 464 ms. Remains : 15/15 places, 11/11 transitions.
Support contains 15 out of 15 places after structural reductions.
[2023-03-16 14:46:54] [INFO ] Flatten gal took : 30 ms
[2023-03-16 14:46:54] [INFO ] Flatten gal took : 9 ms
[2023-03-16 14:46:54] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 600 ms. (steps per millisecond=16 ) properties (out of 56) seen :48
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-16 14:46:56] [INFO ] Invariant cache hit.
[2023-03-16 14:46:56] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 14:46:56] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 14:46:56] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:5
[2023-03-16 14:46:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 14:46:56] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 14:46:56] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 8 atomic propositions for a total of 11 simplifications.
[2023-03-16 14:46:56] [INFO ] Flatten gal took : 5 ms
[2023-03-16 14:46:56] [INFO ] Flatten gal took : 4 ms
[2023-03-16 14:46:56] [INFO ] Input system was already deterministic with 11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 4 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 13/15 places, 11/11 transitions.
[2023-03-16 14:46:56] [INFO ] Flatten gal took : 6 ms
[2023-03-16 14:46:56] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:46:56] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 11 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 10 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 8 transition count 6
Applied a total of 12 rules in 15 ms. Remains 8 /15 variables (removed 7) and now considering 6/11 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 8/15 places, 6/11 transitions.
[2023-03-16 14:46:56] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:46:56] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:46:56] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/15 places, 11/11 transitions.
[2023-03-16 14:46:56] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:46:56] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:46:56] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 14 transition count 10
Applied a total of 2 rules in 4 ms. Remains 14 /15 variables (removed 1) and now considering 10/11 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 14/15 places, 10/11 transitions.
[2023-03-16 14:46:56] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:46:56] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:46:56] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 2 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 14/15 places, 11/11 transitions.
[2023-03-16 14:46:56] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:46:56] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:46:56] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 2 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 14/15 places, 11/11 transitions.
[2023-03-16 14:46:56] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:46:56] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:46:56] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 13/15 places, 11/11 transitions.
[2023-03-16 14:46:56] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:46:56] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:46:56] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 13/15 places, 11/11 transitions.
[2023-03-16 14:46:56] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:46:56] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:46:56] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 2 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 14/15 places, 11/11 transitions.
[2023-03-16 14:46:56] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:46:56] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:46:56] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 13/15 places, 11/11 transitions.
[2023-03-16 14:46:56] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:46:56] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:46:56] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 13 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 13 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 12 transition count 9
Applied a total of 5 rules in 5 ms. Remains 12 /15 variables (removed 3) and now considering 9/11 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 12/15 places, 9/11 transitions.
[2023-03-16 14:46:56] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:46:56] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:46:56] [INFO ] Input system was already deterministic with 9 transitions.
[2023-03-16 14:46:56] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:46:56] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:46:56] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-16 14:46:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 15 places, 11 transitions and 34 arcs took 1 ms.
Total runtime 3431 ms.
There are residual formulas that ITS could not solve within timeout
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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(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.561sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 301 (3.0e+02) #states 1,430 (3)



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

checking: EX [EF [EX [p2<=3]]]
normalized: EX [E [true U EX [p2<=3]]]

abstracting: (p2<=3)
states: 1,428 (3)
..-> the formula is TRUE

FORMULA RobotManipulation-PT-00002-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [EF [~ [p4<=p5]]]
normalized: ~ [E [true U ~ [E [true U ~ [p4<=p5]]]]]

abstracting: (p4<=p5)
states: 1,347 (3)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00002-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EX [AF [~ [p2<=p4]]]
normalized: EX [~ [EG [p2<=p4]]]

abstracting: (p2<=p4)
states: 1,120 (3)
...........
EG iterations: 11
.-> the formula is FALSE

FORMULA RobotManipulation-PT-00002-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: [AX [EG [AF [p3<=p1]]] & AF [EG [EX [AG [~ [p7<=3]]]]]]
normalized: [~ [EG [~ [EG [EX [~ [E [true U p7<=3]]]]]]] & ~ [EX [~ [EG [~ [EG [~ [p3<=p1]]]]]]]]

abstracting: (p3<=p1)
states: 946
....
EG iterations: 4
.
EG iterations: 1
.abstracting: (p7<=3)
states: 1,428 (3)
..
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA RobotManipulation-PT-00002-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[AX [p0<=4] | [2<=p8 | EF [p4<=p9]]]]
normalized: E [true U [[E [true U p4<=p9] | 2<=p8] | ~ [EX [~ [p0<=4]]]]]

abstracting: (p0<=4)
states: 1,425 (3)
.abstracting: (2<=p8)
states: 110
abstracting: (p4<=p9)
states: 1,128 (3)
-> the formula is TRUE

FORMULA RobotManipulation-PT-00002-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EX [~ [E [3<=p9 U [p10<=0 & EX [A [p0<=p11 U 1<=p6]]]]]]
normalized: EX [~ [E [3<=p9 U [p10<=0 & EX [[~ [EG [~ [1<=p6]]] & ~ [E [~ [1<=p6] U [~ [p0<=p11] & ~ [1<=p6]]]]]]]]]]

abstracting: (1<=p6)
states: 440
abstracting: (p0<=p11)
states: 1,220 (3)
abstracting: (1<=p6)
states: 440
abstracting: (1<=p6)
states: 440
.......
EG iterations: 7
.abstracting: (p10<=0)
states: 990
abstracting: (3<=p9)
states: 170
.-> the formula is TRUE

FORMULA RobotManipulation-PT-00002-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EF [[EG [[EG [~ [p14<=p9]] & [~ [p10<=p7] | [~ [p0<=p10] | ~ [2<=p12]]]]] & 1<=p8]]
normalized: E [true U [EG [[[[~ [2<=p12] | ~ [p0<=p10]] | ~ [p10<=p7]] & EG [~ [p14<=p9]]]] & 1<=p8]]

abstracting: (1<=p8)
states: 440
abstracting: (p14<=p9)
states: 795
..
EG iterations: 2
abstracting: (p10<=p7)
states: 1,082 (3)
abstracting: (p0<=p10)
states: 677
abstracting: (2<=p12)
states: 440
.
EG iterations: 1
-> the formula is TRUE

FORMULA RobotManipulation-PT-00002-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EX [[E [EF [p0<=p12] U AF [AG [p0<=4]]] | [AG [~ [p4<=p9]] & [3<=p13 & p7<=p6]]]]
normalized: EX [[[[3<=p13 & p7<=p6] & ~ [E [true U p4<=p9]]] | E [E [true U p0<=p12] U ~ [EG [E [true U ~ [p0<=4]]]]]]]

abstracting: (p0<=4)
states: 1,425 (3)

EG iterations: 0
abstracting: (p0<=p12)
states: 813
abstracting: (p4<=p9)
states: 1,128 (3)
abstracting: (p7<=p6)
states: 1,082 (3)
abstracting: (3<=p13)
states: 20
.-> the formula is FALSE

FORMULA RobotManipulation-PT-00002-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [A [EF [p6<=1] U ~ [p14<=2]] & [AF [[~ [p7<=0] & ~ [p4<=p14]]] & [EF [~ [p5<=p4]] | AG [[p5<=p6 | 2<=p0]]]]]
normalized: [[[~ [E [true U ~ [[p5<=p6 | 2<=p0]]]] | E [true U ~ [p5<=p4]]] & ~ [EG [~ [[~ [p4<=p14] & ~ [p7<=0]]]]]] & [~ [EG [p14<=2]] & ~ [E [p14<=2 U [p14<=2 & ~ [E [true U p6<=1]]]]]]]

abstracting: (p6<=1)
states: 1,320 (3)
abstracting: (p14<=2)
states: 1,140 (3)
abstracting: (p14<=2)
states: 1,140 (3)
abstracting: (p14<=2)
states: 1,140 (3)
.
EG iterations: 1
abstracting: (p7<=0)
states: 990
abstracting: (p4<=p14)
states: 1,256 (3)
.
EG iterations: 1
abstracting: (p5<=p4)
states: 227
abstracting: (2<=p0)
states: 440
abstracting: (p5<=p6)
states: 150
-> the formula is FALSE

FORMULA RobotManipulation-PT-00002-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: [~ [E [[[3<=p3 | [[2<=p13 & p13<=p7] | [p11<=p1 & 3<=p8]]] & p2<=1] U EF [[AG [p1<=p13] & AX [p4<=p9]]]]] | AX [EG [EF [~ [1<=p12]]]]]
normalized: [~ [EX [~ [EG [E [true U ~ [1<=p12]]]]]] | ~ [E [[p2<=1 & [3<=p3 | [[p11<=p1 & 3<=p8] | [2<=p13 & p13<=p7]]]] U E [true U [~ [EX [~ [p4<=p9]]] & ~ [E [true U ~ [p1<=p13]]]]]]]]

abstracting: (p1<=p13)
states: 1,082 (3)
abstracting: (p4<=p9)
states: 1,128 (3)
.abstracting: (p13<=p7)
states: 1,082 (3)
abstracting: (2<=p13)
states: 110
abstracting: (3<=p8)
states: 20
abstracting: (p11<=p1)
states: 320
abstracting: (3<=p3)
states: 47
abstracting: (p2<=1)
states: 1,320 (3)
abstracting: (1<=p12)
states: 935

EG iterations: 0
.-> the formula is TRUE

FORMULA RobotManipulation-PT-00002-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: [EX [[[EF [AX [3<=p0]] & [p2<=4 & p13<=0]] | [E [A [p1<=1 U 4<=p12] U [AF [p7<=p6] & [1<=p4 & p12<=2]]] & ~ [p12<=p13]]]] | [EX [[EX [EG [5<=p12]] | EX [AG [p5<=p3]]]] & EF [[AF [4<=p8] | [~ [p10<=4] | ~ [2<=p2]]]]]]
normalized: [[E [true U [[~ [2<=p2] | ~ [p10<=4]] | ~ [EG [~ [4<=p8]]]]] & EX [[EX [~ [E [true U ~ [p5<=p3]]]] | EX [EG [5<=p12]]]]] | EX [[[~ [p12<=p13] & E [[~ [EG [~ [4<=p12]]] & ~ [E [~ [4<=p12] U [~ [p1<=1] & ~ [4<=p12]]]]] U [[1<=p4 & p12<=2] & ~ [EG [~ [p7<=p6]]]]]] | [[p2<=4 & p13<=0] & E [true U ~ [EX [~ [3<=p0]]]]]]]]

abstracting: (3<=p0)
states: 155
.abstracting: (p13<=0)
states: 990
abstracting: (p2<=4)
states: 1,430 (3)
abstracting: (p7<=p6)
states: 1,082 (3)
......
EG iterations: 6
abstracting: (p12<=2)
states: 1,275 (3)
abstracting: (1<=p4)
states: 605
abstracting: (4<=p12)
states: 38
abstracting: (p1<=1)
states: 1,320 (3)
abstracting: (4<=p12)
states: 38
abstracting: (4<=p12)
states: 38
.
EG iterations: 1
abstracting: (p12<=p13)
states: 677
.abstracting: (5<=p12)
states: 5
......
EG iterations: 6
.abstracting: (p5<=p3)
states: 70
..abstracting: (4<=p8)
states: 2
.
EG iterations: 1
abstracting: (p10<=4)
states: 1,430 (3)
abstracting: (2<=p2)
states: 110
-> the formula is TRUE

FORMULA RobotManipulation-PT-00002-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

totally nodes used: 15476 (1.5e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 34790 47933 82723
used/not used/entry size/cache size: 59367 67049497 16 1024MB
basic ops cache: hits/miss/sum: 13333 23841 37174
used/not used/entry size/cache size: 39793 16737423 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: 2578 3365 5943
used/not used/entry size/cache size: 3365 8385243 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 67094983
1 13201
2 385
3 128
4 46
5 48
6 20
7 16
8 12
9 4
>= 10 21

Total processing time: 0m 5.154sec


BK_STOP 1678978023096

--------------------
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 CTLCardinality -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:181 (16), effective:41 (3)

initing FirstDep: 0m 0.000sec


iterations count:11 (1), effective:0 (0)

iterations count:132 (12), effective:24 (2)

iterations count:15 (1), effective:1 (0)

iterations count:35 (3), effective:8 (0)

iterations count:11 (1), effective:0 (0)

iterations count:53 (4), effective:13 (1)

iterations count:55 (5), effective:9 (0)

iterations count:92 (8), effective:20 (1)

iterations count:161 (14), effective:33 (3)

iterations count:74 (6), effective:15 (1)

iterations count:35 (3), effective:8 (0)

iterations count:17 (1), effective:3 (0)

iterations count:33 (3), effective:8 (0)

iterations count:47 (4), effective:12 (1)

iterations count:65 (5), effective:12 (1)

iterations count:21 (1), effective:5 (0)

iterations count:101 (9), effective:22 (2)

iterations count:95 (8), effective:18 (1)

iterations count:11 (1), effective:0 (0)

iterations count:22 (2), effective:4 (0)

iterations count:41 (3), effective:3 (0)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RobotManipulation-PT-00002"
export BK_EXAMINATION="CTLCardinality"
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-00002, examination is CTLCardinality"
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-167891812000009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-00002.tgz
mv RobotManipulation-PT-00002 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;