About the Execution of Marcie+red for SmallOperatingSystem-PT-MT0032DC0008
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5449.771 | 11634.00 | 14552.00 | 654.60 | TTTFTTTFFTFTTTTF | 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-167912649700010.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-MT0032DC0008, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912649700010
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 11K Feb 25 12:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 12:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 12:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 12:48 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.2K Feb 25 17:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 16K Feb 25 17:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 12:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Feb 25 12:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K 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-MT0032DC0008-CTLFireability-00
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-01
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-02
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-03
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-04
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-05
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-06
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-07
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-08
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-09
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-10
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-11
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-12
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-13
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-14
FORMULA_NAME SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679231107625
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-MT0032DC0008
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 13:05:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 13:05:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 13:05:11] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2023-03-19 13:05:11] [INFO ] Transformed 9 places.
[2023-03-19 13:05:11] [INFO ] Transformed 8 transitions.
[2023-03-19 13:05:11] [INFO ] Parsed PT model containing 9 places and 8 transitions and 27 arcs in 345 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Initial state reduction rules removed 1 formulas.
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-03 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 12 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:05:11] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-19 13:05:11] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-19 13:05:11] [INFO ] Invariant cache hit.
[2023-03-19 13:05:11] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2023-03-19 13:05:11] [INFO ] Invariant cache hit.
[2023-03-19 13:05:11] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 365 ms. Remains : 9/9 places, 8/8 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 13:05:11] [INFO ] Flatten gal took : 21 ms
[2023-03-19 13:05:11] [INFO ] Flatten gal took : 6 ms
[2023-03-19 13:05:11] [INFO ] Input system was already deterministic with 8 transitions.
Finished random walk after 196 steps, including 0 resets, run visited all 17 properties in 40 ms. (steps per millisecond=4 )
[2023-03-19 13:05:11] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:05:11] [INFO ] Flatten gal took : 4 ms
[2023-03-19 13:05:11] [INFO ] Input system was already deterministic with 8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:05:11] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:05:11] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:11] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 0 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:05:11] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:05:11] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:05:11] [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
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 7 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 7 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 5 transition count 6
Applied a total of 5 rules in 12 ms. Remains 5 /9 variables (removed 4) and now considering 6/8 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 5/9 places, 6/8 transitions.
[2023-03-19 13:05:12] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:12] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:12] [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 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:05:12] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:05:12] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:05:12] [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:05:12] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:05:12] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:05:12] [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:05:12] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:05:12] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:05:12] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:05:12] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:12] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:12] [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 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:05:12] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:05:12] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:05:12] [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:05:12] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:05:12] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:05:12] [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:05:12] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:05:12] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:05:12] [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:05:12] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:12] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:12] [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:05:12] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:12] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:12] [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:05:12] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:12] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:12] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 0 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:05:12] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:12] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:05:12] [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:05:12] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:12] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:05:12] [INFO ] Input system was already deterministic with 8 transitions.
[2023-03-19 13:05:12] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:05:12] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:05:12] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-19 13:05:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 8 transitions and 27 arcs took 0 ms.
Total runtime 1440 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.650sec
RS generation: 0m 0.012sec
-> reachability set: #nodes 209 (2.1e+02) #states 166,515 (5)
starting MCC model checker
--------------------------
checking: AG [EF [1<=p4]]
normalized: ~ [E [true U ~ [E [true U 1<=p4]]]]
abstracting: (1<=p4)
states: 151,470 (5)
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EX [1<=p8]
normalized: EX [1<=p8]
abstracting: (1<=p8)
states: 128,826 (5)
.-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [EF [[EX [[p6<=0 | p5<=0]] & p3<=0]]]
normalized: ~ [E [true U ~ [E [true U [p3<=0 & EX [[p6<=0 | p5<=0]]]]]]]
abstracting: (p5<=0)
states: 15,045 (4)
abstracting: (p6<=0)
states: 3,435 (3)
.abstracting: (p3<=0)
states: 37,689 (4)
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: A [1<=p4 U AG [EX [AG [[1<=p5 & 1<=p6]]]]]
normalized: [~ [EG [E [true U ~ [EX [~ [E [true U ~ [[1<=p5 & 1<=p6]]]]]]]]] & ~ [E [E [true U ~ [EX [~ [E [true U ~ [[1<=p5 & 1<=p6]]]]]]] U [~ [1<=p4] & E [true U ~ [EX [~ [E [true U ~ [[1<=p5 & 1<=p6]]]]]]]]]]]
abstracting: (1<=p6)
states: 163,080 (5)
abstracting: (1<=p5)
states: 151,470 (5)
.abstracting: (1<=p4)
states: 151,470 (5)
abstracting: (1<=p6)
states: 163,080 (5)
abstracting: (1<=p5)
states: 151,470 (5)
.abstracting: (1<=p6)
states: 163,080 (5)
abstracting: (1<=p5)
states: 151,470 (5)
.
EG iterations: 0
-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.012sec
checking: AX [EF [[p0<=0 | [p2<=0 | p5<=0]]]]
normalized: ~ [EX [~ [E [true U [[p2<=0 | p5<=0] | p0<=0]]]]]
abstracting: (p0<=0)
states: 0
abstracting: (p5<=0)
states: 15,045 (4)
abstracting: (p2<=0)
states: 25,245 (4)
.-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: E [A [1<=p7 U AG [EF [1<=p3]]] U [EX [~ [AG [[1<=p4 & 1<=p6]]]] & 1<=p7]]
normalized: E [[~ [EG [E [true U ~ [E [true U 1<=p3]]]]] & ~ [E [E [true U ~ [E [true U 1<=p3]]] U [~ [1<=p7] & E [true U ~ [E [true U 1<=p3]]]]]]] U [EX [E [true U ~ [[1<=p4 & 1<=p6]]]] & 1<=p7]]
abstracting: (1<=p7)
states: 148,560 (5)
abstracting: (1<=p6)
states: 163,080 (5)
abstracting: (1<=p4)
states: 151,470 (5)
.abstracting: (1<=p3)
states: 128,826 (5)
abstracting: (1<=p7)
states: 148,560 (5)
abstracting: (1<=p3)
states: 128,826 (5)
abstracting: (1<=p3)
states: 128,826 (5)
.
EG iterations: 1
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AX [AG [~ [A [1<=p4 U [[1<=p0 & 1<=p2] & [1<=p5 & 1<=p3]]]]]]
normalized: ~ [EX [E [true U [~ [EG [~ [[[1<=p5 & 1<=p3] & [1<=p0 & 1<=p2]]]]] & ~ [E [~ [[[1<=p5 & 1<=p3] & [1<=p0 & 1<=p2]]] U [~ [1<=p4] & ~ [[[1<=p5 & 1<=p3] & [1<=p0 & 1<=p2]]]]]]]]]]
abstracting: (1<=p2)
states: 141,270 (5)
abstracting: (1<=p0)
states: 166,515 (5)
abstracting: (1<=p3)
states: 128,826 (5)
abstracting: (1<=p5)
states: 151,470 (5)
abstracting: (1<=p4)
states: 151,470 (5)
abstracting: (1<=p2)
states: 141,270 (5)
abstracting: (1<=p0)
states: 166,515 (5)
abstracting: (1<=p3)
states: 128,826 (5)
abstracting: (1<=p5)
states: 151,470 (5)
abstracting: (1<=p2)
states: 141,270 (5)
abstracting: (1<=p0)
states: 166,515 (5)
abstracting: (1<=p3)
states: 128,826 (5)
abstracting: (1<=p5)
states: 151,470 (5)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.020sec
checking: AX [E [[AF [~ [E [[1<=p0 & [1<=p2 & 1<=p5]] U [1<=p5 & 1<=p6]]]] & 1<=p4] U 1<=p3]]
normalized: ~ [EX [~ [E [[~ [EG [E [[[1<=p2 & 1<=p5] & 1<=p0] U [1<=p5 & 1<=p6]]]] & 1<=p4] U 1<=p3]]]]
abstracting: (1<=p3)
states: 128,826 (5)
abstracting: (1<=p4)
states: 151,470 (5)
abstracting: (1<=p6)
states: 163,080 (5)
abstracting: (1<=p5)
states: 151,470 (5)
abstracting: (1<=p0)
states: 166,515 (5)
abstracting: (1<=p5)
states: 151,470 (5)
abstracting: (1<=p2)
states: 141,270 (5)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AX [E [EX [A [1<=p4 U ~ [[1<=p0 & [1<=p2 & 1<=p5]]]]] U EX [[1<=p0 & [1<=p2 & 1<=p5]]]]]
normalized: ~ [EX [~ [E [EX [[~ [EG [[[1<=p2 & 1<=p5] & 1<=p0]]] & ~ [E [[[1<=p2 & 1<=p5] & 1<=p0] U [~ [1<=p4] & [[1<=p2 & 1<=p5] & 1<=p0]]]]]] U EX [[[1<=p2 & 1<=p5] & 1<=p0]]]]]]
abstracting: (1<=p0)
states: 166,515 (5)
abstracting: (1<=p5)
states: 151,470 (5)
abstracting: (1<=p2)
states: 141,270 (5)
.abstracting: (1<=p0)
states: 166,515 (5)
abstracting: (1<=p5)
states: 151,470 (5)
abstracting: (1<=p2)
states: 141,270 (5)
abstracting: (1<=p4)
states: 151,470 (5)
abstracting: (1<=p0)
states: 166,515 (5)
abstracting: (1<=p5)
states: 151,470 (5)
abstracting: (1<=p2)
states: 141,270 (5)
abstracting: (1<=p0)
states: 166,515 (5)
abstracting: (1<=p5)
states: 151,470 (5)
abstracting: (1<=p2)
states: 141,270 (5)
.
EG iterations: 1
..-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.017sec
checking: EX [[[EF [[[1<=p0 & 1<=p2] & [1<=p5 & 1<=p3]]] | p4<=0] | [[1<=p5 & 1<=p6] | [1<=p3 & EG [EX [[p0<=0 | [p1<=0 | p2<=0]]]]]]]]
normalized: EX [[[[EG [EX [[[p1<=0 | p2<=0] | p0<=0]]] & 1<=p3] | [1<=p5 & 1<=p6]] | [E [true U [[1<=p5 & 1<=p3] & [1<=p0 & 1<=p2]]] | p4<=0]]]
abstracting: (p4<=0)
states: 15,045 (4)
abstracting: (1<=p2)
states: 141,270 (5)
abstracting: (1<=p0)
states: 166,515 (5)
abstracting: (1<=p3)
states: 128,826 (5)
abstracting: (1<=p5)
states: 151,470 (5)
abstracting: (1<=p6)
states: 163,080 (5)
abstracting: (1<=p5)
states: 151,470 (5)
abstracting: (1<=p3)
states: 128,826 (5)
abstracting: (p0<=0)
states: 0
abstracting: (p2<=0)
states: 25,245 (4)
abstracting: (p1<=0)
states: 15,045 (4)
...
EG iterations: 2
.-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: [EX [EG [[[1<=p0 & [1<=p2 & 1<=p5]] | [~ [A [[1<=p5 & 1<=p6] U 1<=p7]] | [1<=p5 & [1<=p6 & 1<=p3]]]]]] | AG [[p3<=0 & [1<=p3 | [1<=p0 & [1<=p2 & 1<=p5]]]]]]
normalized: [~ [E [true U ~ [[[[[1<=p2 & 1<=p5] & 1<=p0] | 1<=p3] & p3<=0]]]] | EX [EG [[[[[1<=p6 & 1<=p3] & 1<=p5] | ~ [[~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [[1<=p5 & 1<=p6]] & ~ [1<=p7]]]]]]] | [[1<=p2 & 1<=p5] & 1<=p0]]]]]
abstracting: (1<=p0)
states: 166,515 (5)
abstracting: (1<=p5)
states: 151,470 (5)
abstracting: (1<=p2)
states: 141,270 (5)
abstracting: (1<=p7)
states: 148,560 (5)
abstracting: (1<=p6)
states: 163,080 (5)
abstracting: (1<=p5)
states: 151,470 (5)
abstracting: (1<=p7)
states: 148,560 (5)
abstracting: (1<=p7)
states: 148,560 (5)
.
EG iterations: 1
abstracting: (1<=p5)
states: 151,470 (5)
abstracting: (1<=p3)
states: 128,826 (5)
abstracting: (1<=p6)
states: 163,080 (5)
.
EG iterations: 1
.abstracting: (p3<=0)
states: 37,689 (4)
abstracting: (1<=p3)
states: 128,826 (5)
abstracting: (1<=p0)
states: 166,515 (5)
abstracting: (1<=p5)
states: 151,470 (5)
abstracting: (1<=p2)
states: 141,270 (5)
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: [AG [[1<=p0 & [1<=p2 & 1<=p5]]] | [EX [1<=p8] & [AX [[1<=p8 | AF [[1<=p0 & [1<=p1 & 1<=p2]]]]] | [A [EX [AF [[1<=p4 & 1<=p6]]] U EX [[1<=p4 & 1<=p6]]] & EX [[1<=p0 & [1<=p2 & 1<=p5]]]]]]]
normalized: [[[[EX [[[1<=p2 & 1<=p5] & 1<=p0]] & [~ [EG [~ [EX [[1<=p4 & 1<=p6]]]]] & ~ [E [~ [EX [[1<=p4 & 1<=p6]]] U [~ [EX [~ [EG [~ [[1<=p4 & 1<=p6]]]]]] & ~ [EX [[1<=p4 & 1<=p6]]]]]]]] | ~ [EX [~ [[~ [EG [~ [[[1<=p1 & 1<=p2] & 1<=p0]]]] | 1<=p8]]]]] & EX [1<=p8]] | ~ [E [true U ~ [[[1<=p2 & 1<=p5] & 1<=p0]]]]]
abstracting: (1<=p0)
states: 166,515 (5)
abstracting: (1<=p5)
states: 151,470 (5)
abstracting: (1<=p2)
states: 141,270 (5)
abstracting: (1<=p8)
states: 128,826 (5)
.abstracting: (1<=p8)
states: 128,826 (5)
abstracting: (1<=p0)
states: 166,515 (5)
abstracting: (1<=p2)
states: 141,270 (5)
abstracting: (1<=p1)
states: 151,470 (5)
..
EG iterations: 2
.abstracting: (1<=p6)
states: 163,080 (5)
abstracting: (1<=p4)
states: 151,470 (5)
.abstracting: (1<=p6)
states: 163,080 (5)
abstracting: (1<=p4)
states: 151,470 (5)
..........
EG iterations: 10
.abstracting: (1<=p6)
states: 163,080 (5)
abstracting: (1<=p4)
states: 151,470 (5)
.abstracting: (1<=p6)
states: 163,080 (5)
abstracting: (1<=p4)
states: 151,470 (5)
..........
EG iterations: 9
abstracting: (1<=p0)
states: 166,515 (5)
abstracting: (1<=p5)
states: 151,470 (5)
abstracting: (1<=p2)
states: 141,270 (5)
.-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
checking: ~ [E [[AF [[E [1<=p8 U 1<=p7] & AG [[1<=p0 & [1<=p1 & 1<=p2]]]]] | AX [EF [[1<=p5 & 1<=p6]]]] U [AF [1<=p3] & E [[EX [[1<=p4 & 1<=p6]] & 1<=p8] U ~ [[[1<=p8 | [1<=p0 & [1<=p2 & 1<=p5]]] & EX [1<=p3]]]]]]]
normalized: ~ [E [[~ [EX [~ [E [true U [1<=p5 & 1<=p6]]]]] | ~ [EG [~ [[~ [E [true U ~ [[[1<=p1 & 1<=p2] & 1<=p0]]]] & E [1<=p8 U 1<=p7]]]]]] U [E [[EX [[1<=p4 & 1<=p6]] & 1<=p8] U ~ [[EX [1<=p3] & [[[1<=p2 & 1<=p5] & 1<=p0] | 1<=p8]]]] & ~ [EG [~ [1<=p3]]]]]]
abstracting: (1<=p3)
states: 128,826 (5)
.
EG iterations: 1
abstracting: (1<=p8)
states: 128,826 (5)
abstracting: (1<=p0)
states: 166,515 (5)
abstracting: (1<=p5)
states: 151,470 (5)
abstracting: (1<=p2)
states: 141,270 (5)
abstracting: (1<=p3)
states: 128,826 (5)
.abstracting: (1<=p8)
states: 128,826 (5)
abstracting: (1<=p6)
states: 163,080 (5)
abstracting: (1<=p4)
states: 151,470 (5)
.abstracting: (1<=p7)
states: 148,560 (5)
abstracting: (1<=p8)
states: 128,826 (5)
abstracting: (1<=p0)
states: 166,515 (5)
abstracting: (1<=p2)
states: 141,270 (5)
abstracting: (1<=p1)
states: 151,470 (5)
EG iterations: 0
abstracting: (1<=p6)
states: 163,080 (5)
abstracting: (1<=p5)
states: 151,470 (5)
.-> the formula is FALSE
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.024sec
checking: E [[A [[[1<=p0 & [1<=p1 & 1<=p2]] | EG [[1<=p4 & 1<=p6]]] U [~ [EX [1<=p7]] & EF [[1<=p7 | [1<=p4 & 1<=p6]]]]] | [EX [EX [AF [[1<=p0 & [1<=p2 & 1<=p5]]]]] & [1<=p7 | AG [E [1<=p3 U [1<=p5 & 1<=p6]]]]]] U [1<=p8 | [1<=p5 & 1<=p6]]]
normalized: E [[[[~ [E [true U ~ [E [1<=p3 U [1<=p5 & 1<=p6]]]]] | 1<=p7] & EX [EX [~ [EG [~ [[[1<=p2 & 1<=p5] & 1<=p0]]]]]]] | [~ [EG [~ [[E [true U [[1<=p4 & 1<=p6] | 1<=p7]] & ~ [EX [1<=p7]]]]]] & ~ [E [~ [[E [true U [[1<=p4 & 1<=p6] | 1<=p7]] & ~ [EX [1<=p7]]]] U [~ [[EG [[1<=p4 & 1<=p6]] | [[1<=p1 & 1<=p2] & 1<=p0]]] & ~ [[E [true U [[1<=p4 & 1<=p6] | 1<=p7]] & ~ [EX [1<=p7]]]]]]]]] U [[1<=p5 & 1<=p6] | 1<=p8]]
abstracting: (1<=p8)
states: 128,826 (5)
abstracting: (1<=p6)
states: 163,080 (5)
abstracting: (1<=p5)
states: 151,470 (5)
abstracting: (1<=p7)
states: 148,560 (5)
.abstracting: (1<=p7)
states: 148,560 (5)
abstracting: (1<=p6)
states: 163,080 (5)
abstracting: (1<=p4)
states: 151,470 (5)
abstracting: (1<=p0)
states: 166,515 (5)
abstracting: (1<=p2)
states: 141,270 (5)
abstracting: (1<=p1)
states: 151,470 (5)
abstracting: (1<=p6)
states: 163,080 (5)
abstracting: (1<=p4)
states: 151,470 (5)
.
EG iterations: 1
abstracting: (1<=p7)
states: 148,560 (5)
.abstracting: (1<=p7)
states: 148,560 (5)
abstracting: (1<=p6)
states: 163,080 (5)
abstracting: (1<=p4)
states: 151,470 (5)
abstracting: (1<=p7)
states: 148,560 (5)
.abstracting: (1<=p7)
states: 148,560 (5)
abstracting: (1<=p6)
states: 163,080 (5)
abstracting: (1<=p4)
states: 151,470 (5)
.
EG iterations: 1
abstracting: (1<=p0)
states: 166,515 (5)
abstracting: (1<=p5)
states: 151,470 (5)
abstracting: (1<=p2)
states: 141,270 (5)
.
EG iterations: 1
..abstracting: (1<=p7)
states: 148,560 (5)
abstracting: (1<=p6)
states: 163,080 (5)
abstracting: (1<=p5)
states: 151,470 (5)
abstracting: (1<=p3)
states: 128,826 (5)
-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: [A [1<=p3 U [~ [[[AF [~ [[1<=p0 & [1<=p1 & 1<=p2]]]] | 1<=p7] | [EG [[1<=p4 & 1<=p6]] | A [[1<=p0 & [1<=p1 & 1<=p2]] U 1<=p7]]]] | ~ [[EX [p4<=0] | AG [1<=p4]]]]] & [EF [[[EX [[p0<=0 | [p2<=0 | p5<=0]]] & 1<=p0] & [1<=p1 & [1<=p2 & EG [[p4<=0 | p6<=0]]]]]] & EX [[AG [[1<=p5 & 1<=p6]] | [EF [[p5<=0 | p6<=0]] | [[p4<=0 & 1<=p5] & [1<=p6 & AX [1<=p7]]]]]]]]
normalized: [[EX [[[[[~ [EX [~ [1<=p7]]] & 1<=p6] & [p4<=0 & 1<=p5]] | E [true U [p5<=0 | p6<=0]]] | ~ [E [true U ~ [[1<=p5 & 1<=p6]]]]]] & E [true U [[[EG [[p4<=0 | p6<=0]] & 1<=p2] & 1<=p1] & [EX [[[p2<=0 | p5<=0] | p0<=0]] & 1<=p0]]]] & [~ [EG [~ [[~ [[~ [E [true U ~ [1<=p4]]] | EX [p4<=0]]] | ~ [[[[~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [[[1<=p1 & 1<=p2] & 1<=p0]] & ~ [1<=p7]]]]] | EG [[1<=p4 & 1<=p6]]] | [~ [EG [[[1<=p1 & 1<=p2] & 1<=p0]]] | 1<=p7]]]]]]] & ~ [E [~ [[~ [[~ [E [true U ~ [1<=p4]]] | EX [p4<=0]]] | ~ [[[[~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [[[1<=p1 & 1<=p2] & 1<=p0]] & ~ [1<=p7]]]]] | EG [[1<=p4 & 1<=p6]]] | [~ [EG [[[1<=p1 & 1<=p2] & 1<=p0]]] | 1<=p7]]]]] U [~ [1<=p3] & ~ [[~ [[~ [E [true U ~ [1<=p4]]] | EX [p4<=0]]] | ~ [[[[~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [[[1<=p1 & 1<=p2] & 1<=p0]] & ~ [1<=p7]]]]] | EG [[1<=p4 & 1<=p6]]] | [~ [EG [[[1<=p1 & 1<=p2] & 1<=p0]]] | 1<=p7]]]]]]]]]]
abstracting: (1<=p7)
states: 148,560 (5)
abstracting: (1<=p0)
states: 166,515 (5)
abstracting: (1<=p2)
states: 141,270 (5)
abstracting: (1<=p1)
states: 151,470 (5)
.
EG iterations: 1
abstracting: (1<=p6)
states: 163,080 (5)
abstracting: (1<=p4)
states: 151,470 (5)
.
EG iterations: 1
abstracting: (1<=p7)
states: 148,560 (5)
abstracting: (1<=p0)
states: 166,515 (5)
abstracting: (1<=p2)
states: 141,270 (5)
abstracting: (1<=p1)
states: 151,470 (5)
abstracting: (1<=p7)
states: 148,560 (5)
abstracting: (1<=p7)
states: 148,560 (5)
.
EG iterations: 1
abstracting: (p4<=0)
states: 15,045 (4)
.abstracting: (1<=p4)
states: 151,470 (5)
abstracting: (1<=p3)
states: 128,826 (5)
abstracting: (1<=p7)
states: 148,560 (5)
abstracting: (1<=p0)
states: 166,515 (5)
abstracting: (1<=p2)
states: 141,270 (5)
abstracting: (1<=p1)
states: 151,470 (5)
.
EG iterations: 1
abstracting: (1<=p6)
states: 163,080 (5)
abstracting: (1<=p4)
states: 151,470 (5)
.
EG iterations: 1
abstracting: (1<=p7)
states: 148,560 (5)
abstracting: (1<=p0)
states: 166,515 (5)
abstracting: (1<=p2)
states: 141,270 (5)
abstracting: (1<=p1)
states: 151,470 (5)
abstracting: (1<=p7)
states: 148,560 (5)
abstracting: (1<=p7)
states: 148,560 (5)
.
EG iterations: 1
abstracting: (p4<=0)
states: 15,045 (4)
.abstracting: (1<=p4)
states: 151,470 (5)
abstracting: (1<=p7)
states: 148,560 (5)
abstracting: (1<=p0)
states: 166,515 (5)
abstracting: (1<=p2)
states: 141,270 (5)
abstracting: (1<=p1)
states: 151,470 (5)
.
EG iterations: 1
abstracting: (1<=p6)
states: 163,080 (5)
abstracting: (1<=p4)
states: 151,470 (5)
.
EG iterations: 1
abstracting: (1<=p7)
states: 148,560 (5)
abstracting: (1<=p0)
states: 166,515 (5)
abstracting: (1<=p2)
states: 141,270 (5)
abstracting: (1<=p1)
states: 151,470 (5)
abstracting: (1<=p7)
states: 148,560 (5)
abstracting: (1<=p7)
states: 148,560 (5)
.
EG iterations: 1
abstracting: (p4<=0)
states: 15,045 (4)
.abstracting: (1<=p4)
states: 151,470 (5)
.
EG iterations: 1
abstracting: (1<=p0)
states: 166,515 (5)
abstracting: (p0<=0)
states: 0
abstracting: (p5<=0)
states: 15,045 (4)
abstracting: (p2<=0)
states: 25,245 (4)
.abstracting: (1<=p1)
states: 151,470 (5)
abstracting: (1<=p2)
states: 141,270 (5)
abstracting: (p6<=0)
states: 3,435 (3)
abstracting: (p4<=0)
states: 15,045 (4)
..........
EG iterations: 10
abstracting: (1<=p6)
states: 163,080 (5)
abstracting: (1<=p5)
states: 151,470 (5)
abstracting: (p6<=0)
states: 3,435 (3)
abstracting: (p5<=0)
states: 15,045 (4)
abstracting: (1<=p5)
states: 151,470 (5)
abstracting: (p4<=0)
states: 15,045 (4)
abstracting: (1<=p6)
states: 163,080 (5)
abstracting: (1<=p7)
states: 148,560 (5)
..-> the formula is TRUE
FORMULA SmallOperatingSystem-PT-MT0032DC0008-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.026sec
totally nodes used: 38738 (3.9e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 829869 103148 933017
used/not used/entry size/cache size: 124186 66984678 16 1024MB
basic ops cache: hits/miss/sum: 310300 40181 350481
used/not used/entry size/cache size: 79203 16698013 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: 9885 1054 10939
used/not used/entry size/cache size: 1054 8387554 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 67079716
1 26444
2 1228
3 456
4 493
5 102
6 87
7 57
8 39
9 29
>= 10 213
Total processing time: 0m 5.433sec
BK_STOP 1679231119259
--------------------
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:528 (66), effective:136 (17)
initing FirstDep: 0m 0.000sec
iterations count:19 (2), effective:4 (0)
iterations count:240 (30), effective:85 (10)
iterations count:240 (30), effective:80 (10)
iterations count:8 (1), effective:0 (0)
iterations count:240 (30), effective:80 (10)
iterations count:8 (1), effective:0 (0)
iterations count:136 (17), effective:32 (4)
iterations count:240 (30), effective:80 (10)
iterations count:8 (1), effective:0 (0)
iterations count:104 (13), effective:24 (3)
iterations count:136 (17), effective:32 (4)
iterations count:30 (3), effective:6 (0)
iterations count:30 (3), effective:6 (0)
iterations count:30 (3), effective:6 (0)
iterations count:25 (3), effective:5 (0)
iterations count:136 (17), effective:32 (4)
iterations count:49 (6), effective:13 (1)
iterations count:12 (1), effective:1 (0)
iterations count:8 (1), effective:0 (0)
iterations count:132 (16), effective:31 (3)
iterations count:23 (2), effective:6 (0)
iterations count:49 (6), effective:13 (1)
iterations count:240 (30), effective:80 (10)
iterations count:69 (8), effective:17 (2)
iterations count:104 (13), effective:24 (3)
iterations count:11 (1), effective:1 (0)
iterations count:113 (14), effective:42 (5)
iterations count:25 (3), effective:5 (0)
iterations count:32 (4), effective:8 (1)
iterations count:24 (3), effective:5 (0)
iterations count:54 (6), effective:14 (1)
iterations count:19 (2), effective:4 (0)
iterations count:19 (2), effective:4 (0)
iterations count:162 (20), effective:40 (5)
iterations count:19 (2), effective:4 (0)
iterations count:24 (3), effective:5 (0)
iterations count:248 (31), effective:88 (11)
iterations count:22 (2), effective:5 (0)
iterations count:32 (4), effective:8 (1)
iterations count:136 (17), effective:32 (4)
iterations count:32 (4), effective:8 (1)
iterations count:136 (17), effective:32 (4)
iterations count:181 (22), effective:60 (7)
iterations count:32 (4), effective:8 (1)
iterations count:136 (17), effective:32 (4)
iterations count:211 (26), effective:54 (6)
iterations count:240 (30), effective:80 (10)
iterations count:240 (30), effective:80 (10)
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-MT0032DC0008"
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-MT0032DC0008, 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-167912649700010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmallOperatingSystem-PT-MT0032DC0008.tgz
mv SmallOperatingSystem-PT-MT0032DC0008 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 ;