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.r138-smll-167819419200001.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 Dekker-PT-010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819419200001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.0K Feb 26 01:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 01:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 01:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 01:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 26 01:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 01:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Feb 26 01:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 65K Mar 5 18:22 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 Dekker-PT-010-CTLCardinality-00
FORMULA_NAME Dekker-PT-010-CTLCardinality-01
FORMULA_NAME Dekker-PT-010-CTLCardinality-02
FORMULA_NAME Dekker-PT-010-CTLCardinality-03
FORMULA_NAME Dekker-PT-010-CTLCardinality-04
FORMULA_NAME Dekker-PT-010-CTLCardinality-05
FORMULA_NAME Dekker-PT-010-CTLCardinality-06
FORMULA_NAME Dekker-PT-010-CTLCardinality-07
FORMULA_NAME Dekker-PT-010-CTLCardinality-08
FORMULA_NAME Dekker-PT-010-CTLCardinality-09
FORMULA_NAME Dekker-PT-010-CTLCardinality-10
FORMULA_NAME Dekker-PT-010-CTLCardinality-11
FORMULA_NAME Dekker-PT-010-CTLCardinality-12
FORMULA_NAME Dekker-PT-010-CTLCardinality-13
FORMULA_NAME Dekker-PT-010-CTLCardinality-14
FORMULA_NAME Dekker-PT-010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678531213858

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=Dekker-PT-010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 10:40:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 10:40:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 10:40:17] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2023-03-11 10:40:17] [INFO ] Transformed 50 places.
[2023-03-11 10:40:17] [INFO ] Transformed 120 transitions.
[2023-03-11 10:40:17] [INFO ] Found NUPN structural information;
[2023-03-11 10:40:17] [INFO ] Parsed PT model containing 50 places and 120 transitions and 820 arcs in 269 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 25 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Dekker-PT-010-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-010-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-010-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 120/120 transitions.
Applied a total of 0 rules in 26 ms. Remains 50 /50 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2023-03-11 10:40:17] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
// Phase 1: matrix 40 rows 50 cols
[2023-03-11 10:40:17] [INFO ] Computed 30 place invariants in 21 ms
[2023-03-11 10:40:18] [INFO ] Implicit Places using invariants in 386 ms returned [26, 38, 47]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 457 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/50 places, 120/120 transitions.
Applied a total of 0 rules in 5 ms. Remains 47 /47 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 490 ms. Remains : 47/50 places, 120/120 transitions.
Support contains 38 out of 47 places after structural reductions.
[2023-03-11 10:40:18] [INFO ] Flatten gal took : 84 ms
[2023-03-11 10:40:18] [INFO ] Flatten gal took : 38 ms
[2023-03-11 10:40:18] [INFO ] Input system was already deterministic with 120 transitions.
Support contains 36 out of 47 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 901 ms. (steps per millisecond=11 ) properties (out of 44) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 10:40:19] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
// Phase 1: matrix 40 rows 47 cols
[2023-03-11 10:40:19] [INFO ] Computed 27 place invariants in 2 ms
[2023-03-11 10:40:19] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2023-03-11 10:40:19] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-11 10:40:20] [INFO ] After 52ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1
[2023-03-11 10:40:20] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-11 10:40:20] [INFO ] After 13ms SMT Verify possible using 10 Read/Feed constraints in real domain returned unsat :2 sat :1
[2023-03-11 10:40:20] [INFO ] After 28ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-11 10:40:20] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 120/120 transitions.
Applied a total of 0 rules in 23 ms. Remains 47 /47 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 47/47 places, 120/120 transitions.
Finished random walk after 8402 steps, including 2 resets, run visited all 1 properties in 46 ms. (steps per millisecond=182 )
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA Dekker-PT-010-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 10:40:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 20 ms
FORMULA Dekker-PT-010-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 18 ms
[2023-03-11 10:40:20] [INFO ] Input system was already deterministic with 120 transitions.
Support contains 34 out of 47 places (down from 35) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 120/120 transitions.
Applied a total of 0 rules in 4 ms. Remains 47 /47 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 47/47 places, 120/120 transitions.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 15 ms
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 16 ms
[2023-03-11 10:40:20] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 120/120 transitions.
Applied a total of 0 rules in 4 ms. Remains 47 /47 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 47/47 places, 120/120 transitions.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 15 ms
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 16 ms
[2023-03-11 10:40:20] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 120/120 transitions.
Applied a total of 0 rules in 14 ms. Remains 47 /47 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 47/47 places, 120/120 transitions.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 23 ms
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 16 ms
[2023-03-11 10:40:20] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 120/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 47/47 places, 120/120 transitions.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 13 ms
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 15 ms
[2023-03-11 10:40:20] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 120/120 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 47/47 places, 120/120 transitions.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 11 ms
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 11 ms
[2023-03-11 10:40:20] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 120/120 transitions.
Applied a total of 0 rules in 9 ms. Remains 47 /47 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 47/47 places, 120/120 transitions.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 10 ms
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 10 ms
[2023-03-11 10:40:20] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 120/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 47/47 places, 120/120 transitions.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 8 ms
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 10 ms
[2023-03-11 10:40:20] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 120/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 47/47 places, 120/120 transitions.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 9 ms
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 9 ms
[2023-03-11 10:40:20] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 120/120 transitions.
Applied a total of 0 rules in 9 ms. Remains 47 /47 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 47/47 places, 120/120 transitions.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 8 ms
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 9 ms
[2023-03-11 10:40:20] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 120/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 47/47 places, 120/120 transitions.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 8 ms
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 9 ms
[2023-03-11 10:40:20] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 120/120 transitions.
Applied a total of 0 rules in 9 ms. Remains 47 /47 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 47/47 places, 120/120 transitions.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 8 ms
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 9 ms
[2023-03-11 10:40:20] [INFO ] Input system was already deterministic with 120 transitions.
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 9 ms
[2023-03-11 10:40:20] [INFO ] Flatten gal took : 9 ms
[2023-03-11 10:40:20] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-11 10:40:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 47 places, 120 transitions and 787 arcs took 1 ms.
Total runtime 3778 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: 47 NrTr: 120 NrArc: 787)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec

