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.r170-tall-167838856600018.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 ERK-PT-000100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856600018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 8.6K Feb 26 16:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 16:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 16:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 16:38 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.6K Feb 25 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 16:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 16:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 16:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 16:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 6.7K 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 ERK-PT-000100-CTLFireability-00
FORMULA_NAME ERK-PT-000100-CTLFireability-01
FORMULA_NAME ERK-PT-000100-CTLFireability-02
FORMULA_NAME ERK-PT-000100-CTLFireability-03
FORMULA_NAME ERK-PT-000100-CTLFireability-04
FORMULA_NAME ERK-PT-000100-CTLFireability-05
FORMULA_NAME ERK-PT-000100-CTLFireability-06
FORMULA_NAME ERK-PT-000100-CTLFireability-07
FORMULA_NAME ERK-PT-000100-CTLFireability-08
FORMULA_NAME ERK-PT-000100-CTLFireability-09
FORMULA_NAME ERK-PT-000100-CTLFireability-10
FORMULA_NAME ERK-PT-000100-CTLFireability-11
FORMULA_NAME ERK-PT-000100-CTLFireability-12
FORMULA_NAME ERK-PT-000100-CTLFireability-13
FORMULA_NAME ERK-PT-000100-CTLFireability-14
FORMULA_NAME ERK-PT-000100-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678463955092

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ERK-PT-000100
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 15:59:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 15:59:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 15:59:16] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2023-03-10 15:59:16] [INFO ] Transformed 11 places.
[2023-03-10 15:59:16] [INFO ] Transformed 11 transitions.
[2023-03-10 15:59:16] [INFO ] Parsed PT model containing 11 places and 11 transitions and 34 arcs in 77 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Initial state reduction rules removed 2 formulas.
FORMULA ERK-PT-000100-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-000100-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 8 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2023-03-10 15:59:16] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-10 15:59:17] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-10 15:59:17] [INFO ] Invariant cache hit.
[2023-03-10 15:59:17] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2023-03-10 15:59:17] [INFO ] Invariant cache hit.
[2023-03-10 15:59:17] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 530 ms. Remains : 11/11 places, 11/11 transitions.
Support contains 11 out of 11 places after structural reductions.
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 14 ms
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 4 ms
[2023-03-10 15:59:17] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 25) seen :22
Finished Best-First random walk after 365 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=73 )
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 2 ms
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 3 ms
[2023-03-10 15:59:17] [INFO ] Input system was already deterministic with 11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 3 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:17] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 11 transition count 10
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 9 transition count 10
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 9 transition count 10
Applied a total of 4 rules in 6 ms. Remains 9 /11 variables (removed 2) and now considering 10/11 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 9/11 places, 10/11 transitions.
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:17] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:17] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 2 ms
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:17] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:17] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:17] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:17] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:17] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 11 transition count 10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 9 transition count 10
Applied a total of 3 rules in 1 ms. Remains 9 /11 variables (removed 2) and now considering 10/11 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 9/11 places, 10/11 transitions.
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 0 ms
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 0 ms
[2023-03-10 15:59:17] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:17] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 11 transition count 10
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 9 transition count 10
Applied a total of 3 rules in 1 ms. Remains 9 /11 variables (removed 2) and now considering 10/11 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 9/11 places, 10/11 transitions.
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 0 ms
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 0 ms
[2023-03-10 15:59:17] [INFO ] Input system was already deterministic with 10 transitions.
Finished random walk after 405 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=202 )
FORMULA ERK-PT-000100-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:17] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:17] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:17] [INFO ] Input system was already deterministic with 11 transitions.
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:59:17] [INFO ] Flatten gal took : 2 ms
[2023-03-10 15:59:17] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 1 ms.
[2023-03-10 15:59:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 11 places, 11 transitions and 34 arcs took 0 ms.
Total runtime 1338 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 11 NrTr: 11 NrArc: 34)

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

net check time: 0m 0.000sec

init dd package: 0m 2.743sec


RS generation: 0m 0.032sec


-> reachability set: #nodes 1011 (1.0e+03) #states 15,914,114,086 (10)



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

checking: EG [EF [AG [[p2<=0 | [p3<=0 | 1<=p6]]]]]
normalized: EG [E [true U ~ [E [true U ~ [[[p3<=0 | 1<=p6] | p2<=0]]]]]]

abstracting: (p2<=0)
states: 551,951,971 (8)
abstracting: (1<=p6)
states: 15,362,162,115 (10)
abstracting: (p3<=0)
states: 372,448,206 (8)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ERK-PT-000100-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.156sec

