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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.2K Feb 25 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 21K 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-R003C003-CTLFireability-00
FORMULA_NAME ResAllocation-PT-R003C003-CTLFireability-01
FORMULA_NAME ResAllocation-PT-R003C003-CTLFireability-02
FORMULA_NAME ResAllocation-PT-R003C003-CTLFireability-03
FORMULA_NAME ResAllocation-PT-R003C003-CTLFireability-04
FORMULA_NAME ResAllocation-PT-R003C003-CTLFireability-05
FORMULA_NAME ResAllocation-PT-R003C003-CTLFireability-06
FORMULA_NAME ResAllocation-PT-R003C003-CTLFireability-07
FORMULA_NAME ResAllocation-PT-R003C003-CTLFireability-08
FORMULA_NAME ResAllocation-PT-R003C003-CTLFireability-09
FORMULA_NAME ResAllocation-PT-R003C003-CTLFireability-10
FORMULA_NAME ResAllocation-PT-R003C003-CTLFireability-11
FORMULA_NAME ResAllocation-PT-R003C003-CTLFireability-12
FORMULA_NAME ResAllocation-PT-R003C003-CTLFireability-13
FORMULA_NAME ResAllocation-PT-R003C003-CTLFireability-14
FORMULA_NAME ResAllocation-PT-R003C003-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679180667078

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-R003C003
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:04:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 23:04:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:04:28] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-03-18 23:04:28] [INFO ] Transformed 18 places.
[2023-03-18 23:04:28] [INFO ] Transformed 12 transitions.
[2023-03-18 23:04:28] [INFO ] Found NUPN structural information;
[2023-03-18 23:04:28] [INFO ] Parsed PT model containing 18 places and 12 transitions and 48 arcs in 83 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Initial state reduction rules removed 3 formulas.
FORMULA ResAllocation-PT-R003C003-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C003-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C003-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 7 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 18 cols
[2023-03-18 23:04:28] [INFO ] Computed 9 place invariants in 6 ms
[2023-03-18 23:04:28] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-18 23:04:28] [INFO ] Invariant cache hit.
[2023-03-18 23:04:28] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-18 23:04:28] [INFO ] Invariant cache hit.
[2023-03-18 23:04:28] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 18/18 places, 12/12 transitions.
Support contains 18 out of 18 places after structural reductions.
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 15 ms
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:04:29] [INFO ] Input system was already deterministic with 12 transitions.
Incomplete random walk after 10000 steps, including 1016 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 28) seen :27
Incomplete Best-First random walk after 10001 steps, including 575 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 23:04:29] [INFO ] Invariant cache hit.
[2023-03-18 23:04:29] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-18 23:04:29] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:04:29] [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 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 18/18 places, 12/12 transitions.
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:04:29] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 18/18 places, 12/12 transitions.
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:04:29] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 18/18 places, 12/12 transitions.
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:04:29] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 18/18 places, 12/12 transitions.
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:04:29] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 18/18 places, 12/12 transitions.
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:04:29] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 18/18 places, 12/12 transitions.
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:04:29] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 18/18 places, 12/12 transitions.
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:04:29] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 18/18 places, 12/12 transitions.
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:04:29] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 18/18 places, 12/12 transitions.
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:04:29] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 18/18 places, 12/12 transitions.
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:04:29] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 18/18 places, 12/12 transitions.
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:04:29] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 15 transition count 10
Applied a total of 5 rules in 6 ms. Remains 15 /18 variables (removed 3) and now considering 10/12 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 15/18 places, 10/12 transitions.
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:04:29] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 18/18 places, 12/12 transitions.
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:04:29] [INFO ] Input system was already deterministic with 12 transitions.
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:04:29] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:04:29] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-18 23:04:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 12 transitions and 48 arcs took 1 ms.
Total runtime 1109 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: 18 NrTr: 12 NrArc: 48)

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

net check time: 0m 0.000sec

init dd package: 0m 2.749sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 62 (6.2e+01) #states 92



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

checking: AX [AF [[p6<=1 & 1<=p6]]]
normalized: ~ [EX [EG [~ [[p6<=1 & 1<=p6]]]]]

abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 92
.
EG iterations: 1
.-> the formula is FALSE

FORMULA ResAllocation-PT-R003C003-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EG [AF [EX [AG [[[p5<=0 & 0<=p5] | [p11<=0 & 0<=p11]]]]]]
normalized: EG [~ [EG [~ [EX [~ [E [true U ~ [[[p11<=0 & 0<=p11] | [p5<=0 & 0<=p5]]]]]]]]]]

abstracting: (0<=p5)
states: 92
abstracting: (p5<=0)
states: 54
abstracting: (0<=p11)
states: 92
abstracting: (p11<=0)
states: 54
....
EG iterations: 3
.......
EG iterations: 7
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: [EF [[[p2<=1 & 1<=p2] & [p5<=1 & 1<=p5]]] & EF [AG [[[p3<=1 & 1<=p3] & [[p9<=1 & 1<=p9] & [p10<=1 & 1<=p10]]]]]]
normalized: [E [true U ~ [E [true U ~ [[[[p10<=1 & 1<=p10] & [p9<=1 & 1<=p9]] & [p3<=1 & 1<=p3]]]]]] & E [true U [[p5<=1 & 1<=p5] & [p2<=1 & 1<=p2]]]]

