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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.5K Feb 25 15:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 15:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 15:25 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 4.1K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 9.5K Feb 25 15:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 15:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 25 15:25 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 22K 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-R005C002-CTLFireability-00
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-01
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-02
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-03
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-04
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-05
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-06
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-07
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-08
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-09
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-10
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-11
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-12
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-13
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-14
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679181517985

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=ResAllocation-PT-R005C002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:18:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 23:18:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:18:39] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-03-18 23:18:39] [INFO ] Transformed 20 places.
[2023-03-18 23:18:39] [INFO ] Transformed 12 transitions.
[2023-03-18 23:18:39] [INFO ] Parsed PT model containing 20 places and 12 transitions and 50 arcs in 87 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ResAllocation-PT-R005C002-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 12/12 transitions.
Applied a total of 0 rules in 8 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 20 cols
[2023-03-18 23:18:39] [INFO ] Computed 10 place invariants in 7 ms
[2023-03-18 23:18:39] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-18 23:18:39] [INFO ] Invariant cache hit.
[2023-03-18 23:18:39] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-18 23:18:39] [INFO ] Invariant cache hit.
[2023-03-18 23:18:39] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 236 ms. Remains : 20/20 places, 12/12 transitions.
Support contains 20 out of 20 places after structural reductions.
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 15 ms
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:18:40] [INFO ] Input system was already deterministic with 12 transitions.
Incomplete random walk after 10000 steps, including 906 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 28) seen :26
Incomplete Best-First random walk after 10001 steps, including 312 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 398 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 23:18:40] [INFO ] Invariant cache hit.
[2023-03-18 23:18:40] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-18 23:18:40] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:18:40] [INFO ] Input system was already deterministic with 12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 20/20 places, 12/12 transitions.
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:18:40] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 20/20 places, 12/12 transitions.
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:18:40] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 20/20 places, 12/12 transitions.
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:18:40] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 20/20 places, 12/12 transitions.
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:18:40] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 20/20 places, 12/12 transitions.
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:18:40] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 20/20 places, 12/12 transitions.
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:18:40] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 20/20 places, 12/12 transitions.
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:18:40] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 20/20 places, 12/12 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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 19 transition count 11
Applied a total of 2 rules in 6 ms. Remains 19 /20 variables (removed 1) and now considering 11/12 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 19/20 places, 11/12 transitions.
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:18:40] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 20/20 places, 12/12 transitions.
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:18:40] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 20/20 places, 12/12 transitions.
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:18:40] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 20/20 places, 12/12 transitions.
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:18:40] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 20/20 places, 12/12 transitions.
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:18:40] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 20/20 places, 12/12 transitions.
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:18:40] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 20/20 places, 12/12 transitions.
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:18:40] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 20/20 places, 12/12 transitions.
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:18:40] [INFO ] Input system was already deterministic with 12 transitions.
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:18:40] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:18:40] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-18 23:18:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 20 places, 12 transitions and 50 arcs took 1 ms.
Total runtime 1356 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: 20 NrTr: 12 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.737sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 61 (6.1e+01) #states 112



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

checking: EG [1<=p1]
normalized: EG [1<=p1]

abstracting: (1<=p1)
states: 48
......................
EG iterations: 22
-> the formula is FALSE

FORMULA ResAllocation-PT-R005C002-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EX [[1<=p6 & 1<=p9]]
normalized: EX [[1<=p6 & 1<=p9]]

abstracting: (1<=p9)
states: 48
abstracting: (1<=p6)
states: 24
.-> the formula is FALSE

FORMULA ResAllocation-PT-R005C002-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [EX [EX [EF [p8<=0]]] | EX [1<=p10]]
normalized: [EX [EX [E [true U p8<=0]]] | EX [1<=p10]]

abstracting: (1<=p10)
states: 16
.abstracting: (p8<=0)
states: 96
..-> the formula is TRUE

FORMULA ResAllocation-PT-R005C002-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=p1)
states: 48
abstracting: (1<=p3)
states: 48
abstracting: (1<=p0)
states: 48
....
EG iterations: 4
.-> the formula is TRUE