net check time: 0m 0.000sec

init dd package: 0m 3.798sec


RS generation: 0m 0.022sec


-> reachability set: #nodes 441 (4.4e+02) #states 6,144 (3)



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

checking: EF [AX [AX [1<=0]]]
normalized: E [true U ~ [EX [EX [~ [1<=0]]]]]

abstracting: (1<=0)
states: 0
..-> the formula is FALSE

FORMULA Dekker-PT-010-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.084sec

checking: EF [AG [[p18<=0 & 0<=p18]]]
normalized: E [true U ~ [E [true U ~ [[p18<=0 & 0<=p18]]]]]

abstracting: (0<=p18)
states: 6,144 (3)
abstracting: (p18<=0)
states: 3,328 (3)
-> the formula is FALSE

FORMULA Dekker-PT-010-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: EF [AG [EF [EG [[p22<=0 & 0<=p22]]]]]
normalized: E [true U ~ [E [true U ~ [E [true U EG [[p22<=0 & 0<=p22]]]]]]]

abstracting: (0<=p22)
states: 6,144 (3)
abstracting: (p22<=0)
states: 5,632 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Dekker-PT-010-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: [EX [0<=0] & [AG [EX [~ [[p22<=1 & 1<=p22]]]] & AG [EF [[p40<=0 & 0<=p40]]]]]
normalized: [[~ [E [true U ~ [E [true U [p40<=0 & 0<=p40]]]]] & ~ [E [true U ~ [EX [~ [[p22<=1 & 1<=p22]]]]]]] & EX [0<=0]]

abstracting: (0<=0)
states: 6,144 (3)
.abstracting: (1<=p22)
states: 512
abstracting: (p22<=1)
states: 6,144 (3)
.abstracting: (0<=p40)
states: 6,144 (3)
abstracting: (p40<=0)
states: 3,328 (3)
-> the formula is TRUE

FORMULA Dekker-PT-010-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [AG [~ [E [~ [[[p7<=0 & 0<=p7] | [p18<=1 & 1<=p18]]] U [p34<=0 & 0<=p34]]]]]
normalized: E [true U ~ [E [true U E [~ [[[p18<=1 & 1<=p18] | [p7<=0 & 0<=p7]]] U [p34<=0 & 0<=p34]]]]]

