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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.5K Feb 25 20:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 20:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 20:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 20:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 20:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 25 20:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 20:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 127K Feb 25 20:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16K 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 FMS-PT-00002-CTLFireability-00
FORMULA_NAME FMS-PT-00002-CTLFireability-01
FORMULA_NAME FMS-PT-00002-CTLFireability-02
FORMULA_NAME FMS-PT-00002-CTLFireability-03
FORMULA_NAME FMS-PT-00002-CTLFireability-04
FORMULA_NAME FMS-PT-00002-CTLFireability-05
FORMULA_NAME FMS-PT-00002-CTLFireability-06
FORMULA_NAME FMS-PT-00002-CTLFireability-07
FORMULA_NAME FMS-PT-00002-CTLFireability-08
FORMULA_NAME FMS-PT-00002-CTLFireability-09
FORMULA_NAME FMS-PT-00002-CTLFireability-10
FORMULA_NAME FMS-PT-00002-CTLFireability-11
FORMULA_NAME FMS-PT-00002-CTLFireability-12
FORMULA_NAME FMS-PT-00002-CTLFireability-13
FORMULA_NAME FMS-PT-00002-CTLFireability-14
FORMULA_NAME FMS-PT-00002-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678493818056

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=FMS-PT-00002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 00:16:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 00:16:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:16:59] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2023-03-11 00:16:59] [INFO ] Transformed 22 places.
[2023-03-11 00:16:59] [INFO ] Transformed 20 transitions.
[2023-03-11 00:16:59] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 80 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Initial state reduction rules removed 4 formulas.
FORMULA FMS-PT-00002-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00002-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00002-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00002-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 8 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-11 00:16:59] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-11 00:17:00] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-11 00:17:00] [INFO ] Invariant cache hit.
[2023-03-11 00:17:00] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2023-03-11 00:17:00] [INFO ] Invariant cache hit.
[2023-03-11 00:17:00] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 431 ms. Remains : 22/22 places, 20/20 transitions.
Support contains 22 out of 22 places after structural reductions.
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 16 ms
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 4 ms
[2023-03-11 00:17:00] [INFO ] Input system was already deterministic with 20 transitions.
Finished random walk after 480 steps, including 0 resets, run visited all 26 properties in 25 ms. (steps per millisecond=19 )
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 3 ms
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:17:00] [INFO ] Input system was already deterministic with 20 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:17:00] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:17:00] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 19
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 21 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 19 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6 place count 19 transition count 15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 11 place count 16 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 15 transition count 14
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 15 transition count 14
Applied a total of 14 rules in 9 ms. Remains 15 /22 variables (removed 7) and now considering 14/20 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 15/22 places, 14/20 transitions.
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:17:00] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 4 places and 0 transitions.
Graph (trivial) has 8 edges and 18 vertex of which 6 / 18 are part of one of the 2 SCC in 2 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 14 transition count 17
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 13 place count 13 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 13 place count 13 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 17 place count 11 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 10 transition count 10
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 10 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 20 place count 10 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 23 place count 8 transition count 8
Applied a total of 23 rules in 5 ms. Remains 8 /22 variables (removed 14) and now considering 8/20 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 8/22 places, 8/20 transitions.
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:17:00] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:17:00] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:17:00] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:17:00] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:17:00] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:17:00] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:17:00] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:17:00] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:17:00] [INFO ] Input system was already deterministic with 20 transitions.
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:17:00] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:17:00] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-11 00:17:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 22 places, 20 transitions and 50 arcs took 0 ms.
Total runtime 965 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: 22 NrTr: 20 NrArc: 50)

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

net check time: 0m 0.000sec

init dd package: 0m 2.759sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 201 (2.0e+02) #states 3,444 (3)



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

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

abstracting: (p0<=0)
states: 2,580 (3)
.-> the formula is TRUE

FORMULA FMS-PT-00002-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [AG [EX [EX [[1<=p8 & 1<=p10]]]]]
normalized: E [true U ~ [E [true U ~ [EX [EX [[1<=p8 & 1<=p10]]]]]]]

