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.r330-tall-167889203600665.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 ResAllocation-PT-R003C002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203600665
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 8.0K Feb 25 15:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 15:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 15:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 15:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 15:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Feb 25 15:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 15:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 15:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 14K 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 ResAllocation-PT-R003C002-CTLCardinality-00
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-01
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-02
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-03
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-04
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-05
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-06
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-07
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-08
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-09
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-10
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-11
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-12
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-13
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-14
FORMULA_NAME ResAllocation-PT-R003C002-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679180586069

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=ResAllocation-PT-R003C002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:03:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 23:03:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:03:07] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-03-18 23:03:07] [INFO ] Transformed 12 places.
[2023-03-18 23:03:07] [INFO ] Transformed 8 transitions.
[2023-03-18 23:03:07] [INFO ] Found NUPN structural information;
[2023-03-18 23:03:07] [INFO ] Parsed PT model containing 12 places and 8 transitions and 30 arcs in 86 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Initial state reduction rules removed 4 formulas.
FORMULA ResAllocation-PT-R003C002-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C002-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C002-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C002-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C002-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C002-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 8 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-18 23:03:07] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-18 23:03:07] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-18 23:03:07] [INFO ] Invariant cache hit.
[2023-03-18 23:03:07] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2023-03-18 23:03:07] [INFO ] Invariant cache hit.
[2023-03-18 23:03:07] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 228 ms. Remains : 12/12 places, 8/8 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-03-18 23:03:08] [INFO ] Flatten gal took : 13 ms
[2023-03-18 23:03:08] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:03:08] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 10000 steps, including 1554 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 41) seen :37
Incomplete Best-First random walk after 10001 steps, including 750 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 389 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 909 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 700 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-18 23:03:08] [INFO ] Invariant cache hit.
[2023-03-18 23:03:08] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-18 23:03:08] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 10 simplifications.
FORMULA ResAllocation-PT-R003C002-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 23:03:08] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-18 23:03:08] [INFO ] Flatten gal took : 2 ms
FORMULA ResAllocation-PT-R003C002-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 23:03:08] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:03:08] [INFO ] Input system was already deterministic with 8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 12/12 places, 8/8 transitions.
[2023-03-18 23:03:08] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:03:08] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:08] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 12/12 places, 8/8 transitions.
[2023-03-18 23:03:08] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:08] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:08] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 12/12 places, 8/8 transitions.
[2023-03-18 23:03:08] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:08] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:08] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 12/12 places, 8/8 transitions.
[2023-03-18 23:03:08] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:08] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:08] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 12/12 places, 8/8 transitions.
[2023-03-18 23:03:08] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:08] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:08] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 12/12 places, 8/8 transitions.
[2023-03-18 23:03:08] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:03:08] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:08] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 7 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 12/12 places, 8/8 transitions.
[2023-03-18 23:03:08] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:08] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:08] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 12/12 places, 8/8 transitions.
[2023-03-18 23:03:08] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:08] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:08] [INFO ] Input system was already deterministic with 8 transitions.
[2023-03-18 23:03:08] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:03:08] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:03:09] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-18 23:03:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 8 transitions and 30 arcs took 1 ms.
Total runtime 1529 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: 12 NrTr: 8 NrArc: 30)

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

net check time: 0m 0.000sec

init dd package: 0m 2.703sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 39 (3.9e+01) #states 20



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

checking: EX [[p10<=0 & 0<=p10]]
normalized: EX [[p10<=0 & 0<=p10]]

abstracting: (0<=p10)
states: 20
abstracting: (p10<=0)
states: 12
.-> the formula is TRUE

FORMULA ResAllocation-PT-R003C002-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [AG [[p6<=0 & 0<=p6]] | AX [[[[p8<=1 & 1<=p8] | [p0<=1 & 1<=p0]] & AF [[p9<=0 & 0<=p9]]]]]
normalized: [~ [E [true U ~ [[p6<=0 & 0<=p6]]]] | ~ [EX [~ [[~ [EG [~ [[p9<=0 & 0<=p9]]]] & [[p0<=1 & 1<=p0] | [p8<=1 & 1<=p8]]]]]]]

abstracting: (1<=p8)
states: 6
abstracting: (p8<=1)
states: 20
abstracting: (1<=p0)
states: 8
abstracting: (p0<=1)
states: 20
abstracting: (0<=p9)
states: 20
abstracting: (p9<=0)
states: 6
.
EG iterations: 1
.abstracting: (0<=p6)
states: 20
abstracting: (p6<=0)
states: 16
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C002-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EX [EG [E [[EX [[[p3<=0 & 0<=p3] | [p1<=1 & 1<=p1]]] | AG [[p1<=1 & 1<=p1]]] U [~ [[p3<=1 & 1<=p3]] & [[p8<=0 & 0<=p8] & [[p2<=0 & 0<=p2] | [p1<=1 & 1<=p1]]]]]]]
normalized: EX [EG [E [[~ [E [true U ~ [[p1<=1 & 1<=p1]]]] | EX [[[p1<=1 & 1<=p1] | [p3<=0 & 0<=p3]]]] U [[[[p1<=1 & 1<=p1] | [p2<=0 & 0<=p2]] & [p8<=0 & 0<=p8]] & ~ [[p3<=1 & 1<=p3]]]]]]

