About the Execution of Marcie+red for RefineWMG-PT-002002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5450.168 | 8261.00 | 10843.00 | 334.70 | TTFFFFTTTFFFFFFF | 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.r330-tall-167889203400530.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 RefineWMG-PT-002002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203400530
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 6.6K Feb 26 15:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 15:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 15:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 15:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 15:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 15:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 26 15:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.9K 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 RefineWMG-PT-002002-CTLFireability-00
FORMULA_NAME RefineWMG-PT-002002-CTLFireability-01
FORMULA_NAME RefineWMG-PT-002002-CTLFireability-02
FORMULA_NAME RefineWMG-PT-002002-CTLFireability-03
FORMULA_NAME RefineWMG-PT-002002-CTLFireability-04
FORMULA_NAME RefineWMG-PT-002002-CTLFireability-05
FORMULA_NAME RefineWMG-PT-002002-CTLFireability-06
FORMULA_NAME RefineWMG-PT-002002-CTLFireability-07
FORMULA_NAME RefineWMG-PT-002002-CTLFireability-08
FORMULA_NAME RefineWMG-PT-002002-CTLFireability-09
FORMULA_NAME RefineWMG-PT-002002-CTLFireability-10
FORMULA_NAME RefineWMG-PT-002002-CTLFireability-11
FORMULA_NAME RefineWMG-PT-002002-CTLFireability-12
FORMULA_NAME RefineWMG-PT-002002-CTLFireability-13
FORMULA_NAME RefineWMG-PT-002002-CTLFireability-14
FORMULA_NAME RefineWMG-PT-002002-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679169776565
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=RefineWMG-PT-002002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 20:02:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 20:02:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:02:58] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-03-18 20:02:58] [INFO ] Transformed 14 places.
[2023-03-18 20:02:58] [INFO ] Transformed 11 transitions.
[2023-03-18 20:02:58] [INFO ] Parsed PT model containing 14 places and 11 transitions and 32 arcs in 77 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Initial state reduction rules removed 1 formulas.
FORMULA RefineWMG-PT-002002-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 9 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-18 20:02:58] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-18 20:02:58] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
[2023-03-18 20:02:58] [INFO ] Invariant cache hit.
[2023-03-18 20:02:58] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-18 20:02:58] [INFO ] Invariant cache hit.
[2023-03-18 20:02:58] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-18 20:02:58] [INFO ] Invariant cache hit.
[2023-03-18 20:02:58] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 14/14 places, 11/11 transitions.
Support contains 14 out of 14 places after structural reductions.
[2023-03-18 20:02:58] [INFO ] Flatten gal took : 14 ms
[2023-03-18 20:02:58] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:02:58] [INFO ] Input system was already deterministic with 11 transitions.
Finished random walk after 137 steps, including 0 resets, run visited all 25 properties in 21 ms. (steps per millisecond=6 )
[2023-03-18 20:02:58] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:02:58] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:02:58] [INFO ] Input system was already deterministic with 11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-18 20:02:58] [INFO ] Invariant cache hit.
[2023-03-18 20:02:58] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 14/14 places, 11/11 transitions.
[2023-03-18 20:02:58] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:02:58] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:02:58] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-18 20:02:58] [INFO ] Invariant cache hit.
[2023-03-18 20:02:59] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 14/14 places, 11/11 transitions.
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:02:59] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-18 20:02:59] [INFO ] Invariant cache hit.
[2023-03-18 20:02:59] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 14/14 places, 11/11 transitions.
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:02:59] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-18 20:02:59] [INFO ] Invariant cache hit.
[2023-03-18 20:02:59] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 14/14 places, 11/11 transitions.
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:02:59] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Graph (trivial) has 3 edges and 14 vertex of which 2 / 14 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 10 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 4 place count 10 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 9 transition count 8
Applied a total of 6 rules in 8 ms. Remains 9 /14 variables (removed 5) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-18 20:02:59] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-18 20:02:59] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 9/14 places, 8/11 transitions.
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:02:59] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-18 20:02:59] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-18 20:02:59] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 14/14 places, 11/11 transitions.
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:02:59] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-18 20:02:59] [INFO ] Invariant cache hit.
[2023-03-18 20:02:59] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 14/14 places, 11/11 transitions.
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:02:59] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-18 20:02:59] [INFO ] Invariant cache hit.
[2023-03-18 20:02:59] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 14/14 places, 11/11 transitions.
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:02:59] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 10 transition count 9
Applied a total of 6 rules in 2 ms. Remains 10 /14 variables (removed 4) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-18 20:02:59] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 20:02:59] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 10/14 places, 9/11 transitions.
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:02:59] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-18 20:02:59] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-18 20:02:59] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 14/14 places, 11/11 transitions.
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:02:59] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Graph (trivial) has 4 edges and 14 vertex of which 2 / 14 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.
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 7 transition count 7
Applied a total of 9 rules in 2 ms. Remains 7 /14 variables (removed 7) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-18 20:02:59] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-18 20:02:59] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 7/14 places, 7/11 transitions.
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:02:59] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
FORMULA RefineWMG-PT-002002-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 12 transition count 10
Applied a total of 3 rules in 1 ms. Remains 12 /14 variables (removed 2) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-18 20:02:59] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 20:02:59] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 12/14 places, 10/11 transitions.
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:02:59] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-18 20:02:59] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-18 20:02:59] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 14/14 places, 11/11 transitions.
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:02:59] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-18 20:02:59] [INFO ] Invariant cache hit.
[2023-03-18 20:02:59] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 14/14 places, 11/11 transitions.
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:02:59] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-18 20:02:59] [INFO ] Invariant cache hit.
[2023-03-18 20:02:59] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 14/14 places, 11/11 transitions.
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:02:59] [INFO ] Input system was already deterministic with 11 transitions.
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:02:59] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:02:59] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-18 20:02:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 14 places, 11 transitions and 32 arcs took 1 ms.
Total runtime 1306 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: 14 NrTr: 11 NrArc: 32)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.722sec
RS generation: 0m 0.001sec
-> reachability set: #nodes 104 (1.0e+02) #states 58,320 (4)
starting MCC model checker
--------------------------
checking: EX [AX [p8<=0]]
normalized: EX [~ [EX [~ [p8<=0]]]]
abstracting: (p8<=0)
states: 19,440 (4)
..-> the formula is FALSE
FORMULA RefineWMG-PT-002002-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AF [[EG [EF [p13<=0]] | 1<=p8]]
normalized: ~ [EG [~ [[EG [E [true U p13<=0]] | 1<=p8]]]]
abstracting: (1<=p8)
states: 38,880 (4)
abstracting: (p13<=0)
states: 19,440 (4)
EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE
FORMULA RefineWMG-PT-002002-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [AX [1<=p8] & EG [1<=p12]]
normalized: [EG [1<=p12] & ~ [EX [~ [1<=p8]]]]
abstracting: (1<=p8)
states: 38,880 (4)
.abstracting: (1<=p12)
states: 38,880 (4)
.
EG iterations: 1
-> the formula is FALSE
FORMULA RefineWMG-PT-002002-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [AG [A [[1<=p5 | 1<=p7] U 1<=p8]]]
normalized: E [true U ~ [E [true U ~ [[~ [EG [~ [1<=p8]]] & ~ [E [~ [1<=p8] U [~ [[1<=p5 | 1<=p7]] & ~ [1<=p8]]]]]]]]]
abstracting: (1<=p8)
states: 38,880 (4)
abstracting: (1<=p7)
states: 38,880 (4)
abstracting: (1<=p5)
states: 38,880 (4)
abstracting: (1<=p8)
states: 38,880 (4)
abstracting: (1<=p8)
states: 38,880 (4)
.
EG iterations: 1
-> the formula is FALSE
FORMULA RefineWMG-PT-002002-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EX [AG [[EX [[2<=p1 & 2<=p2]] | AF [[p1<=1 | p2<=1]]]]]
normalized: EX [~ [E [true U ~ [[~ [EG [~ [[p1<=1 | p2<=1]]]] | EX [[2<=p1 & 2<=p2]]]]]]]
abstracting: (2<=p2)
states: 38,880 (4)
abstracting: (2<=p1)
states: 27,216 (4)
.abstracting: (p2<=1)
states: 19,440 (4)
abstracting: (p1<=1)
states: 31,104 (4)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA RefineWMG-PT-002002-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[EX [AF [5<=p4]] | [AF [[2<=p1 & 2<=p2]] & [EF [5<=p4] & 3<=p3]]]]
normalized: E [true U [[[E [true U 5<=p4] & 3<=p3] & ~ [EG [~ [[2<=p1 & 2<=p2]]]]] | EX [~ [EG [~ [5<=p4]]]]]]
abstracting: (5<=p4)
states: 4,860 (3)
.
EG iterations: 1
.abstracting: (2<=p2)
states: 38,880 (4)
abstracting: (2<=p1)
states: 27,216 (4)
.
EG iterations: 1
abstracting: (3<=p3)
states: 29,160 (4)
abstracting: (5<=p4)
states: 4,860 (3)
-> the formula is TRUE
FORMULA RefineWMG-PT-002002-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AF [AG [EX [[A [[1<=p6 & [1<=p7 & 1<=p9]] U [2<=p1 & 2<=p2]] | EF [[1<=p6 & [1<=p7 & 1<=p9]]]]]]]
normalized: ~ [EG [E [true U ~ [EX [[E [true U [[1<=p7 & 1<=p9] & 1<=p6]] | [~ [EG [~ [[2<=p1 & 2<=p2]]]] & ~ [E [~ [[2<=p1 & 2<=p2]] U [~ [[[1<=p7 & 1<=p9] & 1<=p6]] & ~ [[2<=p1 & 2<=p2]]]]]]]]]]]]
abstracting: (2<=p2)
states: 38,880 (4)
abstracting: (2<=p1)
states: 27,216 (4)
abstracting: (1<=p6)
states: 38,880 (4)
abstracting: (1<=p9)
states: 40,824 (4)
abstracting: (1<=p7)
states: 38,880 (4)
abstracting: (2<=p2)
states: 38,880 (4)
abstracting: (2<=p1)
states: 27,216 (4)
abstracting: (2<=p2)
states: 38,880 (4)
abstracting: (2<=p1)
states: 27,216 (4)
.
EG iterations: 1
abstracting: (1<=p6)
states: 38,880 (4)
abstracting: (1<=p9)
states: 40,824 (4)
abstracting: (1<=p7)
states: 38,880 (4)
..
EG iterations: 1
-> the formula is TRUE
FORMULA RefineWMG-PT-002002-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AX [[E [~ [[[1<=p0 & 1<=p11] & [1<=p12 & [AG [3<=p3] & 1<=p13]]]] U EF [p12<=0]] & AF [E [~ [[1<=p12 & 3<=p3]] U AX [3<=p3]]]]]
normalized: ~ [EX [~ [[~ [EG [~ [E [~ [[1<=p12 & 3<=p3]] U ~ [EX [~ [3<=p3]]]]]]] & E [~ [[[[~ [E [true U ~ [3<=p3]]] & 1<=p13] & 1<=p12] & [1<=p0 & 1<=p11]]] U E [true U p12<=0]]]]]]
abstracting: (p12<=0)
states: 19,440 (4)
abstracting: (1<=p11)
states: 38,880 (4)
abstracting: (1<=p0)
states: 40,824 (4)
abstracting: (1<=p12)
states: 38,880 (4)
abstracting: (1<=p13)
states: 38,880 (4)
abstracting: (3<=p3)
states: 29,160 (4)
abstracting: (3<=p3)
states: 29,160 (4)
.abstracting: (3<=p3)
states: 29,160 (4)
abstracting: (1<=p12)
states: 38,880 (4)
EG iterations: 0
.-> the formula is FALSE
FORMULA RefineWMG-PT-002002-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [E [~ [[A [[[1<=p6 & [1<=p7 & 1<=p9]] | 1<=p13] U [1<=p10 & 1<=p5]] & ~ [EF [[2<=p1 & 2<=p2]]]]] U AG [1<=p7]]]
normalized: ~ [E [true U ~ [E [~ [[~ [E [true U [2<=p1 & 2<=p2]]] & [~ [EG [~ [[1<=p10 & 1<=p5]]]] & ~ [E [~ [[1<=p10 & 1<=p5]] U [~ [[[[1<=p7 & 1<=p9] & 1<=p6] | 1<=p13]] & ~ [[1<=p10 & 1<=p5]]]]]]]] U ~ [E [true U ~ [1<=p7]]]]]]]
abstracting: (1<=p7)
states: 38,880 (4)
abstracting: (1<=p5)
states: 38,880 (4)
abstracting: (1<=p10)
states: 38,880 (4)
abstracting: (1<=p13)
states: 38,880 (4)
abstracting: (1<=p6)
states: 38,880 (4)
abstracting: (1<=p9)
states: 40,824 (4)
abstracting: (1<=p7)
states: 38,880 (4)
abstracting: (1<=p5)
states: 38,880 (4)
abstracting: (1<=p10)
states: 38,880 (4)
abstracting: (1<=p5)
states: 38,880 (4)
abstracting: (1<=p10)
states: 38,880 (4)
.
EG iterations: 1
abstracting: (2<=p2)
states: 38,880 (4)
abstracting: (2<=p1)
states: 27,216 (4)
-> the formula is FALSE
FORMULA RefineWMG-PT-002002-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[2<=p1 & [2<=p2 & [EG [EF [5<=p4]] | [AF [p13<=0] & [E [1<=p12 U 1<=p12] | [[3<=p3 & 1<=p6] & [1<=p7 & 1<=p9]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[1<=p7 & 1<=p9] & [3<=p3 & 1<=p6]] | E [1<=p12 U 1<=p12]] & ~ [EG [~ [p13<=0]]]] | EG [E [true U 5<=p4]]] & 2<=p2] & 2<=p1]]]]
abstracting: (2<=p1)
states: 27,216 (4)
abstracting: (2<=p2)
states: 38,880 (4)
abstracting: (5<=p4)
states: 4,860 (3)
EG iterations: 0
abstracting: (p13<=0)
states: 19,440 (4)
.
EG iterations: 1
abstracting: (1<=p12)
states: 38,880 (4)
abstracting: (1<=p12)
states: 38,880 (4)
abstracting: (1<=p6)
states: 38,880 (4)
abstracting: (3<=p3)
states: 29,160 (4)
abstracting: (1<=p9)
states: 40,824 (4)
abstracting: (1<=p7)
states: 38,880 (4)
-> the formula is FALSE
FORMULA RefineWMG-PT-002002-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[AX [EG [[2<=p1 & 2<=p2]]] & A [[~ [[AF [1<=p12] & AX [1<=p12]]] & [EF [[1<=p6 & [1<=p7 & 1<=p9]]] | [[[[1<=p0 & [1<=p11 & 1<=p12]] | 5<=p4] & 1<=p6] & [1<=p7 & 1<=p9]]]] U p10<=0]]]
normalized: ~ [E [true U ~ [[[~ [EG [~ [p10<=0]]] & ~ [E [~ [p10<=0] U [~ [[[[[1<=p7 & 1<=p9] & [[[[1<=p11 & 1<=p12] & 1<=p0] | 5<=p4] & 1<=p6]] | E [true U [[1<=p7 & 1<=p9] & 1<=p6]]] & ~ [[~ [EX [~ [1<=p12]]] & ~ [EG [~ [1<=p12]]]]]]] & ~ [p10<=0]]]]] & ~ [EX [~ [EG [[2<=p1 & 2<=p2]]]]]]]]]
abstracting: (2<=p2)
states: 38,880 (4)
abstracting: (2<=p1)
states: 27,216 (4)
.
EG iterations: 1
.abstracting: (p10<=0)
states: 19,440 (4)
abstracting: (1<=p12)
states: 38,880 (4)
.
EG iterations: 1
abstracting: (1<=p12)
states: 38,880 (4)
.abstracting: (1<=p6)
states: 38,880 (4)
abstracting: (1<=p9)
states: 40,824 (4)
abstracting: (1<=p7)
states: 38,880 (4)
abstracting: (1<=p6)
states: 38,880 (4)
abstracting: (5<=p4)
states: 4,860 (3)
abstracting: (1<=p0)
states: 40,824 (4)
abstracting: (1<=p12)
states: 38,880 (4)
abstracting: (1<=p11)
states: 38,880 (4)
abstracting: (1<=p9)
states: 40,824 (4)
abstracting: (1<=p7)
states: 38,880 (4)
abstracting: (p10<=0)
states: 19,440 (4)
abstracting: (p10<=0)
states: 19,440 (4)
.
EG iterations: 1
-> the formula is FALSE
FORMULA RefineWMG-PT-002002-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[EF [[[~ [A [1<=p5 U 1<=p5]] | 1<=p7] | [p1<=1 | p2<=1]]] & [E [~ [EF [1<=p8]] U [[~ [[[1<=p0 & 1<=p11] & [1<=p12 & 3<=p3]]] & 2<=p1] & [2<=p2 & AX [1<=p5]]]] | EX [[1<=p7 & A [1<=p8 U 1<=p8]]]]]]
normalized: ~ [E [true U ~ [[[EX [[[~ [EG [~ [1<=p8]]] & ~ [E [~ [1<=p8] U [~ [1<=p8] & ~ [1<=p8]]]]] & 1<=p7]] | E [~ [E [true U 1<=p8]] U [[~ [EX [~ [1<=p5]]] & 2<=p2] & [~ [[[1<=p12 & 3<=p3] & [1<=p0 & 1<=p11]]] & 2<=p1]]]] & E [true U [[p1<=1 | p2<=1] | [~ [[~ [EG [~ [1<=p5]]] & ~ [E [~ [1<=p5] U [~ [1<=p5] & ~ [1<=p5]]]]]] | 1<=p7]]]]]]]
abstracting: (1<=p7)
states: 38,880 (4)
abstracting: (1<=p5)
states: 38,880 (4)
abstracting: (1<=p5)
states: 38,880 (4)
abstracting: (1<=p5)
states: 38,880 (4)
abstracting: (1<=p5)
states: 38,880 (4)
.
EG iterations: 1
abstracting: (p2<=1)
states: 19,440 (4)
abstracting: (p1<=1)
states: 31,104 (4)
abstracting: (2<=p1)
states: 27,216 (4)
abstracting: (1<=p11)
states: 38,880 (4)
abstracting: (1<=p0)
states: 40,824 (4)
abstracting: (3<=p3)
states: 29,160 (4)
abstracting: (1<=p12)
states: 38,880 (4)
abstracting: (2<=p2)
states: 38,880 (4)
abstracting: (1<=p5)
states: 38,880 (4)
.abstracting: (1<=p8)
states: 38,880 (4)
abstracting: (1<=p7)
states: 38,880 (4)
abstracting: (1<=p8)
states: 38,880 (4)
abstracting: (1<=p8)
states: 38,880 (4)
abstracting: (1<=p8)
states: 38,880 (4)
abstracting: (1<=p8)
states: 38,880 (4)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA RefineWMG-PT-002002-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: E [AF [[E [[AF [1<=p10] | [1<=p12 | 1<=p7]] U [p3<=2 & EX [1<=p12]]] & [~ [EG [1<=p8]] | [~ [[[1<=p6 & [1<=p7 & 1<=p9]] | [1<=p0 & [1<=p11 & 1<=p12]]]] & [p13<=0 | [1<=p10 | 5<=p4]]]]]] U EG [[AX [[[AX [1<=p8] & 1<=p0] & [1<=p11 & 1<=p12]]] & EG [[2<=p1 & 2<=p2]]]]]
normalized: E [~ [EG [~ [[[[[[1<=p10 | 5<=p4] | p13<=0] & ~ [[[[1<=p11 & 1<=p12] & 1<=p0] | [[1<=p7 & 1<=p9] & 1<=p6]]]] | ~ [EG [1<=p8]]] & E [[[1<=p12 | 1<=p7] | ~ [EG [~ [1<=p10]]]] U [EX [1<=p12] & p3<=2]]]]]] U EG [[EG [[2<=p1 & 2<=p2]] & ~ [EX [~ [[[1<=p11 & 1<=p12] & [~ [EX [~ [1<=p8]]] & 1<=p0]]]]]]]]
abstracting: (1<=p0)
states: 40,824 (4)
abstracting: (1<=p8)
states: 38,880 (4)
.abstracting: (1<=p12)
states: 38,880 (4)
abstracting: (1<=p11)
states: 38,880 (4)
.abstracting: (2<=p2)
states: 38,880 (4)
abstracting: (2<=p1)
states: 27,216 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p3<=2)
states: 29,160 (4)
abstracting: (1<=p12)
states: 38,880 (4)
.abstracting: (1<=p10)
states: 38,880 (4)
.
EG iterations: 1
abstracting: (1<=p7)
states: 38,880 (4)
abstracting: (1<=p12)
states: 38,880 (4)
abstracting: (1<=p8)
states: 38,880 (4)
.
EG iterations: 1
abstracting: (1<=p6)
states: 38,880 (4)
abstracting: (1<=p9)
states: 40,824 (4)
abstracting: (1<=p7)
states: 38,880 (4)
abstracting: (1<=p0)
states: 40,824 (4)
abstracting: (1<=p12)
states: 38,880 (4)
abstracting: (1<=p11)
states: 38,880 (4)
abstracting: (p13<=0)
states: 19,440 (4)
abstracting: (5<=p4)
states: 4,860 (3)
abstracting: (1<=p10)
states: 38,880 (4)
.
EG iterations: 1
-> the formula is FALSE
FORMULA RefineWMG-PT-002002-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: A [EF [[1<=p12 | ~ [[[E [[1<=p0 & [1<=p11 & 1<=p12]] U [1<=p6 & [1<=p7 & 1<=p9]]] & EX [[1<=p0 & [1<=p11 & 1<=p12]]]] | [[1<=p6 & [1<=p7 & 1<=p9]] & [[1<=p6 & 1<=p7] & [1<=p9 & 5<=p4]]]]]]] U EF [EG [[AX [[1<=p6 & [1<=p7 & 1<=p9]]] & ~ [A [[1<=p6 & [1<=p7 & 1<=p9]] U 1<=p12]]]]]]
normalized: [~ [EG [~ [E [true U EG [[~ [[~ [EG [~ [1<=p12]]] & ~ [E [~ [1<=p12] U [~ [[[1<=p7 & 1<=p9] & 1<=p6]] & ~ [1<=p12]]]]]] & ~ [EX [~ [[[1<=p7 & 1<=p9] & 1<=p6]]]]]]]]]] & ~ [E [~ [E [true U EG [[~ [[~ [EG [~ [1<=p12]]] & ~ [E [~ [1<=p12] U [~ [[[1<=p7 & 1<=p9] & 1<=p6]] & ~ [1<=p12]]]]]] & ~ [EX [~ [[[1<=p7 & 1<=p9] & 1<=p6]]]]]]]] U [~ [E [true U [~ [[[[[1<=p9 & 5<=p4] & [1<=p6 & 1<=p7]] & [[1<=p7 & 1<=p9] & 1<=p6]] | [EX [[[1<=p11 & 1<=p12] & 1<=p0]] & E [[[1<=p11 & 1<=p12] & 1<=p0] U [[1<=p7 & 1<=p9] & 1<=p6]]]]] | 1<=p12]]] & ~ [E [true U EG [[~ [[~ [EG [~ [1<=p12]]] & ~ [E [~ [1<=p12] U [~ [[[1<=p7 & 1<=p9] & 1<=p6]] & ~ [1<=p12]]]]]] & ~ [EX [~ [[[1<=p7 & 1<=p9] & 1<=p6]]]]]]]]]]]]
abstracting: (1<=p6)
states: 38,880 (4)
abstracting: (1<=p9)
states: 40,824 (4)
abstracting: (1<=p7)
states: 38,880 (4)
.abstracting: (1<=p12)
states: 38,880 (4)
abstracting: (1<=p6)
states: 38,880 (4)
abstracting: (1<=p9)
states: 40,824 (4)
abstracting: (1<=p7)
states: 38,880 (4)
abstracting: (1<=p12)
states: 38,880 (4)
abstracting: (1<=p12)
states: 38,880 (4)
.
EG iterations: 1
..........
EG iterations: 10
abstracting: (1<=p12)
states: 38,880 (4)
abstracting: (1<=p6)
states: 38,880 (4)
abstracting: (1<=p9)
states: 40,824 (4)
abstracting: (1<=p7)
states: 38,880 (4)
abstracting: (1<=p0)
states: 40,824 (4)
abstracting: (1<=p12)
states: 38,880 (4)
abstracting: (1<=p11)
states: 38,880 (4)
abstracting: (1<=p0)
states: 40,824 (4)
abstracting: (1<=p12)
states: 38,880 (4)
abstracting: (1<=p11)
states: 38,880 (4)
.abstracting: (1<=p6)
states: 38,880 (4)
abstracting: (1<=p9)
states: 40,824 (4)
abstracting: (1<=p7)
states: 38,880 (4)
abstracting: (1<=p7)
states: 38,880 (4)
abstracting: (1<=p6)
states: 38,880 (4)
abstracting: (5<=p4)
states: 4,860 (3)
abstracting: (1<=p9)
states: 40,824 (4)
abstracting: (1<=p6)
states: 38,880 (4)
abstracting: (1<=p9)
states: 40,824 (4)
abstracting: (1<=p7)
states: 38,880 (4)
.abstracting: (1<=p12)
states: 38,880 (4)
abstracting: (1<=p6)
states: 38,880 (4)
abstracting: (1<=p9)
states: 40,824 (4)
abstracting: (1<=p7)
states: 38,880 (4)
abstracting: (1<=p12)
states: 38,880 (4)
abstracting: (1<=p12)
states: 38,880 (4)
.
EG iterations: 1
..........
EG iterations: 10
abstracting: (1<=p6)
states: 38,880 (4)
abstracting: (1<=p9)
states: 40,824 (4)
abstracting: (1<=p7)
states: 38,880 (4)
.abstracting: (1<=p12)
states: 38,880 (4)
abstracting: (1<=p6)
states: 38,880 (4)
abstracting: (1<=p9)
states: 40,824 (4)
abstracting: (1<=p7)
states: 38,880 (4)
abstracting: (1<=p12)
states: 38,880 (4)
abstracting: (1<=p12)
states: 38,880 (4)
.
EG iterations: 1
..........
EG iterations: 10
EG iterations: 0
-> the formula is FALSE
FORMULA RefineWMG-PT-002002-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
totally nodes used: 11473 (1.1e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 29934 25561 55495
used/not used/entry size/cache size: 33188 67075676 16 1024MB
basic ops cache: hits/miss/sum: 14576 12516 27092
used/not used/entry size/cache size: 23788 16753428 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: 1297 1012 2309
used/not used/entry size/cache size: 1012 8387596 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 67098149
1 10298
2 293
3 81
4 19
5 4
6 3
7 0
8 1
9 6
>= 10 10
Total processing time: 0m 4.320sec
BK_STOP 1679169784826
--------------------
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:577 (52), effective:244 (22)
initing FirstDep: 0m 0.000sec
iterations count:13 (1), effective:2 (0)
iterations count:13 (1), effective:2 (0)
iterations count:92 (8), effective:36 (3)
iterations count:88 (8), effective:35 (3)
iterations count:15 (1), effective:2 (0)
iterations count:31 (2), effective:8 (0)
iterations count:15 (1), effective:2 (0)
iterations count:13 (1), effective:1 (0)
iterations count:11 (1), effective:0 (0)
iterations count:15 (1), effective:2 (0)
iterations count:17 (1), effective:4 (0)
iterations count:84 (7), effective:32 (2)
iterations count:11 (1), effective:0 (0)
iterations count:92 (8), effective:36 (3)
iterations count:11 (1), effective:0 (0)
iterations count:17 (1), effective:2 (0)
iterations count:31 (2), effective:8 (0)
iterations count:13 (1), effective:2 (0)
iterations count:20 (1), effective:3 (0)
iterations count:11 (1), effective:0 (0)
iterations count:13 (1), effective:2 (0)
iterations count:13 (1), effective:1 (0)
iterations count:11 (1), effective:0 (0)
iterations count:11 (1), effective:0 (0)
iterations count:13 (1), effective:1 (0)
iterations count:15 (1), effective:2 (0)
iterations count:31 (2), effective:8 (0)
iterations count:15 (1), effective:2 (0)
iterations count:15 (1), effective:2 (0)
iterations count:15 (1), effective:2 (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="RefineWMG-PT-002002"
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 RefineWMG-PT-002002, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r330-tall-167889203400530"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-002002.tgz
mv RefineWMG-PT-002002 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 ;