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

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

=== Now, execution of the tool begins

BK_START 1678977918526

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-00001
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 14:45:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 14:45:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 14:45:21] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2023-03-16 14:45:21] [INFO ] Transformed 15 places.
[2023-03-16 14:45:21] [INFO ] Transformed 11 transitions.
[2023-03-16 14:45:21] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 42 ms.
Initial state reduction rules removed 3 formulas.
FORMULA RobotManipulation-PT-00001-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00001-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00001-CTLCardinality-11 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 20 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:45:22] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-16 14:45:22] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-03-16 14:45:22] [INFO ] Invariant cache hit.
[2023-03-16 14:45:22] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2023-03-16 14:45:22] [INFO ] Invariant cache hit.
[2023-03-16 14:45:22] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 496 ms. Remains : 15/15 places, 11/11 transitions.
Support contains 15 out of 15 places after structural reductions.
[2023-03-16 14:45:22] [INFO ] Flatten gal took : 30 ms
[2023-03-16 14:45:22] [INFO ] Flatten gal took : 12 ms
[2023-03-16 14:45:22] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 801 ms. (steps per millisecond=12 ) properties (out of 74) seen :53
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-03-16 14:45:24] [INFO ] Invariant cache hit.
[2023-03-16 14:45:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 14:45:24] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 14:45:24] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:18
[2023-03-16 14:45:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 14:45:24] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 14:45:24] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :21 sat :0
Fused 21 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 21 atomic propositions for a total of 13 simplifications.
FORMULA RobotManipulation-PT-00001-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00001-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 14:45:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-16 14:45:24] [INFO ] Flatten gal took : 5 ms
FORMULA RobotManipulation-PT-00001-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 14:45:24] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:45:24] [INFO ] Input system was already deterministic with 11 transitions.
FORMULA RobotManipulation-PT-00001-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 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:45:24] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:45:24] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:45:24] [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 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:45:24] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:45:24] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:45:24] [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 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:45:24] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:45:24] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:45:24] [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:45:24] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:45:24] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:45:24] [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 0 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:45:24] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:45:24] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:45:24] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 15/15 places, 11/11 transitions.
[2023-03-16 14:45:24] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:45:24] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:45:24] [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:45:24] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:45:24] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:45:24] [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 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:45:24] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:45:24] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:45:24] [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
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 14 transition count 8
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 11 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 9 place count 10 transition count 7
Applied a total of 9 rules in 9 ms. Remains 10 /15 variables (removed 5) and now considering 7/11 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 10/15 places, 7/11 transitions.
[2023-03-16 14:45:24] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:45:24] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:45:24] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
FORMULA RobotManipulation-PT-00001-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-16 14:45:24] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:45:24] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:45:24] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-16 14:45:24] [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 3007 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.461sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 107 (1.1e+02) #states 110



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

checking: EX [EX [~ [2<=p5]]]
normalized: EX [EX [~ [2<=p5]]]

abstracting: (2<=p5)
states: 64
..-> the formula is TRUE

FORMULA RobotManipulation-PT-00001-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AF [EX [AF [EX [p6<=p0]]]]
normalized: ~ [EG [~ [EX [~ [EG [~ [EX [p6<=p0]]]]]]]]

abstracting: (p6<=p0)
states: 100
...
EG iterations: 2
..
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EX [[EF [p9<=0] & [~ [1<=p7] & 2<=p2]]]
normalized: EX [[[~ [1<=p7] & 2<=p2] & E [true U p9<=0]]]

abstracting: (p9<=0)
states: 56
abstracting: (2<=p2)
states: 2
abstracting: (1<=p7)
states: 20
.-> the formula is FALSE

FORMULA RobotManipulation-PT-00001-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [[AX [AX [~ [2<=p10]]] & AF [[~ [1<=p7] | [~ [p13<=2] | ~ [1<=p6]]]]]]
normalized: EX [[~ [EG [~ [[[~ [1<=p6] | ~ [p13<=2]] | ~ [1<=p7]]]]] & ~ [EX [EX [2<=p10]]]]]

abstracting: (2<=p10)
states: 2
..abstracting: (1<=p7)
states: 20
abstracting: (p13<=2)
states: 110
abstracting: (1<=p6)
states: 20
...
EG iterations: 3
.-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EX [A [E [~ [AG [p6<=1]] U EG [AG [p4<=p6]]] U [[2<=p1 | p11<=0] | [p2<=p13 | [p12<=0 & p10<=p14]]]]]
normalized: EX [[~ [EG [~ [[[[p12<=0 & p10<=p14] | p2<=p13] | [2<=p1 | p11<=0]]]]] & ~ [E [~ [[[[p12<=0 & p10<=p14] | p2<=p13] | [2<=p1 | p11<=0]]] U [~ [E [E [true U ~ [p6<=1]] U EG [~ [E [true U ~ [p4<=p6]]]]]] & ~ [[[[p12<=0 & p10<=p14] | p2<=p13] | [2<=p1 | p11<=0]]]]]]]]

abstracting: (p11<=0)
states: 30
abstracting: (2<=p1)
states: 2
abstracting: (p2<=p13)
states: 92
abstracting: (p10<=p14)
states: 101
abstracting: (p12<=0)
states: 45
abstracting: (p4<=p6)
states: 84
.
EG iterations: 1
abstracting: (p6<=1)
states: 108
abstracting: (p11<=0)
states: 30
abstracting: (2<=p1)
states: 2
abstracting: (p2<=p13)
states: 92
abstracting: (p10<=p14)
states: 101
abstracting: (p12<=0)
states: 45
abstracting: (p11<=0)
states: 30
abstracting: (2<=p1)
states: 2
abstracting: (p2<=p13)
states: 92
abstracting: (p10<=p14)
states: 101
abstracting: (p12<=0)
states: 45
.....
EG iterations: 5
.-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: [AF [AX [[[EG [~ [1<=p8]] & ~ [E [1<=p10 U 2<=p0]]] & [AX [1<=0] & [~ [p12<=2] | ~ [p6<=p11]]]]]] | EX [[EF [AG [~ [p6<=p7]]] | AX [~ [p7<=p14]]]]]
normalized: [EX [[~ [EX [p7<=p14]] | E [true U ~ [E [true U p6<=p7]]]]] | ~ [EG [EX [~ [[[[~ [p6<=p11] | ~ [p12<=2]] & ~ [EX [~ [1<=0]]]] & [~ [E [1<=p10 U 2<=p0]] & EG [~ [1<=p8]]]]]]]]]

abstracting: (1<=p8)
states: 20
.
EG iterations: 1
abstracting: (2<=p0)
states: 20
abstracting: (1<=p10)
states: 20
abstracting: (1<=0)
states: 0
.abstracting: (p12<=2)
states: 107
abstracting: (p6<=p11)
states: 100
.
EG iterations: 0
abstracting: (p6<=p7)
states: 92
abstracting: (p7<=p14)
states: 101
..-> the formula is FALSE

FORMULA RobotManipulation-PT-00001-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: [AG [A [E [~ [A [p3<=p0 U p11<=p1]] U AX [p11<=p8]] U [AX [2<=p7] | p9<=p7]]] | EF [AG [E [AF [p9<=p2] U EX [p3<=p10]]]]]
normalized: [E [true U ~ [E [true U ~ [E [~ [EG [~ [p9<=p2]]] U EX [p3<=p10]]]]]] | ~ [E [true U ~ [[~ [EG [~ [[~ [EX [~ [2<=p7]]] | p9<=p7]]]] & ~ [E [~ [[~ [EX [~ [2<=p7]]] | p9<=p7]] U [~ [E [~ [[~ [EG [~ [p11<=p1]]] & ~ [E [~ [p11<=p1] U [~ [p3<=p0] & ~ [p11<=p1]]]]]] U ~ [EX [~ [p11<=p8]]]]] & ~ [[~ [EX [~ [2<=p7]]] | p9<=p7]]]]]]]]]]

abstracting: (p9<=p7)
states: 62
abstracting: (2<=p7)
states: 2
.abstracting: (p11<=p8)
states: 40
.abstracting: (p11<=p1)
states: 40
abstracting: (p3<=p0)
states: 100
abstracting: (p11<=p1)
states: 40
abstracting: (p11<=p1)
states: 40
.
EG iterations: 1
abstracting: (p9<=p7)
states: 62
abstracting: (2<=p7)
states: 2
.abstracting: (p9<=p7)
states: 62
abstracting: (2<=p7)
states: 2
..........
EG iterations: 9
abstracting: (p3<=p10)
states: 84
.abstracting: (p9<=p2)
states: 72
.
EG iterations: 1
-> the formula is TRUE

FORMULA RobotManipulation-PT-00001-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

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

abstracting: (2<=p7)
states: 2
...
EG iterations: 3
abstracting: (p7<=0)
states: 90
abstracting: (p12<=p5)
states: 94
abstracting: (p10<=p13)
states: 92
abstracting: (2<=p7)
states: 2
...
EG iterations: 3
abstracting: (p7<=0)
states: 90
abstracting: (p12<=p5)
states: 94
abstracting: (2<=p7)
states: 2
...
EG iterations: 3
abstracting: (p7<=0)
states: 90
abstracting: (p12<=p5)
states: 94
..
EG iterations: 2
abstracting: (p5<=0)
states: 9
.abstracting: (2<=p2)
states: 2
abstracting: (2<=p7)
states: 2
...
EG iterations: 3
abstracting: (p7<=0)
states: 90
abstracting: (p12<=p5)
states: 94
abstracting: (p10<=p13)
states: 92
abstracting: (2<=p7)
states: 2
...
EG iterations: 3
abstracting: (p7<=0)
states: 90
abstracting: (p12<=p5)
states: 94
abstracting: (2<=p7)
states: 2
...
EG iterations: 3
abstracting: (p7<=0)
states: 90
abstracting: (p12<=p5)
states: 94
..
EG iterations: 2
abstracting: (2<=p7)
states: 2
...
EG iterations: 3
abstracting: (p7<=0)
states: 90
abstracting: (p12<=p5)
states: 94
abstracting: (p10<=p13)
states: 92
abstracting: (2<=p7)
states: 2
...
EG iterations: 3
abstracting: (p7<=0)
states: 90
abstracting: (p12<=p5)
states: 94
abstracting: (2<=p7)
states: 2
...
EG iterations: 3
abstracting: (p7<=0)
states: 90
abstracting: (p12<=p5)
states: 94
..
EG iterations: 2
..
EG iterations: 2
abstracting: (p9<=0)
states: 56
.abstracting: (3<=p12)
states: 3
abstracting: (p0<=1)
states: 90
.
EG iterations: 1
abstracting: (p4<=p8)
states: 84
abstracting: (p14<=3)
states: 110
abstracting: (p9<=p11)
states: 86
abstracting: (1<=p1)
states: 20
...
EG iterations: 2
-> the formula is FALSE

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

MC time: 0m 0.005sec

totally nodes used: 3760 (3.8e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 5805 12669 18474
used/not used/entry size/cache size: 15518 67093346 16 1024MB
basic ops cache: hits/miss/sum: 2436 5871 8307
used/not used/entry size/cache size: 9819 16767397 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: 454 757 1211
used/not used/entry size/cache size: 757 8387851 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 67105360
1 3384
2 62
3 25
4 19
5 5
6 2
7 1
8 3
9 0
>= 10 3

Total processing time: 0m 5.284sec


BK_STOP 1678977931743

--------------------
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:97 (8), effective:21 (1)

initing FirstDep: 0m 0.000sec


iterations count:37 (3), effective:6 (0)

iterations count:51 (4), effective:9 (0)

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

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

iterations count:50 (4), effective:9 (0)

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

iterations count:51 (4), effective:11 (1)

iterations count:43 (3), effective:10 (0)

iterations count:34 (3), effective:4 (0)

iterations count:61 (5), effective:13 (1)

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

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

iterations count:54 (4), effective:10 (0)

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

iterations count:116 (10), effective:24 (2)

iterations count:54 (4), effective:10 (0)

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

iterations count:54 (4), effective:10 (0)

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RobotManipulation-PT-00001"
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-00001, 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-167891812000001"
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 [ "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 ;