abstracting: (0<=p34)
states: 6,144 (3)
abstracting: (p34<=0)
states: 3,328 (3)
abstracting: (0<=p7)
states: 6,144 (3)
abstracting: (p7<=0)
states: 2,816 (3)
abstracting: (1<=p18)
states: 2,816 (3)
abstracting: (p18<=1)
states: 6,144 (3)
-> the formula is FALSE

FORMULA Dekker-PT-010-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AF [AG [[EF [[p31<=1 & 1<=p31]] | [AF [[[p22<=0 & 0<=p22] & [p31<=1 & 1<=p31]]] & [[p35<=0 & 0<=p35] | [p31<=1 & 1<=p31]]]]]]
normalized: ~ [EG [E [true U ~ [[[[[p31<=1 & 1<=p31] | [p35<=0 & 0<=p35]] & ~ [EG [~ [[[p31<=1 & 1<=p31] & [p22<=0 & 0<=p22]]]]]] | E [true U [p31<=1 & 1<=p31]]]]]]]

abstracting: (1<=p31)
states: 2,816 (3)
abstracting: (p31<=1)
states: 6,144 (3)
abstracting: (0<=p22)
states: 6,144 (3)
abstracting: (p22<=0)
states: 5,632 (3)
abstracting: (1<=p31)
states: 2,816 (3)
abstracting: (p31<=1)
states: 6,144 (3)
.
EG iterations: 1
abstracting: (0<=p35)
states: 6,144 (3)
abstracting: (p35<=0)
states: 3,328 (3)
abstracting: (1<=p31)
states: 2,816 (3)
abstracting: (p31<=1)
states: 6,144 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Dekker-PT-010-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: EF [AX [[AX [AF [[p13<=0 & 0<=p13]]] & [~ [A [[p21<=1 & 1<=p21] U [[p13<=0 & 0<=p13] | [p12<=1 & 1<=p12]]]] | [[p42<=0 & 0<=p42] | [p39<=1 & 1<=p39]]]]]]
normalized: E [true U ~ [EX [~ [[[[[p39<=1 & 1<=p39] | [p42<=0 & 0<=p42]] | ~ [[~ [EG [~ [[[p12<=1 & 1<=p12] | [p13<=0 & 0<=p13]]]]] & ~ [E [~ [[[p12<=1 & 1<=p12] | [p13<=0 & 0<=p13]]] U [~ [[p21<=1 & 1<=p21]] & ~ [[[p12<=1 & 1<=p12] | [p13<=0 & 0<=p13]]]]]]]]] & ~ [EX [EG [~ [[p13<=0 & 0<=p13]]]]]]]]]]

abstracting: (0<=p13)
states: 6,144 (3)
abstracting: (p13<=0)
states: 2,816 (3)
.
EG iterations: 1
.abstracting: (0<=p13)
states: 6,144 (3)
abstracting: (p13<=0)
states: 2,816 (3)
abstracting: (1<=p12)
states: 2,816 (3)
abstracting: (p12<=1)
states: 6,144 (3)
abstracting: (1<=p21)
states: 2,816 (3)
abstracting: (p21<=1)
states: 6,144 (3)
abstracting: (0<=p13)
states: 6,144 (3)
abstracting: (p13<=0)
states: 2,816 (3)
abstracting: (1<=p12)
states: 2,816 (3)
abstracting: (p12<=1)
states: 6,144 (3)
abstracting: (0<=p13)
states: 6,144 (3)
abstracting: (p13<=0)
states: 2,816 (3)
abstracting: (1<=p12)
states: 2,816 (3)
abstracting: (p12<=1)
states: 6,144 (3)
.
EG iterations: 1
abstracting: (0<=p42)
states: 6,144 (3)
abstracting: (p42<=0)
states: 3,328 (3)
abstracting: (1<=p39)
states: 2,816 (3)
abstracting: (p39<=1)
states: 6,144 (3)
.-> the formula is FALSE

FORMULA Dekker-PT-010-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