FORMULA ResAllocation-PT-R005C002-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [[AX [[1<=p0 & 1<=p3]] & [AX [p1<=0] & 1<=p1]]]
normalized: EX [[[~ [EX [~ [p1<=0]]] & 1<=p1] & ~ [EX [~ [[1<=p0 & 1<=p3]]]]]]

abstracting: (1<=p3)
states: 48
abstracting: (1<=p0)
states: 48
.abstracting: (1<=p1)
states: 48
abstracting: (p1<=0)
states: 64
..-> the formula is FALSE

FORMULA ResAllocation-PT-R005C002-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AX [AG [AX [[[1<=p5 & 1<=p15] & [1<=p16 & 1<=p2]]]]]
normalized: ~ [EX [E [true U EX [~ [[[1<=p16 & 1<=p2] & [1<=p5 & 1<=p15]]]]]]]

abstracting: (1<=p15)
states: 80
abstracting: (1<=p5)
states: 48
abstracting: (1<=p2)
states: 40
abstracting: (1<=p16)
states: 40
..-> the formula is FALSE

FORMULA ResAllocation-PT-R005C002-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [[1<=p10 & EF [[p1<=0 & [1<=p2 & 1<=p5]]]]]
normalized: EX [[E [true U [[1<=p2 & 1<=p5] & p1<=0]] & 1<=p10]]

abstracting: (1<=p10)
states: 16
abstracting: (p1<=0)
states: 64
abstracting: (1<=p5)
states: 48
abstracting: (1<=p2)
states: 40
.-> the formula is FALSE

FORMULA ResAllocation-PT-R005C002-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [AX [EX [EX [AX [[p1<=0 | [p11<=0 | p12<=0]]]]]] | AG [[1<=p7 & [1<=p17 & 1<=p18]]]]
normalized: [~ [EX [~ [EX [EX [~ [EX [~ [[[p11<=0 | p12<=0] | p1<=0]]]]]]]]] | ~ [E [true U ~ [[[1<=p17 & 1<=p18] & 1<=p7]]]]]

abstracting: (1<=p7)
states: 48
abstracting: (1<=p18)
states: 48
abstracting: (1<=p17)
states: 72
abstracting: (p1<=0)
states: 64
abstracting: (p12<=0)
states: 88
abstracting: (p11<=0)
states: 16
....-> the formula is TRUE

FORMULA ResAllocation-PT-R005C002-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [A [EF [p10<=0] U AX [[~ [AG [1<=p10]] & ~ [[A [[1<=p3 & [1<=p13 & 1<=p14]] U [1<=p6 & 1<=p9]] | AF [1<=p8]]]]]]]
normalized: ~ [[~ [EG [EX [~ [[~ [[[~ [EG [~ [[1<=p6 & 1<=p9]]]] & ~ [E [~ [[1<=p6 & 1<=p9]] U [~ [[1<=p6 & 1<=p9]] & ~ [[1<=p3 & [1<=p13 & 1<=p14]]]]]]] | ~ [EG [~ [1<=p8]]]]] & E [true U ~ [1<=p10]]]]]]] & ~ [E [EX [~ [[~ [[[~ [EG [~ [[1<=p6 & 1<=p9]]]] & ~ [E [~ [[1<=p6 & 1<=p9]] U [~ [[1<=p6 & 1<=p9]] & ~ [[1<=p3 & [1<=p13 & 1<=p14]]]]]]] | ~ [EG [~ [1<=p8]]]]] & E [true U ~ [1<=p10]]]]] U [~ [E [true U p10<=0]] & EX [~ [[~ [[[~ [EG [~ [[1<=p6 & 1<=p9]]]] & ~ [E [~ [[1<=p6 & 1<=p9]] U [~ [[1<=p6 & 1<=p9]] & ~ [[1<=p3 & [1<=p13 & 1<=p14]]]]]]] | ~ [EG [~ [1<=p8]]]]] & E [true U ~ [1<=p10]]]]]]]]]]