abstracting: (1<=p3)
states: 8
abstracting: (p3<=1)
states: 20
abstracting: (0<=p8)
states: 20
abstracting: (p8<=0)
states: 14
abstracting: (0<=p2)
states: 20
abstracting: (p2<=0)
states: 14
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
abstracting: (0<=p3)
states: 20
abstracting: (p3<=0)
states: 12
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
.abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
...
EG iterations: 3
.-> the formula is TRUE

FORMULA ResAllocation-PT-R003C002-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[[EF [[p4<=0 & 0<=p4]] & AX [1<=0]] & [[p8<=1 & 1<=p8] & [[~ [A [[p11<=1 & 1<=p11] U [[p9<=0 & 0<=p9] | [p5<=1 & 1<=p5]]]] | [p6<=0 & 0<=p6]] & [[p9<=0 & 0<=p9] | [p11<=1 & 1<=p11]]]]]]
normalized: E [true U [[[[[p11<=1 & 1<=p11] | [p9<=0 & 0<=p9]] & [[p6<=0 & 0<=p6] | ~ [[~ [EG [~ [[[p5<=1 & 1<=p5] | [p9<=0 & 0<=p9]]]]] & ~ [E [~ [[[p5<=1 & 1<=p5] | [p9<=0 & 0<=p9]]] U [~ [[p11<=1 & 1<=p11]] & ~ [[[p5<=1 & 1<=p5] | [p9<=0 & 0<=p9]]]]]]]]]] & [p8<=1 & 1<=p8]] & [~ [EX [~ [1<=0]]] & E [true U [p4<=0 & 0<=p4]]]]]

abstracting: (0<=p4)
states: 20
abstracting: (p4<=0)
states: 16
abstracting: (1<=0)
states: 0
.abstracting: (1<=p8)
states: 6
abstracting: (p8<=1)
states: 20
abstracting: (0<=p9)
states: 20
abstracting: (p9<=0)
states: 6
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
abstracting: (1<=p11)
states: 12
abstracting: (p11<=1)
states: 20
abstracting: (0<=p9)
states: 20
abstracting: (p9<=0)
states: 6
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
abstracting: (0<=p9)
states: 20
abstracting: (p9<=0)
states: 6
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
.....
EG iterations: 5
abstracting: (0<=p6)
states: 20
abstracting: (p6<=0)
states: 16
abstracting: (0<=p9)
states: 20
abstracting: (p9<=0)
states: 6
abstracting: (1<=p11)
states: 12
abstracting: (p11<=1)
states: 20
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C002-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: AF [[AG [EF [[p2<=1 & 1<=p2]]] & [[[p3<=0 & 0<=p3] | [p5<=1 & 1<=p5]] & [AX [[EF [[[p10<=0 & 0<=p10] | [p9<=1 & 1<=p9]]] & [[p9<=0 & 0<=p9] | [p7<=1 & 1<=p7]]]] | AG [[p9<=0 & 0<=p9]]]]]]
normalized: ~ [EG [~ [[[[~ [E [true U ~ [[p9<=0 & 0<=p9]]]] | ~ [EX [~ [[[[p7<=1 & 1<=p7] | [p9<=0 & 0<=p9]] & E [true U [[p9<=1 & 1<=p9] | [p10<=0 & 0<=p10]]]]]]]] & [[p5<=1 & 1<=p5] | [p3<=0 & 0<=p3]]] & ~ [E [true U ~ [E [true U [p2<=1 & 1<=p2]]]]]]]]]