checking: [AG [[EX [[1<=p3 & p3<=1]] | [[p5<=1 & 1<=p5] & [p2<=1 & 1<=p2]]]] | ~ [E [EF [[[p4<=1 & 1<=p4] | [p40<=1 & 1<=p40]]] U ~ [[[AF [[p45<=1 & 1<=p45]] | AG [[p5<=1 & 1<=p5]]] & [EG [[p7<=1 & 1<=p7]] & [p33<=0 & 0<=p33]]]]]]]
normalized: [~ [E [E [true U [[p40<=1 & 1<=p40] | [p4<=1 & 1<=p4]]] U ~ [[[[p33<=0 & 0<=p33] & EG [[p7<=1 & 1<=p7]]] & [~ [E [true U ~ [[p5<=1 & 1<=p5]]]] | ~ [EG [~ [[p45<=1 & 1<=p45]]]]]]]]] | ~ [E [true U ~ [[[[p2<=1 & 1<=p2] & [p5<=1 & 1<=p5]] | EX [[1<=p3 & p3<=1]]]]]]]

abstracting: (p3<=1)
states: 6,144 (3)
abstracting: (1<=p3)
states: 3,328 (3)
.abstracting: (1<=p5)
states: 3,328 (3)
abstracting: (p5<=1)
states: 6,144 (3)
abstracting: (1<=p2)
states: 2,816 (3)
abstracting: (p2<=1)
states: 6,144 (3)
abstracting: (1<=p45)
states: 2,816 (3)
abstracting: (p45<=1)
states: 6,144 (3)
.
EG iterations: 1
abstracting: (1<=p5)
states: 3,328 (3)
abstracting: (p5<=1)
states: 6,144 (3)
abstracting: (1<=p7)
states: 3,328 (3)
abstracting: (p7<=1)
states: 6,144 (3)
.
EG iterations: 1
abstracting: (0<=p33)
states: 6,144 (3)
abstracting: (p33<=0)
states: 5,632 (3)
abstracting: (1<=p4)
states: 2,816 (3)
abstracting: (p4<=1)
states: 6,144 (3)
abstracting: (1<=p40)
states: 2,816 (3)
abstracting: (p40<=1)
states: 6,144 (3)
-> the formula is TRUE

FORMULA Dekker-PT-010-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.057sec

checking: [EF [[[AF [~ [[p25<=0 & 0<=p25]]] | [[[p29<=1 & 1<=p29] & [p32<=0 & 0<=p32]] | E [[p43<=1 & 1<=p43] U [[p4<=0 & 0<=p4] | [p13<=1 & 1<=p13]]]]] & [EG [[[p10<=0 & 0<=p10] | [[p19<=0 & 0<=p19] | [p6<=1 & 1<=p6]]]] & [p4<=1 & 1<=p4]]]] & AX [[[p22<=0 & 0<=p22] | [p34<=1 & 1<=p34]]]]
normalized: [~ [EX [~ [[[p34<=1 & 1<=p34] | [p22<=0 & 0<=p22]]]]] & E [true U [[[p4<=1 & 1<=p4] & EG [[[[p6<=1 & 1<=p6] | [p19<=0 & 0<=p19]] | [p10<=0 & 0<=p10]]]] & [[E [[p43<=1 & 1<=p43] U [[p13<=1 & 1<=p13] | [p4<=0 & 0<=p4]]] | [[p32<=0 & 0<=p32] & [p29<=1 & 1<=p29]]] | ~ [EG [[p25<=0 & 0<=p25]]]]]]]

abstracting: (0<=p25)
states: 6,144 (3)
abstracting: (p25<=0)
states: 5,632 (3)
.
EG iterations: 1
abstracting: (1<=p29)
states: 2,816 (3)
abstracting: (p29<=1)
states: 6,144 (3)
abstracting: (0<=p32)
states: 6,144 (3)
abstracting: (p32<=0)
states: 3,328 (3)
abstracting: (0<=p4)
states: 6,144 (3)
abstracting: (p4<=0)
states: 3,328 (3)
abstracting: (1<=p13)
states: 3,328 (3)
abstracting: (p13<=1)
states: 6,144 (3)
abstracting: (1<=p43)
states: 2,816 (3)
abstracting: (p43<=1)
states: 6,144 (3)
abstracting: (0<=p10)
states: 6,144 (3)
abstracting: (p10<=0)
states: 3,328 (3)
abstracting: (0<=p19)
states: 6,144 (3)
abstracting: (p19<=0)
states: 2,816 (3)
abstracting: (1<=p6)
states: 2,816 (3)
abstracting: (p6<=1)
states: 6,144 (3)
.
EG iterations: 1
abstracting: (1<=p4)
states: 2,816 (3)
abstracting: (p4<=1)
states: 6,144 (3)
abstracting: (0<=p22)
states: 6,144 (3)
abstracting: (p22<=0)
states: 5,632 (3)
abstracting: (1<=p34)
states: 2,816 (3)
abstracting: (p34<=1)
states: 6,144 (3)
.-> the formula is TRUE