checking: E [[1<=p7 & 1<=p8] U ~ [AG [p5<=0]]]
normalized: E [[1<=p7 & 1<=p8] U E [true U ~ [p5<=0]]]

abstracting: (p5<=0)
states: 910,959,501 (8)
abstracting: (1<=p8)
states: 15,541,665,880 (10)
abstracting: (1<=p7)
states: 15,913,937,235 (10)
-> the formula is TRUE

FORMULA ERK-PT-000100-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

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

abstracting: (1<=p1)
states: 15,362,162,115 (10)
abstracting: (1<=p0)
states: 15,913,937,235 (10)
..abstracting: (1<=p3)
states: 15,541,665,880 (10)
abstracting: (1<=p2)
states: 15,362,162,115 (10)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ERK-PT-000100-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: EX [[p2<=0 & AG [[p9<=0 | [p10<=0 | p2<=0]]]]]
normalized: EX [[p2<=0 & ~ [E [true U ~ [[p9<=0 | [p10<=0 | p2<=0]]]]]]]

abstracting: (p2<=0)
states: 551,951,971 (8)
abstracting: (p10<=0)
states: 5,151 (3)
abstracting: (p9<=0)
states: 551,951,971 (8)
abstracting: (p2<=0)
states: 551,951,971 (8)
.-> the formula is FALSE

FORMULA ERK-PT-000100-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: EF [[~ [E [~ [[1<=p9 & 1<=p10]] U AX [[1<=p0 & 1<=p1]]]] & [EG [p5<=0] & p2<=0]]]
normalized: E [true U [[p2<=0 & EG [p5<=0]] & ~ [E [~ [[1<=p9 & 1<=p10]] U ~ [EX [~ [[1<=p0 & 1<=p1]]]]]]]]

abstracting: (1<=p1)
states: 15,362,162,115 (10)
abstracting: (1<=p0)
states: 15,913,937,235 (10)
.abstracting: (1<=p10)
states: 15,914,108,935 (10)
abstracting: (1<=p9)
states: 15,362,162,115 (10)
abstracting: (p5<=0)
states: 910,959,501 (8)
.
EG iterations: 1
abstracting: (p2<=0)
states: 551,951,971 (8)
-> the formula is TRUE

FORMULA ERK-PT-000100-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.282sec

checking: EX [EX [[[1<=p5 | ~ [A [1<=p2 U [1<=p2 & 1<=p3]]]] | [EX [[p9<=0 | p10<=0]] | p6<=0]]]]
normalized: EX [EX [[[~ [[~ [EG [~ [[1<=p2 & 1<=p3]]]] & ~ [E [~ [[1<=p2 & 1<=p3]] U [~ [1<=p2] & ~ [[1<=p2 & 1<=p3]]]]]]] | 1<=p5] | [p6<=0 | EX [[p9<=0 | p10<=0]]]]]]

abstracting: (p10<=0)
states: 5,151 (3)
abstracting: (p9<=0)
states: 551,951,971 (8)
.abstracting: (p6<=0)
states: 551,951,971 (8)
abstracting: (1<=p5)
states: 15,003,154,585 (10)
abstracting: (1<=p3)
states: 15,541,665,880 (10)
abstracting: (1<=p2)
states: 15,362,162,115 (10)
abstracting: (1<=p2)
states: 15,362,162,115 (10)
abstracting: (1<=p3)
states: 15,541,665,880 (10)
abstracting: (1<=p2)
states: 15,362,162,115 (10)
abstracting: (1<=p3)
states: 15,541,665,880 (10)
abstracting: (1<=p2)
states: 15,362,162,115 (10)
..
EG iterations: 2
..-> the formula is TRUE

FORMULA ERK-PT-000100-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.343sec

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

abstracting: (1<=p5)
states: 15,003,154,585 (10)
abstracting: (p4<=0)
states: 372,448,206 (8)
.abstracting: (1<=p6)
states: 15,362,162,115 (10)
abstracting: (1<=p4)
states: 15,541,665,880 (10)
.
EG iterations: 1
abstracting: (1<=p3)
states: 15,541,665,880 (10)
abstracting: (1<=p2)
states: 15,362,162,115 (10)
abstracting: (1<=p3)
states: 15,541,665,880 (10)
abstracting: (1<=p2)
states: 15,362,162,115 (10)
abstracting: (1<=p3)
states: 15,541,665,880 (10)
abstracting: (1<=p2)
states: 15,362,162,115 (10)
.
EG iterations: 1
abstracting: (1<=p10)
states: 15,914,108,935 (10)
abstracting: (1<=p9)
states: 15,362,162,115 (10)
-> the formula is FALSE