abstracting: (1<=p10)
states: 16
abstracting: (1<=p8)
states: 16
.
EG iterations: 1
abstracting: (1<=p14)
states: 32
abstracting: (1<=p13)
states: 88
abstracting: (1<=p3)
states: 48
abstracting: (1<=p9)
states: 48
abstracting: (1<=p6)
states: 24
abstracting: (1<=p9)
states: 48
abstracting: (1<=p6)
states: 24
abstracting: (1<=p9)
states: 48
abstracting: (1<=p6)
states: 24
........
EG iterations: 8
.abstracting: (p10<=0)
states: 96
abstracting: (1<=p10)
states: 16
abstracting: (1<=p8)
states: 16
.
EG iterations: 1
abstracting: (1<=p14)
states: 32
abstracting: (1<=p13)
states: 88
abstracting: (1<=p3)
states: 48
abstracting: (1<=p9)
states: 48
abstracting: (1<=p6)
states: 24
abstracting: (1<=p9)
states: 48
abstracting: (1<=p6)
states: 24
abstracting: (1<=p9)
states: 48
abstracting: (1<=p6)
states: 24
........
EG iterations: 8
.abstracting: (1<=p10)
states: 16
abstracting: (1<=p8)
states: 16
.
EG iterations: 1
abstracting: (1<=p14)
states: 32
abstracting: (1<=p13)
states: 88
abstracting: (1<=p3)
states: 48
abstracting: (1<=p9)
states: 48
abstracting: (1<=p6)
states: 24
abstracting: (1<=p9)
states: 48
abstracting: (1<=p6)
states: 24
abstracting: (1<=p9)
states: 48
abstracting: (1<=p6)
states: 24
........
EG iterations: 8
..
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R005C002-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EX [E [[AF [[1<=p5 & [1<=p15 & 1<=p16]]] & [EX [1<=p10] | [1<=p9 & 1<=p19]]] U EG [[1<=p6 & 1<=p9]]]]
normalized: EX [E [[~ [EG [~ [[[1<=p15 & 1<=p16] & 1<=p5]]]] & [[1<=p9 & 1<=p19] | EX [1<=p10]]] U EG [[1<=p6 & 1<=p9]]]]

abstracting: (1<=p9)
states: 48
abstracting: (1<=p6)
states: 24
........
EG iterations: 8
abstracting: (1<=p10)
states: 16
.abstracting: (1<=p19)
states: 64
abstracting: (1<=p9)
states: 48
abstracting: (1<=p5)
states: 48
abstracting: (1<=p16)
states: 40
abstracting: (1<=p15)
states: 80
...
EG iterations: 3
.-> the formula is FALSE

FORMULA ResAllocation-PT-R005C002-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EG [EX [[A [1<=p8 U [EX [[1<=p0 & 1<=p3]] & [[1<=p1 & [1<=p11 & 1<=p12]] | [1<=p2 & 1<=p5]]]] | [1<=p4 & 1<=p7]]]]
normalized: EG [EX [[[1<=p4 & 1<=p7] | [~ [EG [~ [[[[1<=p2 & 1<=p5] | [[1<=p11 & 1<=p12] & 1<=p1]] & EX [[1<=p0 & 1<=p3]]]]]] & ~ [E [~ [[[[1<=p2 & 1<=p5] | [[1<=p11 & 1<=p12] & 1<=p1]] & EX [[1<=p0 & 1<=p3]]]] U [~ [1<=p8] & ~ [[[[1<=p2 & 1<=p5] | [[1<=p11 & 1<=p12] & 1<=p1]] & EX [[1<=p0 & 1<=p3]]]]]]]]]]]

