About the Execution of Marcie+red for CircularTrains-PT-048
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10148.863 | 94241.00 | 101506.00 | 887.30 | TTFTTFTTTTTTTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r074-smll-167814399900162.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 CircularTrains-PT-048, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814399900162
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.5K Feb 26 04:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 04:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 04:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 04:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 04:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 04:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 37K 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 CircularTrains-PT-048-CTLFireability-00
FORMULA_NAME CircularTrains-PT-048-CTLFireability-01
FORMULA_NAME CircularTrains-PT-048-CTLFireability-02
FORMULA_NAME CircularTrains-PT-048-CTLFireability-03
FORMULA_NAME CircularTrains-PT-048-CTLFireability-04
FORMULA_NAME CircularTrains-PT-048-CTLFireability-05
FORMULA_NAME CircularTrains-PT-048-CTLFireability-06
FORMULA_NAME CircularTrains-PT-048-CTLFireability-07
FORMULA_NAME CircularTrains-PT-048-CTLFireability-08
FORMULA_NAME CircularTrains-PT-048-CTLFireability-09
FORMULA_NAME CircularTrains-PT-048-CTLFireability-10
FORMULA_NAME CircularTrains-PT-048-CTLFireability-11
FORMULA_NAME CircularTrains-PT-048-CTLFireability-12
FORMULA_NAME CircularTrains-PT-048-CTLFireability-13
FORMULA_NAME CircularTrains-PT-048-CTLFireability-14
FORMULA_NAME CircularTrains-PT-048-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678306034529
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=CircularTrains-PT-048
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-08 20:07:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 20:07:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 20:07:18] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2023-03-08 20:07:18] [INFO ] Transformed 96 places.
[2023-03-08 20:07:18] [INFO ] Transformed 48 transitions.
[2023-03-08 20:07:18] [INFO ] Parsed PT model containing 96 places and 48 transitions and 192 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Support contains 90 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 48/48 transitions.
Applied a total of 0 rules in 17 ms. Remains 96 /96 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 96 cols
[2023-03-08 20:07:18] [INFO ] Computed 49 place invariants in 13 ms
[2023-03-08 20:07:18] [INFO ] Implicit Places using invariants in 253 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 299 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 95/96 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 95 /95 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 318 ms. Remains : 95/96 places, 48/48 transitions.
Support contains 90 out of 95 places after structural reductions.
[2023-03-08 20:07:18] [INFO ] Flatten gal took : 37 ms
[2023-03-08 20:07:18] [INFO ] Flatten gal took : 17 ms
[2023-03-08 20:07:18] [INFO ] Input system was already deterministic with 48 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 60) seen :59
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 48 rows 95 cols
[2023-03-08 20:07:19] [INFO ] Computed 48 place invariants in 14 ms
[2023-03-08 20:07:19] [INFO ] [Real]Absence check using 25 positive place invariants in 12 ms returned sat
[2023-03-08 20:07:19] [INFO ] [Real]Absence check using 25 positive and 23 generalized place invariants in 14 ms returned sat
[2023-03-08 20:07:19] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 11 ms
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 11 ms
[2023-03-08 20:07:19] [INFO ] Input system was already deterministic with 48 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 95/95 places, 48/48 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 95 transition count 47
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 2 place count 94 transition count 47
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 4 place count 93 transition count 46
Applied a total of 4 rules in 25 ms. Remains 93 /95 variables (removed 2) and now considering 46/48 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 93/95 places, 46/48 transitions.
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 6 ms
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 7 ms
[2023-03-08 20:07:19] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 48/48 transitions.
Applied a total of 0 rules in 4 ms. Remains 95 /95 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 95/95 places, 48/48 transitions.
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 5 ms
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 6 ms
[2023-03-08 20:07:19] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 95/95 places, 48/48 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 95 transition count 47
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 2 place count 94 transition count 47
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 4 place count 93 transition count 46
Applied a total of 4 rules in 17 ms. Remains 93 /95 variables (removed 2) and now considering 46/48 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 93/95 places, 46/48 transitions.
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 5 ms
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 5 ms
[2023-03-08 20:07:19] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 48/48 transitions.
Applied a total of 0 rules in 7 ms. Remains 95 /95 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 95/95 places, 48/48 transitions.
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:07:19] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 48/48 transitions.
Applied a total of 0 rules in 6 ms. Remains 95 /95 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 95/95 places, 48/48 transitions.
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:07:19] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 95 /95 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 95/95 places, 48/48 transitions.
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 5 ms
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 5 ms
[2023-03-08 20:07:19] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 95 /95 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 95/95 places, 48/48 transitions.
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 5 ms
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 5 ms
[2023-03-08 20:07:19] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 95 /95 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 95/95 places, 48/48 transitions.
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 5 ms
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 5 ms
[2023-03-08 20:07:19] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 95 /95 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 95/95 places, 48/48 transitions.
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 14 ms
[2023-03-08 20:07:19] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 95 /95 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 95/95 places, 48/48 transitions.
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:07:19] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 95 /95 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 95/95 places, 48/48 transitions.
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 5 ms
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:07:19] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 95 /95 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 95/95 places, 48/48 transitions.
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:07:19] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 95 /95 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 95/95 places, 48/48 transitions.
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:07:19] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 95/95 places, 48/48 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 95 transition count 47
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 2 place count 94 transition count 47
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 4 place count 93 transition count 46
Applied a total of 4 rules in 7 ms. Remains 93 /95 variables (removed 2) and now considering 46/48 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 93/95 places, 46/48 transitions.
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:07:19] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 95 /95 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 95/95 places, 48/48 transitions.
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 10 ms
[2023-03-08 20:07:19] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 95/95 places, 48/48 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 95 transition count 47
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 2 place count 94 transition count 47
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 4 place count 93 transition count 46
Applied a total of 4 rules in 7 ms. Remains 93 /95 variables (removed 2) and now considering 46/48 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 93/95 places, 46/48 transitions.
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:07:19] [INFO ] Input system was already deterministic with 46 transitions.
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 5 ms
[2023-03-08 20:07:19] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:07:19] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-08 20:07:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 95 places, 48 transitions and 190 arcs took 1 ms.
Total runtime 2027 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: 95 NrTr: 48 NrArc: 190)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 3.398sec
RS generation: 0m 0.120sec
-> reachability set: #nodes 1632 (1.6e+03) #states 23,973,456,915 (10)
starting MCC model checker
--------------------------
checking: EG [[p64<=0 | p78<=0]]
normalized: EG [[p64<=0 | p78<=0]]
abstracting: (p78<=0)
states: 19,022,666,310 (10)
abstracting: (p64<=0)
states: 3,622,111,560 (9)
..................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 386
-> the formula is FALSE
FORMULA CircularTrains-PT-048-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.005sec
checking: AX [EG [AX [EF [[p9<=0 | p45<=0]]]]]
normalized: ~ [EX [~ [EG [~ [EX [~ [E [true U [p9<=0 | p45<=0]]]]]]]]]
abstracting: (p45<=0)
states: 14,462,123,760 (10)
abstracting: (p9<=0)
states: 14,462,123,760 (10)
.
EG iterations: 0
.-> the formula is TRUE
FORMULA CircularTrains-PT-048-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.023sec
checking: EX [EG [EF [[p73<=0 | p79<=0]]]]
normalized: EX [EG [E [true U [p73<=0 | p79<=0]]]]
abstracting: (p79<=0)
states: 14,462,123,760 (10)
abstracting: (p73<=0)
states: 14,462,123,760 (10)
EG iterations: 0
.-> the formula is TRUE
FORMULA CircularTrains-PT-048-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.012sec
checking: EG [EF [[p5<=0 | p25<=0]]]
normalized: EG [E [true U [p5<=0 | p25<=0]]]
abstracting: (p25<=0)
states: 14,462,123,760 (10)
abstracting: (p5<=0)
states: 14,462,123,760 (10)
EG iterations: 0
-> the formula is TRUE
FORMULA CircularTrains-PT-048-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
checking: EG [[EG [EF [AX [[1<=p32 & 1<=p37]]]] | EF [EX [[p2<=0 | p31<=0]]]]]
normalized: EG [[E [true U EX [[p2<=0 | p31<=0]]] | EG [E [true U ~ [EX [~ [[1<=p32 & 1<=p37]]]]]]]]
abstracting: (1<=p37)
states: 9,511,333,155 (9)
abstracting: (1<=p32)
states: 9,511,333,155 (9)
.
EG iterations: 0
abstracting: (p31<=0)
states: 14,462,123,760 (10)
abstracting: (p2<=0)
states: 14,462,123,760 (10)
.
EG iterations: 0
-> the formula is TRUE
FORMULA CircularTrains-PT-048-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.224sec
checking: A [EG [AF [[[1<=p92 & 1<=p63] | [1<=p20 & 1<=p80]]]] U ~ [EG [[[EF [[1<=p14 & 1<=p34]] & 1<=p28] & [1<=p49 & ~ [[1<=p6 & 1<=p94]]]]]]]
normalized: [~ [EG [EG [[[1<=p49 & ~ [[1<=p6 & 1<=p94]]] & [1<=p28 & E [true U [1<=p14 & 1<=p34]]]]]]] & ~ [E [EG [[[1<=p49 & ~ [[1<=p6 & 1<=p94]]] & [1<=p28 & E [true U [1<=p14 & 1<=p34]]]]] U [~ [EG [~ [EG [~ [[[1<=p20 & 1<=p80] | [1<=p92 & 1<=p63]]]]]]] & EG [[[1<=p49 & ~ [[1<=p6 & 1<=p94]]] & [1<=p28 & E [true U [1<=p14 & 1<=p34]]]]]]]]]
abstracting: (1<=p34)
states: 9,511,333,155 (9)
abstracting: (1<=p14)
states: 9,511,333,155 (9)
abstracting: (1<=p28)
states: 9,511,333,155 (9)
abstracting: (1<=p94)
states: 9,511,333,155 (9)
abstracting: (1<=p6)
states: 9,511,333,155 (9)
abstracting: (1<=p49)
states: 9,511,333,155 (9)
....................................................................................................................................................................................................................................
EG iterations: 228
abstracting: (1<=p63)
states: 20,351,345,355 (10)
abstracting: (1<=p92)
states: 4,950,790,605 (9)
abstracting: (1<=p80)
states: 9,511,333,155 (9)
abstracting: (1<=p20)
states: 9,511,333,155 (9)
..........................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 362
EG iterations: 0
abstracting: (1<=p34)
states: 9,511,333,155 (9)
abstracting: (1<=p14)
states: 9,511,333,155 (9)
abstracting: (1<=p28)
states: 9,511,333,155 (9)
abstracting: (1<=p94)
states: 9,511,333,155 (9)
abstracting: (1<=p6)
states: 9,511,333,155 (9)
abstracting: (1<=p49)
states: 9,511,333,155 (9)
....................................................................................................................................................................................................................................
EG iterations: 228
abstracting: (1<=p34)
states: 9,511,333,155 (9)
abstracting: (1<=p14)
states: 9,511,333,155 (9)
abstracting: (1<=p28)
states: 9,511,333,155 (9)
abstracting: (1<=p94)
states: 9,511,333,155 (9)
abstracting: (1<=p6)
states: 9,511,333,155 (9)
abstracting: (1<=p49)
states: 9,511,333,155 (9)
....................................................................................................................................................................................................................................
EG iterations: 228
.
EG iterations: 1
-> the formula is TRUE
FORMULA CircularTrains-PT-048-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 7.756sec
checking: [EF [EG [EX [[1<=p12 & 1<=p67]]]] | A [EG [E [[1<=p41 & 1<=p58] U AG [[1<=p63 & 1<=p92]]]] U [AX [[1<=p8 & 1<=p33]] | AG [EX [AX [[1<=p20 & 1<=p80]]]]]]]
normalized: [[~ [EG [~ [[~ [EX [~ [[1<=p8 & 1<=p33]]]] | ~ [E [true U ~ [EX [~ [EX [~ [[1<=p20 & 1<=p80]]]]]]]]]]]] & ~ [E [~ [[~ [EX [~ [[1<=p8 & 1<=p33]]]] | ~ [E [true U ~ [EX [~ [EX [~ [[1<=p20 & 1<=p80]]]]]]]]]] U [~ [[~ [EX [~ [[1<=p8 & 1<=p33]]]] | ~ [E [true U ~ [EX [~ [EX [~ [[1<=p20 & 1<=p80]]]]]]]]]] & ~ [EG [E [[1<=p41 & 1<=p58] U ~ [E [true U ~ [[1<=p63 & 1<=p92]]]]]]]]]]] | E [true U EG [EX [[1<=p12 & 1<=p67]]]]]
abstracting: (1<=p67)
states: 9,511,333,155 (9)
abstracting: (1<=p12)
states: 9,511,333,155 (9)
.....................................................................................................................................................................................................................................................................................................................................................
EG iterations: 340
abstracting: (1<=p92)
states: 4,950,790,605 (9)
abstracting: (1<=p63)
states: 20,351,345,355 (10)
abstracting: (1<=p58)
states: 9,511,333,155 (9)
abstracting: (1<=p41)
states: 9,511,333,155 (9)
.
EG iterations: 1
abstracting: (1<=p80)
states: 9,511,333,155 (9)
abstracting: (1<=p20)
states: 9,511,333,155 (9)
..abstracting: (1<=p33)
states: 9,511,333,155 (9)
abstracting: (1<=p8)
states: 9,511,333,155 (9)
.abstracting: (1<=p80)
states: 9,511,333,155 (9)
abstracting: (1<=p20)
states: 9,511,333,155 (9)
..abstracting: (1<=p33)
states: 9,511,333,155 (9)
abstracting: (1<=p8)
states: 9,511,333,155 (9)
.abstracting: (1<=p80)
states: 9,511,333,155 (9)
abstracting: (1<=p20)
states: 9,511,333,155 (9)
..abstracting: (1<=p33)
states: 9,511,333,155 (9)
abstracting: (1<=p8)
states: 9,511,333,155 (9)
...
EG iterations: 2
-> the formula is FALSE
FORMULA CircularTrains-PT-048-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.062sec
checking: AF [AX [[[[EF [[p20<=0 | p80<=0]] | p11<=0] | [p21<=0 | [1<=p73 & 1<=p79]]] & [AG [[p41<=0 | p58<=0]] | [p63<=0 | p92<=0]]]]]
normalized: ~ [EG [EX [~ [[[[p63<=0 | p92<=0] | ~ [E [true U ~ [[p41<=0 | p58<=0]]]]] & [[p21<=0 | [1<=p73 & 1<=p79]] | [p11<=0 | E [true U [p20<=0 | p80<=0]]]]]]]]]
abstracting: (p80<=0)
states: 14,462,123,760 (10)
abstracting: (p20<=0)
states: 14,462,123,760 (10)
abstracting: (p11<=0)
states: 14,462,123,760 (10)
abstracting: (1<=p79)
states: 9,511,333,155 (9)
abstracting: (1<=p73)
states: 9,511,333,155 (9)
abstracting: (p21<=0)
states: 14,462,123,760 (10)
abstracting: (p58<=0)
states: 14,462,123,760 (10)
abstracting: (p41<=0)
states: 14,462,123,760 (10)
abstracting: (p92<=0)
states: 19,022,666,310 (10)
abstracting: (p63<=0)
states: 3,622,111,560 (9)
.....................................................................................................................................................................................................................................................................................................................................................
EG iterations: 340
-> the formula is TRUE
FORMULA CircularTrains-PT-048-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.372sec
checking: AF [[E [[1<=p41 & 1<=p58] U [[~ [[~ [[1<=p54 & 1<=p57]] | [1<=p72 & 1<=p88]]] & 1<=p5] & [1<=p25 & [1<=p14 & 1<=p34]]]] & [1<=p8 & 1<=p33]]]
normalized: ~ [EG [~ [[E [[1<=p41 & 1<=p58] U [[1<=p25 & [1<=p14 & 1<=p34]] & [1<=p5 & ~ [[[1<=p72 & 1<=p88] | ~ [[1<=p54 & 1<=p57]]]]]]] & [1<=p8 & 1<=p33]]]]]
abstracting: (1<=p33)
states: 9,511,333,155 (9)
abstracting: (1<=p8)
states: 9,511,333,155 (9)
abstracting: (1<=p57)
states: 9,511,333,155 (9)
abstracting: (1<=p54)
states: 9,511,333,155 (9)
abstracting: (1<=p88)
states: 20,351,345,355 (10)
abstracting: (1<=p72)
states: 4,950,790,605 (9)
abstracting: (1<=p5)
states: 9,511,333,155 (9)
abstracting: (1<=p34)
states: 9,511,333,155 (9)
abstracting: (1<=p14)
states: 9,511,333,155 (9)
abstracting: (1<=p25)
states: 9,511,333,155 (9)
abstracting: (1<=p58)
states: 9,511,333,155 (9)
abstracting: (1<=p41)
states: 9,511,333,155 (9)
.
EG iterations: 1
-> the formula is FALSE
FORMULA CircularTrains-PT-048-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.169sec
checking: [AF [[1<=p15 & 1<=p90]] & EF [[[AG [[AG [[1<=p71 & 1<=p89]] & [[1<=p2 & 1<=p31] | [1<=p12 & 1<=p67]]]] & EX [[A [[1<=p4 & 1<=p39] U [1<=p22 & 1<=p87]] | [p51<=0 | p75<=0]]]] | [1<=p64 & 1<=p78]]]]
normalized: [E [true U [[1<=p64 & 1<=p78] | [EX [[[p51<=0 | p75<=0] | [~ [EG [~ [[1<=p22 & 1<=p87]]]] & ~ [E [~ [[1<=p22 & 1<=p87]] U [~ [[1<=p4 & 1<=p39]] & ~ [[1<=p22 & 1<=p87]]]]]]]] & ~ [E [true U ~ [[[[1<=p12 & 1<=p67] | [1<=p2 & 1<=p31]] & ~ [E [true U ~ [[1<=p71 & 1<=p89]]]]]]]]]]] & ~ [EG [~ [[1<=p15 & 1<=p90]]]]]
abstracting: (1<=p90)
states: 20,351,345,355 (10)
abstracting: (1<=p15)
states: 4,950,790,605 (9)
..................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 386
abstracting: (1<=p89)
states: 20,351,345,355 (10)
abstracting: (1<=p71)
states: 4,950,790,605 (9)
abstracting: (1<=p31)
states: 9,511,333,155 (9)
abstracting: (1<=p2)
states: 9,511,333,155 (9)
abstracting: (1<=p67)
states: 9,511,333,155 (9)
abstracting: (1<=p12)
states: 9,511,333,155 (9)
abstracting: (1<=p87)
states: 4,950,790,605 (9)
abstracting: (1<=p22)
states: 20,351,345,355 (10)
abstracting: (1<=p39)
states: 9,511,333,155 (9)
abstracting: (1<=p4)
states: 9,511,333,155 (9)
abstracting: (1<=p87)
states: 4,950,790,605 (9)
abstracting: (1<=p22)
states: 20,351,345,355 (10)
abstracting: (1<=p87)
states: 4,950,790,605 (9)
abstracting: (1<=p22)
states: 20,351,345,355 (10)
..................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 386
abstracting: (p75<=0)
states: 14,462,123,760 (10)
abstracting: (p51<=0)
states: 14,462,123,760 (10)
.abstracting: (1<=p78)
states: 4,950,790,605 (9)
abstracting: (1<=p64)
states: 20,351,345,355 (10)
-> the formula is TRUE
FORMULA CircularTrains-PT-048-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 7.607sec
checking: E [[~ [[1<=p9 & 1<=p45]] | EX [[1<=p11 & 1<=p21]]] U EF [[AG [E [[1<=p42 & 1<=p65] U [1<=p15 & 1<=p90]]] | [E [[1<=p60 & 1<=p86] U [[1<=p63 & 1<=p92] | [1<=p20 & 1<=p80]]] & [A [[1<=p5 & 1<=p25] U [1<=p6 & 1<=p94]] | AX [~ [[p2<=0 | p31<=0]]]]]]]]
normalized: E [[EX [[1<=p11 & 1<=p21]] | ~ [[1<=p9 & 1<=p45]]] U E [true U [[[~ [EX [[p2<=0 | p31<=0]]] | [~ [EG [~ [[1<=p6 & 1<=p94]]]] & ~ [E [~ [[1<=p6 & 1<=p94]] U [~ [[1<=p5 & 1<=p25]] & ~ [[1<=p6 & 1<=p94]]]]]]] & E [[1<=p60 & 1<=p86] U [[1<=p20 & 1<=p80] | [1<=p63 & 1<=p92]]]] | ~ [E [true U ~ [E [[1<=p42 & 1<=p65] U [1<=p15 & 1<=p90]]]]]]]]
abstracting: (1<=p90)
states: 20,351,345,355 (10)
abstracting: (1<=p15)
states: 4,950,790,605 (9)
abstracting: (1<=p65)
states: 9,511,333,155 (9)
abstracting: (1<=p42)
states: 9,511,333,155 (9)
abstracting: (1<=p92)
states: 4,950,790,605 (9)
abstracting: (1<=p63)
states: 20,351,345,355 (10)
abstracting: (1<=p80)
states: 9,511,333,155 (9)
abstracting: (1<=p20)
states: 9,511,333,155 (9)
abstracting: (1<=p86)
states: 9,511,333,155 (9)
abstracting: (1<=p60)
states: 9,511,333,155 (9)
abstracting: (1<=p94)
states: 9,511,333,155 (9)
abstracting: (1<=p6)
states: 9,511,333,155 (9)
abstracting: (1<=p25)
states: 9,511,333,155 (9)
abstracting: (1<=p5)
states: 9,511,333,155 (9)
abstracting: (1<=p94)
states: 9,511,333,155 (9)
abstracting: (1<=p6)
states: 9,511,333,155 (9)
abstracting: (1<=p94)
states: 9,511,333,155 (9)
abstracting: (1<=p6)
states: 9,511,333,155 (9)
...........................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 363
abstracting: (p31<=0)
states: 14,462,123,760 (10)
abstracting: (p2<=0)
states: 14,462,123,760 (10)
.abstracting: (1<=p45)
states: 9,511,333,155 (9)
abstracting: (1<=p9)
states: 9,511,333,155 (9)
abstracting: (1<=p21)
states: 9,511,333,155 (9)
abstracting: (1<=p11)
states: 9,511,333,155 (9)
.-> the formula is TRUE
FORMULA CircularTrains-PT-048-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.674sec
checking: EG [E [AF [[~ [AX [[1<=p54 & 1<=p57]]] & [[1<=p2 & 1<=p31] | [1<=p20 & 1<=p80]]]] U [E [[1<=p18 & 1<=p66] U [[[1<=p26 & 1<=p56] & [1<=p10 & 1<=p40]] | [[1<=p0 & 1<=p81] | [1<=p38 & 1<=p55]]]] | [1<=p35 & [1<=p93 & [[1<=p4 & 1<=p39] | [1<=p42 & 1<=p65]]]]]]]
normalized: EG [E [~ [EG [~ [[[[1<=p20 & 1<=p80] | [1<=p2 & 1<=p31]] & EX [~ [[1<=p54 & 1<=p57]]]]]]] U [[1<=p35 & [1<=p93 & [[1<=p42 & 1<=p65] | [1<=p4 & 1<=p39]]]] | E [[1<=p18 & 1<=p66] U [[[1<=p38 & 1<=p55] | [1<=p0 & 1<=p81]] | [[1<=p10 & 1<=p40] & [1<=p26 & 1<=p56]]]]]]]
abstracting: (1<=p56)
states: 20,351,345,355 (10)
abstracting: (1<=p26)
states: 4,950,790,605 (9)
abstracting: (1<=p40)
states: 9,511,333,155 (9)
abstracting: (1<=p10)
states: 9,511,333,155 (9)
abstracting: (1<=p81)
states: 20,351,345,355 (10)
abstracting: (1<=p0)
states: 4,950,790,605 (9)
abstracting: (1<=p55)
states: 9,511,333,155 (9)
abstracting: (1<=p38)
states: 9,511,333,155 (9)
abstracting: (1<=p66)
states: 9,511,333,155 (9)
abstracting: (1<=p18)
states: 9,511,333,155 (9)
abstracting: (1<=p39)
states: 9,511,333,155 (9)
abstracting: (1<=p4)
states: 9,511,333,155 (9)
abstracting: (1<=p65)
states: 9,511,333,155 (9)
abstracting: (1<=p42)
states: 9,511,333,155 (9)
abstracting: (1<=p93)
states: 20,351,345,355 (10)
abstracting: (1<=p35)
states: 4,950,790,605 (9)
abstracting: (1<=p57)
states: 9,511,333,155 (9)
abstracting: (1<=p54)
states: 9,511,333,155 (9)
.abstracting: (1<=p31)
states: 9,511,333,155 (9)
abstracting: (1<=p2)
states: 9,511,333,155 (9)
abstracting: (1<=p80)
states: 9,511,333,155 (9)
abstracting: (1<=p20)
states: 9,511,333,155 (9)
........................................................................................................................................................................................................................................................................
EG iterations: 264
EG iterations: 0
-> the formula is TRUE
FORMULA CircularTrains-PT-048-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.511sec
checking: E [A [[AG [[1<=p28 & 1<=p49]] | [~ [[[1<=p32 & 1<=p37] | EG [[1<=p46 & 1<=p70]]]] | ~ [[1<=p60 & 1<=p86]]]] U ~ [AG [AX [[1<=p30 & 1<=p47]]]]] U [AX [[~ [A [[1<=p3 & 1<=p76] U [1<=p60 & 1<=p86]]] & [1<=p4 & 1<=p39]]] & A [[[AF [[1<=p9 & 1<=p45]] & [AF [[1<=p14 & 1<=p34]] | [[1<=p18 & 1<=p66] | [1<=p18 & 1<=p66]]]] | [1<=p73 & 1<=p79]] U EX [~ [[1<=p18 & 1<=p66]]]]]]
normalized: E [[~ [EG [~ [E [true U EX [~ [[1<=p30 & 1<=p47]]]]]]] & ~ [E [~ [E [true U EX [~ [[1<=p30 & 1<=p47]]]]] U [~ [[[~ [[1<=p60 & 1<=p86]] | ~ [[EG [[1<=p46 & 1<=p70]] | [1<=p32 & 1<=p37]]]] | ~ [E [true U ~ [[1<=p28 & 1<=p49]]]]]] & ~ [E [true U EX [~ [[1<=p30 & 1<=p47]]]]]]]]] U [[~ [EG [~ [EX [~ [[1<=p18 & 1<=p66]]]]]] & ~ [E [~ [EX [~ [[1<=p18 & 1<=p66]]]] U [~ [[[[[[1<=p18 & 1<=p66] | [1<=p18 & 1<=p66]] | ~ [EG [~ [[1<=p14 & 1<=p34]]]]] & ~ [EG [~ [[1<=p9 & 1<=p45]]]]] | [1<=p73 & 1<=p79]]] & ~ [EX [~ [[1<=p18 & 1<=p66]]]]]]]] & ~ [EX [~ [[[1<=p4 & 1<=p39] & ~ [[~ [EG [~ [[1<=p60 & 1<=p86]]]] & ~ [E [~ [[1<=p60 & 1<=p86]] U [~ [[1<=p3 & 1<=p76]] & ~ [[1<=p60 & 1<=p86]]]]]]]]]]]]]
abstracting: (1<=p86)
states: 9,511,333,155 (9)
abstracting: (1<=p60)
states: 9,511,333,155 (9)
abstracting: (1<=p76)
states: 4,950,790,605 (9)
abstracting: (1<=p3)
states: 20,351,345,355 (10)
abstracting: (1<=p86)
states: 9,511,333,155 (9)
abstracting: (1<=p60)
states: 9,511,333,155 (9)
abstracting: (1<=p86)
states: 9,511,333,155 (9)
abstracting: (1<=p60)
states: 9,511,333,155 (9)
...........................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 363
abstracting: (1<=p39)
states: 9,511,333,155 (9)
abstracting: (1<=p4)
states: 9,511,333,155 (9)
.abstracting: (1<=p66)
states: 9,511,333,155 (9)
abstracting: (1<=p18)
states: 9,511,333,155 (9)
.abstracting: (1<=p79)
states: 9,511,333,155 (9)
abstracting: (1<=p73)
states: 9,511,333,155 (9)
abstracting: (1<=p45)
states: 9,511,333,155 (9)
abstracting: (1<=p9)
states: 9,511,333,155 (9)
...........................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 363
abstracting: (1<=p34)
states: 9,511,333,155 (9)
abstracting: (1<=p14)
states: 9,511,333,155 (9)
...........................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 363
abstracting: (1<=p66)
states: 9,511,333,155 (9)
abstracting: (1<=p18)
states: 9,511,333,155 (9)
abstracting: (1<=p66)
states: 9,511,333,155 (9)
abstracting: (1<=p18)
states: 9,511,333,155 (9)
abstracting: (1<=p66)
states: 9,511,333,155 (9)
abstracting: (1<=p18)
states: 9,511,333,155 (9)
.abstracting: (1<=p66)
states: 9,511,333,155 (9)
abstracting: (1<=p18)
states: 9,511,333,155 (9)
...
EG iterations: 2
abstracting: (1<=p47)
states: 9,511,333,155 (9)
abstracting: (1<=p30)
states: 9,511,333,155 (9)
.abstracting: (1<=p49)
states: 9,511,333,155 (9)
abstracting: (1<=p28)
states: 9,511,333,155 (9)
abstracting: (1<=p37)
states: 9,511,333,155 (9)
abstracting: (1<=p32)
states: 9,511,333,155 (9)
abstracting: (1<=p70)
states: 9,511,333,155 (9)
abstracting: (1<=p46)
states: 9,511,333,155 (9)
....................................................................................................................................................................................................................................................................................................................................................
EG iterations: 340
abstracting: (1<=p86)
states: 9,511,333,155 (9)
abstracting: (1<=p60)
states: 9,511,333,155 (9)
abstracting: (1<=p47)
states: 9,511,333,155 (9)
abstracting: (1<=p30)
states: 9,511,333,155 (9)
.abstracting: (1<=p47)
states: 9,511,333,155 (9)
abstracting: (1<=p30)
states: 9,511,333,155 (9)
..
EG iterations: 1
-> the formula is TRUE
FORMULA CircularTrains-PT-048-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m12.884sec
checking: [EX [[[[[1<=p30 & 1<=p47] | [1<=p11 & 1<=p21]] & [EX [[p48<=0 | p77<=0]] | [[p15<=0 | p90<=0] & [p1<=0 | p24<=0]]]] | [p29<=0 | p50<=0]]] & [EG [A [[AF [[1<=p61 & 1<=p68]] | EG [[1<=p23 & 1<=p91]]] U [EF [~ [[p64<=0 | p78<=0]]] | [1<=p22 & 1<=p87]]]] | [EG [[p71<=0 | p89<=0]] | ~ [A [EF [[[1<=p64 & 1<=p78] & [1<=p4 & 1<=p39]]] U [1<=p1 & 1<=p24]]]]]]
normalized: [[[~ [[~ [EG [~ [[1<=p1 & 1<=p24]]]] & ~ [E [~ [[1<=p1 & 1<=p24]] U [~ [E [true U [[1<=p4 & 1<=p39] & [1<=p64 & 1<=p78]]]] & ~ [[1<=p1 & 1<=p24]]]]]]] | EG [[p71<=0 | p89<=0]]] | EG [[~ [EG [~ [[[1<=p22 & 1<=p87] | E [true U ~ [[p64<=0 | p78<=0]]]]]]] & ~ [E [~ [[[1<=p22 & 1<=p87] | E [true U ~ [[p64<=0 | p78<=0]]]]] U [~ [[EG [[1<=p23 & 1<=p91]] | ~ [EG [~ [[1<=p61 & 1<=p68]]]]]] & ~ [[[1<=p22 & 1<=p87] | E [true U ~ [[p64<=0 | p78<=0]]]]]]]]]]] & EX [[[p29<=0 | p50<=0] | [[[[p1<=0 | p24<=0] & [p15<=0 | p90<=0]] | EX [[p48<=0 | p77<=0]]] & [[1<=p11 & 1<=p21] | [1<=p30 & 1<=p47]]]]]]
abstracting: (1<=p47)
states: 9,511,333,155 (9)
abstracting: (1<=p30)
states: 9,511,333,155 (9)
abstracting: (1<=p21)
states: 9,511,333,155 (9)
abstracting: (1<=p11)
states: 9,511,333,155 (9)
abstracting: (p77<=0)
states: 14,462,123,760 (10)
abstracting: (p48<=0)
states: 14,462,123,760 (10)
.abstracting: (p90<=0)
states: 3,622,111,560 (9)
abstracting: (p15<=0)
states: 19,022,666,310 (10)
abstracting: (p24<=0)
states: 19,022,666,310 (10)
abstracting: (p1<=0)
states: 3,622,111,560 (9)
abstracting: (p50<=0)
states: 14,462,123,760 (10)
abstracting: (p29<=0)
states: 14,462,123,760 (10)
.abstracting: (p78<=0)
states: 19,022,666,310 (10)
abstracting: (p64<=0)
states: 3,622,111,560 (9)
abstracting: (1<=p87)
states: 4,950,790,605 (9)
abstracting: (1<=p22)
states: 20,351,345,355 (10)
abstracting: (1<=p68)
states: 9,511,333,155 (9)
abstracting: (1<=p61)
states: 9,511,333,155 (9)
...........................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 363
abstracting: (1<=p91)
states: 20,351,345,355 (10)
abstracting: (1<=p23)
states: 4,950,790,605 (9)
....................................................................................................................................................................................................................................................................................................................................................
EG iterations: 340
abstracting: (p78<=0)
states: 19,022,666,310 (10)
abstracting: (p64<=0)
states: 3,622,111,560 (9)
abstracting: (1<=p87)
states: 4,950,790,605 (9)
abstracting: (1<=p22)
states: 20,351,345,355 (10)
abstracting: (p78<=0)
states: 19,022,666,310 (10)
abstracting: (p64<=0)
states: 3,622,111,560 (9)
abstracting: (1<=p87)
states: 4,950,790,605 (9)
abstracting: (1<=p22)
states: 20,351,345,355 (10)
.
EG iterations: 1
EG iterations: 0
abstracting: (p89<=0)
states: 3,622,111,560 (9)
abstracting: (p71<=0)
states: 19,022,666,310 (10)
..................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 386
abstracting: (1<=p24)
states: 4,950,790,605 (9)
abstracting: (1<=p1)
states: 20,351,345,355 (10)
abstracting: (1<=p78)
states: 4,950,790,605 (9)
abstracting: (1<=p64)
states: 20,351,345,355 (10)
abstracting: (1<=p39)
states: 9,511,333,155 (9)
abstracting: (1<=p4)
states: 9,511,333,155 (9)
abstracting: (1<=p24)
states: 4,950,790,605 (9)
abstracting: (1<=p1)
states: 20,351,345,355 (10)
abstracting: (1<=p24)
states: 4,950,790,605 (9)
abstracting: (1<=p1)
states: 20,351,345,355 (10)
..................................................................................................................
before gc: list nodes free: 1826698
after gc: idd nodes used:116559, unused:63883441; list nodes free:301442640
................................................................................................................................................................................................................................................................................
EG iterations: 386
-> the formula is TRUE
FORMULA CircularTrains-PT-048-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m16.823sec
checking: A [AG [E [EF [[1<=p26 & 1<=p56]] U [EG [[1<=p14 & 1<=p34]] | [[1<=p2 & 1<=p31] | [[1<=p30 & 1<=p47] & [1<=p17 & 1<=p82]]]]]] U [~ [EX [[EF [[1<=p73 & 1<=p79]] | [[1<=p61 & 1<=p68] & [1<=p0 & 1<=p81]]]]] | [AF [[AG [[1<=p26 & 1<=p56]] | [1<=p17 & 1<=p82]]] | [[AX [[[1<=p16 & 1<=p84] & [1<=p13 & 1<=p85]]] & EF [[[1<=p16 & 1<=p84] & [1<=p13 & 1<=p85]]]] & [1<=p22 & 1<=p87]]]]]
normalized: [~ [EG [~ [[[[[1<=p22 & 1<=p87] & [E [true U [[1<=p13 & 1<=p85] & [1<=p16 & 1<=p84]]] & ~ [EX [~ [[[1<=p13 & 1<=p85] & [1<=p16 & 1<=p84]]]]]]] | ~ [EG [~ [[[1<=p17 & 1<=p82] | ~ [E [true U ~ [[1<=p26 & 1<=p56]]]]]]]]] | ~ [EX [[[[1<=p0 & 1<=p81] & [1<=p61 & 1<=p68]] | E [true U [1<=p73 & 1<=p79]]]]]]]]] & ~ [E [~ [[[[[1<=p22 & 1<=p87] & [E [true U [[1<=p13 & 1<=p85] & [1<=p16 & 1<=p84]]] & ~ [EX [~ [[[1<=p13 & 1<=p85] & [1<=p16 & 1<=p84]]]]]]] | ~ [EG [~ [[[1<=p17 & 1<=p82] | ~ [E [true U ~ [[1<=p26 & 1<=p56]]]]]]]]] | ~ [EX [[[[1<=p0 & 1<=p81] & [1<=p61 & 1<=p68]] | E [true U [1<=p73 & 1<=p79]]]]]]] U [E [true U ~ [E [E [true U [1<=p26 & 1<=p56]] U [[[[1<=p30 & 1<=p47] & [1<=p17 & 1<=p82]] | [1<=p2 & 1<=p31]] | EG [[1<=p14 & 1<=p34]]]]]] & ~ [[[[[1<=p22 & 1<=p87] & [E [true U [[1<=p13 & 1<=p85] & [1<=p16 & 1<=p84]]] & ~ [EX [~ [[[1<=p13 & 1<=p85] & [1<=p16 & 1<=p84]]]]]]] | ~ [EG [~ [[[1<=p17 & 1<=p82] | ~ [E [true U ~ [[1<=p26 & 1<=p56]]]]]]]]] | ~ [EX [[[[1<=p0 & 1<=p81] & [1<=p61 & 1<=p68]] | E [true U [1<=p73 & 1<=p79]]]]]]]]]]]
abstracting: (1<=p79)
states: 9,511,333,155 (9)
abstracting: (1<=p73)
states: 9,511,333,155 (9)
abstracting: (1<=p68)
states: 9,511,333,155 (9)
abstracting: (1<=p61)
states: 9,511,333,155 (9)
abstracting: (1<=p81)
states: 20,351,345,355 (10)
abstracting: (1<=p0)
states: 4,950,790,605 (9)
.abstracting: (1<=p56)
states: 20,351,345,355 (10)
abstracting: (1<=p26)
states: 4,950,790,605 (9)
abstracting: (1<=p82)
states: 9,511,333,155 (9)
abstracting: (1<=p17)
states: 9,511,333,155 (9)
...........................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 363
abstracting: (1<=p84)
states: 4,950,790,605 (9)
abstracting: (1<=p16)
states: 20,351,345,355 (10)
abstracting: (1<=p85)
states: 4,950,790,605 (9)
abstracting: (1<=p13)
states: 20,351,345,355 (10)
.abstracting: (1<=p84)
states: 4,950,790,605 (9)
abstracting: (1<=p16)
states: 20,351,345,355 (10)
abstracting: (1<=p85)
states: 4,950,790,605 (9)
abstracting: (1<=p13)
states: 20,351,345,355 (10)
abstracting: (1<=p87)
states: 4,950,790,605 (9)
abstracting: (1<=p22)
states: 20,351,345,355 (10)
abstracting: (1<=p34)
states: 9,511,333,155 (9)
abstracting: (1<=p14)
states: 9,511,333,155 (9)
....................................................................................................................................................................................................................................................................................................................................................
EG iterations: 340
abstracting: (1<=p31)
states: 9,511,333,155 (9)
abstracting: (1<=p2)
states: 9,511,333,155 (9)
abstracting: (1<=p82)
states: 9,511,333,155 (9)
abstracting: (1<=p17)
states: 9,511,333,155 (9)
abstracting: (1<=p47)
states: 9,511,333,155 (9)
abstracting: (1<=p30)
states: 9,511,333,155 (9)
abstracting: (1<=p56)
states: 20,351,345,355 (10)
abstracting: (1<=p26)
states: 4,950,790,605 (9)
abstracting: (1<=p79)
states: 9,511,333,155 (9)
abstracting: (1<=p73)
states: 9,511,333,155 (9)
abstracting: (1<=p68)
states: 9,511,333,155 (9)
abstracting: (1<=p61)
states: 9,511,333,155 (9)
abstracting: (1<=p81)
states: 20,351,345,355 (10)
abstracting: (1<=p0)
states: 4,950,790,605 (9)
.abstracting: (1<=p56)
states: 20,351,345,355 (10)
abstracting: (1<=p26)
states: 4,950,790,605 (9)
abstracting: (1<=p82)
states: 9,511,333,155 (9)
abstracting: (1<=p17)
states: 9,511,333,155 (9)
...........................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 363
abstracting: (1<=p84)
states: 4,950,790,605 (9)
abstracting: (1<=p16)
states: 20,351,345,355 (10)
abstracting: (1<=p85)
states: 4,950,790,605 (9)
abstracting: (1<=p13)
states: 20,351,345,355 (10)
.abstracting: (1<=p84)
states: 4,950,790,605 (9)
abstracting: (1<=p16)
states: 20,351,345,355 (10)
abstracting: (1<=p85)
states: 4,950,790,605 (9)
abstracting: (1<=p13)
states: 20,351,345,355 (10)
abstracting: (1<=p87)
states: 4,950,790,605 (9)
abstracting: (1<=p22)
states: 20,351,345,355 (10)
abstracting: (1<=p79)
states: 9,511,333,155 (9)
abstracting: (1<=p73)
states: 9,511,333,155 (9)
abstracting: (1<=p68)
states: 9,511,333,155 (9)
abstracting: (1<=p61)
states: 9,511,333,155 (9)
abstracting: (1<=p81)
states: 20,351,345,355 (10)
abstracting: (1<=p0)
states: 4,950,790,605 (9)
.abstracting: (1<=p56)
states: 20,351,345,355 (10)
abstracting: (1<=p26)
states: 4,950,790,605 (9)
abstracting: (1<=p82)
states: 9,511,333,155 (9)
abstracting: (1<=p17)
states: 9,511,333,155 (9)
...........................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 363
abstracting: (1<=p84)
states: 4,950,790,605 (9)
abstracting: (1<=p16)
states: 20,351,345,355 (10)
abstracting: (1<=p85)
states: 4,950,790,605 (9)
abstracting: (1<=p13)
states: 20,351,345,355 (10)
.abstracting: (1<=p84)
states: 4,950,790,605 (9)
abstracting: (1<=p16)
states: 20,351,345,355 (10)
abstracting: (1<=p85)
states: 4,950,790,605 (9)
abstracting: (1<=p13)
states: 20,351,345,355 (10)
abstracting: (1<=p87)
states: 4,950,790,605 (9)
abstracting: (1<=p22)
states: 20,351,345,355 (10)
.
EG iterations: 1
-> the formula is TRUE
FORMULA CircularTrains-PT-048-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.931sec
checking: [AX [[[EF [[p18<=0 | p66<=0]] & 1<=p5] & [1<=p25 & [[p48<=0 | p77<=0] & [p20<=0 | p80<=0]]]]] | [AG [[AG [EF [[p60<=0 | p86<=0]]] | EX [[p23<=0 | p91<=0]]]] & [[EF [AX [[p1<=0 | p24<=0]]] | AG [[1<=p12 & 1<=p67]]] | [~ [A [EX [[1<=p42 & 1<=p65]] U [A [[1<=p38 & 1<=p55] U [1<=p61 & 1<=p68]] | [[1<=p27 & 1<=p59] | [1<=p36 & 1<=p43]]]]] | A [[EG [~ [[1<=p7 & 1<=p83]]] | ~ [[[1<=p73 & 1<=p79] | [1<=p19 & 1<=p52]]]] U [1<=p61 & 1<=p68]]]]]]
normalized: [[[[[~ [EG [~ [[1<=p61 & 1<=p68]]]] & ~ [E [~ [[1<=p61 & 1<=p68]] U [~ [[~ [[[1<=p19 & 1<=p52] | [1<=p73 & 1<=p79]]] | EG [~ [[1<=p7 & 1<=p83]]]]] & ~ [[1<=p61 & 1<=p68]]]]]] | ~ [[~ [EG [~ [[[[1<=p36 & 1<=p43] | [1<=p27 & 1<=p59]] | [~ [EG [~ [[1<=p61 & 1<=p68]]]] & ~ [E [~ [[1<=p61 & 1<=p68]] U [~ [[1<=p38 & 1<=p55]] & ~ [[1<=p61 & 1<=p68]]]]]]]]]] & ~ [E [~ [[[[1<=p36 & 1<=p43] | [1<=p27 & 1<=p59]] | [~ [EG [~ [[1<=p61 & 1<=p68]]]] & ~ [E [~ [[1<=p61 & 1<=p68]] U [~ [[1<=p38 & 1<=p55]] & ~ [[1<=p61 & 1<=p68]]]]]]]] U [~ [EX [[1<=p42 & 1<=p65]]] & ~ [[[[1<=p36 & 1<=p43] | [1<=p27 & 1<=p59]] | [~ [EG [~ [[1<=p61 & 1<=p68]]]] & ~ [E [~ [[1<=p61 & 1<=p68]] U [~ [[1<=p38 & 1<=p55]] & ~ [[1<=p61 & 1<=p68]]]]]]]]]]]]]] | [~ [E [true U ~ [[1<=p12 & 1<=p67]]]] | E [true U ~ [EX [~ [[p1<=0 | p24<=0]]]]]]] & ~ [E [true U ~ [[EX [[p23<=0 | p91<=0]] | ~ [E [true U ~ [E [true U [p60<=0 | p86<=0]]]]]]]]]] | ~ [EX [~ [[[1<=p25 & [[p20<=0 | p80<=0] & [p48<=0 | p77<=0]]] & [1<=p5 & E [true U [p18<=0 | p66<=0]]]]]]]]
abstracting: (p66<=0)
states: 14,462,123,760 (10)
abstracting: (p18<=0)
states: 14,462,123,760 (10)
abstracting: (1<=p5)
states: 9,511,333,155 (9)
abstracting: (p77<=0)
states: 14,462,123,760 (10)
abstracting: (p48<=0)
states: 14,462,123,760 (10)
abstracting: (p80<=0)
states: 14,462,123,760 (10)
abstracting: (p20<=0)
states: 14,462,123,760 (10)
abstracting: (1<=p25)
states: 9,511,333,155 (9)
.abstracting: (p86<=0)
states: 14,462,123,760 (10)
abstracting: (p60<=0)
states: 14,462,123,760 (10)
abstracting: (p91<=0)
states: 3,622,111,560 (9)
abstracting: (p23<=0)
states: 19,022,666,310 (10)
.abstracting: (p24<=0)
states: 19,022,666,310 (10)
abstracting: (p1<=0)
states: 3,622,111,560 (9)
.abstracting: (1<=p67)
states: 9,511,333,155 (9)
abstracting: (1<=p12)
states: 9,511,333,155 (9)
abstracting: (1<=p68)
states: 9,511,333,155 (9)
abstracting: (1<=p61)
states: 9,511,333,155 (9)
abstracting: (1<=p55)
states: 9,511,333,155 (9)
abstracting: (1<=p38)
states: 9,511,333,155 (9)
abstracting: (1<=p68)
states: 9,511,333,155 (9)
abstracting: (1<=p61)
states: 9,511,333,155 (9)
abstracting: (1<=p68)
states: 9,511,333,155 (9)
abstracting: (1<=p61)
states: 9,511,333,155 (9)
...........................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 363
abstracting: (1<=p59)
states: 9,511,333,155 (9)
abstracting: (1<=p27)
states: 9,511,333,155 (9)
abstracting: (1<=p43)
states: 9,511,333,155 (9)
abstracting: (1<=p36)
states: 9,511,333,155 (9)
abstracting: (1<=p65)
states: 9,511,333,155 (9)
abstracting: (1<=p42)
states: 9,511,333,155 (9)
.abstracting: (1<=p68)
states: 9,511,333,155 (9)
abstracting: (1<=p61)
states: 9,511,333,155 (9)
abstracting: (1<=p55)
states: 9,511,333,155 (9)
abstracting: (1<=p38)
states: 9,511,333,155 (9)
abstracting: (1<=p68)
states: 9,511,333,155 (9)
abstracting: (1<=p61)
states: 9,511,333,155 (9)
abstracting: (1<=p68)
states: 9,511,333,155 (9)
abstracting: (1<=p61)
states: 9,511,333,155 (9)
...........................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 363
abstracting: (1<=p59)
states: 9,511,333,155 (9)
abstracting: (1<=p27)
states: 9,511,333,155 (9)
abstracting: (1<=p43)
states: 9,511,333,155 (9)
abstracting: (1<=p36)
states: 9,511,333,155 (9)
abstracting: (1<=p68)
states: 9,511,333,155 (9)
abstracting: (1<=p61)
states: 9,511,333,155 (9)
abstracting: (1<=p55)
states: 9,511,333,155 (9)
abstracting: (1<=p38)
states: 9,511,333,155 (9)
abstracting: (1<=p68)
states: 9,511,333,155 (9)
abstracting: (1<=p61)
states: 9,511,333,155 (9)
abstracting: (1<=p68)
states: 9,511,333,155 (9)
abstracting: (1<=p61)
states: 9,511,333,155 (9)
...........................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 363
abstracting: (1<=p59)
states: 9,511,333,155 (9)
abstracting: (1<=p27)
states: 9,511,333,155 (9)
abstracting: (1<=p43)
states: 9,511,333,155 (9)
abstracting: (1<=p36)
states: 9,511,333,155 (9)
.................................................................................................................................................................
EG iterations: 161
abstracting: (1<=p68)
states: 9,511,333,155 (9)
abstracting: (1<=p61)
states: 9,511,333,155 (9)
abstracting: (1<=p83)
states: 20,351,345,355 (10)
abstracting: (1<=p7)
states: 4,950,790,605 (9)
..................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 386
abstracting: (1<=p79)
states: 9,511,333,155 (9)
abstracting: (1<=p73)
states: 9,511,333,155 (9)
abstracting: (1<=p52)
states: 9,511,333,155 (9)
abstracting: (1<=p19)
states: 9,511,333,155 (9)
abstracting: (1<=p68)
states: 9,511,333,155 (9)
abstracting: (1<=p61)
states: 9,511,333,155 (9)
abstracting: (1<=p68)
states: 9,511,333,155 (9)
abstracting: (1<=p61)
states: 9,511,333,155 (9)
...........................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 363
-> the formula is TRUE
FORMULA CircularTrains-PT-048-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 9.131sec
totally nodes used: 83748084 (8.4e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 33584858 116203004 149787862
used/not used/entry size/cache size: 34313860 32795004 16 1024MB
basic ops cache: hits/miss/sum: 4412463 11428848 15841311
used/not used/entry size/cache size: 4847655 11929561 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: 37556 118119 155675
used/not used/entry size/cache size: 33475 8355133 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 50965996
1 13079214
2 2547718
3 434188
4 64268
5 9523
6 2614
7 1006
8 567
9 741
>= 10 3029
Total processing time: 1m27.457sec
BK_STOP 1678306128770
--------------------
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.013sec
iterations count:1536 (32), effective:384 (8)
initing FirstDep: 0m 0.013sec
iterations count:51 (1), effective:1 (0)
iterations count:51 (1), effective:1 (0)
iterations count:51 (1), effective:1 (0)
iterations count:1624 (33), effective:383 (7)
iterations count:54 (1), effective:2 (0)
iterations count:231 (4), effective:47 (0)
iterations count:231 (4), effective:47 (0)
iterations count:231 (4), effective:47 (0)
iterations count:51 (1), effective:1 (0)
iterations count:60 (1), effective:4 (0)
iterations count:60 (1), effective:4 (0)
iterations count:48 (1), effective:0 (0)
iterations count:60 (1), effective:4 (0)
iterations count:51 (1), effective:1 (0)
iterations count:231 (4), effective:47 (0)
iterations count:370 (7), effective:80 (1)
iterations count:51 (1), effective:1 (0)
iterations count:48 (1), effective:0 (0)
iterations count:51 (1), effective:1 (0)
iterations count:231 (4), effective:47 (0)
iterations count:192 (4), effective:34 (0)
iterations count:54 (1), effective:2 (0)
iterations count:120 (2), effective:24 (0)
iterations count:51 (1), effective:1 (0)
iterations count:437 (9), effective:103 (2)
iterations count:48 (1), effective:0 (0)
iterations count:293 (6), effective:67 (1)
iterations count:369 (7), effective:93 (1)
iterations count:51 (1), effective:1 (0)
iterations count:56 (1), effective:2 (0)
iterations count:51 (1), effective:1 (0)
iterations count:56 (1), effective:2 (0)
iterations count:56 (1), effective:2 (0)
iterations count:1832 (38), effective:384 (8)
iterations count:231 (4), effective:47 (0)
iterations count:231 (4), effective:47 (0)
iterations count:231 (4), effective:47 (0)
iterations count:403 (8), effective:91 (1)
iterations count:231 (4), effective:47 (0)
iterations count:51 (1), effective:1 (0)
iterations count:407 (8), effective:92 (1)
iterations count:231 (4), effective:47 (0)
iterations count:231 (4), effective:47 (0)
iterations count:231 (4), effective:47 (0)
iterations count:51 (1), effective:1 (0)
iterations count:407 (8), effective:92 (1)
iterations count:231 (4), effective:47 (0)
iterations count:51 (1), effective:1 (0)
iterations count:407 (8), effective:92 (1)
iterations count:51 (1), effective:1 (0)
iterations count:51 (1), effective:1 (0)
iterations count:54 (1), effective:2 (0)
iterations count:50 (1), effective:1 (0)
iterations count:51 (1), effective:1 (0)
iterations count:51 (1), effective:1 (0)
iterations count:246 (5), effective:67 (1)
iterations count:51 (1), effective:1 (0)
iterations count:233 (4), effective:62 (1)
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="CircularTrains-PT-048"
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 CircularTrains-PT-048, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r074-smll-167814399900162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CircularTrains-PT-048.tgz
mv CircularTrains-PT-048 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 ;