abstracting: (1<=p2)
states: 40
abstracting: (p2<=1)
states: 92
abstracting: (1<=p5)
states: 38
abstracting: (p5<=1)
states: 92
abstracting: (1<=p3)
states: 42
abstracting: (p3<=1)
states: 92
abstracting: (1<=p9)
states: 42
abstracting: (p9<=1)
states: 92
abstracting: (1<=p10)
states: 22
abstracting: (p10<=1)
states: 92
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C003-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AX [[[p6<=1 & 1<=p6] | [AX [[p4<=0 & 0<=p4]] & [AG [[p4<=0 & 0<=p4]] | A [EX [[p16<=1 & 1<=p16]] U E [[p4<=1 & 1<=p4] U [p4<=1 & 1<=p4]]]]]]]
normalized: ~ [EX [~ [[[[[~ [EG [~ [E [[p4<=1 & 1<=p4] U [p4<=1 & 1<=p4]]]]] & ~ [E [~ [E [[p4<=1 & 1<=p4] U [p4<=1 & 1<=p4]]] U [~ [EX [[p16<=1 & 1<=p16]]] & ~ [E [[p4<=1 & 1<=p4] U [p4<=1 & 1<=p4]]]]]]] | ~ [E [true U ~ [[p4<=0 & 0<=p4]]]]] & ~ [EX [~ [[p4<=0 & 0<=p4]]]]] | [p6<=1 & 1<=p6]]]]]

abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 92
abstracting: (0<=p4)
states: 92
abstracting: (p4<=0)
states: 60
.abstracting: (0<=p4)
states: 92
abstracting: (p4<=0)
states: 60
abstracting: (1<=p4)
states: 32
abstracting: (p4<=1)
states: 92
abstracting: (1<=p4)
states: 32
abstracting: (p4<=1)
states: 92
abstracting: (1<=p16)
states: 32
abstracting: (p16<=1)
states: 92
.abstracting: (1<=p4)
states: 32
abstracting: (p4<=1)
states: 92
abstracting: (1<=p4)
states: 32
abstracting: (p4<=1)
states: 92
abstracting: (1<=p4)
states: 32
abstracting: (p4<=1)
states: 92
abstracting: (1<=p4)
states: 32
abstracting: (p4<=1)
states: 92
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AX [AX [~ [A [~ [[[[p11<=1 & 1<=p11] & [p14<=1 & 1<=p14]] & [[p17<=1 & 1<=p17] & [[p0<=1 & 1<=p0] & [p3<=1 & 1<=p3]]]]] U A [[p1<=1 & 1<=p1] U [[p2<=1 & 1<=p2] & [p5<=1 & 1<=p5]]]]]]]
normalized: ~ [EX [EX [[~ [EG [~ [[~ [EG [~ [[[p5<=1 & 1<=p5] & [p2<=1 & 1<=p2]]]]] & ~ [E [~ [[[p5<=1 & 1<=p5] & [p2<=1 & 1<=p2]]] U [~ [[p1<=1 & 1<=p1]] & ~ [[[p5<=1 & 1<=p5] & [p2<=1 & 1<=p2]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[p5<=1 & 1<=p5] & [p2<=1 & 1<=p2]]]]] & ~ [E [~ [[[p5<=1 & 1<=p5] & [p2<=1 & 1<=p2]]] U [~ [[p1<=1 & 1<=p1]] & ~ [[[p5<=1 & 1<=p5] & [p2<=1 & 1<=p2]]]]]]]] U [[[[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]] & [p17<=1 & 1<=p17]] & [[p14<=1 & 1<=p14] & [p11<=1 & 1<=p11]]] & ~ [[~ [EG [~ [[[p5<=1 & 1<=p5] & [p2<=1 & 1<=p2]]]]] & ~ [E [~ [[[p5<=1 & 1<=p5] & [p2<=1 & 1<=p2]]] U [~ [[p1<=1 & 1<=p1]] & ~ [[[p5<=1 & 1<=p5] & [p2<=1 & 1<=p2]]]]]]]]]]]]]]]

abstracting: (1<=p2)
states: 40
abstracting: (p2<=1)
states: 92
abstracting: (1<=p5)
states: 38
abstracting: (p5<=1)
states: 92
abstracting: (1<=p1)
states: 44
abstracting: (p1<=1)
states: 92
abstracting: (1<=p2)
states: 40
abstracting: (p2<=1)
states: 92
abstracting: (1<=p5)
states: 38
abstracting: (p5<=1)
states: 92
abstracting: (1<=p2)
states: 40
abstracting: (p2<=1)
states: 92
abstracting: (1<=p5)
states: 38
abstracting: (p5<=1)
states: 92
.
EG iterations: 1
abstracting: (1<=p11)
states: 38
abstracting: (p11<=1)
states: 92
abstracting: (1<=p14)
states: 40
abstracting: (p14<=1)
states: 92
abstracting: (1<=p17)
states: 60
abstracting: (p17<=1)
states: 92
abstracting: (1<=p0)
states: 44
abstracting: (p0<=1)
states: 92
abstracting: (1<=p3)
states: 42
abstracting: (p3<=1)
states: 92
abstracting: (1<=p2)
states: 40
abstracting: (p2<=1)
states: 92
abstracting: (1<=p5)
states: 38
abstracting: (p5<=1)
states: 92
abstracting: (1<=p1)
states: 44
abstracting: (p1<=1)
states: 92
abstracting: (1<=p2)
states: 40
abstracting: (p2<=1)
states: 92
abstracting: (1<=p5)
states: 38
abstracting: (p5<=1)
states: 92
abstracting: (1<=p2)
states: 40
abstracting: (p2<=1)
states: 92
abstracting: (1<=p5)
states: 38
abstracting: (p5<=1)
states: 92
.
EG iterations: 1
abstracting: (1<=p2)
states: 40
abstracting: (p2<=1)
states: 92
abstracting: (1<=p5)
states: 38
abstracting: (p5<=1)
states: 92
abstracting: (1<=p1)
states: 44
abstracting: (p1<=1)
states: 92
abstracting: (1<=p2)
states: 40
abstracting: (p2<=1)
states: 92
abstracting: (1<=p5)
states: 38
abstracting: (p5<=1)
states: 92
abstracting: (1<=p2)
states: 40
abstracting: (p2<=1)
states: 92
abstracting: (1<=p5)
states: 38
abstracting: (p5<=1)
states: 92
.
EG iterations: 1
.
EG iterations: 1
..-> the formula is FALSE

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