FORMULA ERK-PT-000100-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.518sec

checking: AG [[AG [[[[[1<=p4 & 1<=p5] & [1<=p7 & 1<=p8]] | EF [[1<=p9 & 1<=p10]]] | [1<=p4 | EX [1<=p4]]]] | [1<=p7 & 1<=p8]]]
normalized: ~ [E [true U ~ [[[1<=p7 & 1<=p8] | ~ [E [true U ~ [[[1<=p4 | EX [1<=p4]] | [E [true U [1<=p9 & 1<=p10]] | [[1<=p7 & 1<=p8] & [1<=p4 & 1<=p5]]]]]]]]]]]

abstracting: (1<=p5)
states: 15,003,154,585 (10)
abstracting: (1<=p4)
states: 15,541,665,880 (10)
abstracting: (1<=p8)
states: 15,541,665,880 (10)
abstracting: (1<=p7)
states: 15,913,937,235 (10)
abstracting: (1<=p10)
states: 15,914,108,935 (10)
abstracting: (1<=p9)
states: 15,362,162,115 (10)
abstracting: (1<=p4)
states: 15,541,665,880 (10)
.abstracting: (1<=p4)
states: 15,541,665,880 (10)
abstracting: (1<=p8)
states: 15,541,665,880 (10)
abstracting: (1<=p7)
states: 15,913,937,235 (10)
-> the formula is TRUE

FORMULA ERK-PT-000100-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.130sec

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

abstracting: (1<=p8)
states: 15,541,665,880 (10)
abstracting: (1<=p7)
states: 15,913,937,235 (10)
abstracting: (1<=p4)
states: 15,541,665,880 (10)
.
EG iterations: 1
abstracting: (1<=p6)
states: 15,362,162,115 (10)
abstracting: (1<=p4)
states: 15,541,665,880 (10)
abstracting: (1<=p10)
states: 15,914,108,935 (10)
abstracting: (1<=p9)
states: 15,362,162,115 (10)
abstracting: (1<=p4)
states: 15,541,665,880 (10)
.abstracting: (1<=p3)
states: 15,541,665,880 (10)
abstracting: (1<=p2)
states: 15,362,162,115 (10)
-> the formula is FALSE

FORMULA ERK-PT-000100-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.672sec

checking: EG [[EF [AG [[1<=p0 & 1<=p1]]] & [[1<=p9 & 1<=p10] | [[~ [A [[1<=p2 & 1<=p3] U 1<=p2]] | EF [[1<=p2 & [1<=p0 & 1<=p1]]]] & [AX [p4<=0] | EF [EG [1<=p4]]]]]]]
normalized: EG [[[[[E [true U EG [1<=p4]] | ~ [EX [~ [p4<=0]]]] & [E [true U [1<=p2 & [1<=p0 & 1<=p1]]] | ~ [[~ [EG [~ [1<=p2]]] & ~ [E [~ [1<=p2] U [~ [[1<=p2 & 1<=p3]] & ~ [1<=p2]]]]]]]] | [1<=p9 & 1<=p10]] & E [true U ~ [E [true U ~ [[1<=p0 & 1<=p1]]]]]]]

abstracting: (1<=p1)
states: 15,362,162,115 (10)
abstracting: (1<=p0)
states: 15,913,937,235 (10)
abstracting: (1<=p10)
states: 15,914,108,935 (10)
abstracting: (1<=p9)
states: 15,362,162,115 (10)
abstracting: (1<=p2)
states: 15,362,162,115 (10)
abstracting: (1<=p3)
states: 15,541,665,880 (10)
abstracting: (1<=p2)
states: 15,362,162,115 (10)
abstracting: (1<=p2)
states: 15,362,162,115 (10)
abstracting: (1<=p2)
states: 15,362,162,115 (10)
..
EG iterations: 2
abstracting: (1<=p1)
states: 15,362,162,115 (10)
abstracting: (1<=p0)
states: 15,913,937,235 (10)
abstracting: (1<=p2)
states: 15,362,162,115 (10)
abstracting: (p4<=0)
states: 372,448,206 (8)
.abstracting: (1<=p4)
states: 15,541,665,880 (10)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA ERK-PT-000100-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.126sec