abstracting: (1<=p2)
states: 6
abstracting: (p2<=1)
states: 20
abstracting: (0<=p3)
states: 20
abstracting: (p3<=0)
states: 12
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
abstracting: (0<=p10)
states: 20
abstracting: (p10<=0)
states: 12
abstracting: (1<=p9)
states: 14
abstracting: (p9<=1)
states: 20
abstracting: (0<=p9)
states: 20
abstracting: (p9<=0)
states: 6
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 20
.abstracting: (0<=p9)
states: 20
abstracting: (p9<=0)
states: 6
.
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C002-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[AG [~ [E [[[p8<=0 & 0<=p8] | [p6<=1 & 1<=p6]] U [[p10<=0 & 0<=p10] | [p2<=1 & 1<=p2]]]]] | [EF [[p7<=0 & 0<=p7]] & [EX [[[p3<=0 & 0<=p3] & [p0<=1 & 1<=p0]]] & EX [E [[p3<=1 & 1<=p3] U [p1<=0 & 0<=p1]]]]]]]
normalized: ~ [E [true U ~ [[[[EX [E [[p3<=1 & 1<=p3] U [p1<=0 & 0<=p1]]] & EX [[[p0<=1 & 1<=p0] & [p3<=0 & 0<=p3]]]] & E [true U [p7<=0 & 0<=p7]]] | ~ [E [true U E [[[p6<=1 & 1<=p6] | [p8<=0 & 0<=p8]] U [[p2<=1 & 1<=p2] | [p10<=0 & 0<=p10]]]]]]]]]

abstracting: (0<=p10)
states: 20
abstracting: (p10<=0)
states: 12
abstracting: (1<=p2)
states: 6
abstracting: (p2<=1)
states: 20
abstracting: (0<=p8)
states: 20
abstracting: (p8<=0)
states: 14
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 20
abstracting: (0<=p7)
states: 20
abstracting: (p7<=0)
states: 4
abstracting: (0<=p3)
states: 20
abstracting: (p3<=0)
states: 12
abstracting: (1<=p0)
states: 8
abstracting: (p0<=1)
states: 20
.abstracting: (0<=p1)
states: 20
abstracting: (p1<=0)
states: 12
abstracting: (1<=p3)
states: 8
abstracting: (p3<=1)
states: 20
.-> the formula is FALSE

FORMULA ResAllocation-PT-R003C002-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [[AF [EG [[p11<=0 & 0<=p11]]] | E [~ [[p2<=0 & 0<=p2]] U [[p3<=1 & 1<=p3] & [[p2<=0 & 0<=p2] | [p10<=1 & 1<=p10]]]]] & [AX [AF [[AX [~ [[p2<=1 & 1<=p2]]] | EG [[~ [[p0<=0 & 0<=p0]] & ~ [[p8<=1 & 1<=p8]]]]]]] | [EX [AG [[p5<=0 & 0<=p5]]] | [AG [[p10<=0 & 0<=p10]] & ~ [E [EX [0<=0] U [p2<=1 & 1<=p2]]]]]]]
normalized: [[[[~ [E [EX [0<=0] U [p2<=1 & 1<=p2]]] & ~ [E [true U ~ [[p10<=0 & 0<=p10]]]]] | EX [~ [E [true U ~ [[p5<=0 & 0<=p5]]]]]] | ~ [EX [EG [~ [[EG [[~ [[p8<=1 & 1<=p8]] & ~ [[p0<=0 & 0<=p0]]]] | ~ [EX [[p2<=1 & 1<=p2]]]]]]]]] & [E [~ [[p2<=0 & 0<=p2]] U [[[p10<=1 & 1<=p10] | [p2<=0 & 0<=p2]] & [p3<=1 & 1<=p3]]] | ~ [EG [~ [EG [[p11<=0 & 0<=p11]]]]]]]

abstracting: (0<=p11)
states: 20
abstracting: (p11<=0)
states: 8
.
EG iterations: 1
..
EG iterations: 2
abstracting: (1<=p3)
states: 8
abstracting: (p3<=1)
states: 20
abstracting: (0<=p2)
states: 20
abstracting: (p2<=0)
states: 14
abstracting: (1<=p10)
states: 8
abstracting: (p10<=1)
states: 20
abstracting: (0<=p2)
states: 20
abstracting: (p2<=0)
states: 14
abstracting: (1<=p2)
states: 6
abstracting: (p2<=1)
states: 20
.abstracting: (0<=p0)
states: 20
abstracting: (p0<=0)
states: 12
abstracting: (1<=p8)
states: 6
abstracting: (p8<=1)
states: 20
....
EG iterations: 4
.....
EG iterations: 5
.abstracting: (0<=p5)
states: 20
abstracting: (p5<=0)
states: 12
.abstracting: (0<=p10)
states: 20
abstracting: (p10<=0)
states: 12
abstracting: (1<=p2)
states: 6
abstracting: (p2<=1)
states: 20
abstracting: (0<=0)
states: 20
.-> the formula is TRUE