MC time: 0m 0.011sec

checking: AF [EX [[EG [[[p5<=1 & 1<=p5] & [p11<=1 & 1<=p11]]] & [[AX [[[p3<=1 & 1<=p3] & [[p9<=1 & 1<=p9] & [p10<=1 & 1<=p10]]]] | [p4<=1 & 1<=p4]] | [[p0<=0 & 0<=p0] | [p3<=0 & 0<=p3]]]]]]
normalized: ~ [EG [~ [EX [[[[[p3<=0 & 0<=p3] | [p0<=0 & 0<=p0]] | [[p4<=1 & 1<=p4] | ~ [EX [~ [[[[p10<=1 & 1<=p10] & [p9<=1 & 1<=p9]] & [p3<=1 & 1<=p3]]]]]]] & EG [[[p11<=1 & 1<=p11] & [p5<=1 & 1<=p5]]]]]]]]

abstracting: (1<=p5)
states: 38
abstracting: (p5<=1)
states: 92
abstracting: (1<=p11)
states: 38
abstracting: (p11<=1)
states: 92
...........
EG iterations: 11
abstracting: (1<=p3)
states: 42
abstracting: (p3<=1)
states: 92
abstracting: (1<=p9)
states: 42
abstracting: (p9<=1)
states: 92
abstracting: (1<=p10)
states: 22
abstracting: (p10<=1)
states: 92
.abstracting: (1<=p4)
states: 32
abstracting: (p4<=1)
states: 92
abstracting: (0<=p0)
states: 92
abstracting: (p0<=0)
states: 48
abstracting: (0<=p3)
states: 92
abstracting: (p3<=0)
states: 50
.
EG iterations: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C003-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EX [EX [A [[[p4<=1 & 1<=p4] & A [[[p11<=1 & 1<=p11] & [[p14<=1 & 1<=p14] & [p17<=1 & 1<=p17]]] U [p1<=1 & 1<=p1]]] U ~ [[[[p9<=1 & 1<=p9] & [p12<=1 & 1<=p12]] & [[p15<=1 & 1<=p15] & [[p5<=1 & 1<=p5] & [p11<=1 & 1<=p11]]]]]]]]
normalized: EX [EX [[~ [EG [[[[[p11<=1 & 1<=p11] & [p5<=1 & 1<=p5]] & [p15<=1 & 1<=p15]] & [[p12<=1 & 1<=p12] & [p9<=1 & 1<=p9]]]]] & ~ [E [[[[[p11<=1 & 1<=p11] & [p5<=1 & 1<=p5]] & [p15<=1 & 1<=p15]] & [[p12<=1 & 1<=p12] & [p9<=1 & 1<=p9]]] U [~ [[[~ [EG [~ [[p1<=1 & 1<=p1]]]] & ~ [E [~ [[p1<=1 & 1<=p1]] U [~ [[[[p17<=1 & 1<=p17] & [p14<=1 & 1<=p14]] & [p11<=1 & 1<=p11]]] & ~ [[p1<=1 & 1<=p1]]]]]] & [p4<=1 & 1<=p4]]] & [[[[p11<=1 & 1<=p11] & [p5<=1 & 1<=p5]] & [p15<=1 & 1<=p15]] & [[p12<=1 & 1<=p12] & [p9<=1 & 1<=p9]]]]]]]]]

abstracting: (1<=p9)
states: 42
abstracting: (p9<=1)
states: 92
abstracting: (1<=p12)
states: 44
abstracting: (p12<=1)
states: 92
abstracting: (1<=p15)
states: 52
abstracting: (p15<=1)
states: 92
abstracting: (1<=p5)
states: 38
abstracting: (p5<=1)
states: 92
abstracting: (1<=p11)
states: 38
abstracting: (p11<=1)
states: 92
abstracting: (1<=p4)
states: 32
abstracting: (p4<=1)
states: 92
abstracting: (1<=p1)
states: 44
abstracting: (p1<=1)
states: 92
abstracting: (1<=p11)
states: 38
abstracting: (p11<=1)
states: 92
abstracting: (1<=p14)
states: 40
abstracting: (p14<=1)
states: 92
abstracting: (1<=p17)
states: 60
abstracting: (p17<=1)
states: 92
abstracting: (1<=p1)
states: 44
abstracting: (p1<=1)
states: 92
abstracting: (1<=p1)
states: 44
abstracting: (p1<=1)
states: 92
.....
EG iterations: 5
abstracting: (1<=p9)
states: 42
abstracting: (p9<=1)
states: 92
abstracting: (1<=p12)
states: 44
abstracting: (p12<=1)
states: 92
abstracting: (1<=p15)
states: 52
abstracting: (p15<=1)
states: 92
abstracting: (1<=p5)
states: 38
abstracting: (p5<=1)
states: 92
abstracting: (1<=p11)
states: 38
abstracting: (p11<=1)
states: 92
abstracting: (1<=p9)
states: 42
abstracting: (p9<=1)
states: 92
abstracting: (1<=p12)
states: 44
abstracting: (p12<=1)
states: 92
abstracting: (1<=p15)
states: 52
abstracting: (p15<=1)
states: 92
abstracting: (1<=p5)
states: 38
abstracting: (p5<=1)
states: 92
abstracting: (1<=p11)
states: 38
abstracting: (p11<=1)
states: 92
.....
EG iterations: 5
..-> the formula is TRUE

