Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r330-tall-167889203200369.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 Railroad-PT-010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203200369
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 9.0K Feb 25 22:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 22:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 22:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 22:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 22:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 25 22:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 22:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 82K 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 Railroad-PT-010-CTLCardinality-00
FORMULA_NAME Railroad-PT-010-CTLCardinality-01
FORMULA_NAME Railroad-PT-010-CTLCardinality-02
FORMULA_NAME Railroad-PT-010-CTLCardinality-03
FORMULA_NAME Railroad-PT-010-CTLCardinality-04
FORMULA_NAME Railroad-PT-010-CTLCardinality-05
FORMULA_NAME Railroad-PT-010-CTLCardinality-06
FORMULA_NAME Railroad-PT-010-CTLCardinality-07
FORMULA_NAME Railroad-PT-010-CTLCardinality-08
FORMULA_NAME Railroad-PT-010-CTLCardinality-09
FORMULA_NAME Railroad-PT-010-CTLCardinality-10
FORMULA_NAME Railroad-PT-010-CTLCardinality-11
FORMULA_NAME Railroad-PT-010-CTLCardinality-12
FORMULA_NAME Railroad-PT-010-CTLCardinality-13
FORMULA_NAME Railroad-PT-010-CTLCardinality-14
FORMULA_NAME Railroad-PT-010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679150997034

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Railroad-PT-010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 14:49:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 14:49:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 14:49:58] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2023-03-18 14:49:58] [INFO ] Transformed 118 places.
[2023-03-18 14:49:58] [INFO ] Transformed 156 transitions.
[2023-03-18 14:49:58] [INFO ] Found NUPN structural information;
[2023-03-18 14:49:58] [INFO ] Parsed PT model containing 118 places and 156 transitions and 898 arcs in 105 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 10 transitions.
FORMULA Railroad-PT-010-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 146/146 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 78 transition count 146
Applied a total of 9 rules in 12 ms. Remains 78 /87 variables (removed 9) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 78 cols
[2023-03-18 14:49:58] [INFO ] Computed 32 place invariants in 20 ms
[2023-03-18 14:49:59] [INFO ] Implicit Places using invariants in 388 ms returned []
[2023-03-18 14:49:59] [INFO ] Invariant cache hit.
[2023-03-18 14:49:59] [INFO ] Implicit Places using invariants and state equation in 94 ms returned [34, 70]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 507 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/87 places, 146/146 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 521 ms. Remains : 76/87 places, 146/146 transitions.
Support contains 58 out of 76 places after structural reductions.
[2023-03-18 14:49:59] [INFO ] Flatten gal took : 46 ms
[2023-03-18 14:49:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Railroad-PT-010-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 14:49:59] [INFO ] Flatten gal took : 20 ms
[2023-03-18 14:49:59] [INFO ] Input system was already deterministic with 146 transitions.
Support contains 48 out of 76 places (down from 58) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 39) seen :38
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 146 rows 76 cols
[2023-03-18 14:49:59] [INFO ] Computed 30 place invariants in 11 ms
[2023-03-18 14:49:59] [INFO ] [Real]Absence check using 22 positive place invariants in 7 ms returned sat
[2023-03-18 14:49:59] [INFO ] [Real]Absence check using 22 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-18 14:49:59] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 14:49:59] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-18 14:49:59] [INFO ] [Nat]Absence check using 22 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-18 14:49:59] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 14:50:00] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 3 ms to minimize.
[2023-03-18 14:50:00] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2023-03-18 14:50:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 157 ms
[2023-03-18 14:50:00] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-18 14:50:00] [INFO ] After 270ms SMT Verify possible using all constraints in natural 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 13 simplifications.
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 13 ms
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 14 ms
[2023-03-18 14:50:00] [INFO ] Input system was already deterministic with 146 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 146/146 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 73 transition count 146
Applied a total of 3 rules in 4 ms. Remains 73 /76 variables (removed 3) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 73/76 places, 146/146 transitions.
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 10 ms
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 11 ms
[2023-03-18 14:50:00] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 146/146 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 73 transition count 146
Applied a total of 3 rules in 4 ms. Remains 73 /76 variables (removed 3) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 73/76 places, 146/146 transitions.
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 10 ms
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 10 ms
[2023-03-18 14:50:00] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 76/76 places, 146/146 transitions.
Ensure Unique test removed 3 places
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 73 transition count 145
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 145
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 16 place count 65 transition count 138
Applied a total of 16 rules in 21 ms. Remains 65 /76 variables (removed 11) and now considering 138/146 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 65/76 places, 138/146 transitions.
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 8 ms
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 10 ms
[2023-03-18 14:50:00] [INFO ] Input system was already deterministic with 138 transitions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 146/146 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 73 transition count 146
Applied a total of 3 rules in 3 ms. Remains 73 /76 variables (removed 3) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 73/76 places, 146/146 transitions.
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 8 ms
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 9 ms
[2023-03-18 14:50:00] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 146/146 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 73 transition count 146
Applied a total of 3 rules in 2 ms. Remains 73 /76 variables (removed 3) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 73/76 places, 146/146 transitions.
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 8 ms
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 8 ms
[2023-03-18 14:50:00] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 146/146 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 73 transition count 146
Applied a total of 3 rules in 2 ms. Remains 73 /76 variables (removed 3) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 73/76 places, 146/146 transitions.
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 7 ms
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 8 ms
[2023-03-18 14:50:00] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 76/76 places, 146/146 transitions.
Ensure Unique test removed 3 places
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 73 transition count 144
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 71 transition count 144
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 18 place count 64 transition count 137
Applied a total of 18 rules in 15 ms. Remains 64 /76 variables (removed 12) and now considering 137/146 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 64/76 places, 137/146 transitions.
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 6 ms
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 6 ms
[2023-03-18 14:50:00] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 146/146 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 73 transition count 146
Applied a total of 3 rules in 2 ms. Remains 73 /76 variables (removed 3) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 73/76 places, 146/146 transitions.
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 6 ms
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 11 ms
[2023-03-18 14:50:00] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 146/146 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 73 transition count 146
Applied a total of 3 rules in 3 ms. Remains 73 /76 variables (removed 3) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 73/76 places, 146/146 transitions.
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 6 ms
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 6 ms
[2023-03-18 14:50:00] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 146/146 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 73 transition count 146
Applied a total of 3 rules in 2 ms. Remains 73 /76 variables (removed 3) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 73/76 places, 146/146 transitions.
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 7 ms
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 7 ms
[2023-03-18 14:50:00] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 76/76 places, 146/146 transitions.
Ensure Unique test removed 3 places
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 73 transition count 145
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 72 transition count 145
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 18 place count 64 transition count 137
Applied a total of 18 rules in 13 ms. Remains 64 /76 variables (removed 12) and now considering 137/146 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 64/76 places, 137/146 transitions.
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 6 ms
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 6 ms
[2023-03-18 14:50:00] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 146/146 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 73 transition count 146
Applied a total of 3 rules in 2 ms. Remains 73 /76 variables (removed 3) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 73/76 places, 146/146 transitions.
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 7 ms
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 6 ms
[2023-03-18 14:50:00] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 76/76 places, 146/146 transitions.
Ensure Unique test removed 3 places
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 73 transition count 144
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 71 transition count 144
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 12 place count 67 transition count 140
Applied a total of 12 rules in 10 ms. Remains 67 /76 variables (removed 9) and now considering 140/146 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 67/76 places, 140/146 transitions.
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 5 ms
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 5 ms
[2023-03-18 14:50:00] [INFO ] Input system was already deterministic with 140 transitions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 146/146 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 73 transition count 146
Applied a total of 3 rules in 2 ms. Remains 73 /76 variables (removed 3) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 73/76 places, 146/146 transitions.
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 5 ms
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 6 ms
[2023-03-18 14:50:00] [INFO ] Input system was already deterministic with 146 transitions.
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 6 ms
[2023-03-18 14:50:00] [INFO ] Flatten gal took : 5 ms
[2023-03-18 14:50:00] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-18 14:50:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 76 places, 146 transitions and 815 arcs took 1 ms.
Total runtime 2373 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 76 NrTr: 146 NrArc: 815)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec

net check time: 0m 0.000sec

init dd package: 0m 2.753sec


RS generation: 0m 2.350sec


-> reachability set: #nodes 39695 (4.0e+04) #states 2,038,166 (6)



starting MCC model checker
--------------------------

checking: AF [AG [EX [0<=0]]]
normalized: ~ [EG [E [true U ~ [EX [0<=0]]]]]

abstracting: (0<=0)
states: 2,038,166 (6)
..
EG iterations: 1
-> the formula is TRUE

FORMULA Railroad-PT-010-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.984sec

checking: EF [EX [AG [[p3<=0 & 0<=p3]]]]
normalized: E [true U EX [~ [E [true U ~ [[p3<=0 & 0<=p3]]]]]]

abstracting: (0<=p3)
states: 2,038,166 (6)
abstracting: (p3<=0)
states: 2,038,122 (6)
.-> the formula is FALSE

FORMULA Railroad-PT-010-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.487sec

checking: EG [AX [EX [[[p34<=1 & 1<=p34] | [p18<=0 & 0<=p18]]]]]
normalized: EG [~ [EX [~ [EX [[[p18<=0 & 0<=p18] | [p34<=1 & 1<=p34]]]]]]]

abstracting: (1<=p34)
states: 1,009,267 (6)
abstracting: (p34<=1)
states: 2,038,166 (6)
abstracting: (0<=p18)
states: 2,038,166 (6)
abstracting: (p18<=0)
states: 1,533,561 (6)
..
EG iterations: 0
-> the formula is TRUE