FORMULA ResAllocation-PT-R003C002-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [A [[[p9<=0 & 0<=p9] | [p8<=1 & 1<=p8]] U AF [[[E [[p3<=1 & 1<=p3] U [p6<=1 & 1<=p6]] | [[p11<=1 & 1<=p11] & [p0<=0 & 0<=p0]]] | [[[p1<=1 & 1<=p1] & [[p3<=0 & 0<=p3] | [p2<=1 & 1<=p2]]] | [[p5<=1 & 1<=p5] & [p3<=0 & 0<=p3]]]]]]]
normalized: EG [[~ [EG [EG [~ [[[[[p3<=0 & 0<=p3] & [p5<=1 & 1<=p5]] | [[[p2<=1 & 1<=p2] | [p3<=0 & 0<=p3]] & [p1<=1 & 1<=p1]]] | [[[p0<=0 & 0<=p0] & [p11<=1 & 1<=p11]] | E [[p3<=1 & 1<=p3] U [p6<=1 & 1<=p6]]]]]]]] & ~ [E [EG [~ [[[[[p3<=0 & 0<=p3] & [p5<=1 & 1<=p5]] | [[[p2<=1 & 1<=p2] | [p3<=0 & 0<=p3]] & [p1<=1 & 1<=p1]]] | [[[p0<=0 & 0<=p0] & [p11<=1 & 1<=p11]] | E [[p3<=1 & 1<=p3] U [p6<=1 & 1<=p6]]]]]] U [~ [[[p8<=1 & 1<=p8] | [p9<=0 & 0<=p9]]] & EG [~ [[[[[p3<=0 & 0<=p3] & [p5<=1 & 1<=p5]] | [[[p2<=1 & 1<=p2] | [p3<=0 & 0<=p3]] & [p1<=1 & 1<=p1]]] | [[[p0<=0 & 0<=p0] & [p11<=1 & 1<=p11]] | E [[p3<=1 & 1<=p3] U [p6<=1 & 1<=p6]]]]]]]]]]]

abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 20
abstracting: (1<=p3)
states: 8
abstracting: (p3<=1)
states: 20
abstracting: (1<=p11)
states: 12
abstracting: (p11<=1)
states: 20
abstracting: (0<=p0)
states: 20
abstracting: (p0<=0)
states: 12
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
abstracting: (0<=p3)
states: 20
abstracting: (p3<=0)
states: 12
abstracting: (1<=p2)
states: 6
abstracting: (p2<=1)
states: 20
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
abstracting: (0<=p3)
states: 20
abstracting: (p3<=0)
states: 12
....
EG iterations: 4
abstracting: (0<=p9)
states: 20
abstracting: (p9<=0)
states: 6
abstracting: (1<=p8)
states: 6
abstracting: (p8<=1)
states: 20
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 20
abstracting: (1<=p3)
states: 8
abstracting: (p3<=1)
states: 20
abstracting: (1<=p11)
states: 12
abstracting: (p11<=1)
states: 20
abstracting: (0<=p0)
states: 20
abstracting: (p0<=0)
states: 12
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
abstracting: (0<=p3)
states: 20
abstracting: (p3<=0)
states: 12
abstracting: (1<=p2)
states: 6
abstracting: (p2<=1)
states: 20
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
abstracting: (0<=p3)
states: 20
abstracting: (p3<=0)
states: 12
....
EG iterations: 4
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 20
abstracting: (1<=p3)
states: 8
abstracting: (p3<=1)
states: 20
abstracting: (1<=p11)
states: 12
abstracting: (p11<=1)
states: 20
abstracting: (0<=p0)
states: 20
abstracting: (p0<=0)
states: 12
abstracting: (1<=p1)
states: 8
abstracting: (p1<=1)
states: 20
abstracting: (0<=p3)
states: 20
abstracting: (p3<=0)
states: 12
abstracting: (1<=p2)
states: 6
abstracting: (p2<=1)
states: 20
abstracting: (1<=p5)
states: 8
abstracting: (p5<=1)
states: 20
abstracting: (0<=p3)
states: 20
abstracting: (p3<=0)
states: 12
....
EG iterations: 4
.
EG iterations: 1
...
EG iterations: 3
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C002-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 1198 (1.2e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1212 3087 4299
used/not used/entry size/cache size: 3868 67104996 16 1024MB
basic ops cache: hits/miss/sum: 1154 2473 3627
used/not used/entry size/cache size: 4476 16772740 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: 211 166 377
used/not used/entry size/cache size: 166 8388442 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 67107678
1 1174
2 12
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.324sec


BK_STOP 1679180594368

--------------------
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:56 (7), effective:12 (1)

initing FirstDep: 0m 0.002sec


iterations count:32 (4), effective:9 (1)

iterations count:27 (3), effective:7 (0)

iterations count:29 (3), effective:7 (0)

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

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

iterations count:29 (3), effective:8 (1)

iterations count:26 (3), effective:5 (0)

iterations count:25 (3), effective:7 (0)

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

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

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

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

iterations count:32 (4), effective:9 (1)

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

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

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

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

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

iterations count:26 (3), effective:5 (0)

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

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

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

iterations count:8 (1), effective:0 (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="ResAllocation-PT-R003C002"
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 ResAllocation-PT-R003C002, 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 r330-tall-167889203600665"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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