FORMULA Dekker-PT-010-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: E [[A [~ [[EG [[[p24<=0 & 0<=p24] | [p44<=1 & 1<=p44]]] | [[p25<=1 & 1<=p25] | [[p25<=1 & 1<=p25] & [p24<=0 & 0<=p24]]]]] U [p44<=0 & 0<=p44]] & AF [~ [[AG [[[p29<=0 & 0<=p29] | [p15<=1 & 1<=p15]]] | [[[p27<=1 & 1<=p27] | [p29<=1 & 1<=p29]] & AF [[[p26<=0 & 0<=p26] | [p18<=1 & 1<=p18]]]]]]]] U AX [AG [EF [[[p42<=0 & 0<=p42] | [p7<=1 & 1<=p7]]]]]]
normalized: E [[~ [EG [[[~ [EG [~ [[[p18<=1 & 1<=p18] | [p26<=0 & 0<=p26]]]]] & [[p29<=1 & 1<=p29] | [p27<=1 & 1<=p27]]] | ~ [E [true U ~ [[[p15<=1 & 1<=p15] | [p29<=0 & 0<=p29]]]]]]]] & [~ [EG [~ [[p44<=0 & 0<=p44]]]] & ~ [E [~ [[p44<=0 & 0<=p44]] U [[[[[p24<=0 & 0<=p24] & [p25<=1 & 1<=p25]] | [p25<=1 & 1<=p25]] | EG [[[p44<=1 & 1<=p44] | [p24<=0 & 0<=p24]]]] & ~ [[p44<=0 & 0<=p44]]]]]]] U ~ [EX [E [true U ~ [E [true U [[p7<=1 & 1<=p7] | [p42<=0 & 0<=p42]]]]]]]]

abstracting: (0<=p42)
states: 6,144 (3)
abstracting: (p42<=0)
states: 3,328 (3)
abstracting: (1<=p7)
states: 3,328 (3)
abstracting: (p7<=1)
states: 6,144 (3)
.abstracting: (0<=p44)
states: 6,144 (3)
abstracting: (p44<=0)
states: 5,632 (3)
abstracting: (0<=p24)
states: 6,144 (3)
abstracting: (p24<=0)
states: 3,328 (3)
abstracting: (1<=p44)
states: 512
abstracting: (p44<=1)
states: 6,144 (3)
.
EG iterations: 1
abstracting: (1<=p25)
states: 512
abstracting: (p25<=1)
states: 6,144 (3)
abstracting: (1<=p25)
states: 512
abstracting: (p25<=1)
states: 6,144 (3)
abstracting: (0<=p24)
states: 6,144 (3)
abstracting: (p24<=0)
states: 3,328 (3)
abstracting: (0<=p44)
states: 6,144 (3)
abstracting: (p44<=0)
states: 5,632 (3)
abstracting: (0<=p44)
states: 6,144 (3)
abstracting: (p44<=0)
states: 5,632 (3)
.
EG iterations: 1
abstracting: (0<=p29)
states: 6,144 (3)
abstracting: (p29<=0)
states: 3,328 (3)
abstracting: (1<=p15)
states: 3,328 (3)
abstracting: (p15<=1)
states: 6,144 (3)
abstracting: (1<=p27)
states: 512
abstracting: (p27<=1)
states: 6,144 (3)
abstracting: (1<=p29)
states: 2,816 (3)
abstracting: (p29<=1)
states: 6,144 (3)
abstracting: (0<=p26)
states: 6,144 (3)
abstracting: (p26<=0)
states: 3,328 (3)
abstracting: (1<=p18)
states: 2,816 (3)
abstracting: (p18<=1)
states: 6,144 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA Dekker-PT-010-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.056sec

