About the Execution of Marcie+red for SmallOperatingSystem-PT-MT0064DC0032
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5481.199 | 12873.00 | 17312.00 | 741.90 | FTTTFFFFFTTTFTFF | 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.r458-smll-167912649700034.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 SmallOperatingSystem-PT-MT0064DC0032, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912649700034
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.9K Feb 25 12:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 12:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 12:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 12:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 17:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 17:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 25 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 220K Feb 25 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 12:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 12:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 17:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 8.2K 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 SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-00
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-01
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-02
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-03
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-04
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-05
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-06
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-07
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-08
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-09
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-10
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-11
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-12
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-13
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-14
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679231410802
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=SmallOperatingSystem-PT-MT0064DC0032
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 13:10:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 13:10:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 13:10:14] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2023-03-19 13:10:14] [INFO ] Transformed 9 places.
[2023-03-19 13:10:14] [INFO ] Transformed 8 transitions.
[2023-03-19 13:10:14] [INFO ] Parsed PT model containing 9 places and 8 transitions and 27 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
Initial state reduction rules removed 3 formulas.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 20 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-19 13:10:14] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-19 13:10:15] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-19 13:10:15] [INFO ] Invariant cache hit.
[2023-03-19 13:10:15] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2023-03-19 13:10:15] [INFO ] Invariant cache hit.
[2023-03-19 13:10:15] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 414 ms. Remains : 9/9 places, 8/8 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 13:10:15] [INFO ] Flatten gal took : 28 ms
[2023-03-19 13:10:15] [INFO ] Flatten gal took : 11 ms
[2023-03-19 13:10:15] [INFO ] Input system was already deterministic with 8 transitions.
Finished random walk after 7206 steps, including 2 resets, run visited all 20 properties in 98 ms. (steps per millisecond=73 )
[2023-03-19 13:10:15] [INFO ] Flatten gal took : 4 ms
[2023-03-19 13:10:15] [INFO ] Flatten gal took : 6 ms
[2023-03-19 13:10:15] [INFO ] Input system was already deterministic with 8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 6 transition count 6
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 6 transition count 6
Applied a total of 6 rules in 18 ms. Remains 6 /9 variables (removed 3) and now considering 6/8 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 6/9 places, 6/8 transitions.
[2023-03-19 13:10:15] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:10:15] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:10:15] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 33 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=33 )
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 6 transition count 6
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 6 transition count 6
Applied a total of 6 rules in 5 ms. Remains 6 /9 variables (removed 3) and now considering 6/8 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 6/9 places, 6/8 transitions.
[2023-03-19 13:10:15] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:10:15] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:10:16] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:10:16] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:10:16] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:10:16] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:10:16] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:10:16] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:10:16] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:10:16] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 2 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:10:16] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/9 places, 7/8 transitions.
[2023-03-19 13:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:10:16] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:10:16] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 7 transition count 6
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 2 edges and 5 vertex of which 2 / 5 are part of one of the 1 SCC in 8 ms
Free SCC test removed 1 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 6 place count 4 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7 place count 4 transition count 5
Applied a total of 7 rules in 13 ms. Remains 4 /9 variables (removed 5) and now considering 5/8 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 4/9 places, 5/8 transitions.
[2023-03-19 13:10:16] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:10:16] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:10:16] [INFO ] Input system was already deterministic with 5 transitions.
Finished random walk after 66 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=66 )
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 2 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 8/9 places, 7/8 transitions.
[2023-03-19 13:10:16] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:10:16] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:10:16] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/9 places, 7/8 transitions.
[2023-03-19 13:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:10:16] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:10:16] [INFO ] Input system was already deterministic with 8 transitions.
[2023-03-19 13:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:10:16] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-19 13:10:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 8 transitions and 27 arcs took 1 ms.
Total runtime 1655 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: 9 NrTr: 8 NrArc: 27)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.517sec
RS generation: 0m 0.133sec
-> reachability set: #nodes 1449 (1.4e+03) #states 9,133,641 (6)
starting MCC model checker
--------------------------
checking: EG [AF [[AG [p8<=0] & [EG [[p4<=0 | p6<=0]] & [p4<=0 | p6<=0]]]]]
normalized: EG [~ [EG [~ [[~ [E [true U ~ [p8<=0]]] & [EG [[p4<=0 | p6<=0]] & [p4<=0 | p6<=0]]]]]]]
abstracting: (p6<=0)
states: 1
abstracting: (p4<=0)
states: 564,553 (5)
abstracting: (p6<=0)
states: 1
abstracting: (p4<=0)
states: 564,553 (5)
..................................
EG iterations: 34
abstracting: (p8<=0)
states: 762,025 (5)
EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.048sec
checking: EF [~ [E [[[1<=p1 & 1<=p2] & 1<=p0] U [1<=p0 & [1<=p1 & 1<=p2]]]]]
normalized: E [true U ~ [E [[[1<=p1 & 1<=p2] & 1<=p0] U [1<=p0 & [1<=p1 & 1<=p2]]]]]
abstracting: (1<=p2)
states: 8,917,656 (6)
abstracting: (1<=p1)
states: 8,569,088 (6)
abstracting: (1<=p0)
states: 9,133,641 (6)
abstracting: (1<=p0)
states: 9,133,641 (6)
abstracting: (1<=p2)
states: 8,917,656 (6)
abstracting: (1<=p1)
states: 8,569,088 (6)
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.063sec
checking: EF [[1<=p7 | [~ [E [EX [[1<=p0 & [1<=p2 & 1<=p5]]] U AF [1<=p4]]] & AX [p7<=0]]]]
normalized: E [true U [[~ [EX [~ [p7<=0]]] & ~ [E [EX [[[1<=p2 & 1<=p5] & 1<=p0]] U ~ [EG [~ [1<=p4]]]]]] | 1<=p7]]
abstracting: (1<=p7)
states: 8,569,088 (6)
abstracting: (1<=p4)
states: 8,569,088 (6)
..................................
EG iterations: 34
abstracting: (1<=p0)
states: 9,133,641 (6)
abstracting: (1<=p5)
states: 8,569,088 (6)
abstracting: (1<=p2)
states: 8,917,656 (6)
.abstracting: (p7<=0)
states: 564,553 (5)
.-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.024sec
checking: EX [AX [[AG [~ [A [[1<=p0 & [1<=p1 & 1<=p2]] U 1<=p7]]] | [AG [[p5<=0 | p6<=0]] | AF [p7<=0]]]]]
normalized: EX [~ [EX [~ [[[~ [EG [~ [p7<=0]]] | ~ [E [true U ~ [[p5<=0 | p6<=0]]]]] | ~ [E [true U [~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [[[1<=p1 & 1<=p2] & 1<=p0]] & ~ [1<=p7]]]]]]]]]]]]
abstracting: (1<=p7)
states: 8,569,088 (6)
abstracting: (1<=p0)
states: 9,133,641 (6)
abstracting: (1<=p2)
states: 8,917,656 (6)
abstracting: (1<=p1)
states: 8,569,088 (6)
abstracting: (1<=p7)
states: 8,569,088 (6)
abstracting: (1<=p7)
states: 8,569,088 (6)
.
EG iterations: 1
abstracting: (p6<=0)
states: 1
abstracting: (p5<=0)
states: 564,553 (5)
abstracting: (p7<=0)
states: 564,553 (5)
.
EG iterations: 1
..-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: E [[~ [AX [A [p3<=0 U 1<=p3]]] | EG [E [~ [EX [[1<=p5 & 1<=p6]]] U [1<=p3 & EF [[1<=p0 & [1<=p2 & 1<=p5]]]]]]] U EG [[1<=p8 & EF [[1<=p4 & [1<=p6 & EG [1<=p3]]]]]]]
normalized: E [[EG [E [~ [EX [[1<=p5 & 1<=p6]]] U [E [true U [[1<=p2 & 1<=p5] & 1<=p0]] & 1<=p3]]] | EX [~ [[~ [EG [~ [1<=p3]]] & ~ [E [~ [1<=p3] U [~ [p3<=0] & ~ [1<=p3]]]]]]]] U EG [[E [true U [[EG [1<=p3] & 1<=p6] & 1<=p4]] & 1<=p8]]]
abstracting: (1<=p8)
states: 8,371,616 (6)
abstracting: (1<=p4)
states: 8,569,088 (6)
abstracting: (1<=p6)
states: 9,133,640 (6)
abstracting: (1<=p3)
states: 8,371,616 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p3)
states: 8,371,616 (6)
abstracting: (p3<=0)
states: 762,025 (5)
abstracting: (1<=p3)
states: 8,371,616 (6)
abstracting: (1<=p3)
states: 8,371,616 (6)
.
EG iterations: 1
.abstracting: (1<=p3)
states: 8,371,616 (6)
abstracting: (1<=p0)
states: 9,133,641 (6)
abstracting: (1<=p5)
states: 8,569,088 (6)
abstracting: (1<=p2)
states: 8,917,656 (6)
abstracting: (1<=p6)
states: 9,133,640 (6)
abstracting: (1<=p5)
states: 8,569,088 (6)
..
EG iterations: 1
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.057sec
checking: AX [AX [[~ [E [~ [[1<=p4 & 1<=p6]] U AG [1<=p7]]] | [[A [1<=p4 U 1<=p3] & AX [[1<=p0 & [1<=p2 & 1<=p5]]]] & [1<=p4 & AG [[[1<=p0 & [1<=p1 & 1<=p2]] | 1<=p4]]]]]]]
normalized: ~ [EX [EX [~ [[[[~ [E [true U ~ [[[[1<=p1 & 1<=p2] & 1<=p0] | 1<=p4]]]] & 1<=p4] & [~ [EX [~ [[[1<=p2 & 1<=p5] & 1<=p0]]]] & [~ [EG [~ [1<=p3]]] & ~ [E [~ [1<=p3] U [~ [1<=p4] & ~ [1<=p3]]]]]]] | ~ [E [~ [[1<=p4 & 1<=p6]] U ~ [E [true U ~ [1<=p7]]]]]]]]]]
abstracting: (1<=p7)
states: 8,569,088 (6)
abstracting: (1<=p6)
states: 9,133,640 (6)
abstracting: (1<=p4)
states: 8,569,088 (6)
abstracting: (1<=p3)
states: 8,371,616 (6)
abstracting: (1<=p4)
states: 8,569,088 (6)
abstracting: (1<=p3)
states: 8,371,616 (6)
abstracting: (1<=p3)
states: 8,371,616 (6)
.
EG iterations: 1
abstracting: (1<=p0)
states: 9,133,641 (6)
abstracting: (1<=p5)
states: 8,569,088 (6)
abstracting: (1<=p2)
states: 8,917,656 (6)
.abstracting: (1<=p4)
states: 8,569,088 (6)
abstracting: (1<=p4)
states: 8,569,088 (6)
abstracting: (1<=p0)
states: 9,133,641 (6)
abstracting: (1<=p2)
states: 8,917,656 (6)
abstracting: (1<=p1)
states: 8,569,088 (6)
..-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.232sec
checking: [AF [[[~ [A [[1<=p4 & 1<=p6] U [1<=p0 & [1<=p2 & 1<=p5]]]] | [p3<=0 & [p4<=0 & AX [[p4<=0 | p6<=0]]]]] & AG [p3<=0]]] & EF [EX [[p8<=0 | A [1<=p8 U [1<=p4 & 1<=p6]]]]]]
normalized: [E [true U EX [[[~ [EG [~ [[1<=p4 & 1<=p6]]]] & ~ [E [~ [[1<=p4 & 1<=p6]] U [~ [1<=p8] & ~ [[1<=p4 & 1<=p6]]]]]] | p8<=0]]] & ~ [EG [~ [[~ [E [true U ~ [p3<=0]]] & [[[~ [EX [~ [[p4<=0 | p6<=0]]]] & p4<=0] & p3<=0] | ~ [[~ [EG [~ [[[1<=p2 & 1<=p5] & 1<=p0]]]] & ~ [E [~ [[[1<=p2 & 1<=p5] & 1<=p0]] U [~ [[1<=p4 & 1<=p6]] & ~ [[[1<=p2 & 1<=p5] & 1<=p0]]]]]]]]]]]]]
abstracting: (1<=p0)
states: 9,133,641 (6)
abstracting: (1<=p5)
states: 8,569,088 (6)
abstracting: (1<=p2)
states: 8,917,656 (6)
abstracting: (1<=p6)
states: 9,133,640 (6)
abstracting: (1<=p4)
states: 8,569,088 (6)
abstracting: (1<=p0)
states: 9,133,641 (6)
abstracting: (1<=p5)
states: 8,569,088 (6)
abstracting: (1<=p2)
states: 8,917,656 (6)
abstracting: (1<=p0)
states: 9,133,641 (6)
abstracting: (1<=p5)
states: 8,569,088 (6)
abstracting: (1<=p2)
states: 8,917,656 (6)
..
EG iterations: 2
abstracting: (p3<=0)
states: 762,025 (5)
abstracting: (p4<=0)
states: 564,553 (5)
abstracting: (p6<=0)
states: 1
abstracting: (p4<=0)
states: 564,553 (5)
.abstracting: (p3<=0)
states: 762,025 (5)
EG iterations: 0
abstracting: (p8<=0)
states: 762,025 (5)
abstracting: (1<=p6)
states: 9,133,640 (6)
abstracting: (1<=p4)
states: 8,569,088 (6)
abstracting: (1<=p8)
states: 8,371,616 (6)
abstracting: (1<=p6)
states: 9,133,640 (6)
abstracting: (1<=p4)
states: 8,569,088 (6)
abstracting: (1<=p6)
states: 9,133,640 (6)
abstracting: (1<=p4)
states: 8,569,088 (6)
..................................
EG iterations: 34
.-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.057sec
checking: AG [AX [[[1<=p7 & A [AX [[1<=p0 & [1<=p2 & 1<=p5]]] U A [1<=p4 U 1<=p4]]] | [EF [[p0<=0 | [p2<=0 | p5<=0]]] & [AX [1<=p7] & AG [[[1<=p0 & [1<=p1 & 1<=p2]] | 1<=p7]]]]]]]
normalized: ~ [E [true U EX [~ [[[[~ [E [true U ~ [[[[1<=p1 & 1<=p2] & 1<=p0] | 1<=p7]]]] & ~ [EX [~ [1<=p7]]]] & E [true U [[p2<=0 | p5<=0] | p0<=0]]] | [[~ [EG [~ [[~ [EG [~ [1<=p4]]] & ~ [E [~ [1<=p4] U [~ [1<=p4] & ~ [1<=p4]]]]]]]] & ~ [E [~ [[~ [EG [~ [1<=p4]]] & ~ [E [~ [1<=p4] U [~ [1<=p4] & ~ [1<=p4]]]]]] U [EX [~ [[[1<=p2 & 1<=p5] & 1<=p0]]] & ~ [[~ [EG [~ [1<=p4]]] & ~ [E [~ [1<=p4] U [~ [1<=p4] & ~ [1<=p4]]]]]]]]]] & 1<=p7]]]]]]
abstracting: (1<=p7)
states: 8,569,088 (6)
abstracting: (1<=p4)
states: 8,569,088 (6)
abstracting: (1<=p4)
states: 8,569,088 (6)
abstracting: (1<=p4)
states: 8,569,088 (6)
abstracting: (1<=p4)
states: 8,569,088 (6)
..................................
EG iterations: 34
abstracting: (1<=p0)
states: 9,133,641 (6)
abstracting: (1<=p5)
states: 8,569,088 (6)
abstracting: (1<=p2)
states: 8,917,656 (6)
.abstracting: (1<=p4)
states: 8,569,088 (6)
abstracting: (1<=p4)
states: 8,569,088 (6)
abstracting: (1<=p4)
states: 8,569,088 (6)
abstracting: (1<=p4)
states: 8,569,088 (6)
..................................
EG iterations: 34
abstracting: (1<=p4)
states: 8,569,088 (6)
abstracting: (1<=p4)
states: 8,569,088 (6)
abstracting: (1<=p4)
states: 8,569,088 (6)
abstracting: (1<=p4)
states: 8,569,088 (6)
..................................
EG iterations: 34
..................................
EG iterations: 34
abstracting: (p0<=0)
states: 0
abstracting: (p5<=0)
states: 564,553 (5)
abstracting: (p2<=0)
states: 215,985 (5)
abstracting: (1<=p7)
states: 8,569,088 (6)
.abstracting: (1<=p7)
states: 8,569,088 (6)
abstracting: (1<=p0)
states: 9,133,641 (6)
abstracting: (1<=p2)
states: 8,917,656 (6)
abstracting: (1<=p1)
states: 8,569,088 (6)
.-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.137sec
checking: [EF [AX [[[1<=p5 & 1<=p6] | [1<=p3 | EF [p3<=0]]]]] & EX [[[AF [1<=p7] | [[1<=p0 & [1<=p2 & 1<=p5]] | 1<=p8]] & [EF [[p7<=0 | [p5<=0 | p6<=0]]] & EF [[p0<=0 | [p1<=0 | p2<=0]]]]]]]
normalized: [EX [[[E [true U [[p1<=0 | p2<=0] | p0<=0]] & E [true U [[p5<=0 | p6<=0] | p7<=0]]] & [[[[1<=p2 & 1<=p5] & 1<=p0] | 1<=p8] | ~ [EG [~ [1<=p7]]]]]] & E [true U ~ [EX [~ [[[E [true U p3<=0] | 1<=p3] | [1<=p5 & 1<=p6]]]]]]]
abstracting: (1<=p6)
states: 9,133,640 (6)
abstracting: (1<=p5)
states: 8,569,088 (6)
abstracting: (1<=p3)
states: 8,371,616 (6)
abstracting: (p3<=0)
states: 762,025 (5)
.abstracting: (1<=p7)
states: 8,569,088 (6)
.
EG iterations: 1
abstracting: (1<=p8)
states: 8,371,616 (6)
abstracting: (1<=p0)
states: 9,133,641 (6)
abstracting: (1<=p5)
states: 8,569,088 (6)
abstracting: (1<=p2)
states: 8,917,656 (6)
abstracting: (p7<=0)
states: 564,553 (5)
abstracting: (p6<=0)
states: 1
abstracting: (p5<=0)
states: 564,553 (5)
abstracting: (p0<=0)
states: 0
abstracting: (p2<=0)
states: 215,985 (5)
abstracting: (p1<=0)
states: 564,553 (5)
.-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.064sec
checking: AX [A [[1<=p8 & [~ [EG [1<=p7]] & 1<=p3]] U ~ [[~ [[[1<=p4 & 1<=p6] & [1<=p5 & 1<=p6]]] | [~ [[[1<=p7 & 1<=p0] & [1<=p1 & 1<=p2]]] | ~ [E [[1<=p0 & [1<=p1 & 1<=p2]] U [1<=p5 & 1<=p6]]]]]]]]
normalized: ~ [EX [~ [[~ [EG [[[~ [E [[1<=p0 & [1<=p1 & 1<=p2]] U [1<=p5 & 1<=p6]]] | ~ [[[1<=p1 & 1<=p2] & [1<=p7 & 1<=p0]]]] | ~ [[[1<=p5 & 1<=p6] & [1<=p4 & 1<=p6]]]]]] & ~ [E [[[~ [E [[1<=p0 & [1<=p1 & 1<=p2]] U [1<=p5 & 1<=p6]]] | ~ [[[1<=p1 & 1<=p2] & [1<=p7 & 1<=p0]]]] | ~ [[[1<=p5 & 1<=p6] & [1<=p4 & 1<=p6]]]] U [~ [[1<=p8 & [1<=p3 & ~ [EG [1<=p7]]]]] & [[~ [E [[1<=p0 & [1<=p1 & 1<=p2]] U [1<=p5 & 1<=p6]]] | ~ [[[1<=p1 & 1<=p2] & [1<=p7 & 1<=p0]]]] | ~ [[[1<=p5 & 1<=p6] & [1<=p4 & 1<=p6]]]]]]]]]]]
abstracting: (1<=p6)
states: 9,133,640 (6)
abstracting: (1<=p4)
states: 8,569,088 (6)
abstracting: (1<=p6)
states: 9,133,640 (6)
abstracting: (1<=p5)
states: 8,569,088 (6)
abstracting: (1<=p0)
states: 9,133,641 (6)
abstracting: (1<=p7)
states: 8,569,088 (6)
abstracting: (1<=p2)
states: 8,917,656 (6)
abstracting: (1<=p1)
states: 8,569,088 (6)
abstracting: (1<=p6)
states: 9,133,640 (6)
abstracting: (1<=p5)
states: 8,569,088 (6)
abstracting: (1<=p2)
states: 8,917,656 (6)
abstracting: (1<=p1)
states: 8,569,088 (6)
abstracting: (1<=p0)
states: 9,133,641 (6)
abstracting: (1<=p7)
states: 8,569,088 (6)
.
EG iterations: 1
abstracting: (1<=p3)
states: 8,371,616 (6)
abstracting: (1<=p8)
states: 8,371,616 (6)
abstracting: (1<=p6)
states: 9,133,640 (6)
abstracting: (1<=p4)
states: 8,569,088 (6)
abstracting: (1<=p6)
states: 9,133,640 (6)
abstracting: (1<=p5)
states: 8,569,088 (6)
abstracting: (1<=p0)
states: 9,133,641 (6)
abstracting: (1<=p7)
states: 8,569,088 (6)
abstracting: (1<=p2)
states: 8,917,656 (6)
abstracting: (1<=p1)
states: 8,569,088 (6)
abstracting: (1<=p6)
states: 9,133,640 (6)
abstracting: (1<=p5)
states: 8,569,088 (6)
abstracting: (1<=p2)
states: 8,917,656 (6)
abstracting: (1<=p1)
states: 8,569,088 (6)
abstracting: (1<=p0)
states: 9,133,641 (6)
abstracting: (1<=p6)
states: 9,133,640 (6)
abstracting: (1<=p4)
states: 8,569,088 (6)
abstracting: (1<=p6)
states: 9,133,640 (6)
abstracting: (1<=p5)
states: 8,569,088 (6)
abstracting: (1<=p0)
states: 9,133,641 (6)
abstracting: (1<=p7)
states: 8,569,088 (6)
abstracting: (1<=p2)
states: 8,917,656 (6)
abstracting: (1<=p1)
states: 8,569,088 (6)
abstracting: (1<=p6)
states: 9,133,640 (6)
abstracting: (1<=p5)
states: 8,569,088 (6)
abstracting: (1<=p2)
states: 8,917,656 (6)
abstracting: (1<=p1)
states: 8,569,088 (6)
abstracting: (1<=p0)
states: 9,133,641 (6)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.053sec
checking: AG [[~ [E [[[1<=p7 | [1<=p5 & 1<=p6]] & [p4<=0 & [1<=p7 | [1<=p4 | [1<=p4 & 1<=p6]]]]] U E [[[1<=p8 & 1<=p0] & [1<=p2 & 1<=p5]] U 1<=p7]]] & [EF [[[p7<=0 | p0<=0] | [p1<=0 | [p2<=0 | EX [[p5<=0 | p6<=0]]]]]] & [p4<=0 | p6<=0]]]]
normalized: ~ [E [true U ~ [[[[p4<=0 | p6<=0] & E [true U [[p1<=0 | [p2<=0 | EX [[p5<=0 | p6<=0]]]] | [p7<=0 | p0<=0]]]] & ~ [E [[[p4<=0 & [1<=p7 | [1<=p4 | [1<=p4 & 1<=p6]]]] & [1<=p7 | [1<=p5 & 1<=p6]]] U E [[[1<=p2 & 1<=p5] & [1<=p8 & 1<=p0]] U 1<=p7]]]]]]]
abstracting: (1<=p7)
states: 8,569,088 (6)
abstracting: (1<=p0)
states: 9,133,641 (6)
abstracting: (1<=p8)
states: 8,371,616 (6)
abstracting: (1<=p5)
states: 8,569,088 (6)
abstracting: (1<=p2)
states: 8,917,656 (6)
abstracting: (1<=p6)
states: 9,133,640 (6)
abstracting: (1<=p5)
states: 8,569,088 (6)
abstracting: (1<=p7)
states: 8,569,088 (6)
abstracting: (1<=p6)
states: 9,133,640 (6)
abstracting: (1<=p4)
states: 8,569,088 (6)
abstracting: (1<=p4)
states: 8,569,088 (6)
abstracting: (1<=p7)
states: 8,569,088 (6)
abstracting: (p4<=0)
states: 564,553 (5)
abstracting: (p0<=0)
states: 0
abstracting: (p7<=0)
states: 564,553 (5)
abstracting: (p6<=0)
states: 1
abstracting: (p5<=0)
states: 564,553 (5)
.abstracting: (p2<=0)
states: 215,985 (5)
abstracting: (p1<=0)
states: 564,553 (5)
abstracting: (p6<=0)
states: 1
abstracting: (p4<=0)
states: 564,553 (5)
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.032sec
totally nodes used: 99850 (1.0e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 5347832 391740 5739572
used/not used/entry size/cache size: 403242 66705622 16 1024MB
basic ops cache: hits/miss/sum: 1407963 108935 1516898
used/not used/entry size/cache size: 205146 16572070 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: 52267 3965 56232
used/not used/entry size/cache size: 3965 8384643 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 67019845
1 85692
2 1869
3 635
4 147
5 72
6 175
7 158
8 133
9 9
>= 10 129
Total processing time: 0m 6.040sec
BK_STOP 1679231423675
--------------------
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:1128 (141), effective:288 (36)
initing FirstDep: 0m 0.000sec
iterations count:26 (3), effective:6 (0)
iterations count:8 (1), effective:0 (0)
iterations count:104 (13), effective:32 (4)
iterations count:23 (2), effective:5 (0)
iterations count:25 (3), effective:5 (0)
iterations count:104 (13), effective:32 (4)
iterations count:25 (3), effective:5 (0)
iterations count:24 (3), effective:5 (0)
iterations count:45 (5), effective:11 (1)
iterations count:27 (3), effective:7 (0)
iterations count:8 (1), effective:0 (0)
iterations count:26 (3), effective:6 (0)
iterations count:264 (33), effective:64 (8)
iterations count:264 (33), effective:64 (8)
iterations count:360 (45), effective:96 (12)
iterations count:264 (33), effective:64 (8)
iterations count:30 (3), effective:6 (0)
iterations count:8 (1), effective:0 (0)
iterations count:8 (1), effective:0 (0)
iterations count:8 (1), effective:0 (0)
iterations count:8 (1), effective:0 (0)
iterations count:260 (32), effective:63 (7)
iterations count:8 (1), effective:0 (0)
iterations count:392 (49), effective:96 (12)
iterations count:360 (45), effective:96 (12)
iterations count:252 (31), effective:61 (7)
iterations count:40 (5), effective:32 (4)
iterations count:8 (1), effective:0 (0)
iterations count:416 (52), effective:125 (15)
iterations count:104 (13), effective:32 (4)
iterations count:24 (3), effective:5 (0)
iterations count:24 (3), effective:5 (0)
iterations count:39 (4), effective:31 (3)
iterations count:24 (3), effective:5 (0)
iterations count:25 (3), effective:5 (0)
iterations count:8 (1), effective:0 (0)
iterations count:104 (13), effective:32 (4)
iterations count:19 (2), 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="SmallOperatingSystem-PT-MT0064DC0032"
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 SmallOperatingSystem-PT-MT0064DC0032, 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 r458-smll-167912649700034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmallOperatingSystem-PT-MT0064DC0032.tgz
mv SmallOperatingSystem-PT-MT0064DC0032 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 ;