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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.4K Feb 25 15:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 15:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 15:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 15:31 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.8K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 15:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 15:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 15:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 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 64K 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-R015C002-CTLCardinality-00
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-01
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-02
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-03
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-04
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-05
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-06
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-07
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-08
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-09
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-10
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-11
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-12
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-13
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-14
FORMULA_NAME ResAllocation-PT-R015C002-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679181669971

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-R015C002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:21:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 23:21:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:21:11] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2023-03-18 23:21:11] [INFO ] Transformed 60 places.
[2023-03-18 23:21:11] [INFO ] Transformed 32 transitions.
[2023-03-18 23:21:11] [INFO ] Parsed PT model containing 60 places and 32 transitions and 150 arcs in 96 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Support contains 51 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 9 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 60 cols
[2023-03-18 23:21:11] [INFO ] Computed 30 place invariants in 8 ms
[2023-03-18 23:21:11] [INFO ] Implicit Places using invariants in 183 ms returned [41, 43, 47, 49, 55]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 209 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/60 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 220 ms. Remains : 55/60 places, 32/32 transitions.
Support contains 51 out of 55 places after structural reductions.
[2023-03-18 23:21:12] [INFO ] Flatten gal took : 21 ms
[2023-03-18 23:21:12] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:21:12] [INFO ] Input system was already deterministic with 32 transitions.
Support contains 50 out of 55 places (down from 51) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 574 ms. (steps per millisecond=17 ) properties (out of 64) seen :49
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) 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 14) seen :1
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 13) 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 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 32 rows 55 cols
[2023-03-18 23:21:12] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-18 23:21:12] [INFO ] [Real]Absence check using 25 positive place invariants in 4 ms returned sat
[2023-03-18 23:21:12] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:9
[2023-03-18 23:21:13] [INFO ] [Nat]Absence check using 25 positive place invariants in 6 ms returned sat
[2023-03-18 23:21:13] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :2
[2023-03-18 23:21:13] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-18 23:21:13] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :2
Fused 13 Parikh solutions to 2 different solutions.
Finished Parikh walk after 27 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=13 )
Parikh walk visited 2 properties in 2 ms.
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:21:13] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ResAllocation-PT-R015C002-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:21:13] [INFO ] Input system was already deterministic with 32 transitions.
Support contains 41 out of 55 places (down from 49) after GAL structural reductions.
FORMULA ResAllocation-PT-R015C002-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 55/55 places, 32/32 transitions.
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:21:13] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 55/55 places, 32/32 transitions.
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:13] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Applied a total of 0 rules in 7 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 55/55 places, 32/32 transitions.
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:21:13] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 52 transition count 30
Applied a total of 5 rules in 9 ms. Remains 52 /55 variables (removed 3) and now considering 30/32 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 52/55 places, 30/32 transitions.
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:13] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 52 transition count 30
Applied a total of 5 rules in 5 ms. Remains 52 /55 variables (removed 3) and now considering 30/32 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 52/55 places, 30/32 transitions.
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:21:13] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 55/55 places, 32/32 transitions.
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:13] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 52 transition count 30
Applied a total of 5 rules in 4 ms. Remains 52 /55 variables (removed 3) and now considering 30/32 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 52/55 places, 30/32 transitions.
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:21:13] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 55/55 places, 32/32 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 53 transition count 31
Applied a total of 3 rules in 3 ms. Remains 53 /55 variables (removed 2) and now considering 31/32 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 53/55 places, 31/32 transitions.
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:13] [INFO ] Input system was already deterministic with 31 transitions.
Finished random walk after 30 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=30 )
FORMULA ResAllocation-PT-R015C002-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 55/55 places, 32/32 transitions.
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:13] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 55/55 places, 32/32 transitions.
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:21:13] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 55/55 places, 32/32 transitions.
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:13] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 55/55 places, 32/32 transitions.
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:21:13] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 55/55 places, 32/32 transitions.
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:21:13] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 55/55 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 55/55 places, 32/32 transitions.
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:21:13] [INFO ] Input system was already deterministic with 32 transitions.
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:13] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:21:13] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-18 23:21:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 55 places, 32 transitions and 140 arcs took 1 ms.
Total runtime 2009 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: 55 NrTr: 32 NrArc: 140)

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