abstracting: (1<=p10)
states: 2,670 (3)
abstracting: (1<=p8)
states: 900
..-> the formula is FALSE

FORMULA FMS-PT-00002-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: A [EX [EG [1<=p20]] U EF [[1<=p11 & AG [1<=p0]]]]
normalized: [~ [EG [~ [E [true U [~ [E [true U ~ [1<=p0]]] & 1<=p11]]]]] & ~ [E [~ [E [true U [~ [E [true U ~ [1<=p0]]] & 1<=p11]]] U [~ [E [true U [~ [E [true U ~ [1<=p0]]] & 1<=p11]]] & ~ [EX [EG [1<=p20]]]]]]]

abstracting: (1<=p20)
states: 1,722 (3)
.
EG iterations: 1
.abstracting: (1<=p11)
states: 774
abstracting: (1<=p0)
states: 864
abstracting: (1<=p11)
states: 774
abstracting: (1<=p0)
states: 864
abstracting: (1<=p11)
states: 774
abstracting: (1<=p0)
states: 864

EG iterations: 0
-> the formula is FALSE

FORMULA FMS-PT-00002-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EX [[AG [[1<=p16 | 1<=p0]] & 1<=p3]]
normalized: EX [[~ [E [true U ~ [[1<=p16 | 1<=p0]]]] & 1<=p3]]

abstracting: (1<=p3)
states: 240
abstracting: (1<=p0)
states: 864
abstracting: (1<=p16)
states: 1,722 (3)
.-> the formula is FALSE

FORMULA FMS-PT-00002-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AX [E [EX [EF [[1<=p12 | 1<=p19]]] U 1<=p6]]
normalized: ~ [EX [~ [E [EX [E [true U [1<=p12 | 1<=p19]]] U 1<=p6]]]]

abstracting: (1<=p6)
states: 864
abstracting: (1<=p19)
states: 900
abstracting: (1<=p12)
states: 240
..-> the formula is TRUE

FORMULA FMS-PT-00002-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[AF [1<=p12] & [AG [1<=p6] & [1<=p0 | 1<=p1]]]]
normalized: E [true U [[[1<=p0 | 1<=p1] & ~ [E [true U ~ [1<=p6]]]] & ~ [EG [~ [1<=p12]]]]]

abstracting: (1<=p12)
states: 240
.
EG iterations: 1
abstracting: (1<=p6)
states: 864
abstracting: (1<=p1)
states: 864
abstracting: (1<=p0)
states: 864
-> the formula is FALSE

FORMULA FMS-PT-00002-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AX [[~ [E [EX [EX [1<=p20]] U 1<=p9]] | ~ [A [~ [[p6<=0 | 1<=p0]] U p14<=0]]]]
normalized: ~ [EX [~ [[~ [[~ [EG [~ [p14<=0]]] & ~ [E [~ [p14<=0] U [[p6<=0 | 1<=p0] & ~ [p14<=0]]]]]] | ~ [E [EX [EX [1<=p20]] U 1<=p9]]]]]]

abstracting: (1<=p9)
states: 900
abstracting: (1<=p20)
states: 1,722 (3)
..abstracting: (p14<=0)
states: 3,204 (3)
abstracting: (1<=p0)
states: 864
abstracting: (p6<=0)
states: 2,580 (3)
abstracting: (p14<=0)
states: 3,204 (3)
abstracting: (p14<=0)
states: 3,204 (3)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA FMS-PT-00002-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [[EX [AF [[[1<=p2 & 1<=p18] | 1<=p19]]] & [1<=p4 & p0<=0]]]
normalized: E [true U [[1<=p4 & p0<=0] & EX [~ [EG [~ [[[1<=p2 & 1<=p18] | 1<=p19]]]]]]]