FORMULA ResAllocation-PT-R003C003-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EX [~ [A [A [[A [[[p1<=1 & 1<=p1] & [[p7<=1 & 1<=p7] & [p8<=1 & 1<=p8]]] U [p4<=1 & 1<=p4]] & EX [[p16<=1 & 1<=p16]]] U A [[p6<=1 & 1<=p6] U [[p11<=1 & 1<=p11] & [[p14<=1 & 1<=p14] & [p17<=1 & 1<=p17]]]]] U AG [~ [[p1<=1 & 1<=p1]]]]]]
normalized: EX [~ [[~ [EG [E [true U [p1<=1 & 1<=p1]]]] & ~ [E [E [true U [p1<=1 & 1<=p1]] U [~ [[~ [EG [~ [[~ [EG [~ [[[[p17<=1 & 1<=p17] & [p14<=1 & 1<=p14]] & [p11<=1 & 1<=p11]]]]] & ~ [E [~ [[[[p17<=1 & 1<=p17] & [p14<=1 & 1<=p14]] & [p11<=1 & 1<=p11]]] U [~ [[p6<=1 & 1<=p6]] & ~ [[[[p17<=1 & 1<=p17] & [p14<=1 & 1<=p14]] & [p11<=1 & 1<=p11]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[[p17<=1 & 1<=p17] & [p14<=1 & 1<=p14]] & [p11<=1 & 1<=p11]]]]] & ~ [E [~ [[[[p17<=1 & 1<=p17] & [p14<=1 & 1<=p14]] & [p11<=1 & 1<=p11]]] U [~ [[p6<=1 & 1<=p6]] & ~ [[[[p17<=1 & 1<=p17] & [p14<=1 & 1<=p14]] & [p11<=1 & 1<=p11]]]]]]]] U [~ [[~ [EG [~ [[[[p17<=1 & 1<=p17] & [p14<=1 & 1<=p14]] & [p11<=1 & 1<=p11]]]]] & ~ [E [~ [[[[p17<=1 & 1<=p17] & [p14<=1 & 1<=p14]] & [p11<=1 & 1<=p11]]] U [~ [[p6<=1 & 1<=p6]] & ~ [[[[p17<=1 & 1<=p17] & [p14<=1 & 1<=p14]] & [p11<=1 & 1<=p11]]]]]]]] & ~ [[EX [[p16<=1 & 1<=p16]] & [~ [EG [~ [[p4<=1 & 1<=p4]]]] & ~ [E [~ [[p4<=1 & 1<=p4]] U [~ [[[[p8<=1 & 1<=p8] & [p7<=1 & 1<=p7]] & [p1<=1 & 1<=p1]]] & ~ [[p4<=1 & 1<=p4]]]]]]]]]]]]] & E [true U [p1<=1 & 1<=p1]]]]]]]]

abstracting: (1<=p1)
states: 44
abstracting: (p1<=1)
states: 92
abstracting: (1<=p4)
states: 32
abstracting: (p4<=1)
states: 92
abstracting: (1<=p1)
states: 44
abstracting: (p1<=1)
states: 92
abstracting: (1<=p7)
states: 44
abstracting: (p7<=1)
states: 92
abstracting: (1<=p8)
states: 10
abstracting: (p8<=1)
states: 92
abstracting: (1<=p4)
states: 32
abstracting: (p4<=1)
states: 92
abstracting: (1<=p4)
states: 32
abstracting: (p4<=1)
states: 92
.
EG iterations: 1
abstracting: (1<=p16)
states: 32
abstracting: (p16<=1)
states: 92
.abstracting: (1<=p11)
states: 38
abstracting: (p11<=1)
states: 92
abstracting: (1<=p14)
states: 40
abstracting: (p14<=1)
states: 92
abstracting: (1<=p17)
states: 60
abstracting: (p17<=1)
states: 92
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 92
abstracting: (1<=p11)
states: 38
abstracting: (p11<=1)
states: 92
abstracting: (1<=p14)
states: 40
abstracting: (p14<=1)
states: 92
abstracting: (1<=p17)
states: 60
abstracting: (p17<=1)
states: 92
abstracting: (1<=p11)
states: 38
abstracting: (p11<=1)
states: 92
abstracting: (1<=p14)
states: 40
abstracting: (p14<=1)
states: 92
abstracting: (1<=p17)
states: 60
abstracting: (p17<=1)
states: 92
.
EG iterations: 1
abstracting: (1<=p11)
states: 38
abstracting: (p11<=1)
states: 92
abstracting: (1<=p14)
states: 40
abstracting: (p14<=1)
states: 92
abstracting: (1<=p17)
states: 60
abstracting: (p17<=1)
states: 92
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 92
abstracting: (1<=p11)
states: 38
abstracting: (p11<=1)
states: 92
abstracting: (1<=p14)
states: 40
abstracting: (p14<=1)
states: 92
abstracting: (1<=p17)
states: 60
abstracting: (p17<=1)
states: 92
abstracting: (1<=p11)
states: 38
abstracting: (p11<=1)
states: 92
abstracting: (1<=p14)
states: 40
abstracting: (p14<=1)
states: 92
abstracting: (1<=p17)
states: 60
abstracting: (p17<=1)
states: 92
.
EG iterations: 1
abstracting: (1<=p11)
states: 38
abstracting: (p11<=1)
states: 92
abstracting: (1<=p14)
states: 40
abstracting: (p14<=1)
states: 92
abstracting: (1<=p17)
states: 60
abstracting: (p17<=1)
states: 92
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 92
abstracting: (1<=p11)
states: 38
abstracting: (p11<=1)
states: 92
abstracting: (1<=p14)
states: 40
abstracting: (p14<=1)
states: 92
abstracting: (1<=p17)
states: 60
abstracting: (p17<=1)
states: 92
abstracting: (1<=p11)
states: 38
abstracting: (p11<=1)
states: 92
abstracting: (1<=p14)
states: 40
abstracting: (p14<=1)
states: 92
abstracting: (1<=p17)
states: 60
abstracting: (p17<=1)
states: 92
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p1)
states: 44
abstracting: (p1<=1)
states: 92
abstracting: (1<=p1)
states: 44
abstracting: (p1<=1)
states: 92
......
EG iterations: 6
.-> the formula is TRUE

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