FORMULA Railroad-PT-010-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.138sec

checking: AF [EX [EG [[[p5<=0 & 0<=p5] & [p53<=1 & 1<=p53]]]]]
normalized: ~ [EG [~ [EX [EG [[[p53<=1 & 1<=p53] & [p5<=0 & 0<=p5]]]]]]]

abstracting: (0<=p5)
states: 2,038,166 (6)
abstracting: (p5<=0)
states: 1,979,117 (6)
abstracting: (1<=p53)
states: 504,605 (5)
abstracting: (p53<=1)
states: 2,038,166 (6)
..
EG iterations: 2
..........................
EG iterations: 25
-> the formula is FALSE

FORMULA Railroad-PT-010-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.776sec

checking: AG [[EF [[p48<=1 & 1<=p48]] | [p43<=1 & 1<=p43]]]
normalized: ~ [E [true U ~ [[[p43<=1 & 1<=p43] | E [true U [p48<=1 & 1<=p48]]]]]]

abstracting: (1<=p48)
states: 10
abstracting: (p48<=1)
states: 2,038,166 (6)
abstracting: (1<=p43)
states: 504,605 (5)
abstracting: (p43<=1)
states: 2,038,166 (6)
-> the formula is TRUE

FORMULA Railroad-PT-010-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.135sec

checking: AX [[[p29<=0 & 0<=p29] & [p64<=1 & 1<=p64]]]
normalized: ~ [EX [~ [[[p64<=1 & 1<=p64] & [p29<=0 & 0<=p29]]]]]

abstracting: (0<=p29)
states: 2,038,166 (6)
abstracting: (p29<=0)
states: 1,533,504 (6)
abstracting: (1<=p64)
states: 504,605 (5)
abstracting: (p64<=1)
states: 2,038,166 (6)
.-> the formula is FALSE

FORMULA Railroad-PT-010-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.385sec