net check time: 0m 0.000sec

init dd package: 0m 2.694sec


RS generation: 0m 0.005sec


-> reachability set: #nodes 158 (1.6e+02) #states 278,528 (5)



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

checking: AG [AF [1<=p46]]
normalized: ~ [E [true U EG [~ [1<=p46]]]]

abstracting: (1<=p46)
states: 98,304 (4)
........................................................
EG iterations: 56
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.082sec

checking: EF [AX [AF [AG [~ [p37<=0]]]]]
normalized: E [true U ~ [EX [EG [E [true U p37<=0]]]]]

abstracting: (p37<=0)
states: 40,960 (4)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: [EF [~ [p18<=p41]] & AF [AG [EF [~ [1<=p7]]]]]
normalized: [~ [EG [E [true U ~ [E [true U ~ [1<=p7]]]]]] & E [true U ~ [p18<=p41]]]

abstracting: (p18<=p41)
states: 221,184 (5)
abstracting: (1<=p7)
states: 131,072 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EX [EF [AG [[p51<=p26 & p42<=p22]]]]
normalized: EX [E [true U ~ [E [true U ~ [[p51<=p26 & p42<=p22]]]]]]

abstracting: (p42<=p22)
states: 204,800 (5)
abstracting: (p51<=p26)
states: 155,648 (5)
.-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AX [[EG [EX [~ [A [p46<=0 U p25<=p41]]]] & EF [~ [1<=p20]]]]
normalized: ~ [EX [~ [[E [true U ~ [1<=p20]] & EG [EX [~ [[~ [EG [~ [p25<=p41]]] & ~ [E [~ [p25<=p41] U [~ [p46<=0] & ~ [p25<=p41]]]]]]]]]]]]

abstracting: (p25<=p41)
states: 180,224 (5)
abstracting: (p46<=0)
states: 180,224 (5)
abstracting: (p25<=p41)
states: 180,224 (5)
abstracting: (p25<=p41)
states: 180,224 (5)
........................................................................................................
EG iterations: 104
............................................................................................
EG iterations: 91
abstracting: (1<=p20)
states: 49,152 (4)
.-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.202sec

checking: EG [A [p43<=0 U [AF [p34<=p50] | AF [p37<=p26]]]]
normalized: EG [[~ [EG [~ [[~ [EG [~ [p37<=p26]]] | ~ [EG [~ [p34<=p50]]]]]]] & ~ [E [~ [[~ [EG [~ [p37<=p26]]] | ~ [EG [~ [p34<=p50]]]]] U [~ [p43<=0] & ~ [[~ [EG [~ [p37<=p26]]] | ~ [EG [~ [p34<=p50]]]]]]]]]]

abstracting: (p34<=p50)
states: 262,144 (5)
...............................
EG iterations: 31
abstracting: (p37<=p26)
states: 65,536 (4)
......................................................................
EG iterations: 70
abstracting: (p43<=0)
states: 73,728 (4)
abstracting: (p34<=p50)
states: 262,144 (5)
...............................
EG iterations: 31
abstracting: (p37<=p26)
states: 65,536 (4)
......................................................................
EG iterations: 70
abstracting: (p34<=p50)
states: 262,144 (5)
...............................
EG iterations: 31
abstracting: (p37<=p26)
states: 65,536 (4)
......................................................................
EG iterations: 70
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.072sec

checking: [E [p47<=p22 U 1<=p42] | AX [[1<=p31 & 1<=p15]]]
normalized: [~ [EX [~ [[1<=p31 & 1<=p15]]]] | E [p47<=p22 U 1<=p42]]

abstracting: (1<=p42)
states: 73,728 (4)
abstracting: (p47<=p22)
states: 139,264 (5)
abstracting: (1<=p15)
states: 131,072 (5)
abstracting: (1<=p31)
states: 262,144 (5)
.-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: AF [E [[~ [EX [1<=p30]] | [EF [EG [1<=p15]] | ~ [A [p14<=p2 U 1<=p37]]]] U EG [1<=p16]]]
normalized: ~ [EG [~ [E [[[~ [[~ [EG [~ [1<=p37]]] & ~ [E [~ [1<=p37] U [~ [p14<=p2] & ~ [1<=p37]]]]]] | E [true U EG [1<=p15]]] | ~ [EX [1<=p30]]] U EG [1<=p16]]]]]