abstracting: (1<=p19)
states: 900
abstracting: (1<=p18)
states: 900
abstracting: (1<=p2)
states: 864
........
EG iterations: 8
.abstracting: (p0<=0)
states: 2,580 (3)
abstracting: (1<=p4)
states: 864
-> the formula is TRUE

FORMULA FMS-PT-00002-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EG [EX [[[p21<=0 & A [1<=p14 U 1<=p19]] & [[EG [[p5<=0 | p7<=0]] | ~ [A [1<=p6 U 1<=p19]]] & [1<=p0 | 1<=p20]]]]]
normalized: EG [EX [[[[1<=p0 | 1<=p20] & [~ [[~ [EG [~ [1<=p19]]] & ~ [E [~ [1<=p19] U [~ [1<=p6] & ~ [1<=p19]]]]]] | EG [[p5<=0 | p7<=0]]]] & [[~ [EG [~ [1<=p19]]] & ~ [E [~ [1<=p19] U [~ [1<=p14] & ~ [1<=p19]]]]] & p21<=0]]]]

abstracting: (p21<=0)
states: 2,544 (3)
abstracting: (1<=p19)
states: 900
abstracting: (1<=p14)
states: 240
abstracting: (1<=p19)
states: 900
abstracting: (1<=p19)
states: 900
........
EG iterations: 8
abstracting: (p7<=0)
states: 0
abstracting: (p5<=0)
states: 2,580 (3)
.
EG iterations: 1
abstracting: (1<=p19)
states: 900
abstracting: (1<=p6)
states: 864
abstracting: (1<=p19)
states: 900
abstracting: (1<=p19)
states: 900
........
EG iterations: 8
abstracting: (1<=p20)
states: 1,722 (3)
abstracting: (1<=p0)
states: 864
..
EG iterations: 1
-> the formula is FALSE