checking: [EF [AX [1<=0]] | AG [EX [AG [[[[p11<=0 & 0<=p11] | [p38<=1 & 1<=p38]] & [p18<=1 & 1<=p18]]]]]]
normalized: [~ [E [true U ~ [EX [~ [E [true U ~ [[[p18<=1 & 1<=p18] & [[p38<=1 & 1<=p38] | [p11<=0 & 0<=p11]]]]]]]]]] | E [true U ~ [EX [~ [1<=0]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (0<=p11)
states: 2,038,166 (6)
abstracting: (p11<=0)
states: 1,637,996 (6)
abstracting: (1<=p38)
states: 1,009,267 (6)
abstracting: (p38<=1)
states: 2,038,166 (6)
abstracting: (1<=p18)
states: 504,605 (5)
abstracting: (p18<=1)
states: 2,038,166 (6)
.-> the formula is FALSE

FORMULA Railroad-PT-010-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.581sec

checking: AG [[AG [[[p13<=0 & 0<=p13] | [p59<=1 & 1<=p59]]] | ~ [[p71<=0 & 0<=p71]]]]
normalized: ~ [E [true U ~ [[~ [[p71<=0 & 0<=p71]] | ~ [E [true U ~ [[[p59<=1 & 1<=p59] | [p13<=0 & 0<=p13]]]]]]]]]

abstracting: (0<=p13)
states: 2,038,166 (6)
abstracting: (p13<=0)
states: 1,551,211 (6)
abstracting: (1<=p59)
states: 1,009,267 (6)
abstracting: (p59<=1)
states: 2,038,166 (6)
abstracting: (0<=p71)
states: 2,038,166 (6)
abstracting: (p71<=0)
states: 2,038,156 (6)
-> the formula is FALSE

FORMULA Railroad-PT-010-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.100sec

checking: E [[[p0<=0 & 0<=p0] | [p1<=1 & 1<=p1]] U EX [~ [EF [EX [[p8<=1 & 1<=p8]]]]]]
normalized: E [[[p1<=1 & 1<=p1] | [p0<=0 & 0<=p0]] U EX [~ [E [true U EX [[p8<=1 & 1<=p8]]]]]]

abstracting: (1<=p8)
states: 16,890 (4)
abstracting: (p8<=1)
states: 2,038,166 (6)
..abstracting: (0<=p0)
states: 2,038,166 (6)
abstracting: (p0<=0)
states: 1,513,872 (6)
abstracting: (1<=p1)
states: 32
abstracting: (p1<=1)
states: 2,038,166 (6)
-> the formula is FALSE

FORMULA Railroad-PT-010-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.001sec

checking: AX [AG [[AG [[EF [[[p67<=0 & 0<=p67] | [p6<=1 & 1<=p6]]] | [[p72<=0 & 0<=p72] | [p29<=1 & 1<=p29]]]] | [p29<=1 & 1<=p29]]]]
normalized: ~ [EX [E [true U ~ [[[p29<=1 & 1<=p29] | ~ [E [true U ~ [[[[p29<=1 & 1<=p29] | [p72<=0 & 0<=p72]] | E [true U [[p6<=1 & 1<=p6] | [p67<=0 & 0<=p67]]]]]]]]]]]]

abstracting: (0<=p67)
states: 2,038,166 (6)
abstracting: (p67<=0)
states: 1,513,872 (6)
abstracting: (1<=p6)
states: 285
abstracting: (p6<=1)
states: 2,038,166 (6)
abstracting: (0<=p72)
states: 2,038,166 (6)
abstracting: (p72<=0)
states: 1,533,561 (6)
abstracting: (1<=p29)
states: 504,662 (5)
abstracting: (p29<=1)
states: 2,038,166 (6)
abstracting: (1<=p29)
states: 504,662 (5)
abstracting: (p29<=1)
states: 2,038,166 (6)
.-> the formula is TRUE

FORMULA Railroad-PT-010-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.286sec

checking: EF [[AG [~ [[p18<=1 & 1<=p18]]] | [[AF [AX [[[p42<=0 & 0<=p42] | [p46<=1 & 1<=p46]]]] & EF [[p73<=1 & 1<=p73]]] & [A [[p68<=0 & 0<=p68] U [p64<=1 & 1<=p64]] & [[p14<=1 & 1<=p14] | [[p8<=0 & 0<=p8] | [p65<=1 & 1<=p65]]]]]]]
normalized: E [true U [[[[[[p65<=1 & 1<=p65] | [p8<=0 & 0<=p8]] | [p14<=1 & 1<=p14]] & [~ [EG [~ [[p64<=1 & 1<=p64]]]] & ~ [E [~ [[p64<=1 & 1<=p64]] U [~ [[p68<=0 & 0<=p68]] & ~ [[p64<=1 & 1<=p64]]]]]]] & [E [true U [p73<=1 & 1<=p73]] & ~ [EG [EX [~ [[[p46<=1 & 1<=p46] | [p42<=0 & 0<=p42]]]]]]]] | ~ [E [true U [p18<=1 & 1<=p18]]]]]

abstracting: (1<=p18)
states: 504,605 (5)
abstracting: (p18<=1)
states: 2,038,166 (6)
abstracting: (0<=p42)
states: 2,038,166 (6)
abstracting: (p42<=0)
states: 1,533,561 (6)
abstracting: (1<=p46)
states: 1,009,267 (6)
abstracting: (p46<=1)
states: 2,038,166 (6)
..
EG iterations: 1
abstracting: (1<=p73)
states: 1,009,267 (6)
abstracting: (p73<=1)
states: 2,038,166 (6)
abstracting: (1<=p64)
states: 504,605 (5)
abstracting: (p64<=1)
states: 2,038,166 (6)
abstracting: (0<=p68)
states: 2,038,166 (6)
abstracting: (p68<=0)
states: 1,513,872 (6)
abstracting: (1<=p64)
states: 504,605 (5)
abstracting: (p64<=1)
states: 2,038,166 (6)
abstracting: (1<=p64)
states: 504,605 (5)
abstracting: (p64<=1)
states: 2,038,166 (6)
.
EG iterations: 1
abstracting: (1<=p14)
states: 504,605 (5)
abstracting: (p14<=1)
states: 2,038,166 (6)
abstracting: (0<=p8)
states: 2,038,166 (6)
abstracting: (p8<=0)
states: 2,021,276 (6)
abstracting: (1<=p65)
states: 524,294 (5)
abstracting: (p65<=1)
states: 2,038,166 (6)
-> the formula is TRUE

FORMULA Railroad-PT-010-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.389sec

checking: E [[AF [[p74<=0 & 0<=p74]] & [~ [[EG [[p58<=1 & 1<=p58]] & [[p27<=0 & 0<=p27] & [AG [[[p46<=0 & 0<=p46] | [p71<=1 & 1<=p71]]] | [[p9<=1 & 1<=p9] & [[p45<=0 & 0<=p45] | [p62<=1 & 1<=p62]]]]]]] | ~ [[p59<=1 & 1<=p59]]]] U EF [EG [[p12<=1 & 1<=p12]]]]
normalized: E [[[~ [[p59<=1 & 1<=p59]] | ~ [[[[[[[p62<=1 & 1<=p62] | [p45<=0 & 0<=p45]] & [p9<=1 & 1<=p9]] | ~ [E [true U ~ [[[p71<=1 & 1<=p71] | [p46<=0 & 0<=p46]]]]]] & [p27<=0 & 0<=p27]] & EG [[p58<=1 & 1<=p58]]]]] & ~ [EG [~ [[p74<=0 & 0<=p74]]]]] U E [true U EG [[p12<=1 & 1<=p12]]]]

abstracting: (1<=p12)
states: 546,165 (5)
abstracting: (p12<=1)
states: 2,038,166 (6)
.................
EG iterations: 17
abstracting: (0<=p74)
states: 2,038,166 (6)
abstracting: (p74<=0)
states: 1,533,561 (6)
.
EG iterations: 1
abstracting: (1<=p58)
states: 11
abstracting: (p58<=1)
states: 2,038,166 (6)
...
EG iterations: 3
abstracting: (0<=p27)
states: 2,038,166 (6)
abstracting: (p27<=0)
states: 1,533,504 (6)
abstracting: (0<=p46)
states: 2,038,166 (6)
abstracting: (p46<=0)
states: 1,028,899 (6)
abstracting: (1<=p71)
states: 10
abstracting: (p71<=1)
states: 2,038,166 (6)
abstracting: (1<=p9)
states: 70,182 (4)
abstracting: (p9<=1)
states: 2,038,166 (6)
abstracting: (0<=p45)
states: 2,038,166 (6)
abstracting: (p45<=0)
states: 2,038,133 (6)
abstracting: (1<=p62)
states: 504,605 (5)
abstracting: (p62<=1)
states: 2,038,166 (6)
abstracting: (1<=p59)
states: 1,009,267 (6)
abstracting: (p59<=1)
states: 2,038,166 (6)
-> the formula is FALSE

FORMULA Railroad-PT-010-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.677sec

checking: ~ [A [~ [[~ [[[p11<=0 & 0<=p11] & [[[p35<=0 & 0<=p35] | [p39<=1 & 1<=p39]] & [[p27<=1 & 1<=p27] | ~ [[p33<=1 & 1<=p33]]]]]] | ~ [[[p8<=1 & 1<=p8] | [[p7<=0 & 0<=p7] | [p18<=1 & 1<=p18]]]]]] U EF [~ [[E [[p37<=1 & 1<=p37] U [[p11<=0 & 0<=p11] | [p66<=1 & 1<=p66]]] | [p30<=1 & 1<=p30]]]]]]
normalized: ~ [[~ [EG [~ [E [true U ~ [[[p30<=1 & 1<=p30] | E [[p37<=1 & 1<=p37] U [[p66<=1 & 1<=p66] | [p11<=0 & 0<=p11]]]]]]]]] & ~ [E [~ [E [true U ~ [[[p30<=1 & 1<=p30] | E [[p37<=1 & 1<=p37] U [[p66<=1 & 1<=p66] | [p11<=0 & 0<=p11]]]]]]] U [[~ [[[[p18<=1 & 1<=p18] | [p7<=0 & 0<=p7]] | [p8<=1 & 1<=p8]]] | ~ [[[[~ [[p33<=1 & 1<=p33]] | [p27<=1 & 1<=p27]] & [[p39<=1 & 1<=p39] | [p35<=0 & 0<=p35]]] & [p11<=0 & 0<=p11]]]] & ~ [E [true U ~ [[[p30<=1 & 1<=p30] | E [[p37<=1 & 1<=p37] U [[p66<=1 & 1<=p66] | [p11<=0 & 0<=p11]]]]]]]]]]]]

abstracting: (0<=p11)
states: 2,038,166 (6)
abstracting: (p11<=0)
states: 1,637,996 (6)
abstracting: (1<=p66)
states: 1,009,267 (6)
abstracting: (p66<=1)
states: 2,038,166 (6)
abstracting: (1<=p37)
states: 11
abstracting: (p37<=1)
states: 2,038,166 (6)
abstracting: (1<=p30)
states: 504,662 (5)
abstracting: (p30<=1)
states: 2,038,166 (6)
abstracting: (0<=p11)
states: 2,038,166 (6)
abstracting: (p11<=0)
states: 1,637,996 (6)
abstracting: (0<=p35)
states: 2,038,166 (6)
abstracting: (p35<=0)
states: 2,038,145 (6)
abstracting: (1<=p39)
states: 524,294 (5)
abstracting: (p39<=1)
states: 2,038,166 (6)
abstracting: (1<=p27)
states: 504,662 (5)
abstracting: (p27<=1)
states: 2,038,166 (6)
abstracting: (1<=p33)
states: 504,662 (5)
abstracting: (p33<=1)
states: 2,038,166 (6)
abstracting: (1<=p8)
states: 16,890 (4)
abstracting: (p8<=1)
states: 2,038,166 (6)
abstracting: (0<=p7)
states: 2,038,166 (6)
abstracting: (p7<=0)
states: 2,035,481 (6)
abstracting: (1<=p18)
states: 504,605 (5)
abstracting: (p18<=1)
states: 2,038,166 (6)
abstracting: (0<=p11)
states: 2,038,166 (6)
abstracting: (p11<=0)
states: 1,637,996 (6)
abstracting: (1<=p66)
states: 1,009,267 (6)
abstracting: (p66<=1)
states: 2,038,166 (6)
abstracting: (1<=p37)
states: 11
abstracting: (p37<=1)
states: 2,038,166 (6)
abstracting: (1<=p30)
states: 504,662 (5)
abstracting: (p30<=1)
states: 2,038,166 (6)
abstracting: (0<=p11)
states: 2,038,166 (6)
abstracting: (p11<=0)
states: 1,637,996 (6)
abstracting: (1<=p66)
states: 1,009,267 (6)
abstracting: (p66<=1)
states: 2,038,166 (6)
abstracting: (1<=p37)
states: 11
abstracting: (p37<=1)
states: 2,038,166 (6)
abstracting: (1<=p30)
states: 504,662 (5)
abstracting: (p30<=1)
states: 2,038,166 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Railroad-PT-010-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.991sec

checking: E [[~ [E [AX [[p75<=0 & 0<=p75]] U [[p44<=1 & 1<=p44] & [p26<=1 & 1<=p26]]]] | [~ [[p63<=1 & 1<=p63]] | [AF [[p22<=1 & 1<=p22]] & EX [[p5<=1 & 1<=p5]]]]] U E [[~ [[[p54<=1 & 1<=p54] & [p22<=0 & 0<=p22]]] & [~ [[p53<=0 & 0<=p53]] | [[p22<=1 & 1<=p22] | [p35<=1 & 1<=p35]]]] U ~ [AX [[[p8<=0 & 0<=p8] | [p49<=1 & 1<=p49]]]]]]
normalized: E [[[[EX [[p5<=1 & 1<=p5]] & ~ [EG [~ [[p22<=1 & 1<=p22]]]]] | ~ [[p63<=1 & 1<=p63]]] | ~ [E [~ [EX [~ [[p75<=0 & 0<=p75]]]] U [[p26<=1 & 1<=p26] & [p44<=1 & 1<=p44]]]]] U E [[[[[p35<=1 & 1<=p35] | [p22<=1 & 1<=p22]] | ~ [[p53<=0 & 0<=p53]]] & ~ [[[p22<=0 & 0<=p22] & [p54<=1 & 1<=p54]]]] U EX [~ [[[p49<=1 & 1<=p49] | [p8<=0 & 0<=p8]]]]]]

abstracting: (0<=p8)
states: 2,038,166 (6)
abstracting: (p8<=0)
states: 2,021,276 (6)
abstracting: (1<=p49)
states: 11
abstracting: (p49<=1)
states: 2,038,166 (6)
.abstracting: (1<=p54)
states: 504,605 (5)
abstracting: (p54<=1)
states: 2,038,166 (6)
abstracting: (0<=p22)
states: 2,038,166 (6)
abstracting: (p22<=0)
states: 1,533,561 (6)
abstracting: (0<=p53)
states: 2,038,166 (6)
abstracting: (p53<=0)
states: 1,533,561 (6)
abstracting: (1<=p22)
states: 504,605 (5)
abstracting: (p22<=1)
states: 2,038,166 (6)
abstracting: (1<=p35)
states: 21
abstracting: (p35<=1)
states: 2,038,166 (6)
abstracting: (1<=p44)
states: 30
abstracting: (p44<=1)
states: 2,038,166 (6)
abstracting: (1<=p26)
states: 504,662 (5)
abstracting: (p26<=1)
states: 2,038,166 (6)
abstracting: (0<=p75)
states: 2,038,166 (6)
abstracting: (p75<=0)
states: 1,533,561 (6)
.abstracting: (1<=p63)
states: 1,009,267 (6)
abstracting: (p63<=1)
states: 2,038,166 (6)
abstracting: (1<=p22)
states: 504,605 (5)
abstracting: (p22<=1)
states: 2,038,166 (6)
.
EG iterations: 1
abstracting: (1<=p5)
states: 59,049 (4)
abstracting: (p5<=1)
states: 2,038,166 (6)
.-> the formula is FALSE

FORMULA Railroad-PT-010-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.645sec

totally nodes used: 9532564 (9.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 17448441 66520943 83969384
used/not used/entry size/cache size: 44428091 22680773 16 1024MB
basic ops cache: hits/miss/sum: 1866848 6623347 8490195
used/not used/entry size/cache size: 7895039 8882177 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: 101079 420974 522053
used/not used/entry size/cache size: 410990 7977618 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 59044180
1 6833141
2 1026998
3 176208
4 25220
5 2808
6 281
7 27
8 1
9 0
>= 10 0

Total processing time: 0m37.180sec


BK_STOP 1679151038881

--------------------
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 CTLCardinality -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:7294 (49), effective:261 (1)

initing FirstDep: 0m 0.000sec


iterations count:17930 (122), effective:478 (3)

iterations count:18268 (125), effective:479 (3)

iterations count:2267 (15), effective:96 (0)

iterations count:146 (1), effective:0 (0)

iterations count:2465 (16), effective:66 (0)

iterations count:147 (1), effective:1 (0)

iterations count:4849 (33), effective:172 (1)

iterations count:839 (5), effective:13 (0)

iterations count:1436 (9), effective:34 (0)

iterations count:1094 (7), effective:18 (0)

iterations count:3300 (22), effective:71 (0)

iterations count:5084 (34), effective:152 (1)

iterations count:1065 (7), effective:19 (0)

iterations count:146 (1), effective:0 (0)

iterations count:6073 (41), effective:168 (1)

iterations count:146 (1), effective:0 (0)

iterations count:6073 (41), effective:168 (1)

iterations count:146 (1), effective:0 (0)

iterations count:6073 (41), effective:168 (1)

iterations count:6723 (46), effective:250 (1)

iterations count:21993 (150), effective:574 (3)

iterations count:6333 (43), effective:241 (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="Railroad-PT-010"
export BK_EXAMINATION="CTLCardinality"
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 Railroad-PT-010, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r330-tall-167889203200369"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Railroad-PT-010.tgz
mv Railroad-PT-010 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;