checking: [AX [[1<=p9 & 1<=p10]] & E [[AG [[[~ [[1<=p4 | [1<=p2 & 1<=p3]]] | 1<=p6] | [1<=p2 | 1<=p6]]] | [[1<=p2 & 1<=p3] | EX [EG [1<=p4]]]] U AX [p2<=0]]]
normalized: [E [[[EX [EG [1<=p4]] | [1<=p2 & 1<=p3]] | ~ [E [true U ~ [[[1<=p2 | 1<=p6] | [1<=p6 | ~ [[1<=p4 | [1<=p2 & 1<=p3]]]]]]]]] U ~ [EX [~ [p2<=0]]]] & ~ [EX [~ [[1<=p9 & 1<=p10]]]]]

abstracting: (1<=p10)
states: 15,914,108,935 (10)
abstracting: (1<=p9)
states: 15,362,162,115 (10)
.abstracting: (p2<=0)
states: 551,951,971 (8)
.abstracting: (1<=p3)
states: 15,541,665,880 (10)
abstracting: (1<=p2)
states: 15,362,162,115 (10)
abstracting: (1<=p4)
states: 15,541,665,880 (10)
abstracting: (1<=p6)
states: 15,362,162,115 (10)
abstracting: (1<=p6)
states: 15,362,162,115 (10)
abstracting: (1<=p2)
states: 15,362,162,115 (10)
abstracting: (1<=p3)
states: 15,541,665,880 (10)
abstracting: (1<=p2)
states: 15,362,162,115 (10)
abstracting: (1<=p4)
states: 15,541,665,880 (10)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA ERK-PT-000100-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.676sec

checking: EF [[1<=p0 & [1<=p1 & EG [[E [A [[1<=p9 & 1<=p10] U [1<=p0 & 1<=p1]] U AG [1<=p4]] & [[1<=p5 | E [[1<=p0 & 1<=p1] U [1<=p0 & 1<=p1]]] & 1<=p5]]]]]]
normalized: E [true U [1<=p0 & [1<=p1 & EG [[[1<=p5 & [1<=p5 | E [[1<=p0 & 1<=p1] U [1<=p0 & 1<=p1]]]] & E [[~ [EG [~ [[1<=p0 & 1<=p1]]]] & ~ [E [~ [[1<=p0 & 1<=p1]] U [~ [[1<=p9 & 1<=p10]] & ~ [[1<=p0 & 1<=p1]]]]]] U ~ [E [true U ~ [1<=p4]]]]]]]]]

abstracting: (1<=p4)
states: 15,541,665,880 (10)
abstracting: (1<=p1)
states: 15,362,162,115 (10)
abstracting: (1<=p0)
states: 15,913,937,235 (10)
abstracting: (1<=p10)
states: 15,914,108,935 (10)
abstracting: (1<=p9)
states: 15,362,162,115 (10)
abstracting: (1<=p1)
states: 15,362,162,115 (10)
abstracting: (1<=p0)
states: 15,913,937,235 (10)
abstracting: (1<=p1)
states: 15,362,162,115 (10)
abstracting: (1<=p0)
states: 15,913,937,235 (10)
.
EG iterations: 1
abstracting: (1<=p1)
states: 15,362,162,115 (10)
abstracting: (1<=p0)
states: 15,913,937,235 (10)
abstracting: (1<=p1)
states: 15,362,162,115 (10)
abstracting: (1<=p0)
states: 15,913,937,235 (10)
abstracting: (1<=p5)
states: 15,003,154,585 (10)
abstracting: (1<=p5)
states: 15,003,154,585 (10)
.
EG iterations: 1
abstracting: (1<=p1)
states: 15,362,162,115 (10)
abstracting: (1<=p0)
states: 15,913,937,235 (10)
-> the formula is FALSE

FORMULA ERK-PT-000100-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.564sec

checking: E [[[AX [p5<=0] & EX [[1<=p5 & [1<=p0 & 1<=p1]]]] & [EX [[1<=p6 | 1<=p5]] & [EF [EX [EX [[1<=p9 & 1<=p10]]]] & ~ [[[AX [[[1<=p0 & 1<=p1] & [1<=p4 & 1<=p6]]] & p6<=0] & [[1<=p5 | [[1<=p0 & 1<=p1] | 1<=p5]] & [[1<=p5 & EF [[1<=p9 & 1<=p10]]] | 1<=p6]]]]]]] U [~ [E [p4<=0 U [~ [[1<=p5 | 1<=p6]] | [p6<=0 & [1<=p4 & 1<=p5]]]]] | AG [1<=p6]]]
normalized: E [[[[~ [[[[1<=p6 | [1<=p5 & E [true U [1<=p9 & 1<=p10]]]] & [1<=p5 | [1<=p5 | [1<=p0 & 1<=p1]]]] & [p6<=0 & ~ [EX [~ [[[1<=p4 & 1<=p6] & [1<=p0 & 1<=p1]]]]]]]] & E [true U EX [EX [[1<=p9 & 1<=p10]]]]] & EX [[1<=p6 | 1<=p5]]] & [EX [[1<=p5 & [1<=p0 & 1<=p1]]] & ~ [EX [~ [p5<=0]]]]] U [~ [E [true U ~ [1<=p6]]] | ~ [E [p4<=0 U [[p6<=0 & [1<=p4 & 1<=p5]] | ~ [[1<=p5 | 1<=p6]]]]]]]