FORMULA FMS-PT-00002-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: E [p14<=0 U A [[1<=p5 & 1<=p7] U A [~ [[AG [1<=p19] | [[1<=p10 & 1<=p17] & [1<=p5 & 1<=p7]]]] U EF [AG [[1<=p2 & 1<=p18]]]]]]
normalized: E [p14<=0 U [~ [EG [~ [[~ [EG [~ [E [true U ~ [E [true U ~ [[1<=p2 & 1<=p18]]]]]]]] & ~ [E [~ [E [true U ~ [E [true U ~ [[1<=p2 & 1<=p18]]]]]] U [[[[1<=p5 & 1<=p7] & [1<=p10 & 1<=p17]] | ~ [E [true U ~ [1<=p19]]]] & ~ [E [true U ~ [E [true U ~ [[1<=p2 & 1<=p18]]]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [E [true U ~ [E [true U ~ [[1<=p2 & 1<=p18]]]]]]]] & ~ [E [~ [E [true U ~ [E [true U ~ [[1<=p2 & 1<=p18]]]]]] U [[[[1<=p5 & 1<=p7] & [1<=p10 & 1<=p17]] | ~ [E [true U ~ [1<=p19]]]] & ~ [E [true U ~ [E [true U ~ [[1<=p2 & 1<=p18]]]]]]]]]]] U [~ [[1<=p5 & 1<=p7]] & ~ [[~ [EG [~ [E [true U ~ [E [true U ~ [[1<=p2 & 1<=p18]]]]]]]] & ~ [E [~ [E [true U ~ [E [true U ~ [[1<=p2 & 1<=p18]]]]]] U [[[[1<=p5 & 1<=p7] & [1<=p10 & 1<=p17]] | ~ [E [true U ~ [1<=p19]]]] & ~ [E [true U ~ [E [true U ~ [[1<=p2 & 1<=p18]]]]]]]]]]]]]]]]

abstracting: (1<=p18)
states: 900
abstracting: (1<=p2)
states: 864
abstracting: (1<=p19)
states: 900
abstracting: (1<=p17)
states: 1,722 (3)
abstracting: (1<=p10)
states: 2,670 (3)
abstracting: (1<=p7)
states: 3,444 (3)
abstracting: (1<=p5)
states: 864
abstracting: (1<=p18)
states: 900
abstracting: (1<=p2)
states: 864
abstracting: (1<=p18)
states: 900
abstracting: (1<=p2)
states: 864

EG iterations: 0
abstracting: (1<=p7)
states: 3,444 (3)
abstracting: (1<=p5)
states: 864
abstracting: (1<=p18)
states: 900
abstracting: (1<=p2)
states: 864
abstracting: (1<=p19)
states: 900
abstracting: (1<=p17)
states: 1,722 (3)
abstracting: (1<=p10)
states: 2,670 (3)
abstracting: (1<=p7)
states: 3,444 (3)
abstracting: (1<=p5)
states: 864
abstracting: (1<=p18)
states: 900
abstracting: (1<=p2)
states: 864
abstracting: (1<=p18)
states: 900
abstracting: (1<=p2)
states: 864

EG iterations: 0
abstracting: (1<=p18)
states: 900
abstracting: (1<=p2)
states: 864
abstracting: (1<=p19)
states: 900
abstracting: (1<=p17)
states: 1,722 (3)
abstracting: (1<=p10)
states: 2,670 (3)
abstracting: (1<=p7)
states: 3,444 (3)
abstracting: (1<=p5)
states: 864
abstracting: (1<=p18)
states: 900
abstracting: (1<=p2)
states: 864
abstracting: (1<=p18)
states: 900
abstracting: (1<=p2)
states: 864

EG iterations: 0

EG iterations: 0
abstracting: (p14<=0)
states: 3,204 (3)
-> the formula is FALSE

FORMULA FMS-PT-00002-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[EF [EX [p19<=0]] & [A [~ [[E [1<=p1 U 1<=p0] & [[1<=p8 & 1<=p10] | 1<=p0]]] U [AF [1<=p0] | ~ [[1<=p14 & [1<=p8 & 1<=p10]]]]] | [1<=p2 & 1<=p18]]]]
normalized: ~ [E [true U ~ [[[[1<=p2 & 1<=p18] | [~ [EG [~ [[~ [[1<=p14 & [1<=p8 & 1<=p10]]] | ~ [EG [~ [1<=p0]]]]]]] & ~ [E [~ [[~ [[1<=p14 & [1<=p8 & 1<=p10]]] | ~ [EG [~ [1<=p0]]]]] U [[[1<=p0 | [1<=p8 & 1<=p10]] & E [1<=p1 U 1<=p0]] & ~ [[~ [[1<=p14 & [1<=p8 & 1<=p10]]] | ~ [EG [~ [1<=p0]]]]]]]]]] & E [true U EX [p19<=0]]]]]]

abstracting: (p19<=0)
states: 2,544 (3)
.abstracting: (1<=p0)
states: 864
.
EG iterations: 1
abstracting: (1<=p10)
states: 2,670 (3)
abstracting: (1<=p8)
states: 900
abstracting: (1<=p14)
states: 240
abstracting: (1<=p0)
states: 864
abstracting: (1<=p1)
states: 864
abstracting: (1<=p10)
states: 2,670 (3)
abstracting: (1<=p8)
states: 900
abstracting: (1<=p0)
states: 864
abstracting: (1<=p0)
states: 864
.
EG iterations: 1
abstracting: (1<=p10)
states: 2,670 (3)
abstracting: (1<=p8)
states: 900
abstracting: (1<=p14)
states: 240
abstracting: (1<=p0)
states: 864
.
EG iterations: 1
abstracting: (1<=p10)
states: 2,670 (3)
abstracting: (1<=p8)
states: 900
abstracting: (1<=p14)
states: 240
.
EG iterations: 1
abstracting: (1<=p18)
states: 900
abstracting: (1<=p2)
states: 864
-> the formula is FALSE

FORMULA FMS-PT-00002-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: [[AG [[p17<=0 | p10<=0]] | AX [AF [[1<=p13 & 1<=p15]]]] | [AG [~ [A [AG [1<=p1] U AG [1<=p0]]]] | [AX [~ [A [EG [[1<=p2 & 1<=p18]] U [[1<=p8 & 1<=p10] | 1<=p11]]]] & [AX [EF [[1<=p2 & 1<=p18]]] | EF [[1<=p2 & 1<=p18]]]]]]
normalized: [[[[E [true U [1<=p2 & 1<=p18]] | ~ [EX [~ [E [true U [1<=p2 & 1<=p18]]]]]] & ~ [EX [[~ [EG [~ [[1<=p11 | [1<=p8 & 1<=p10]]]]] & ~ [E [~ [[1<=p11 | [1<=p8 & 1<=p10]]] U [~ [EG [[1<=p2 & 1<=p18]]] & ~ [[1<=p11 | [1<=p8 & 1<=p10]]]]]]]]]] | ~ [E [true U [~ [EG [E [true U ~ [1<=p0]]]] & ~ [E [E [true U ~ [1<=p0]] U [E [true U ~ [1<=p1]] & E [true U ~ [1<=p0]]]]]]]]] | [~ [EX [EG [~ [[1<=p13 & 1<=p15]]]]] | ~ [E [true U ~ [[p17<=0 | p10<=0]]]]]]

abstracting: (p10<=0)
states: 774
abstracting: (p17<=0)
states: 1,722 (3)
abstracting: (1<=p15)
states: 3,438 (3)
abstracting: (1<=p13)
states: 240
.
EG iterations: 1
.abstracting: (1<=p0)
states: 864
abstracting: (1<=p1)
states: 864
abstracting: (1<=p0)
states: 864
abstracting: (1<=p0)
states: 864

EG iterations: 0
abstracting: (1<=p10)
states: 2,670 (3)
abstracting: (1<=p8)
states: 900
abstracting: (1<=p11)
states: 774
abstracting: (1<=p18)
states: 900
abstracting: (1<=p2)
states: 864
.
EG iterations: 1
abstracting: (1<=p10)
states: 2,670 (3)
abstracting: (1<=p8)
states: 900
abstracting: (1<=p11)
states: 774
abstracting: (1<=p10)
states: 2,670 (3)
abstracting: (1<=p8)
states: 900
abstracting: (1<=p11)
states: 774
.
EG iterations: 1
.abstracting: (1<=p18)
states: 900
abstracting: (1<=p2)
states: 864
.abstracting: (1<=p18)
states: 900
abstracting: (1<=p2)
states: 864
-> the formula is TRUE

FORMULA FMS-PT-00002-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

totally nodes used: 17978 (1.8e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 35778 61987 97765
used/not used/entry size/cache size: 77409 67031455 16 1024MB
basic ops cache: hits/miss/sum: 10813 18205 29018
used/not used/entry size/cache size: 33721 16743495 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: 1530 2317 3847
used/not used/entry size/cache size: 2317 8386291 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 67091572
1 16992
2 204
3 28
4 11
5 17
6 10
7 10
8 11
9 1
>= 10 8

Total processing time: 0m 4.374sec


BK_STOP 1678493826022

--------------------
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:174 (8), effective:34 (1)

initing FirstDep: 0m 0.000sec


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

iterations count:42 (2), effective:7 (0)

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

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

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

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

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

iterations count:72 (3), effective:13 (0)

iterations count:75 (3), effective:14 (0)

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

iterations count:83 (4), effective:15 (0)

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

iterations count:116 (5), effective:24 (1)

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

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

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

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

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

iterations count:83 (4), effective:17 (0)

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

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

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

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

iterations count:83 (4), effective:17 (0)

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

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

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

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

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

iterations count:83 (4), effective:17 (0)

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

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

iterations count:76 (3), effective:14 (0)

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

iterations count:153 (7), effective:29 (1)

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

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

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

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

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

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

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

iterations count:90 (4), effective:14 (0)

iterations count:90 (4), effective:14 (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="FMS-PT-00002"
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 FMS-PT-00002, 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-167838856900186"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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