abstracting: (1<=p3)
states: 48
abstracting: (1<=p0)
states: 48
.abstracting: (1<=p1)
states: 48
abstracting: (1<=p12)
states: 24
abstracting: (1<=p11)
states: 96
abstracting: (1<=p5)
states: 48
abstracting: (1<=p2)
states: 40
abstracting: (1<=p8)
states: 16
abstracting: (1<=p3)
states: 48
abstracting: (1<=p0)
states: 48
.abstracting: (1<=p1)
states: 48
abstracting: (1<=p12)
states: 24
abstracting: (1<=p11)
states: 96
abstracting: (1<=p5)
states: 48
abstracting: (1<=p2)
states: 40
abstracting: (1<=p3)
states: 48
abstracting: (1<=p0)
states: 48
.abstracting: (1<=p1)
states: 48
abstracting: (1<=p12)
states: 24
abstracting: (1<=p11)
states: 96
abstracting: (1<=p5)
states: 48
abstracting: (1<=p2)
states: 40
.
EG iterations: 1
abstracting: (1<=p7)
states: 48
abstracting: (1<=p4)
states: 32
.......
EG iterations: 6
-> the formula is FALSE

FORMULA ResAllocation-PT-R005C002-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [~ [A [EF [[AX [[1<=p5 & [1<=p15 & 1<=p16]]] & AF [[1<=p3 & [1<=p13 & 1<=p14]]]]] U EX [E [[1<=p7 & [1<=p17 & 1<=p18]] U 1<=p8]]]]]
normalized: EG [~ [[~ [EG [~ [EX [E [[[1<=p17 & 1<=p18] & 1<=p7] U 1<=p8]]]]] & ~ [E [~ [EX [E [[[1<=p17 & 1<=p18] & 1<=p7] U 1<=p8]]] U [~ [E [true U [~ [EG [~ [[[1<=p13 & 1<=p14] & 1<=p3]]]] & ~ [EX [~ [[[1<=p15 & 1<=p16] & 1<=p5]]]]]]] & ~ [EX [E [[[1<=p17 & 1<=p18] & 1<=p7] U 1<=p8]]]]]]]]]

abstracting: (1<=p8)
states: 16
abstracting: (1<=p7)
states: 48
abstracting: (1<=p18)
states: 48
abstracting: (1<=p17)
states: 72
.abstracting: (1<=p5)
states: 48
abstracting: (1<=p16)
states: 40
abstracting: (1<=p15)
states: 80
.abstracting: (1<=p3)
states: 48
abstracting: (1<=p14)
states: 32
abstracting: (1<=p13)
states: 88
.
EG iterations: 1
abstracting: (1<=p8)
states: 16
abstracting: (1<=p7)
states: 48
abstracting: (1<=p18)
states: 48
abstracting: (1<=p17)
states: 72
.abstracting: (1<=p8)
states: 16
abstracting: (1<=p7)
states: 48
abstracting: (1<=p18)
states: 48
abstracting: (1<=p17)
states: 72
...
EG iterations: 2
..
EG iterations: 2
-> the formula is TRUE

FORMULA ResAllocation-PT-R005C002-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [AX [[p1<=0 | [~ [A [1<=p10 U ~ [[p1<=0 | [p11<=0 | p12<=0]]]]] & [[p2<=0 | p5<=0] & [p3<=0 | [p13<=0 | p14<=0]]]]]]]
normalized: EX [~ [EX [~ [[[[[p2<=0 | p5<=0] & [[p13<=0 | p14<=0] | p3<=0]] & ~ [[~ [EG [[[p11<=0 | p12<=0] | p1<=0]]] & ~ [E [[[p11<=0 | p12<=0] | p1<=0] U [~ [1<=p10] & [[p11<=0 | p12<=0] | p1<=0]]]]]]] | p1<=0]]]]]

abstracting: (p1<=0)
states: 64
abstracting: (p1<=0)
states: 64
abstracting: (p12<=0)
states: 88
abstracting: (p11<=0)
states: 16
abstracting: (1<=p10)
states: 16
abstracting: (p1<=0)
states: 64
abstracting: (p12<=0)
states: 88
abstracting: (p11<=0)
states: 16
abstracting: (p1<=0)
states: 64
abstracting: (p12<=0)
states: 88
abstracting: (p11<=0)
states: 16
........
EG iterations: 8
abstracting: (p3<=0)
states: 64
abstracting: (p14<=0)
states: 80
abstracting: (p13<=0)
states: 24
abstracting: (p5<=0)
states: 64
abstracting: (p2<=0)
states: 72
..-> the formula is TRUE