MC time: 0m 0.003sec

checking: AX [[[AX [EF [[[p1<=1 & 1<=p1] & [[p7<=1 & 1<=p7] & [p8<=1 & 1<=p8]]]]] & AG [[AX [[p6<=1 & 1<=p6]] | [[p16<=1 & 1<=p16] | [[p9<=1 & 1<=p9] & [[p12<=1 & 1<=p12] & [p15<=1 & 1<=p15]]]]]]] & [[p16<=1 & 1<=p16] & [[p7<=1 & 1<=p7] & [p13<=1 & 1<=p13]]]]]
normalized: ~ [EX [~ [[[[[p13<=1 & 1<=p13] & [p7<=1 & 1<=p7]] & [p16<=1 & 1<=p16]] & [~ [E [true U ~ [[[[[[p15<=1 & 1<=p15] & [p12<=1 & 1<=p12]] & [p9<=1 & 1<=p9]] | [p16<=1 & 1<=p16]] | ~ [EX [~ [[p6<=1 & 1<=p6]]]]]]]] & ~ [EX [~ [E [true U [[[p8<=1 & 1<=p8] & [p7<=1 & 1<=p7]] & [p1<=1 & 1<=p1]]]]]]]]]]]

abstracting: (1<=p1)
states: 44
abstracting: (p1<=1)
states: 92
abstracting: (1<=p7)
states: 44
abstracting: (p7<=1)
states: 92
abstracting: (1<=p8)
states: 10
abstracting: (p8<=1)
states: 92
.abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 92
.abstracting: (1<=p16)
states: 32
abstracting: (p16<=1)
states: 92
abstracting: (1<=p9)
states: 42
abstracting: (p9<=1)
states: 92
abstracting: (1<=p12)
states: 44
abstracting: (p12<=1)
states: 92
abstracting: (1<=p15)
states: 52
abstracting: (p15<=1)
states: 92
abstracting: (1<=p16)
states: 32
abstracting: (p16<=1)
states: 92
abstracting: (1<=p7)
states: 44
abstracting: (p7<=1)
states: 92
abstracting: (1<=p13)
states: 48
abstracting: (p13<=1)
states: 92
.-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EX [EG [[EX [AG [[p4<=1 & 1<=p4]]] | [AG [[[p3<=0 & 0<=p3] | [[p9<=0 & 0<=p9] | [p10<=0 & 0<=p10]]]] & [EX [[[p7<=1 & 1<=p7] & [p13<=1 & 1<=p13]]] | [A [[[p5<=1 & 1<=p5] & [p11<=1 & 1<=p11]] U [[p1<=1 & 1<=p1] & [[p7<=1 & 1<=p7] & [p8<=1 & 1<=p8]]]] | [p6<=0 & 0<=p6]]]]]]]
normalized: EX [EG [[[[[[p6<=0 & 0<=p6] | [~ [EG [~ [[[[p8<=1 & 1<=p8] & [p7<=1 & 1<=p7]] & [p1<=1 & 1<=p1]]]]] & ~ [E [~ [[[[p8<=1 & 1<=p8] & [p7<=1 & 1<=p7]] & [p1<=1 & 1<=p1]]] U [~ [[[p11<=1 & 1<=p11] & [p5<=1 & 1<=p5]]] & ~ [[[[p8<=1 & 1<=p8] & [p7<=1 & 1<=p7]] & [p1<=1 & 1<=p1]]]]]]]] | EX [[[p13<=1 & 1<=p13] & [p7<=1 & 1<=p7]]]] & ~ [E [true U ~ [[[[p10<=0 & 0<=p10] | [p9<=0 & 0<=p9]] | [p3<=0 & 0<=p3]]]]]] | EX [~ [E [true U ~ [[p4<=1 & 1<=p4]]]]]]]]

