About the Execution of Marcie+red for Kanban-PT-00050
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5712.915 | 26070.00 | 14674.00 | 6558.70 | TFFFTTFTTFTFTTTT | 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.r234-tall-167856420000258.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 Kanban-PT-00050, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420000258
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 5.0K Feb 25 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Feb 25 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 11:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 11:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 11:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 25 11:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14K 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 Kanban-PT-00050-CTLFireability-00
FORMULA_NAME Kanban-PT-00050-CTLFireability-01
FORMULA_NAME Kanban-PT-00050-CTLFireability-02
FORMULA_NAME Kanban-PT-00050-CTLFireability-03
FORMULA_NAME Kanban-PT-00050-CTLFireability-04
FORMULA_NAME Kanban-PT-00050-CTLFireability-05
FORMULA_NAME Kanban-PT-00050-CTLFireability-06
FORMULA_NAME Kanban-PT-00050-CTLFireability-07
FORMULA_NAME Kanban-PT-00050-CTLFireability-08
FORMULA_NAME Kanban-PT-00050-CTLFireability-09
FORMULA_NAME Kanban-PT-00050-CTLFireability-10
FORMULA_NAME Kanban-PT-00050-CTLFireability-11
FORMULA_NAME Kanban-PT-00050-CTLFireability-12
FORMULA_NAME Kanban-PT-00050-CTLFireability-13
FORMULA_NAME Kanban-PT-00050-CTLFireability-14
FORMULA_NAME Kanban-PT-00050-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679466627254
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=Kanban-PT-00050
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 06:30:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 06:30:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:30:28] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2023-03-22 06:30:28] [INFO ] Transformed 16 places.
[2023-03-22 06:30:28] [INFO ] Transformed 16 transitions.
[2023-03-22 06:30:28] [INFO ] Parsed PT model containing 16 places and 16 transitions and 40 arcs in 74 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Kanban-PT-00050-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00050-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 9 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2023-03-22 06:30:28] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-22 06:30:28] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-22 06:30:28] [INFO ] Invariant cache hit.
[2023-03-22 06:30:28] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-22 06:30:28] [INFO ] Invariant cache hit.
[2023-03-22 06:30:28] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 242 ms. Remains : 16/16 places, 16/16 transitions.
Support contains 16 out of 16 places after structural reductions.
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 14 ms
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 5 ms
[2023-03-22 06:30:29] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10010 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 33) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 06:30:29] [INFO ] Invariant cache hit.
[2023-03-22 06:30:29] [INFO ] After 29ms 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 14 simplifications.
[2023-03-22 06:30:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 4 ms
FORMULA Kanban-PT-00050-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:30:29] [INFO ] Input system was already deterministic with 16 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 3 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 16 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 15 transition count 15
Applied a total of 2 rules in 5 ms. Remains 15 /16 variables (removed 1) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 15/16 places, 15/16 transitions.
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 16/16 places, 16/16 transitions.
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 10 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 10 transition count 11
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 10 transition count 11
Applied a total of 5 rules in 5 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 10/16 places, 11/16 transitions.
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Input system was already deterministic with 11 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA Kanban-PT-00050-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 16/16 places, 16/16 transitions.
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 11 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 10 transition count 11
Applied a total of 5 rules in 5 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 10/16 places, 11/16 transitions.
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 0 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Input system was already deterministic with 16 transitions.
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:30:29] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:30:29] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 1 ms.
[2023-03-22 06:30:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 16 places, 16 transitions and 40 arcs took 0 ms.
Total runtime 895 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: 16 NrTr: 16 NrArc: 40)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.697sec
RS generation: 0m 0.138sec
-> reachability set: #nodes 3216 (3.2e+03) #states 10,425,941,194,901,336 (16)
starting MCC model checker
--------------------------
checking: AX [EF [AG [1<=p11]]]
normalized: ~ [EX [~ [E [true U ~ [E [true U ~ [1<=p11]]]]]]]
abstracting: (1<=p11)
states: 9,835,793,580,095,600 (15)
.-> the formula is FALSE
FORMULA Kanban-PT-00050-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.031sec
checking: AF [EG [EF [p12<=0]]]
normalized: ~ [EG [~ [EG [E [true U p12<=0]]]]]
abstracting: (p12<=0)
states: 494,942,954,381,876 (14)
EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE
FORMULA Kanban-PT-00050-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.031sec
checking: EX [AX [E [1<=p2 U EG [p15<=0]]]]
normalized: EX [~ [EX [~ [E [1<=p2 U EG [p15<=0]]]]]]
abstracting: (p15<=0)
states: 494,942,954,381,876 (14)
.
EG iterations: 1
abstracting: (1<=p2)
states: 9,930,998,240,519,460 (15)
..-> the formula is TRUE
FORMULA Kanban-PT-00050-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.091sec
checking: EF [EX [A [[1<=p6 & 1<=p5] U AX [1<=p8]]]]
normalized: E [true U EX [[~ [EG [EX [~ [1<=p8]]]] & ~ [E [EX [~ [1<=p8]] U [~ [[1<=p6 & 1<=p5]] & EX [~ [1<=p8]]]]]]]]
abstracting: (1<=p8)
states: 9,835,793,580,095,600 (15)
.abstracting: (1<=p5)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p6)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p8)
states: 9,835,793,580,095,600 (15)
.abstracting: (1<=p8)
states: 9,835,793,580,095,600 (15)
..
EG iterations: 1
.-> the formula is TRUE
FORMULA Kanban-PT-00050-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.592sec
checking: AF [~ [E [~ [[[E [1<=p1 U 1<=p2] & EF [1<=p1]] | AX [1<=p15]]] U 1<=p8]]]
normalized: ~ [EG [E [~ [[~ [EX [~ [1<=p15]]] | [E [true U 1<=p1] & E [1<=p1 U 1<=p2]]]] U 1<=p8]]]
abstracting: (1<=p8)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p2)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p1)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p1)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p15)
states: 9,930,998,240,519,460 (15)
..
EG iterations: 1
-> the formula is TRUE
FORMULA Kanban-PT-00050-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.075sec
checking: EF [[AX [[p1<=0 & p8<=0]] | [AF [[1<=p15 & 1<=p12]] & [EX [p5<=0] | 1<=p2]]]]
normalized: E [true U [[[1<=p2 | EX [p5<=0]] & ~ [EG [~ [[1<=p15 & 1<=p12]]]]] | ~ [EX [~ [[p1<=0 & p8<=0]]]]]]
abstracting: (p8<=0)
states: 590,147,614,805,736 (14)
abstracting: (p1<=0)
states: 494,942,954,381,876 (14)
.abstracting: (1<=p12)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p15)
states: 9,930,998,240,519,460 (15)
....................................................
EG iterations: 52
abstracting: (p5<=0)
states: 590,147,614,805,736 (14)
.abstracting: (1<=p2)
states: 9,930,998,240,519,460 (15)
-> the formula is TRUE
FORMULA Kanban-PT-00050-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.570sec
checking: [EF [AX [A [AF [1<=p12] U AX [1<=p1]]]] | [EF [[EG [[p8<=0 | p5<=0]] & [p15<=0 & 1<=p12]]] & EX [AX [[[1<=p3 & 1<=p9] & [1<=p14 & 1<=p5]]]]]]
normalized: [[EX [~ [EX [~ [[[1<=p14 & 1<=p5] & [1<=p3 & 1<=p9]]]]]] & E [true U [[p15<=0 & 1<=p12] & EG [[p8<=0 | p5<=0]]]]] | E [true U ~ [EX [~ [[~ [EG [EX [~ [1<=p1]]]] & ~ [E [EX [~ [1<=p1]] U [EG [~ [1<=p12]] & EX [~ [1<=p1]]]]]]]]]]]
abstracting: (1<=p1)
states: 9,930,998,240,519,460 (15)
.abstracting: (1<=p12)
states: 9,930,998,240,519,460 (15)
....................................................
EG iterations: 52
abstracting: (1<=p1)
states: 9,930,998,240,519,460 (15)
.abstracting: (1<=p1)
states: 9,930,998,240,519,460 (15)
..
EG iterations: 1
.abstracting: (p5<=0)
states: 590,147,614,805,736 (14)
abstracting: (p8<=0)
states: 590,147,614,805,736 (14)
.
EG iterations: 1
abstracting: (1<=p12)
states: 9,930,998,240,519,460 (15)
abstracting: (p15<=0)
states: 494,942,954,381,876 (14)
abstracting: (1<=p9)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p3)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p5)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p14)
states: 9,930,998,240,519,460 (15)
..-> the formula is TRUE
FORMULA Kanban-PT-00050-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.415sec
checking: E [A [1<=p4 U ~ [[1<=p10 | EX [EF [1<=p1]]]]] U EF [[EG [[p8<=0 | 1<=p2]] | [1<=p1 & E [AF [[1<=p3 & [1<=p9 & 1<=p14]]] U EF [1<=p1]]]]]]
normalized: E [[~ [EG [[1<=p10 | EX [E [true U 1<=p1]]]]] & ~ [E [[1<=p10 | EX [E [true U 1<=p1]]] U [~ [1<=p4] & [1<=p10 | EX [E [true U 1<=p1]]]]]]] U E [true U [[1<=p1 & E [~ [EG [~ [[1<=p3 & [1<=p9 & 1<=p14]]]]] U E [true U 1<=p1]]] | EG [[p8<=0 | 1<=p2]]]]]
abstracting: (1<=p2)
states: 9,930,998,240,519,460 (15)
abstracting: (p8<=0)
states: 590,147,614,805,736 (14)
....................................................
EG iterations: 52
abstracting: (1<=p1)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p14)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p9)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p3)
states: 9,930,998,240,519,460 (15)
..
EG iterations: 2
abstracting: (1<=p1)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p1)
states: 9,930,998,240,519,460 (15)
.abstracting: (1<=p10)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p4)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p1)
states: 9,930,998,240,519,460 (15)
.abstracting: (1<=p10)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p1)
states: 9,930,998,240,519,460 (15)
.abstracting: (1<=p10)
states: 9,835,793,580,095,600 (15)
EG iterations: 0
-> the formula is TRUE
FORMULA Kanban-PT-00050-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.337sec
checking: A [[1<=p11 | E [EG [[[1<=p0 & 1<=p7] & [1<=p13 & [1<=p12 & p5<=0]]]] U E [1<=p1 U [p1<=0 | [1<=p5 & 1<=p1]]]]] U AG [AF [[AF [1<=p4] | EG [1<=p4]]]]]
normalized: [~ [EG [E [true U EG [~ [[EG [1<=p4] | ~ [EG [~ [1<=p4]]]]]]]]] & ~ [E [E [true U EG [~ [[EG [1<=p4] | ~ [EG [~ [1<=p4]]]]]]] U [~ [[1<=p11 | E [EG [[[1<=p13 & [1<=p12 & p5<=0]] & [1<=p0 & 1<=p7]]] U E [1<=p1 U [p1<=0 | [1<=p5 & 1<=p1]]]]]] & E [true U EG [~ [[EG [1<=p4] | ~ [EG [~ [1<=p4]]]]]]]]]]]
abstracting: (1<=p4)
states: 9,835,793,580,095,600 (15)
....................................................
EG iterations: 52
abstracting: (1<=p4)
states: 9,835,793,580,095,600 (15)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p1)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p5)
states: 9,835,793,580,095,600 (15)
abstracting: (p1<=0)
states: 494,942,954,381,876 (14)
abstracting: (1<=p1)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p7)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p0)
states: 9,461,038,929,509,960 (15)
abstracting: (p5<=0)
states: 590,147,614,805,736 (14)
abstracting: (1<=p12)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p13)
states: 9,461,038,929,509,960 (15)
....................................................
EG iterations: 52
abstracting: (1<=p11)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p4)
states: 9,835,793,580,095,600 (15)
....................................................
EG iterations: 52
abstracting: (1<=p4)
states: 9,835,793,580,095,600 (15)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p4)
states: 9,835,793,580,095,600 (15)
....................................................
EG iterations: 52
abstracting: (1<=p4)
states: 9,835,793,580,095,600 (15)
.
EG iterations: 1
.
EG iterations: 1
EG iterations: 0
-> the formula is FALSE
FORMULA Kanban-PT-00050-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.323sec
checking: E [1<=p15 U [AF [EX [EX [1<=p1]]] & [1<=p15 | ~ [[[[[1<=p3 & [1<=p9 & 1<=p14]] | 1<=p15] & A [1<=p4 U 1<=p5]] | [AG [1<=p15] & [[1<=p0 & [1<=p7 & 1<=p13]] | 1<=p5]]]]]]]
normalized: E [1<=p15 U [[1<=p15 | ~ [[[[1<=p5 | [1<=p0 & [1<=p7 & 1<=p13]]] & ~ [E [true U ~ [1<=p15]]]] | [[~ [EG [~ [1<=p5]]] & ~ [E [~ [1<=p5] U [~ [1<=p4] & ~ [1<=p5]]]]] & [1<=p15 | [1<=p3 & [1<=p9 & 1<=p14]]]]]]] & ~ [EG [~ [EX [EX [1<=p1]]]]]]]
abstracting: (1<=p1)
states: 9,930,998,240,519,460 (15)
......................................................
EG iterations: 52
abstracting: (1<=p14)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p9)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p3)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p15)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p5)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p4)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p5)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p5)
states: 9,835,793,580,095,600 (15)
....................................................
EG iterations: 52
abstracting: (1<=p15)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p13)
states: 9,461,038,929,509,960 (15)
abstracting: (1<=p7)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p0)
states: 9,461,038,929,509,960 (15)
abstracting: (1<=p5)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p15)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p15)
states: 9,930,998,240,519,460 (15)
-> the formula is TRUE
FORMULA Kanban-PT-00050-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.116sec
checking: EF [[[~ [E [[[[EX [1<=p15] | E [1<=p6 U 1<=p2]] & [1<=p5 & 1<=p3]] & [1<=p9 & [1<=p14 & 1<=p5]]] U 1<=p2]] & 1<=p2] & [p4<=0 & [[~ [E [1<=p5 U 1<=p5]] & 1<=p5] | [A [1<=p2 U 1<=p8] & [1<=p1 | 1<=p5]]]]]]
normalized: E [true U [[p4<=0 & [[[1<=p1 | 1<=p5] & [~ [EG [~ [1<=p8]]] & ~ [E [~ [1<=p8] U [~ [1<=p2] & ~ [1<=p8]]]]]] | [1<=p5 & ~ [E [1<=p5 U 1<=p5]]]]] & [1<=p2 & ~ [E [[[1<=p9 & [1<=p14 & 1<=p5]] & [[1<=p5 & 1<=p3] & [E [1<=p6 U 1<=p2] | EX [1<=p15]]]] U 1<=p2]]]]]
abstracting: (1<=p2)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p15)
states: 9,930,998,240,519,460 (15)
.abstracting: (1<=p2)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p6)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p3)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p5)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p5)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p14)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p9)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p2)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p5)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p5)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p5)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p8)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p2)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p8)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p8)
states: 9,835,793,580,095,600 (15)
....................................................
EG iterations: 52
abstracting: (1<=p5)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p1)
states: 9,930,998,240,519,460 (15)
abstracting: (p4<=0)
states: 590,147,614,805,736 (14)
-> the formula is FALSE
FORMULA Kanban-PT-00050-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.241sec
checking: [E [A [[EG [1<=p15] & AG [[1<=p1 | [1<=p3 & [1<=p9 & 1<=p14]]]]] U AX [EG [[1<=p0 & [1<=p7 & 1<=p13]]]]] U AG [1<=p8]] & [AF [[[p4<=0 | E [p5<=0 U p8<=0]] & AF [[A [1<=p4 U 1<=p4] | [1<=p8 | [1<=p3 & [1<=p9 & 1<=p14]]]]]]] | [EG [1<=p15] & EG [EF [1<=p6]]]]]
normalized: [[[EG [E [true U 1<=p6]] & EG [1<=p15]] | ~ [EG [~ [[~ [EG [~ [[[1<=p8 | [1<=p3 & [1<=p9 & 1<=p14]]] | [~ [EG [~ [1<=p4]]] & ~ [E [~ [1<=p4] U [~ [1<=p4] & ~ [1<=p4]]]]]]]]] & [p4<=0 | E [p5<=0 U p8<=0]]]]]]] & E [[~ [EG [EX [~ [EG [[1<=p0 & [1<=p7 & 1<=p13]]]]]]] & ~ [E [EX [~ [EG [[1<=p0 & [1<=p7 & 1<=p13]]]]] U [~ [[~ [E [true U ~ [[1<=p1 | [1<=p3 & [1<=p9 & 1<=p14]]]]]] & EG [1<=p15]]] & EX [~ [EG [[1<=p0 & [1<=p7 & 1<=p13]]]]]]]]] U ~ [E [true U ~ [1<=p8]]]]]
abstracting: (1<=p8)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p13)
states: 9,461,038,929,509,960 (15)
abstracting: (1<=p7)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p0)
states: 9,461,038,929,509,960 (15)
.
EG iterations: 1
.abstracting: (1<=p15)
states: 9,930,998,240,519,460 (15)
.
EG iterations: 1
abstracting: (1<=p14)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p9)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p3)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p1)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p13)
states: 9,461,038,929,509,960 (15)
abstracting: (1<=p7)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p0)
states: 9,461,038,929,509,960 (15)
.
EG iterations: 1
.abstracting: (1<=p13)
states: 9,461,038,929,509,960 (15)
abstracting: (1<=p7)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p0)
states: 9,461,038,929,509,960 (15)
.
EG iterations: 1
..
EG iterations: 1
abstracting: (p8<=0)
states: 590,147,614,805,736 (14)
abstracting: (p5<=0)
states: 590,147,614,805,736 (14)
abstracting: (p4<=0)
states: 590,147,614,805,736 (14)
abstracting: (1<=p4)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p4)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p4)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p4)
states: 9,835,793,580,095,600 (15)
....................................................
EG iterations: 52
abstracting: (1<=p14)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p9)
states: 9,835,793,580,095,600 (15)
abstracting: (1<=p3)
states: 9,930,998,240,519,460 (15)
abstracting: (1<=p8)
states: 9,835,793,580,095,600 (15)
....................................................
EG iterations: 52
.
EG iterations: 1
abstracting: (1<=p15)
states: 9,930,998,240,519,460 (15)
.
EG iterations: 1
abstracting: (1<=p6)
states: 9,835,793,580,095,600 (15)
EG iterations: 0
-> the formula is FALSE
FORMULA Kanban-PT-00050-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.453sec
totally nodes used: 1531780 (1.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 20881533 3558163 24439696
used/not used/entry size/cache size: 4833356 62275508 16 1024MB
basic ops cache: hits/miss/sum: 6900879 1603203 8504082
used/not used/entry size/cache size: 2218838 14558378 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: 122486 32555 155041
used/not used/entry size/cache size: 32514 8356094 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 65622714
1 1459658
2 23998
3 1262
4 374
5 198
6 105
7 11
8 52
9 57
>= 10 435
Total processing time: 0m10.887sec
BK_STOP 1679466653324
--------------------
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:3566 (222), effective:1100 (68)
initing FirstDep: 0m 0.000sec
iterations count:216 (13), effective:50 (3)
iterations count:116 (7), effective:50 (3)
iterations count:166 (10), effective:50 (3)
iterations count:65 (4), effective:49 (3)
iterations count:1850 (115), effective:609 (38)
iterations count:18 (1), effective:1 (0)
iterations count:54 (3), effective:11 (0)
iterations count:35 (2), effective:5 (0)
iterations count:1081 (67), effective:370 (23)
iterations count:129 (8), effective:53 (3)
iterations count:197 (12), effective:51 (3)
iterations count:250 (15), effective:110 (6)
iterations count:54 (3), effective:11 (0)
iterations count:16 (1), effective:0 (0)
iterations count:53 (3), effective:10 (0)
iterations count:54 (3), effective:11 (0)
iterations count:54 (3), effective:11 (0)
iterations count:166 (10), effective:50 (3)
iterations count:54 (3), effective:11 (0)
iterations count:16 (1), effective:0 (0)
iterations count:172 (10), effective:51 (3)
iterations count:121 (7), effective:52 (3)
iterations count:16 (1), effective:0 (0)
iterations count:172 (10), effective:51 (3)
iterations count:172 (10), effective:51 (3)
iterations count:16 (1), effective:0 (0)
iterations count:166 (10), effective:50 (3)
iterations count:45 (2), effective:10 (0)
iterations count:55 (3), effective:11 (0)
iterations count:55 (3), effective:11 (0)
iterations count:16 (1), effective:0 (0)
iterations count:66 (4), effective:50 (3)
iterations count:166 (10), effective:50 (3)
iterations count:466 (29), effective:100 (6)
iterations count:16 (1), effective:0 (0)
iterations count:166 (10), effective:50 (3)
iterations count:16 (1), effective:0 (0)
iterations count:52 (3), effective:11 (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="Kanban-PT-00050"
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 Kanban-PT-00050, 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 r234-tall-167856420000258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-00050.tgz
mv Kanban-PT-00050 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 ;