checking: AX [[[[p23<=0 & 0<=p23] | AX [1<=0]] | [~ [E [[[p35<=1 & 1<=p35] | [[p38<=0 & 0<=p38] | [p19<=1 & 1<=p19]]] U [[p39<=1 & 1<=p39] | [[p18<=0 & 0<=p18] | [p37<=1 & 1<=p37]]]]] | [[EF [EX [[[p4<=0 & 0<=p4] & [p20<=1 & 1<=p20]]]] & [[p22<=0 & 0<=p22] & [p26<=1 & 1<=p26]]] | [AX [[p44<=0 & 0<=p44]] & [[p35<=0 & 0<=p35] | [p4<=1 & 1<=p4]]]]]]]
normalized: ~ [EX [~ [[[[[[[p4<=1 & 1<=p4] | [p35<=0 & 0<=p35]] & ~ [EX [~ [[p44<=0 & 0<=p44]]]]] | [[[p26<=1 & 1<=p26] & [p22<=0 & 0<=p22]] & E [true U EX [[[p20<=1 & 1<=p20] & [p4<=0 & 0<=p4]]]]]] | ~ [E [[[[p19<=1 & 1<=p19] | [p38<=0 & 0<=p38]] | [p35<=1 & 1<=p35]] U [[[p37<=1 & 1<=p37] | [p18<=0 & 0<=p18]] | [p39<=1 & 1<=p39]]]]] | [~ [EX [~ [1<=0]]] | [p23<=0 & 0<=p23]]]]]]

abstracting: (0<=p23)
states: 6,144 (3)
abstracting: (p23<=0)
states: 3,328 (3)
abstracting: (1<=0)
states: 0
.abstracting: (1<=p39)
states: 2,816 (3)
abstracting: (p39<=1)
states: 6,144 (3)
abstracting: (0<=p18)
states: 6,144 (3)
abstracting: (p18<=0)
states: 3,328 (3)
abstracting: (1<=p37)
states: 2,816 (3)
abstracting: (p37<=1)
states: 6,144 (3)
abstracting: (1<=p35)
states: 2,816 (3)
abstracting: (p35<=1)
states: 6,144 (3)
abstracting: (0<=p38)
states: 6,144 (3)
abstracting: (p38<=0)
states: 5,632 (3)
abstracting: (1<=p19)
states: 3,328 (3)
abstracting: (p19<=1)
states: 6,144 (3)
abstracting: (0<=p4)
states: 6,144 (3)
abstracting: (p4<=0)
states: 3,328 (3)
abstracting: (1<=p20)
states: 2,816 (3)
abstracting: (p20<=1)
states: 6,144 (3)
.abstracting: (0<=p22)
states: 6,144 (3)
abstracting: (p22<=0)
states: 5,632 (3)
abstracting: (1<=p26)
states: 2,816 (3)
abstracting: (p26<=1)
states: 6,144 (3)
abstracting: (0<=p44)
states: 6,144 (3)
abstracting: (p44<=0)
states: 5,632 (3)
.abstracting: (0<=p35)
states: 6,144 (3)
abstracting: (p35<=0)
states: 3,328 (3)
abstracting: (1<=p4)
states: 2,816 (3)
abstracting: (p4<=1)
states: 6,144 (3)
.-> the formula is FALSE

FORMULA Dekker-PT-010-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

totally nodes used: 86505 (8.7e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 79942 620344 700286
used/not used/entry size/cache size: 676116 66432748 16 1024MB
basic ops cache: hits/miss/sum: 14170 77236 91406
used/not used/entry size/cache size: 132751 16644465 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: 1379 7559 8938
used/not used/entry size/cache size: 7559 8381049 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 67026470
1 78575
2 3546
3 254
4 19
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.915sec


BK_STOP 1678531228423

--------------------
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:1473 (12), effective:80 (0)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

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

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

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

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

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

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

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

iterations count:144 (1), effective:6 (0)

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

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

iterations count:273 (2), effective:5 (0)

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

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

iterations count:121 (1), effective:1 (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="Dekker-PT-010"
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 Dekker-PT-010, 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 r138-smll-167819419200001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-010.tgz
mv Dekker-PT-010 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 ;