abstracting: (1<=p4)
states: 32
abstracting: (p4<=1)
states: 92
.abstracting: (0<=p3)
states: 92
abstracting: (p3<=0)
states: 50
abstracting: (0<=p9)
states: 92
abstracting: (p9<=0)
states: 50
abstracting: (0<=p10)
states: 92
abstracting: (p10<=0)
states: 70
abstracting: (1<=p7)
states: 44
abstracting: (p7<=1)
states: 92
abstracting: (1<=p13)
states: 48
abstracting: (p13<=1)
states: 92
.abstracting: (1<=p1)
states: 44
abstracting: (p1<=1)
states: 92
abstracting: (1<=p7)
states: 44
abstracting: (p7<=1)
states: 92
abstracting: (1<=p8)
states: 10
abstracting: (p8<=1)
states: 92
abstracting: (1<=p5)
states: 38
abstracting: (p5<=1)
states: 92
abstracting: (1<=p11)
states: 38
abstracting: (p11<=1)
states: 92
abstracting: (1<=p1)
states: 44
abstracting: (p1<=1)
states: 92
abstracting: (1<=p7)
states: 44
abstracting: (p7<=1)
states: 92
abstracting: (1<=p8)
states: 10
abstracting: (p8<=1)
states: 92
abstracting: (1<=p1)
states: 44
abstracting: (p1<=1)
states: 92
abstracting: (1<=p7)
states: 44
abstracting: (p7<=1)
states: 92
abstracting: (1<=p8)
states: 10
abstracting: (p8<=1)
states: 92
...
EG iterations: 3
abstracting: (0<=p6)
states: 92
abstracting: (p6<=0)
states: 88
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: E [EG [[1<=p16 & p16<=1]] U EG [[~ [A [AX [[[p7<=1 & 1<=p7] & [p13<=1 & 1<=p13]]] U ~ [[[p11<=1 & 1<=p11] & [[p14<=1 & 1<=p14] & [p17<=1 & 1<=p17]]]]]] | ~ [[[~ [[[p1<=1 & 1<=p1] & [[p7<=1 & 1<=p7] & [p8<=1 & 1<=p8]]]] | E [[p16<=1 & 1<=p16] U [[p1<=1 & 1<=p1] & [[p7<=1 & 1<=p7] & [p8<=1 & 1<=p8]]]]] & ~ [EF [[[p1<=1 & 1<=p1] & [[p7<=1 & 1<=p7] & [p8<=1 & 1<=p8]]]]]]]]]]
normalized: E [EG [[1<=p16 & p16<=1]] U EG [[~ [[~ [E [true U [[[p8<=1 & 1<=p8] & [p7<=1 & 1<=p7]] & [p1<=1 & 1<=p1]]]] & [E [[p16<=1 & 1<=p16] U [[[p8<=1 & 1<=p8] & [p7<=1 & 1<=p7]] & [p1<=1 & 1<=p1]]] | ~ [[[[p8<=1 & 1<=p8] & [p7<=1 & 1<=p7]] & [p1<=1 & 1<=p1]]]]]] | ~ [[~ [EG [[[[p17<=1 & 1<=p17] & [p14<=1 & 1<=p14]] & [p11<=1 & 1<=p11]]]] & ~ [E [[[[p17<=1 & 1<=p17] & [p14<=1 & 1<=p14]] & [p11<=1 & 1<=p11]] U [EX [~ [[[p13<=1 & 1<=p13] & [p7<=1 & 1<=p7]]]] & [[[p17<=1 & 1<=p17] & [p14<=1 & 1<=p14]] & [p11<=1 & 1<=p11]]]]]]]]]]

