About the Execution of Marcie+red for CloudOpsManagement-PT-00002by00001
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5449.976 | 11849.00 | 18686.00 | 490.60 | FFTFTTFTFFTFTTFT | normal |
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.r074-smll-167814400300458.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 CloudOpsManagement-PT-00002by00001, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814400300458
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 9.4K Feb 26 01:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 01:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 01:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 01:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 15:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 01:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 01:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 01:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 01:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 17K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CloudOpsManagement-PT-00002by00001-CTLFireability-00
FORMULA_NAME CloudOpsManagement-PT-00002by00001-CTLFireability-01
FORMULA_NAME CloudOpsManagement-PT-00002by00001-CTLFireability-02
FORMULA_NAME CloudOpsManagement-PT-00002by00001-CTLFireability-03
FORMULA_NAME CloudOpsManagement-PT-00002by00001-CTLFireability-04
FORMULA_NAME CloudOpsManagement-PT-00002by00001-CTLFireability-05
FORMULA_NAME CloudOpsManagement-PT-00002by00001-CTLFireability-06
FORMULA_NAME CloudOpsManagement-PT-00002by00001-CTLFireability-07
FORMULA_NAME CloudOpsManagement-PT-00002by00001-CTLFireability-08
FORMULA_NAME CloudOpsManagement-PT-00002by00001-CTLFireability-09
FORMULA_NAME CloudOpsManagement-PT-00002by00001-CTLFireability-10
FORMULA_NAME CloudOpsManagement-PT-00002by00001-CTLFireability-11
FORMULA_NAME CloudOpsManagement-PT-00002by00001-CTLFireability-12
FORMULA_NAME CloudOpsManagement-PT-00002by00001-CTLFireability-13
FORMULA_NAME CloudOpsManagement-PT-00002by00001-CTLFireability-14
FORMULA_NAME CloudOpsManagement-PT-00002by00001-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678520423361
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=CloudOpsManagement-PT-00002by00001
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 07:40:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 07:40:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 07:40:26] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2023-03-11 07:40:26] [INFO ] Transformed 27 places.
[2023-03-11 07:40:26] [INFO ] Transformed 29 transitions.
[2023-03-11 07:40:26] [INFO ] Parsed PT model containing 27 places and 29 transitions and 94 arcs in 137 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 20 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
// Phase 1: matrix 29 rows 27 cols
[2023-03-11 07:40:26] [INFO ] Computed 11 place invariants in 7 ms
[2023-03-11 07:40:27] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-11 07:40:27] [INFO ] Invariant cache hit.
[2023-03-11 07:40:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 07:40:27] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2023-03-11 07:40:27] [INFO ] Invariant cache hit.
[2023-03-11 07:40:27] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 480 ms. Remains : 27/27 places, 29/29 transitions.
Support contains 27 out of 27 places after structural reductions.
[2023-03-11 07:40:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-11 07:40:27] [INFO ] Flatten gal took : 40 ms
FORMULA CloudOpsManagement-PT-00002by00001-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 07:40:27] [INFO ] Flatten gal took : 14 ms
[2023-03-11 07:40:27] [INFO ] Input system was already deterministic with 29 transitions.
Support contains 26 out of 27 places (down from 27) after GAL structural reductions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 31) seen :29
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 07:40:28] [INFO ] Invariant cache hit.
[2023-03-11 07:40:28] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-11 07:40:28] [INFO ] After 67ms 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 1 ms.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2023-03-11 07:40:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 8 ms
FORMULA CloudOpsManagement-PT-00002by00001-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 6 ms
[2023-03-11 07:40:28] [INFO ] Input system was already deterministic with 29 transitions.
Support contains 25 out of 27 places (down from 26) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 27/27 places, 29/29 transitions.
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 3 ms
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 4 ms
[2023-03-11 07:40:28] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Graph (trivial) has 9 edges and 27 vertex of which 8 / 27 are part of one of the 4 SCC in 3 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 23 transition count 22
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 7 place count 23 transition count 19
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 17 transition count 19
Applied a total of 13 rules in 15 ms. Remains 17 /27 variables (removed 10) and now considering 19/29 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 17/27 places, 19/29 transitions.
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 2 ms
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 3 ms
[2023-03-11 07:40:28] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/27 places, 29/29 transitions.
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 3 ms
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 4 ms
[2023-03-11 07:40:28] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/27 places, 29/29 transitions.
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 3 ms
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 3 ms
[2023-03-11 07:40:28] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 27/27 places, 29/29 transitions.
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 3 ms
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 3 ms
[2023-03-11 07:40:28] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/27 places, 29/29 transitions.
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 2 ms
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 3 ms
[2023-03-11 07:40:28] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Graph (trivial) has 3 edges and 27 vertex of which 2 / 27 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 26 transition count 27
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 26 transition count 26
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 24 transition count 26
Applied a total of 5 rules in 7 ms. Remains 24 /27 variables (removed 3) and now considering 26/29 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 24/27 places, 26/29 transitions.
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 2 ms
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 2 ms
[2023-03-11 07:40:28] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/27 places, 29/29 transitions.
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 2 ms
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 3 ms
[2023-03-11 07:40:28] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 27/27 places, 29/29 transitions.
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 2 ms
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 3 ms
[2023-03-11 07:40:28] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/27 places, 29/29 transitions.
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 2 ms
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 3 ms
[2023-03-11 07:40:28] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/27 places, 29/29 transitions.
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 2 ms
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 3 ms
[2023-03-11 07:40:28] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/27 places, 29/29 transitions.
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 2 ms
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 2 ms
[2023-03-11 07:40:28] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Graph (trivial) has 7 edges and 27 vertex of which 6 / 27 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 24 transition count 25
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 24 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 22 transition count 24
Applied a total of 5 rules in 6 ms. Remains 22 /27 variables (removed 5) and now considering 24/29 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 22/27 places, 24/29 transitions.
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 2 ms
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 2 ms
[2023-03-11 07:40:28] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Graph (trivial) has 9 edges and 27 vertex of which 8 / 27 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 23 transition count 22
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 7 place count 23 transition count 19
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 17 transition count 19
Applied a total of 13 rules in 5 ms. Remains 17 /27 variables (removed 10) and now considering 19/29 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 17/27 places, 19/29 transitions.
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 3 ms
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 2 ms
[2023-03-11 07:40:28] [INFO ] Input system was already deterministic with 19 transitions.
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 5 ms
[2023-03-11 07:40:28] [INFO ] Flatten gal took : 5 ms
[2023-03-11 07:40:28] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-11 07:40:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 27 places, 29 transitions and 94 arcs took 1 ms.
Total runtime 2266 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: 27 NrTr: 29 NrArc: 94)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.507sec
RS generation: 0m 0.014sec
-> reachability set: #nodes 110 (1.1e+02) #states 3,857 (3)
starting MCC model checker
--------------------------
checking: EF [EG [1<=p12]]
normalized: E [true U EG [1<=p12]]
abstracting: (1<=p12)
states: 129
.
EG iterations: 1
-> the formula is TRUE
FORMULA CloudOpsManagement-PT-00002by00001-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: AG [EF [[1<=p8 & 1<=p9]]]
normalized: ~ [E [true U ~ [E [true U [1<=p8 & 1<=p9]]]]]
abstracting: (1<=p9)
states: 105
abstracting: (1<=p8)
states: 2,264 (3)
-> the formula is FALSE
FORMULA CloudOpsManagement-PT-00002by00001-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: EX [AX [~ [E [EF [~ [[p8<=0 | p25<=0]]] U AX [[1<=p8 & 1<=p9]]]]]]
normalized: EX [~ [EX [E [E [true U ~ [[p8<=0 | p25<=0]]] U ~ [EX [~ [[1<=p8 & 1<=p9]]]]]]]]
abstracting: (1<=p9)
states: 105
abstracting: (1<=p8)
states: 2,264 (3)
.abstracting: (p25<=0)
states: 1,552 (3)
abstracting: (p8<=0)
states: 1,593 (3)
..-> the formula is TRUE
FORMULA CloudOpsManagement-PT-00002by00001-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [EX [[[1<=p13 & 1<=p16] | [1<=p1 & 1<=p2]]]]
normalized: ~ [E [true U ~ [EX [[[1<=p1 & 1<=p2] | [1<=p13 & 1<=p16]]]]]]
abstracting: (1<=p16)
states: 3,857 (3)
abstracting: (1<=p13)
states: 1,161 (3)
abstracting: (1<=p2)
states: 2,121 (3)
abstracting: (1<=p1)
states: 1,946 (3)
.-> the formula is FALSE
FORMULA CloudOpsManagement-PT-00002by00001-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AF [[1<=p22 & [1<=p7 & [p17<=0 | p19<=0]]]]
normalized: ~ [EG [~ [[[[p17<=0 | p19<=0] & 1<=p7] & 1<=p22]]]]
abstracting: (1<=p22)
states: 1,161 (3)
abstracting: (1<=p7)
states: 1,522 (3)
abstracting: (p19<=0)
states: 0
abstracting: (p17<=0)
states: 2,696 (3)
.
EG iterations: 1
-> the formula is FALSE
FORMULA CloudOpsManagement-PT-00002by00001-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [EX [AG [[E [1<=p15 U [1<=p10 & 1<=p25]] & [AF [1<=p18] | EG [[1<=p8 & 1<=p9]]]]]]]
normalized: E [true U EX [~ [E [true U ~ [[[EG [[1<=p8 & 1<=p9]] | ~ [EG [~ [1<=p18]]]] & E [1<=p15 U [1<=p10 & 1<=p25]]]]]]]]
abstracting: (1<=p25)
states: 2,305 (3)
abstracting: (1<=p10)
states: 140
abstracting: (1<=p15)
states: 1,161 (3)
abstracting: (1<=p18)
states: 1,161 (3)
.
EG iterations: 1
abstracting: (1<=p9)
states: 105
abstracting: (1<=p8)
states: 2,264 (3)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA CloudOpsManagement-PT-00002by00001-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EG [[EG [p22<=0] & [~ [A [1<=p2 U [1<=p1 & 1<=p2]]] | ~ [A [1<=p15 U 1<=p15]]]]]
normalized: EG [[[~ [[~ [EG [~ [1<=p15]]] & ~ [E [~ [1<=p15] U [~ [1<=p15] & ~ [1<=p15]]]]]] | ~ [[~ [EG [~ [[1<=p1 & 1<=p2]]]] & ~ [E [~ [[1<=p1 & 1<=p2]] U [~ [1<=p2] & ~ [[1<=p1 & 1<=p2]]]]]]]] & EG [p22<=0]]]
abstracting: (p22<=0)
states: 2,696 (3)
.
EG iterations: 1
abstracting: (1<=p2)
states: 2,121 (3)
abstracting: (1<=p1)
states: 1,946 (3)
abstracting: (1<=p2)
states: 2,121 (3)
abstracting: (1<=p2)
states: 2,121 (3)
abstracting: (1<=p1)
states: 1,946 (3)
abstracting: (1<=p2)
states: 2,121 (3)
abstracting: (1<=p1)
states: 1,946 (3)
..
EG iterations: 2
abstracting: (1<=p15)
states: 1,161 (3)
abstracting: (1<=p15)
states: 1,161 (3)
abstracting: (1<=p15)
states: 1,161 (3)
abstracting: (1<=p15)
states: 1,161 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA CloudOpsManagement-PT-00002by00001-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: [AF [AX [AG [p3<=0]]] | AG [EX [[EX [[p8<=0 | p25<=0]] | [[1<=p8 & 1<=p9] | [1<=p8 & 1<=p25]]]]]]
normalized: [~ [E [true U ~ [EX [[[[1<=p8 & 1<=p25] | [1<=p8 & 1<=p9]] | EX [[p8<=0 | p25<=0]]]]]]] | ~ [EG [EX [E [true U ~ [p3<=0]]]]]]
abstracting: (p3<=0)
states: 1,736 (3)
.
EG iterations: 0
abstracting: (p25<=0)
states: 1,552 (3)
abstracting: (p8<=0)
states: 1,593 (3)
.abstracting: (1<=p9)
states: 105
abstracting: (1<=p8)
states: 2,264 (3)
abstracting: (1<=p25)
states: 2,305 (3)
abstracting: (1<=p8)
states: 2,264 (3)
.-> the formula is TRUE
FORMULA CloudOpsManagement-PT-00002by00001-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AX [[[AF [p22<=0] | EX [[1<=p1 & 1<=p2]]] | [p24<=0 | [1<=p15 | [EG [EF [p15<=0]] & AX [AG [p7<=0]]]]]]]
normalized: ~ [EX [~ [[[[[~ [EX [E [true U ~ [p7<=0]]]] & EG [E [true U p15<=0]]] | 1<=p15] | p24<=0] | [EX [[1<=p1 & 1<=p2]] | ~ [EG [~ [p22<=0]]]]]]]]
abstracting: (p22<=0)
states: 2,696 (3)
.
EG iterations: 1
abstracting: (1<=p2)
states: 2,121 (3)
abstracting: (1<=p1)
states: 1,946 (3)
.abstracting: (p24<=0)
states: 2,696 (3)
abstracting: (1<=p15)
states: 1,161 (3)
abstracting: (p15<=0)
states: 2,696 (3)
EG iterations: 0
abstracting: (p7<=0)
states: 2,335 (3)
..-> the formula is TRUE
FORMULA CloudOpsManagement-PT-00002by00001-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AF [[AX [A [AX [[1<=p8 & 1<=p9]] U ~ [[1<=p2 | [1<=p10 & 1<=p25]]]]] & [p3<=0 & EG [EX [[p3<=0 | p4<=0]]]]]]
normalized: ~ [EG [~ [[[EG [EX [[p3<=0 | p4<=0]]] & p3<=0] & ~ [EX [~ [[~ [EG [[[1<=p10 & 1<=p25] | 1<=p2]]] & ~ [E [[[1<=p10 & 1<=p25] | 1<=p2] U [EX [~ [[1<=p8 & 1<=p9]]] & [[1<=p10 & 1<=p25] | 1<=p2]]]]]]]]]]]]
abstracting: (1<=p2)
states: 2,121 (3)
abstracting: (1<=p25)
states: 2,305 (3)
abstracting: (1<=p10)
states: 140
abstracting: (1<=p9)
states: 105
abstracting: (1<=p8)
states: 2,264 (3)
.abstracting: (1<=p2)
states: 2,121 (3)
abstracting: (1<=p25)
states: 2,305 (3)
abstracting: (1<=p10)
states: 140
abstracting: (1<=p2)
states: 2,121 (3)
abstracting: (1<=p25)
states: 2,305 (3)
abstracting: (1<=p10)
states: 140
..
EG iterations: 2
.abstracting: (p3<=0)
states: 1,736 (3)
abstracting: (p4<=0)
states: 2,905 (3)
abstracting: (p3<=0)
states: 1,736 (3)
..
EG iterations: 1
..
EG iterations: 2
-> the formula is FALSE
FORMULA CloudOpsManagement-PT-00002by00001-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AX [[[1<=p6 & 1<=p26] | [AX [~ [A [1<=p15 U [1<=p13 & 1<=p16]]]] & EG [~ [A [[1<=p1 & 1<=p2] U [1<=p21 & 1<=p23]]]]]]]
normalized: ~ [EX [~ [[[EG [~ [[~ [EG [~ [[1<=p21 & 1<=p23]]]] & ~ [E [~ [[1<=p21 & 1<=p23]] U [~ [[1<=p1 & 1<=p2]] & ~ [[1<=p21 & 1<=p23]]]]]]]] & ~ [EX [[~ [EG [~ [[1<=p13 & 1<=p16]]]] & ~ [E [~ [[1<=p13 & 1<=p16]] U [~ [1<=p15] & ~ [[1<=p13 & 1<=p16]]]]]]]]] | [1<=p6 & 1<=p26]]]]]
abstracting: (1<=p26)
states: 1,799 (3)
abstracting: (1<=p6)
states: 1,225 (3)
abstracting: (1<=p16)
states: 3,857 (3)
abstracting: (1<=p13)
states: 1,161 (3)
abstracting: (1<=p15)
states: 1,161 (3)
abstracting: (1<=p16)
states: 3,857 (3)
abstracting: (1<=p13)
states: 1,161 (3)
abstracting: (1<=p16)
states: 3,857 (3)
abstracting: (1<=p13)
states: 1,161 (3)
.
EG iterations: 1
.abstracting: (1<=p23)
states: 3,857 (3)
abstracting: (1<=p21)
states: 1,161 (3)
abstracting: (1<=p2)
states: 2,121 (3)
abstracting: (1<=p1)
states: 1,946 (3)
abstracting: (1<=p23)
states: 3,857 (3)
abstracting: (1<=p21)
states: 1,161 (3)
abstracting: (1<=p23)
states: 3,857 (3)
abstracting: (1<=p21)
states: 1,161 (3)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is TRUE
FORMULA CloudOpsManagement-PT-00002by00001-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: A [[AG [A [[1<=p11 | E [[1<=p1 & 1<=p2] U ~ [[p3<=0 | p4<=0]]]] U EX [1<=p18]]] | [1<=p21 & 1<=p23]] U AX [EF [[p3<=0 | p4<=0]]]]
normalized: [~ [EG [EX [~ [E [true U [p3<=0 | p4<=0]]]]]] & ~ [E [EX [~ [E [true U [p3<=0 | p4<=0]]]] U [~ [[[1<=p21 & 1<=p23] | ~ [E [true U ~ [[~ [EG [~ [EX [1<=p18]]]] & ~ [E [~ [EX [1<=p18]] U [~ [[E [[1<=p1 & 1<=p2] U ~ [[p3<=0 | p4<=0]]] | 1<=p11]] & ~ [EX [1<=p18]]]]]]]]]]] & EX [~ [E [true U [p3<=0 | p4<=0]]]]]]]]
abstracting: (p4<=0)
states: 2,905 (3)
abstracting: (p3<=0)
states: 1,736 (3)
.abstracting: (1<=p18)
states: 1,161 (3)
.abstracting: (1<=p11)
states: 3,612 (3)
abstracting: (p4<=0)
states: 2,905 (3)
abstracting: (p3<=0)
states: 1,736 (3)
abstracting: (1<=p2)
states: 2,121 (3)
abstracting: (1<=p1)
states: 1,946 (3)
abstracting: (1<=p18)
states: 1,161 (3)
.abstracting: (1<=p18)
states: 1,161 (3)
..
EG iterations: 1
abstracting: (1<=p23)
states: 3,857 (3)
abstracting: (1<=p21)
states: 1,161 (3)
abstracting: (p4<=0)
states: 2,905 (3)
abstracting: (p3<=0)
states: 1,736 (3)
.abstracting: (p4<=0)
states: 2,905 (3)
abstracting: (p3<=0)
states: 1,736 (3)
..
EG iterations: 1
-> the formula is TRUE
FORMULA CloudOpsManagement-PT-00002by00001-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: E [[EX [AX [AF [[1<=p21 & 1<=p23]]]] | [AG [AX [[[1<=p13 & 1<=p16] | 1<=p24]]] & [E [EG [1<=p11] U [AG [[1<=p11 & [1<=p12 & 1<=p25]]] & [1<=p14 | [1<=p3 & 1<=p4]]]] & EF [[1<=p21 & 1<=p23]]]]] U AG [EX [EX [~ [[p8<=0 | p25<=0]]]]]]
normalized: E [[[[E [true U [1<=p21 & 1<=p23]] & E [EG [1<=p11] U [[[1<=p3 & 1<=p4] | 1<=p14] & ~ [E [true U ~ [[[1<=p12 & 1<=p25] & 1<=p11]]]]]]] & ~ [E [true U EX [~ [[[1<=p13 & 1<=p16] | 1<=p24]]]]]] | EX [~ [EX [EG [~ [[1<=p21 & 1<=p23]]]]]]] U ~ [E [true U ~ [EX [EX [~ [[p8<=0 | p25<=0]]]]]]]]
abstracting: (p25<=0)
states: 1,552 (3)
abstracting: (p8<=0)
states: 1,593 (3)
..abstracting: (1<=p23)
states: 3,857 (3)
abstracting: (1<=p21)
states: 1,161 (3)
.
EG iterations: 1
..abstracting: (1<=p24)
states: 1,161 (3)
abstracting: (1<=p16)
states: 3,857 (3)
abstracting: (1<=p13)
states: 1,161 (3)
.abstracting: (1<=p11)
states: 3,612 (3)
abstracting: (1<=p25)
states: 2,305 (3)
abstracting: (1<=p12)
states: 129
abstracting: (1<=p14)
states: 1,161 (3)
abstracting: (1<=p4)
states: 952
abstracting: (1<=p3)
states: 2,121 (3)
abstracting: (1<=p11)
states: 3,612 (3)
.
EG iterations: 1
abstracting: (1<=p23)
states: 3,857 (3)
abstracting: (1<=p21)
states: 1,161 (3)
-> the formula is FALSE
FORMULA CloudOpsManagement-PT-00002by00001-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: E [[EF [AX [[[[1<=p13 & 1<=p16] | [1<=p26 & 1<=p0]] & AF [1<=p18]]]] | [EG [[AX [[1<=p17 & 1<=p19]] | ~ [[1<=p24 | [1<=p11 & [1<=p12 & 1<=p25]]]]]] & AF [[1<=p21 & 1<=p23]]]] U A [AG [A [[1<=p11 | 1<=p22] U A [1<=p22 U 1<=p3]]] U AF [1<=p2]]]
normalized: E [[[~ [EG [~ [[1<=p21 & 1<=p23]]]] & EG [[~ [[[[1<=p12 & 1<=p25] & 1<=p11] | 1<=p24]] | ~ [EX [~ [[1<=p17 & 1<=p19]]]]]]] | E [true U ~ [EX [~ [[~ [EG [~ [1<=p18]]] & [[1<=p26 & 1<=p0] | [1<=p13 & 1<=p16]]]]]]]] U [~ [EG [EG [~ [1<=p2]]]] & ~ [E [EG [~ [1<=p2]] U [E [true U ~ [[~ [EG [~ [[~ [EG [~ [1<=p3]]] & ~ [E [~ [1<=p3] U [~ [1<=p22] & ~ [1<=p3]]]]]]]] & ~ [E [~ [[~ [EG [~ [1<=p3]]] & ~ [E [~ [1<=p3] U [~ [1<=p22] & ~ [1<=p3]]]]]] U [~ [[1<=p11 | 1<=p22]] & ~ [[~ [EG [~ [1<=p3]]] & ~ [E [~ [1<=p3] U [~ [1<=p22] & ~ [1<=p3]]]]]]]]]]]] & EG [~ [1<=p2]]]]]]]
abstracting: (1<=p2)
states: 2,121 (3)
..
EG iterations: 2
abstracting: (1<=p3)
states: 2,121 (3)
abstracting: (1<=p22)
states: 1,161 (3)
abstracting: (1<=p3)
states: 2,121 (3)
abstracting: (1<=p3)
states: 2,121 (3)
..
EG iterations: 2
abstracting: (1<=p22)
states: 1,161 (3)
abstracting: (1<=p11)
states: 3,612 (3)
abstracting: (1<=p3)
states: 2,121 (3)
abstracting: (1<=p22)
states: 1,161 (3)
abstracting: (1<=p3)
states: 2,121 (3)
abstracting: (1<=p3)
states: 2,121 (3)
..
EG iterations: 2
abstracting: (1<=p3)
states: 2,121 (3)
abstracting: (1<=p22)
states: 1,161 (3)
abstracting: (1<=p3)
states: 2,121 (3)
abstracting: (1<=p3)
states: 2,121 (3)
..
EG iterations: 2
..
EG iterations: 2
abstracting: (1<=p2)
states: 2,121 (3)
..
EG iterations: 2
abstracting: (1<=p2)
states: 2,121 (3)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (1<=p16)
states: 3,857 (3)
abstracting: (1<=p13)
states: 1,161 (3)
abstracting: (1<=p0)
states: 1,911 (3)
abstracting: (1<=p26)
states: 1,799 (3)
abstracting: (1<=p18)
states: 1,161 (3)
.
EG iterations: 1
.abstracting: (1<=p19)
states: 3,857 (3)
abstracting: (1<=p17)
states: 1,161 (3)
.abstracting: (1<=p24)
states: 1,161 (3)
abstracting: (1<=p11)
states: 3,612 (3)
abstracting: (1<=p25)
states: 2,305 (3)
abstracting: (1<=p12)
states: 129
.
EG iterations: 1
abstracting: (1<=p23)
states: 3,857 (3)
abstracting: (1<=p21)
states: 1,161 (3)
.
EG iterations: 1
-> the formula is FALSE
FORMULA CloudOpsManagement-PT-00002by00001-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
totally nodes used: 16541 (1.7e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 47356 84625 131981
used/not used/entry size/cache size: 100852 67008012 16 1024MB
basic ops cache: hits/miss/sum: 10996 17195 28191
used/not used/entry size/cache size: 31437 16745779 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: 946 1468 2414
used/not used/entry size/cache size: 1468 8387140 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 67092649
1 15974
2 208
3 18
4 5
5 3
6 1
7 1
8 0
9 2
>= 10 3
Total processing time: 0m 5.109sec
BK_STOP 1678520435210
--------------------
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:263 (9), effective:47 (1)
initing FirstDep: 0m 0.000sec
iterations count:102 (3), effective:15 (0)
iterations count:101 (3), effective:15 (0)
iterations count:196 (6), effective:37 (1)
iterations count:114 (3), effective:16 (0)
iterations count:269 (9), effective:50 (1)
iterations count:29 (1), effective:0 (0)
iterations count:29 (1), effective:0 (0)
iterations count:39 (1), effective:2 (0)
iterations count:29 (1), effective:0 (0)
iterations count:67 (2), effective:6 (0)
iterations count:31 (1), effective:1 (0)
iterations count:113 (3), effective:16 (0)
iterations count:29 (1), effective:0 (0)
iterations count:31 (1), effective:1 (0)
iterations count:39 (1), effective:2 (0)
iterations count:33 (1), effective:1 (0)
iterations count:59 (2), effective:5 (0)
iterations count:136 (4), effective:17 (0)
iterations count:53 (1), effective:7 (0)
iterations count:33 (1), effective:1 (0)
iterations count:33 (1), effective:1 (0)
iterations count:195 (6), effective:36 (1)
iterations count:33 (1), effective:1 (0)
iterations count:33 (1), effective:1 (0)
iterations count:93 (3), effective:11 (0)
iterations count:37 (1), effective:1 (0)
iterations count:37 (1), effective:1 (0)
iterations count:71 (2), effective:9 (0)
iterations count:37 (1), effective:1 (0)
iterations count:45 (1), effective:3 (0)
iterations count:29 (1), effective:0 (0)
iterations count:47 (1), effective:4 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudOpsManagement-PT-00002by00001"
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 CloudOpsManagement-PT-00002by00001, 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 r074-smll-167814400300458"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudOpsManagement-PT-00002by00001.tgz
mv CloudOpsManagement-PT-00002by00001 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 '
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 ;