abstracting: (1<=p6)
states: 15,362,162,115 (10)
abstracting: (1<=p5)
states: 15,003,154,585 (10)
abstracting: (1<=p5)
states: 15,003,154,585 (10)
abstracting: (1<=p4)
states: 15,541,665,880 (10)
abstracting: (p6<=0)
states: 551,951,971 (8)
abstracting: (p4<=0)
states: 372,448,206 (8)
abstracting: (1<=p6)
states: 15,362,162,115 (10)
abstracting: (p5<=0)
states: 910,959,501 (8)
.abstracting: (1<=p1)
states: 15,362,162,115 (10)
abstracting: (1<=p0)
states: 15,913,937,235 (10)
abstracting: (1<=p5)
states: 15,003,154,585 (10)
.abstracting: (1<=p5)
states: 15,003,154,585 (10)
abstracting: (1<=p6)
states: 15,362,162,115 (10)
.abstracting: (1<=p10)
states: 15,914,108,935 (10)
abstracting: (1<=p9)
states: 15,362,162,115 (10)
..abstracting: (1<=p1)
states: 15,362,162,115 (10)
abstracting: (1<=p0)
states: 15,913,937,235 (10)
abstracting: (1<=p6)
states: 15,362,162,115 (10)
abstracting: (1<=p4)
states: 15,541,665,880 (10)
.abstracting: (p6<=0)
states: 551,951,971 (8)
abstracting: (1<=p1)
states: 15,362,162,115 (10)
abstracting: (1<=p0)
states: 15,913,937,235 (10)
abstracting: (1<=p5)
states: 15,003,154,585 (10)
abstracting: (1<=p5)
states: 15,003,154,585 (10)
abstracting: (1<=p10)
states: 15,914,108,935 (10)
abstracting: (1<=p9)
states: 15,362,162,115 (10)
abstracting: (1<=p5)
states: 15,003,154,585 (10)
abstracting: (1<=p6)
states: 15,362,162,115 (10)
-> the formula is FALSE

FORMULA ERK-PT-000100-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.299sec

totally nodes used: 624125 (6.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 34715429 1573847 36289276
used/not used/entry size/cache size: 1889353 65219511 16 1024MB
basic ops cache: hits/miss/sum: 12065488 588818 12654306
used/not used/entry size/cache size: 1046334 15730882 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: 212625 8058 220683
used/not used/entry size/cache size: 8056 8380552 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 66542219
1 543441
2 16878
3 5451
4 364
5 13
6 199
7 4
8 3
9 2
>= 10 290

Total processing time: 0m 8.258sec


BK_STOP 1678463968056

--------------------
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 CTLFireability -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:2411 (219), effective:800 (72)

initing FirstDep: 0m 0.000sec


iterations count:424 (38), effective:105 (9)

iterations count:27 (2), effective:6 (0)

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

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

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

iterations count:1705 (155), effective:498 (45)

iterations count:411 (37), effective:100 (9)

iterations count:27 (2), effective:6 (0)

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

iterations count:209 (19), effective:99 (9)

iterations count:32 (2), effective:6 (0)

iterations count:31 (2), effective:6 (0)

iterations count:411 (37), effective:200 (18)

iterations count:311 (28), effective:100 (9)

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

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

iterations count:32 (2), effective:6 (0)

iterations count:1026 (93), effective:403 (36)

iterations count:1718 (156), effective:502 (45)

iterations count:211 (19), effective:100 (9)

iterations count:311 (28), effective:100 (9)

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

iterations count:712 (64), effective:201 (18)

iterations count:411 (37), effective:100 (9)

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

iterations count:32 (2), effective:6 (0)

iterations count:11 (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="ERK-PT-000100"
export BK_EXAMINATION="CTLFireability"
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 ERK-PT-000100, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838856600018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ERK-PT-000100.tgz
mv ERK-PT-000100 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;