abstracting: (1<=p11)
states: 38
abstracting: (p11<=1)
states: 92
abstracting: (1<=p14)
states: 40
abstracting: (p14<=1)
states: 92
abstracting: (1<=p17)
states: 60
abstracting: (p17<=1)
states: 92
abstracting: (1<=p7)
states: 44
abstracting: (p7<=1)
states: 92
abstracting: (1<=p13)
states: 48
abstracting: (p13<=1)
states: 92
.abstracting: (1<=p11)
states: 38
abstracting: (p11<=1)
states: 92
abstracting: (1<=p14)
states: 40
abstracting: (p14<=1)
states: 92
abstracting: (1<=p17)
states: 60
abstracting: (p17<=1)
states: 92
abstracting: (1<=p11)
states: 38
abstracting: (p11<=1)
states: 92
abstracting: (1<=p14)
states: 40
abstracting: (p14<=1)
states: 92
abstracting: (1<=p17)
states: 60
abstracting: (p17<=1)
states: 92
.
EG iterations: 1
abstracting: (1<=p1)
states: 44
abstracting: (p1<=1)
states: 92
abstracting: (1<=p7)
states: 44
abstracting: (p7<=1)
states: 92
abstracting: (1<=p8)
states: 10
abstracting: (p8<=1)
states: 92
abstracting: (1<=p1)
states: 44
abstracting: (p1<=1)
states: 92
abstracting: (1<=p7)
states: 44
abstracting: (p7<=1)
states: 92
abstracting: (1<=p8)
states: 10
abstracting: (p8<=1)
states: 92
abstracting: (1<=p16)
states: 32
abstracting: (p16<=1)
states: 92
abstracting: (1<=p1)
states: 44
abstracting: (p1<=1)
states: 92
abstracting: (1<=p7)
states: 44
abstracting: (p7<=1)
states: 92
abstracting: (1<=p8)
states: 10
abstracting: (p8<=1)
states: 92
.
EG iterations: 1
abstracting: (p16<=1)
states: 92
abstracting: (1<=p16)
states: 32
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C003-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (0<=p2)
states: 92
abstracting: (p2<=0)
states: 52
abstracting: (0<=p5)
states: 92
abstracting: (p5<=0)
states: 54
abstracting: (0<=p4)
states: 92
abstracting: (p4<=0)
states: 60
abstracting: (0<=p11)
states: 92
abstracting: (p11<=0)
states: 54
abstracting: (0<=p14)
states: 92
abstracting: (p14<=0)
states: 52
abstracting: (0<=p17)
states: 92
abstracting: (p17<=0)
states: 32
abstracting: (1<=p7)
states: 44
abstracting: (p7<=1)
states: 92
abstracting: (1<=p13)
states: 48
abstracting: (p13<=1)
states: 92
abstracting: (1<=p11)
states: 38
abstracting: (p11<=1)
states: 92
abstracting: (1<=p14)
states: 40
abstracting: (p14<=1)
states: 92
abstracting: (1<=p17)
states: 60
abstracting: (p17<=1)
states: 92
abstracting: (1<=p7)
states: 44
abstracting: (p7<=1)
states: 92
abstracting: (1<=p13)
states: 48
abstracting: (p13<=1)
states: 92
abstracting: (1<=p7)
states: 44
abstracting: (p7<=1)
states: 92
abstracting: (1<=p13)
states: 48
abstracting: (p13<=1)
states: 92
.....
EG iterations: 5
abstracting: (0<=p3)
states: 92
abstracting: (p3<=0)
states: 50
abstracting: (0<=p9)
states: 92
abstracting: (p9<=0)
states: 50
abstracting: (0<=p10)
states: 92
abstracting: (p10<=0)
states: 70
abstracting: (0<=p6)
states: 92
abstracting: (p6<=0)
states: 88
.
EG iterations: 1
abstracting: (1<=p1)
states: 44
abstracting: (p1<=1)
states: 92
abstracting: (1<=p7)
states: 44
abstracting: (p7<=1)
states: 92
abstracting: (1<=p8)
states: 10
abstracting: (p8<=1)
states: 92
abstracting: (1<=p16)
states: 32
abstracting: (p16<=1)
states: 92
abstracting: (1<=p0)
states: 44
abstracting: (p0<=1)
states: 92
abstracting: (1<=p3)
states: 42
abstracting: (p3<=1)
states: 92
.abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 92
.
EG iterations: 1
abstracting: (1<=p2)
states: 40
abstracting: (p2<=1)
states: 92
abstracting: (1<=p5)
states: 38
abstracting: (p5<=1)
states: 92
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 92
abstracting: (1<=p2)
states: 40
abstracting: (p2<=1)
states: 92
abstracting: (1<=p5)
states: 38
abstracting: (p5<=1)
states: 92
abstracting: (1<=p2)
states: 40
abstracting: (p2<=1)
states: 92
abstracting: (1<=p5)
states: 38
abstracting: (p5<=1)
states: 92
.
EG iterations: 1
abstracting: (1<=p5)
states: 38
abstracting: (p5<=1)
states: 92
abstracting: (1<=p11)
states: 38
abstracting: (p11<=1)
states: 92
abstracting: (1<=p5)
states: 38
abstracting: (p5<=1)
states: 92
abstracting: (1<=p11)
states: 38
abstracting: (p11<=1)
states: 92
abstracting: (1<=p5)
states: 38
abstracting: (p5<=1)
states: 92
abstracting: (1<=p11)
states: 38
abstracting: (p11<=1)
states: 92
abstracting: (1<=p5)
states: 38
abstracting: (p5<=1)
states: 92
abstracting: (1<=p11)
states: 38
abstracting: (p11<=1)
states: 92
.
EG iterations: 1
..-> the formula is TRUE

FORMULA ResAllocation-PT-R003C003-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

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