FORMULA ResAllocation-PT-R005C002-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [~ [E [AX [[[[1<=p2 & 1<=p5] | [1<=p6 & 1<=p9]] & [1<=p8 | [1<=p6 & 1<=p9]]]] U [~ [[1<=p4 & 1<=p7]] & [AG [[1<=p9 & 1<=p19]] | EX [1<=p1]]]]] | [EX [A [EX [1<=p8] U [1<=p0 & [1<=p3 & 1<=p8]]]] | EF [[[[AX [[1<=p5 & [1<=p15 & 1<=p16]]] | [p8<=0 | p1<=0]] & 1<=p7] & [1<=p17 & 1<=p18]]]]]
normalized: [~ [E [~ [EX [~ [[[[1<=p6 & 1<=p9] | 1<=p8] & [[1<=p6 & 1<=p9] | [1<=p2 & 1<=p5]]]]]] U [[EX [1<=p1] | ~ [E [true U ~ [[1<=p9 & 1<=p19]]]]] & ~ [[1<=p4 & 1<=p7]]]]] | [E [true U [[1<=p17 & 1<=p18] & [[[p8<=0 | p1<=0] | ~ [EX [~ [[[1<=p15 & 1<=p16] & 1<=p5]]]]] & 1<=p7]]] | EX [[~ [EG [~ [[[1<=p3 & 1<=p8] & 1<=p0]]]] & ~ [E [~ [[[1<=p3 & 1<=p8] & 1<=p0]] U [~ [EX [1<=p8]] & ~ [[[1<=p3 & 1<=p8] & 1<=p0]]]]]]]]]

abstracting: (1<=p0)
states: 48
abstracting: (1<=p8)
states: 16
abstracting: (1<=p3)
states: 48
abstracting: (1<=p8)
states: 16
.abstracting: (1<=p0)
states: 48
abstracting: (1<=p8)
states: 16
abstracting: (1<=p3)
states: 48
abstracting: (1<=p0)
states: 48
abstracting: (1<=p8)
states: 16
abstracting: (1<=p3)
states: 48
.
EG iterations: 1
.abstracting: (1<=p7)
states: 48
abstracting: (1<=p5)
states: 48
abstracting: (1<=p16)
states: 40
abstracting: (1<=p15)
states: 80
.abstracting: (p1<=0)
states: 64
abstracting: (p8<=0)
states: 96
abstracting: (1<=p18)
states: 48
abstracting: (1<=p17)
states: 72
abstracting: (1<=p7)
states: 48
abstracting: (1<=p4)
states: 32
abstracting: (1<=p19)
states: 64
abstracting: (1<=p9)
states: 48
abstracting: (1<=p1)
states: 48
.abstracting: (1<=p5)
states: 48
abstracting: (1<=p2)
states: 40
abstracting: (1<=p9)
states: 48
abstracting: (1<=p6)
states: 24
abstracting: (1<=p8)
states: 16
abstracting: (1<=p9)
states: 48
abstracting: (1<=p6)
states: 24
.-> the formula is TRUE