abstracting: (1<=p16)
states: 65,536 (4)
...............................................
EG iterations: 47
abstracting: (1<=p30)
states: 16,384 (4)
.abstracting: (1<=p15)
states: 131,072 (5)
......................................................................................
EG iterations: 86
abstracting: (1<=p37)
states: 237,568 (5)
abstracting: (p14<=p2)
states: 241,664 (5)
abstracting: (1<=p37)
states: 237,568 (5)
abstracting: (1<=p37)
states: 237,568 (5)
....................................................................
EG iterations: 68
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.131sec

checking: EX [[AX [AF [EX [~ [p18<=0]]]] & [AX [EX [~ [1<=p42]]] | [EF [[p36<=0 & p25<=1]] | ~ [E [p8<=p13 U p22<=0]]]]]]
normalized: EX [[[[~ [E [p8<=p13 U p22<=0]] | E [true U [p36<=0 & p25<=1]]] | ~ [EX [~ [EX [~ [1<=p42]]]]]] & ~ [EX [EG [~ [EX [~ [p18<=0]]]]]]]]

abstracting: (p18<=0)
states: 221,184 (5)
................................................
EG iterations: 47
.abstracting: (1<=p42)
states: 73,728 (4)
..abstracting: (p25<=1)
states: 278,528 (5)
abstracting: (p36<=0)
states: 237,568 (5)
abstracting: (p22<=0)
states: 237,568 (5)
abstracting: (p8<=p13)
states: 225,280 (5)
.-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: EF [[A [AX [p24<=p0] U ~ [AF [AG [1<=p42]]]] & EF [EX [[p25<=p30 | [p21<=p7 & p47<=0]]]]]]
normalized: E [true U [E [true U EX [[p25<=p30 | [p21<=p7 & p47<=0]]]] & [~ [EG [~ [EG [E [true U ~ [1<=p42]]]]]] & ~ [E [~ [EG [E [true U ~ [1<=p42]]]] U [EX [~ [p24<=p0]] & ~ [EG [E [true U ~ [1<=p42]]]]]]]]]]

abstracting: (1<=p42)
states: 73,728 (4)
...........................................................................................
EG iterations: 91
abstracting: (p24<=p0)
states: 262,144 (5)
.abstracting: (1<=p42)
states: 73,728 (4)
...........................................................................................
EG iterations: 91
abstracting: (1<=p42)
states: 73,728 (4)
...........................................................................................
EG iterations: 91
.
EG iterations: 1
abstracting: (p47<=0)
states: 98,304 (4)
abstracting: (p21<=p7)
states: 208,896 (5)
abstracting: (p25<=p30)
states: 155,648 (5)
.-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.089sec

checking: [AX [AX [AX [[~ [p29<=1] | ~ [p36<=p52]]]]] | EX [~ [A [[EG [p27<=p1] | [~ [1<=p23] | EX [p12<=p0]]] U [~ [[p41<=p45 | 1<=p29]] & EG [1<=p45]]]]]]
normalized: [EX [~ [[~ [EG [~ [[EG [1<=p45] & ~ [[p41<=p45 | 1<=p29]]]]]] & ~ [E [~ [[EG [1<=p45] & ~ [[p41<=p45 | 1<=p29]]]] U [~ [[[EX [p12<=p0] | ~ [1<=p23]] | EG [p27<=p1]]] & ~ [[EG [1<=p45] & ~ [[p41<=p45 | 1<=p29]]]]]]]]]] | ~ [EX [EX [EX [~ [[~ [p36<=p52] | ~ [p29<=1]]]]]]]]