abstracting: (1<=p0)
states: 44
abstracting: (p0<=1)
states: 92
abstracting: (1<=p3)
states: 42
abstracting: (p3<=1)
states: 92
...
EG iterations: 3
.abstracting: (1<=p3)
states: 42
abstracting: (p3<=1)
states: 92
abstracting: (1<=p9)
states: 42
abstracting: (p9<=1)
states: 92
abstracting: (1<=p10)
states: 22
abstracting: (p10<=1)
states: 92
.abstracting: (1<=p11)
states: 38
abstracting: (p11<=1)
states: 92
abstracting: (1<=p14)
states: 40
abstracting: (p14<=1)
states: 92
abstracting: (1<=p17)
states: 60
abstracting: (p17<=1)
states: 92
abstracting: (1<=p11)
states: 38
abstracting: (p11<=1)
states: 92
abstracting: (1<=p14)
states: 40
abstracting: (p14<=1)
states: 92
abstracting: (1<=p17)
states: 60
abstracting: (p17<=1)
states: 92
abstracting: (1<=p3)
states: 42
abstracting: (p3<=1)
states: 92
abstracting: (1<=p9)
states: 42
abstracting: (p9<=1)
states: 92
abstracting: (1<=p10)
states: 22
abstracting: (p10<=1)
states: 92
.abstracting: (1<=p3)
states: 42
abstracting: (p3<=1)
states: 92
abstracting: (1<=p9)
states: 42
abstracting: (p9<=1)
states: 92
abstracting: (1<=p10)
states: 22
abstracting: (p10<=1)
states: 92
.......
EG iterations: 6
abstracting: (1<=p3)
states: 42
abstracting: (p3<=1)
states: 92
abstracting: (1<=p9)
states: 42
abstracting: (p9<=1)
states: 92
abstracting: (1<=p10)
states: 22
abstracting: (p10<=1)
states: 92
abstracting: (0<=p1)
states: 92
abstracting: (p1<=0)
states: 48
abstracting: (0<=p7)
states: 92
abstracting: (p7<=0)
states: 48
abstracting: (0<=p8)
states: 92
abstracting: (p8<=0)
states: 82
abstracting: (1<=p4)
states: 32
abstracting: (p4<=1)
states: 92
abstracting: (0<=p7)
states: 92
abstracting: (p7<=0)
states: 48
abstracting: (0<=p13)
states: 92
abstracting: (p13<=0)
states: 44
.abstracting: (1<=p7)
states: 44
abstracting: (p7<=1)
states: 92
abstracting: (1<=p13)
states: 48
abstracting: (p13<=1)
states: 92
abstracting: (1<=p3)
states: 42
abstracting: (p3<=1)
states: 92
abstracting: (1<=p9)
states: 42
abstracting: (p9<=1)
states: 92
abstracting: (1<=p10)
states: 22
abstracting: (p10<=1)
states: 92
abstracting: (1<=p9)
states: 42
abstracting: (p9<=1)
states: 92
abstracting: (1<=p12)
states: 44
abstracting: (p12<=1)
states: 92
abstracting: (1<=p15)
states: 52
abstracting: (p15<=1)
states: 92
abstracting: (1<=p0)
states: 44
abstracting: (p0<=1)
states: 92
abstracting: (1<=p3)
states: 42
abstracting: (p3<=1)
states: 92
abstracting: (1<=p1)
states: 44
abstracting: (p1<=1)
states: 92
abstracting: (1<=p1)
states: 44
abstracting: (p1<=1)
states: 92
abstracting: (1<=p16)
states: 32
abstracting: (p16<=1)
states: 92
abstracting: (1<=p9)
states: 42
abstracting: (p9<=1)
states: 92
abstracting: (1<=p12)
states: 44
abstracting: (p12<=1)
states: 92
abstracting: (1<=p15)
states: 52
abstracting: (p15<=1)
states: 92
abstracting: (1<=p5)
states: 38
abstracting: (p5<=1)
states: 92
abstracting: (1<=p2)
states: 40
abstracting: (p2<=1)
states: 92
.
EG iterations: 1
abstracting: (1<=p1)
states: 44
abstracting: (p1<=1)
states: 92
abstracting: (1<=p1)
states: 44
abstracting: (p1<=1)
states: 92
.
EG iterations: 1
abstracting: (1<=p7)
states: 44
abstracting: (p7<=1)
states: 92
abstracting: (1<=p13)
states: 48
abstracting: (p13<=1)
states: 92
abstracting: (1<=p3)
states: 42
abstracting: (p3<=1)
states: 92
abstracting: (1<=p9)
states: 42
abstracting: (p9<=1)
states: 92
abstracting: (1<=p10)
states: 22
abstracting: (p10<=1)
states: 92
abstracting: (1<=p9)
states: 42
abstracting: (p9<=1)
states: 92
abstracting: (1<=p12)
states: 44
abstracting: (p12<=1)
states: 92
abstracting: (1<=p15)
states: 52
abstracting: (p15<=1)
states: 92
abstracting: (1<=p0)
states: 44
abstracting: (p0<=1)
states: 92
abstracting: (1<=p3)
states: 42
abstracting: (p3<=1)
states: 92
abstracting: (1<=p1)
states: 44
abstracting: (p1<=1)
states: 92
abstracting: (1<=p7)
states: 44
abstracting: (p7<=1)
states: 92
abstracting: (1<=p13)
states: 48
abstracting: (p13<=1)
states: 92
abstracting: (1<=p3)
states: 42
abstracting: (p3<=1)
states: 92
abstracting: (1<=p9)
states: 42
abstracting: (p9<=1)
states: 92
abstracting: (1<=p10)
states: 22
abstracting: (p10<=1)
states: 92
abstracting: (1<=p9)
states: 42
abstracting: (p9<=1)
states: 92
abstracting: (1<=p12)
states: 44
abstracting: (p12<=1)
states: 92
abstracting: (1<=p15)
states: 52
abstracting: (p15<=1)
states: 92
abstracting: (1<=p0)
states: 44
abstracting: (p0<=1)
states: 92
abstracting: (1<=p3)
states: 42
abstracting: (p3<=1)
states: 92
abstracting: (1<=p1)
states: 44
abstracting: (p1<=1)
states: 92
.
EG iterations: 1
.-> the formula is FALSE

FORMULA ResAllocation-PT-R003C003-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

totally nodes used: 7498 (7.5e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 5510 17330 22840
used/not used/entry size/cache size: 23308 67085556 16 1024MB
basic ops cache: hits/miss/sum: 3988 9864 13852
used/not used/entry size/cache size: 18123 16759093 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: 675 464 1139
used/not used/entry size/cache size: 464 8388144 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 67101388
1 7454
2 22
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.416sec


BK_STOP 1679180674969

--------------------
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:89 (7), effective:18 (1)

initing FirstDep: 0m 0.000sec


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

iterations count:53 (4), effective:9 (0)

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

iterations count:54 (4), effective:9 (0)

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

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

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

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

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

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

iterations count:61 (5), effective:10 (0)

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:61 (5), effective:15 (1)

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

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

iterations count:41 (3), effective:9 (0)

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

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

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

iterations count:61 (5), effective:15 (1)

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

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

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

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

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

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

iterations count:41 (3), effective:9 (0)

iterations count:54 (4), effective:13 (1)

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

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

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

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

iterations count:54 (4), effective:13 (1)

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

iterations count:54 (4), effective:13 (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-R003C003"
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-R003C003, 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-167889203600674"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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