FORMULA ResAllocation-PT-R005C002-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [AG [[p7<=0 | [p17<=0 | p18<=0]]] & [A [[A [[p1<=0 | [p11<=0 | p12<=0]] U [EG [[1<=p2 & 1<=p5]] | [1<=p8 | [1<=p5 & [1<=p15 & 1<=p16]]]]] | [~ [[EF [1<=p8] | [[1<=p4 & 1<=p7] | 1<=p8]]] | A [E [1<=p10 U [1<=p7 & [1<=p17 & 1<=p18]]] U ~ [[1<=p3 & [1<=p13 & 1<=p14]]]]]] U AX [[[[1<=p1 & [1<=p11 & 1<=p12]] | [[1<=p5 & [1<=p15 & 1<=p16]] | ~ [[1<=p7 & [1<=p17 & 1<=p18]]]]] & [[1<=p4 & 1<=p7] | [[1<=p9 & 1<=p19] | [1<=p8 & 1<=p10]]]]]] | [AF [[[1<=p2 & 1<=p5] & [1<=p8 & [p5<=0 | [p15<=0 | p16<=0]]]]] & AF [[EF [AG [[1<=p0 & 1<=p3]]] & p10<=0]]]]]
normalized: [[[~ [EG [EX [~ [[[[~ [[[1<=p17 & 1<=p18] & 1<=p7]] | [[1<=p15 & 1<=p16] & 1<=p5]] | [[1<=p11 & 1<=p12] & 1<=p1]] & [[[1<=p8 & 1<=p10] | [1<=p9 & 1<=p19]] | [1<=p4 & 1<=p7]]]]]]] & ~ [E [EX [~ [[[[~ [[[1<=p17 & 1<=p18] & 1<=p7]] | [[1<=p15 & 1<=p16] & 1<=p5]] | [[1<=p11 & 1<=p12] & 1<=p1]] & [[[1<=p8 & 1<=p10] | [1<=p9 & 1<=p19]] | [1<=p4 & 1<=p7]]]]] U [EX [~ [[[[~ [[[1<=p17 & 1<=p18] & 1<=p7]] | [[1<=p15 & 1<=p16] & 1<=p5]] | [[1<=p11 & 1<=p12] & 1<=p1]] & [[[1<=p8 & 1<=p10] | [1<=p9 & 1<=p19]] | [1<=p4 & 1<=p7]]]]] & ~ [[[[~ [EG [[[1<=p13 & 1<=p14] & 1<=p3]]] & ~ [E [[[1<=p13 & 1<=p14] & 1<=p3] U [~ [E [1<=p10 U [[1<=p17 & 1<=p18] & 1<=p7]]] & [[1<=p13 & 1<=p14] & 1<=p3]]]]] | ~ [[[[1<=p4 & 1<=p7] | 1<=p8] | E [true U 1<=p8]]]] | [~ [EG [~ [[[[[1<=p15 & 1<=p16] & 1<=p5] | 1<=p8] | EG [[1<=p2 & 1<=p5]]]]]] & ~ [E [~ [[[[[1<=p15 & 1<=p16] & 1<=p5] | 1<=p8] | EG [[1<=p2 & 1<=p5]]]] U [~ [[[p11<=0 | p12<=0] | p1<=0]] & ~ [[[[[1<=p15 & 1<=p16] & 1<=p5] | 1<=p8] | EG [[1<=p2 & 1<=p5]]]]]]]]]]]]]] | [~ [EG [~ [[E [true U ~ [E [true U ~ [[1<=p0 & 1<=p3]]]]] & p10<=0]]]] & ~ [EG [~ [[[[[p15<=0 | p16<=0] | p5<=0] & 1<=p8] & [1<=p2 & 1<=p5]]]]]]] & ~ [E [true U ~ [[[p17<=0 | p18<=0] | p7<=0]]]]]

abstracting: (p7<=0)
states: 64
abstracting: (p18<=0)
states: 64
abstracting: (p17<=0)
states: 40
abstracting: (1<=p5)
states: 48
abstracting: (1<=p2)
states: 40
abstracting: (1<=p8)
states: 16
abstracting: (p5<=0)
states: 64
abstracting: (p16<=0)
states: 72
abstracting: (p15<=0)
states: 32
.
EG iterations: 1
abstracting: (p10<=0)
states: 96
abstracting: (1<=p3)
states: 48
abstracting: (1<=p0)
states: 48