abstracting: (p29<=1)
states: 278,528 (5)
abstracting: (p36<=p52)
states: 258,048 (5)
...abstracting: (1<=p29)
states: 131,072 (5)
abstracting: (p41<=p45)
states: 245,760 (5)
abstracting: (1<=p45)
states: 90,112 (4)
............................................
EG iterations: 44
abstracting: (p27<=p1)
states: 208,896 (5)
.................................
EG iterations: 33
abstracting: (1<=p23)
states: 131,072 (5)
abstracting: (p12<=p0)
states: 237,568 (5)
.abstracting: (1<=p29)
states: 131,072 (5)
abstracting: (p41<=p45)
states: 245,760 (5)
abstracting: (1<=p45)
states: 90,112 (4)
............................................
EG iterations: 44
abstracting: (1<=p29)
states: 131,072 (5)
abstracting: (p41<=p45)
states: 245,760 (5)
abstracting: (1<=p45)
states: 90,112 (4)
............................................
EG iterations: 44

EG iterations: 0
.-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.120sec

checking: AG [[[AF [~ [1<=p21]] | ~ [1<=p16]] | [EX [p54<=0] | [AX [EF [p7<=0]] & [[EF [~ [1<=p33]] | ~ [p10<=p33]] | [~ [p29<=0] | [p37<=p41 | p11<=p35]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[p37<=p41 | p11<=p35] | ~ [p29<=0]] | [~ [p10<=p33] | E [true U ~ [1<=p33]]]] & ~ [EX [~ [E [true U p7<=0]]]]] | EX [p54<=0]] | [~ [1<=p16] | ~ [EG [1<=p21]]]]]]]

abstracting: (1<=p21)
states: 131,072 (5)
..........................................................................................................................
EG iterations: 122
abstracting: (1<=p16)
states: 65,536 (4)
abstracting: (p54<=0)
states: 131,072 (5)
.abstracting: (p7<=0)
states: 147,456 (5)
.abstracting: (1<=p33)
states: 253,952 (5)
abstracting: (p10<=p33)
states: 278,528 (5)
abstracting: (p29<=0)
states: 147,456 (5)
abstracting: (p11<=p35)
states: 262,144 (5)
abstracting: (p37<=p41)
states: 86,016 (4)
-> the formula is TRUE

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

MC time: 0m 0.087sec

checking: EG [E [~ [[[EF [p19<=p5] & [AF [p47<=p45] & p14<=p11]] & [p1<=p42 & [p22<=p29 & p21<=p25]]]] U p19<=0]]
normalized: EG [E [~ [[[p1<=p42 & [p22<=p29 & p21<=p25]] & [[p14<=p11 & ~ [EG [~ [p47<=p45]]]] & E [true U p19<=p5]]]] U p19<=0]]

abstracting: (p19<=0)
states: 147,456 (5)
abstracting: (p19<=p5)
states: 208,896 (5)
abstracting: (p47<=p45)
states: 143,360 (5)
...............................................
EG iterations: 47
abstracting: (p14<=p11)
states: 241,664 (5)
abstracting: (p21<=p25)
states: 208,896 (5)
abstracting: (p22<=p29)
states: 253,952 (5)
abstracting: (p1<=p42)
states: 180,224 (5)
..............................................................................
EG iterations: 78
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.223sec

totally nodes used: 1465366 (1.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 652210 2214067 2866277
used/not used/entry size/cache size: 3279776 63829088 16 1024MB
basic ops cache: hits/miss/sum: 168789 542808 711597
used/not used/entry size/cache size: 1159759 15617457 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: 960 2748 3708
used/not used/entry size/cache size: 2748 8385860 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 65740331
1 1281490
2 78053
3 8251
4 681
5 55
6 3
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.502sec


BK_STOP 1679181679783

--------------------
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:918 (28), effective:240 (7)

initing FirstDep: 0m 0.000sec


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

iterations count:325 (10), effective:90 (2)

iterations count:415 (12), effective:115 (3)

iterations count:232 (7), effective:65 (2)

iterations count:300 (9), effective:82 (2)

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

iterations count:406 (12), effective:121 (3)

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

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

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

iterations count:251 (7), effective:55 (1)

iterations count:43 (1), effective:4 (0)

iterations count:43 (1), effective:4 (0)

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

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

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

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

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

iterations count:300 (9), effective:82 (2)

iterations count:427 (13), effective:119 (3)

iterations count:118 (3), effective:28 (0)

iterations count:187 (5), effective:48 (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="ResAllocation-PT-R015C002"
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-R015C002, 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-167889203700745"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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