EG iterations: 0
abstracting: (1<=p5)
states: 48
abstracting: (1<=p2)
states: 40
.........
EG iterations: 9
abstracting: (1<=p8)
states: 16
abstracting: (1<=p5)
states: 48
abstracting: (1<=p16)
states: 40
abstracting: (1<=p15)
states: 80
abstracting: (p1<=0)
states: 64
abstracting: (p12<=0)
states: 88
abstracting: (p11<=0)
states: 16
abstracting: (1<=p5)
states: 48
abstracting: (1<=p2)
states: 40
.........
EG iterations: 9
abstracting: (1<=p8)
states: 16
abstracting: (1<=p5)
states: 48
abstracting: (1<=p16)
states: 40
abstracting: (1<=p15)
states: 80
abstracting: (1<=p5)
states: 48
abstracting: (1<=p2)
states: 40
.........
EG iterations: 9
abstracting: (1<=p8)
states: 16
abstracting: (1<=p5)
states: 48
abstracting: (1<=p16)
states: 40
abstracting: (1<=p15)
states: 80
...
EG iterations: 3
abstracting: (1<=p8)
states: 16
abstracting: (1<=p8)
states: 16
abstracting: (1<=p7)
states: 48
abstracting: (1<=p4)
states: 32
abstracting: (1<=p3)
states: 48
abstracting: (1<=p14)
states: 32
abstracting: (1<=p13)
states: 88
abstracting: (1<=p7)
states: 48
abstracting: (1<=p18)
states: 48
abstracting: (1<=p17)
states: 72
abstracting: (1<=p10)
states: 16
abstracting: (1<=p3)
states: 48
abstracting: (1<=p14)
states: 32
abstracting: (1<=p13)
states: 88
abstracting: (1<=p3)
states: 48
abstracting: (1<=p14)
states: 32
abstracting: (1<=p13)
states: 88
.......
EG iterations: 7
abstracting: (1<=p7)
states: 48
abstracting: (1<=p4)
states: 32
abstracting: (1<=p19)
states: 64
abstracting: (1<=p9)
states: 48
abstracting: (1<=p10)
states: 16
abstracting: (1<=p8)
states: 16
abstracting: (1<=p1)
states: 48
abstracting: (1<=p12)
states: 24
abstracting: (1<=p11)
states: 96
abstracting: (1<=p5)
states: 48
abstracting: (1<=p16)
states: 40
abstracting: (1<=p15)
states: 80
abstracting: (1<=p7)
states: 48
abstracting: (1<=p18)
states: 48
abstracting: (1<=p17)
states: 72
.abstracting: (1<=p7)
states: 48
abstracting: (1<=p4)
states: 32
abstracting: (1<=p19)
states: 64
abstracting: (1<=p9)
states: 48
abstracting: (1<=p10)
states: 16
abstracting: (1<=p8)
states: 16
abstracting: (1<=p1)
states: 48
abstracting: (1<=p12)
states: 24
abstracting: (1<=p11)
states: 96
abstracting: (1<=p5)
states: 48
abstracting: (1<=p16)
states: 40
abstracting: (1<=p15)
states: 80
abstracting: (1<=p7)
states: 48
abstracting: (1<=p18)
states: 48
abstracting: (1<=p17)
states: 72
.abstracting: (1<=p7)
states: 48
abstracting: (1<=p4)
states: 32
abstracting: (1<=p19)
states: 64
abstracting: (1<=p9)
states: 48
abstracting: (1<=p10)
states: 16
abstracting: (1<=p8)
states: 16
abstracting: (1<=p1)
states: 48
abstracting: (1<=p12)
states: 24
abstracting: (1<=p11)
states: 96
abstracting: (1<=p5)
states: 48
abstracting: (1<=p16)
states: 40
abstracting: (1<=p15)
states: 80
abstracting: (1<=p7)
states: 48
abstracting: (1<=p18)
states: 48
abstracting: (1<=p17)
states: 72
...........
EG iterations: 10
-> the formula is FALSE

FORMULA ResAllocation-PT-R005C002-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

totally nodes used: 8664 (8.7e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 5887 18374 24261
used/not used/entry size/cache size: 25241 67083623 16 1024MB
basic ops cache: hits/miss/sum: 3472 10110 13582
used/not used/entry size/cache size: 19275 16757941 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: 376 440 816
used/not used/entry size/cache size: 440 8388168 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 67100208
1 8648
2 8
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.341sec


BK_STOP 1679181526048

--------------------
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:129 (10), effective:30 (2)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:43 (3), effective:11 (0)

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

iterations count:74 (6), effective:20 (1)

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

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

iterations count:68 (5), effective:19 (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-R005C002"
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 ResAllocation-PT-R005C002, 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 r330-tall-167889203600730"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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