fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r074-smll-167814399900177
Last Updated
May 14, 2023

About the Execution of Marcie+red for CircularTrains-PT-192

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10065.756 3600000.00 3638890.00 9499.80 ??FF???????T???? 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-167814399900177.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-192, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814399900177
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 7.2K Feb 26 04:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 04:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 04:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 04:32 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 4.0K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 04:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 26 04:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 147K 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-192-CTLCardinality-00
FORMULA_NAME CircularTrains-PT-192-CTLCardinality-01
FORMULA_NAME CircularTrains-PT-192-CTLCardinality-02
FORMULA_NAME CircularTrains-PT-192-CTLCardinality-03
FORMULA_NAME CircularTrains-PT-192-CTLCardinality-04
FORMULA_NAME CircularTrains-PT-192-CTLCardinality-05
FORMULA_NAME CircularTrains-PT-192-CTLCardinality-06
FORMULA_NAME CircularTrains-PT-192-CTLCardinality-07
FORMULA_NAME CircularTrains-PT-192-CTLCardinality-08
FORMULA_NAME CircularTrains-PT-192-CTLCardinality-09
FORMULA_NAME CircularTrains-PT-192-CTLCardinality-10
FORMULA_NAME CircularTrains-PT-192-CTLCardinality-11
FORMULA_NAME CircularTrains-PT-192-CTLCardinality-12
FORMULA_NAME CircularTrains-PT-192-CTLCardinality-13
FORMULA_NAME CircularTrains-PT-192-CTLCardinality-14
FORMULA_NAME CircularTrains-PT-192-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678310085071

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=CircularTrains-PT-192
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-08 21:14:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 21:14:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 21:14:47] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2023-03-08 21:14:47] [INFO ] Transformed 384 places.
[2023-03-08 21:14:47] [INFO ] Transformed 192 transitions.
[2023-03-08 21:14:47] [INFO ] Parsed PT model containing 384 places and 192 transitions and 768 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Support contains 128 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 192/192 transitions.
Applied a total of 0 rules in 64 ms. Remains 384 /384 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 384 cols
[2023-03-08 21:14:48] [INFO ] Computed 193 place invariants in 39 ms
[2023-03-08 21:14:49] [INFO ] Implicit Places using invariants in 894 ms returned [7, 10, 18, 21, 37, 47, 48, 62, 64, 65, 75, 78, 89, 101, 102, 108, 133, 138, 141, 144, 160, 163, 217, 230, 231, 245, 283, 285, 293, 298, 311, 314, 327, 330, 333, 346, 356, 357, 369, 371, 374, 375, 376, 378, 380, 382]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 939 ms to find 46 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 338/384 places, 192/192 transitions.
Applied a total of 0 rules in 11 ms. Remains 338 /338 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1015 ms. Remains : 338/384 places, 192/192 transitions.
Support contains 128 out of 338 places after structural reductions.
[2023-03-08 21:14:49] [INFO ] Flatten gal took : 70 ms
[2023-03-08 21:14:49] [INFO ] Flatten gal took : 29 ms
[2023-03-08 21:14:49] [INFO ] Input system was already deterministic with 192 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 975 ms. (steps per millisecond=10 ) properties (out of 79) seen :71
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 192 rows 338 cols
[2023-03-08 21:14:50] [INFO ] Computed 147 place invariants in 8 ms
[2023-03-08 21:14:51] [INFO ] [Real]Absence check using 120 positive place invariants in 31 ms returned sat
[2023-03-08 21:14:51] [INFO ] [Real]Absence check using 120 positive and 27 generalized place invariants in 11 ms returned sat
[2023-03-08 21:14:51] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
[2023-03-08 21:14:51] [INFO ] Flatten gal took : 34 ms
[2023-03-08 21:14:51] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CircularTrains-PT-192-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-08 21:14:51] [INFO ] Flatten gal took : 36 ms
[2023-03-08 21:14:51] [INFO ] Input system was already deterministic with 192 transitions.
Support contains 111 out of 338 places (down from 117) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 192/192 transitions.
Applied a total of 0 rules in 24 ms. Remains 338 /338 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 338/338 places, 192/192 transitions.
[2023-03-08 21:14:51] [INFO ] Flatten gal took : 27 ms
[2023-03-08 21:14:51] [INFO ] Flatten gal took : 31 ms
[2023-03-08 21:14:51] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 192/192 transitions.
Applied a total of 0 rules in 31 ms. Remains 338 /338 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 338/338 places, 192/192 transitions.
[2023-03-08 21:14:51] [INFO ] Flatten gal took : 26 ms
[2023-03-08 21:14:51] [INFO ] Flatten gal took : 26 ms
[2023-03-08 21:14:51] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 338/338 places, 192/192 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 338 transition count 160
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 306 transition count 160
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 64 place count 306 transition count 149
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 86 place count 295 transition count 149
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 108 place count 284 transition count 138
Applied a total of 108 rules in 62 ms. Remains 284 /338 variables (removed 54) and now considering 138/192 (removed 54) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62 ms. Remains : 284/338 places, 138/192 transitions.
[2023-03-08 21:14:51] [INFO ] Flatten gal took : 17 ms
[2023-03-08 21:14:51] [INFO ] Flatten gal took : 18 ms
[2023-03-08 21:14:51] [INFO ] Input system was already deterministic with 138 transitions.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 192/192 transitions.
Applied a total of 0 rules in 8 ms. Remains 338 /338 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 338/338 places, 192/192 transitions.
[2023-03-08 21:14:51] [INFO ] Flatten gal took : 21 ms
[2023-03-08 21:14:51] [INFO ] Flatten gal took : 22 ms
[2023-03-08 21:14:51] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 338/338 places, 192/192 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 338 transition count 162
Reduce places removed 30 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 308 transition count 160
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 306 transition count 160
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 64 place count 306 transition count 146
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 92 place count 292 transition count 146
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 114 place count 281 transition count 135
Applied a total of 114 rules in 50 ms. Remains 281 /338 variables (removed 57) and now considering 135/192 (removed 57) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 281/338 places, 135/192 transitions.
[2023-03-08 21:14:51] [INFO ] Flatten gal took : 15 ms
[2023-03-08 21:14:51] [INFO ] Flatten gal took : 16 ms
[2023-03-08 21:14:52] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 192/192 transitions.
Applied a total of 0 rules in 7 ms. Remains 338 /338 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 338/338 places, 192/192 transitions.
[2023-03-08 21:14:52] [INFO ] Flatten gal took : 18 ms
[2023-03-08 21:14:52] [INFO ] Flatten gal took : 19 ms
[2023-03-08 21:14:52] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 338 /338 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 338/338 places, 192/192 transitions.
[2023-03-08 21:14:52] [INFO ] Flatten gal took : 17 ms
[2023-03-08 21:14:52] [INFO ] Flatten gal took : 16 ms
[2023-03-08 21:14:52] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 192/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 338 /338 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 338/338 places, 192/192 transitions.
[2023-03-08 21:14:52] [INFO ] Flatten gal took : 9 ms
[2023-03-08 21:14:52] [INFO ] Flatten gal took : 9 ms
[2023-03-08 21:14:52] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 192/192 transitions.
Applied a total of 0 rules in 14 ms. Remains 338 /338 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 338/338 places, 192/192 transitions.
[2023-03-08 21:14:52] [INFO ] Flatten gal took : 9 ms
[2023-03-08 21:14:52] [INFO ] Flatten gal took : 9 ms
[2023-03-08 21:14:52] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 338/338 places, 192/192 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 338 transition count 157
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 303 transition count 157
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 70 place count 303 transition count 146
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 92 place count 292 transition count 146
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 114 place count 281 transition count 135
Applied a total of 114 rules in 24 ms. Remains 281 /338 variables (removed 57) and now considering 135/192 (removed 57) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 281/338 places, 135/192 transitions.
[2023-03-08 21:14:52] [INFO ] Flatten gal took : 7 ms
[2023-03-08 21:14:52] [INFO ] Flatten gal took : 7 ms
[2023-03-08 21:14:52] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 192/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 338 /338 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 338/338 places, 192/192 transitions.
[2023-03-08 21:14:52] [INFO ] Flatten gal took : 8 ms
[2023-03-08 21:14:52] [INFO ] Flatten gal took : 9 ms
[2023-03-08 21:14:52] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 192/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 338 /338 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 338/338 places, 192/192 transitions.
[2023-03-08 21:14:52] [INFO ] Flatten gal took : 8 ms
[2023-03-08 21:14:52] [INFO ] Flatten gal took : 8 ms
[2023-03-08 21:14:52] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 192/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 338 /338 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 338/338 places, 192/192 transitions.
[2023-03-08 21:14:52] [INFO ] Flatten gal took : 7 ms
[2023-03-08 21:14:52] [INFO ] Flatten gal took : 8 ms
[2023-03-08 21:14:52] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 192/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 338 /338 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 338/338 places, 192/192 transitions.
[2023-03-08 21:14:52] [INFO ] Flatten gal took : 8 ms
[2023-03-08 21:14:52] [INFO ] Flatten gal took : 22 ms
[2023-03-08 21:14:52] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 338/338 places, 192/192 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 338 transition count 157
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 303 transition count 157
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 70 place count 303 transition count 146
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 92 place count 292 transition count 146
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 114 place count 281 transition count 135
Applied a total of 114 rules in 26 ms. Remains 281 /338 variables (removed 57) and now considering 135/192 (removed 57) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 281/338 places, 135/192 transitions.
[2023-03-08 21:14:52] [INFO ] Flatten gal took : 5 ms
[2023-03-08 21:14:52] [INFO ] Flatten gal took : 8 ms
[2023-03-08 21:14:52] [INFO ] Input system was already deterministic with 135 transitions.
[2023-03-08 21:14:52] [INFO ] Flatten gal took : 9 ms
[2023-03-08 21:14:52] [INFO ] Flatten gal took : 9 ms
[2023-03-08 21:14:52] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-08 21:14:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 338 places, 192 transitions and 676 arcs took 3 ms.
Total runtime 4903 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: 338 NrTr: 192 NrArc: 676)

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

net check time: 0m 0.000sec

init dd package: 0m 3.565sec


RS generation: 0m28.287sec


-> reachability set: #nodes 20120 (2.0e+04) #states 42,702,305,279,429,960,121,441,757,316,910,224,606,536,275 (43)



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

checking: EF [EG [p292<=0]]
normalized: E [true U EG [p292<=0]]

abstracting: (p292<=0)
states: 6,738,516,874,596,414,936,025,669,007,662,542,525,980,424 (42)
..............................................................................................................................................................................................................................................................................................................................
before gc: list nodes free: 1755544

after gc: idd nodes used:665227, unused:63334773; list nodes free:292650194
.....................................................................
before gc: list nodes free: 1985310

after gc: idd nodes used:1044887, unused:62955113; list nodes free:290913143
..........................MC time: 3m58.012sec

checking: EF [EG [p278<=0]]
normalized: E [true U EG [p278<=0]]

abstracting: (p278<=0)
states: 25,655,075,367,809,611,194,230,129,406,970,308,180,346,320 (43)
..............................................................................................................
before gc: list nodes free: 2086028

after gc: idd nodes used:115685, unused:63884315; list nodes free:295163418
....................................................................................................................................................................................................................................
before gc: list nodes free: 1555995

after gc: idd nodes used:966494, unused:63033506; list nodes free:291266121
.................................................
before gc: list nodes free: 2002705

after gc: idd nodes used:984200, unused:63015800; list nodes free:291185491
.MC time: 3m43.703sec

checking: E [~ [EX [p275<=0]] U EG [p228<=0]]
normalized: E [~ [EX [p275<=0]] U EG [p228<=0]]

abstracting: (p228<=0)
states: 34,094,459,823,240,697,854,423,255,819,879,832,852,379,910 (43)
....................................................................................................................................................................................................................................................
before gc: list nodes free: 1060143

after gc: idd nodes used:628346, unused:63371654; list nodes free:292807026
...................................................................................
before gc: list nodes free: 964151

after gc: idd nodes used:1010395, unused:62989605; list nodes free:291063588
.MC time: 3m28.068sec

checking: AX [EX [EG [EF [~ [p314<=p321]]]]]
normalized: ~ [EX [~ [EX [EG [E [true U ~ [p314<=p321]]]]]]]

abstracting: (p314<=p321)
states: 14,941,593,947,290,796,407,060,437,228,703,874,364,959,580 (43)

EG iterations: 0
..-> the formula is TRUE

FORMULA CircularTrains-PT-192-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.915sec

checking: EF [[1<=p327 & [AX [1<=0] & AF [[p99<=0 | 1<=p208]]]]]
normalized: E [true U [1<=p327 & [~ [EG [~ [[p99<=0 | 1<=p208]]]] & ~ [EX [~ [1<=0]]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (1<=p208)
states: 17,047,229,911,620,348,927,211,627,909,939,916,426,189,955 (43)
abstracting: (p99<=0)
states: 25,655,075,367,809,611,194,230,129,406,970,308,180,346,320 (43)
............................
before gc: list nodes free: 907969

after gc: idd nodes used:463633, unused:63536367; list nodes free:293561505
..............................
before gc: list nodes free: 755914

after gc: idd nodes used:1326972, unused:62673028; list nodes free:289594866
MC time: 3m27.106sec

checking: AG [[AG [E [p175<=0 U p114<=p35]] | 1<=p20]]
normalized: ~ [E [true U ~ [[1<=p20 | ~ [E [true U ~ [E [p175<=0 U p114<=p35]]]]]]]]

abstracting: (p114<=p35)
states: 37,530,697,502,248,675,851,485,242,120,638,957,485,783,087 (43)
abstracting: (p175<=0)
states: 34,094,459,823,240,697,854,423,255,819,879,832,852,379,910 (43)
abstracting: (1<=p20)
states: 17,047,229,911,620,348,927,211,627,909,939,916,426,189,955 (43)
-> the formula is FALSE

FORMULA CircularTrains-PT-192-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.492sec

checking: EF [[[AX [AF [~ [p160<=p50]]] & EX [[1<=p84 | p333<=p127]]] & AX [EX [p27<=p51]]]]
normalized: E [true U [~ [EX [~ [EX [p27<=p51]]]] & [EX [[1<=p84 | p333<=p127]] & ~ [EX [EG [p160<=p50]]]]]]

abstracting: (p160<=p50)
states: 29,091,313,046,817,589,191,292,115,707,729,432,813,749,497 (43)
.....................................................................................................
before gc: list nodes free: 358766

after gc: idd nodes used:386182, unused:63613818; list nodes free:293919305
...............................................................................................
before gc: list nodes free: 93584

after gc: idd nodes used:1015879, unused:62984121; list nodes free:291020883
.MC time: 3m25.480sec

checking: E [EF [~ [EF [~ [p126<=1]]]] U EF [~ [A [EF [p29<=p32] U [[p318<=1 & p211<=p90] | ~ [p313<=1]]]]]]
normalized: E [E [true U ~ [E [true U ~ [p126<=1]]]] U E [true U ~ [[~ [EG [~ [[~ [p313<=1] | [p318<=1 & p211<=p90]]]]] & ~ [E [~ [[~ [p313<=1] | [p318<=1 & p211<=p90]]] U [~ [E [true U p29<=p32]] & ~ [[~ [p313<=1] | [p318<=1 & p211<=p90]]]]]]]]]]

abstracting: (p211<=p90)
states: 32,527,550,725,825,567,188,354,102,008,488,557,447,152,674 (43)
abstracting: (p318<=1)
states: 27,355,942,948,644,282,918,397,586,812,217,290,326,399,486 (43)
abstracting: (p313<=1)
states: 42,702,305,279,429,960,121,441,757,316,910,224,606,536,275 (43)
abstracting: (p29<=p32)
states: 32,393,592,242,406,026,130,255,798,414,632,850,706,326,744 (43)
abstracting: (p211<=p90)
states: 32,527,550,725,825,567,188,354,102,008,488,557,447,152,674 (43)
abstracting: (p318<=1)
states: 27,355,942,948,644,282,918,397,586,812,217,290,326,399,486 (43)
abstracting: (p313<=1)
states: 42,702,305,279,429,960,121,441,757,316,910,224,606,536,275 (43)
abstracting: (p211<=p90)
states: 32,527,550,725,825,567,188,354,102,008,488,557,447,152,674 (43)
abstracting: (p318<=1)
states: 27,355,942,948,644,282,918,397,586,812,217,290,326,399,486 (43)
abstracting: (p313<=1)
states: 42,702,305,279,429,960,121,441,757,316,910,224,606,536,275 (43)
...........................................................................................................................................................................................................
before gc: list nodes free: 236024

after gc: idd nodes used:494837, unused:63505163; list nodes free:293425604
..........................................................................................................................................................
before gc: list nodes free: 1586205

after gc: idd nodes used:1109039, unused:62890961; list nodes free:290611665
MC time: 3m10.374sec

checking: AG [[~ [A [[[E [p69<=1 U 1<=p126] & EF [1<=p1]] | [EG [1<=p36] | EF [p257<=1]]] U EX [AX [p108<=p191]]]] | [~ [p152<=p288] | AG [1<=p286]]]]
normalized: ~ [E [true U ~ [[[~ [E [true U ~ [1<=p286]]] | ~ [p152<=p288]] | ~ [[~ [EG [~ [EX [~ [EX [~ [p108<=p191]]]]]]] & ~ [E [~ [EX [~ [EX [~ [p108<=p191]]]]] U [~ [[[E [true U p257<=1] | EG [1<=p36]] | [E [true U 1<=p1] & E [p69<=1 U 1<=p126]]]] & ~ [EX [~ [EX [~ [p108<=p191]]]]]]]]]]]]]]

abstracting: (p108<=p191)
states: 32,527,550,725,825,567,188,354,102,008,488,557,447,152,674 (43)
..abstracting: (1<=p126)
states: 35,963,788,404,833,545,185,416,088,309,247,682,080,555,851 (43)
abstracting: (p69<=1)
states: 27,355,942,948,644,282,918,397,586,812,217,290,326,399,486 (43)
abstracting: (1<=p1)
states: 35,963,788,404,833,545,185,416,088,309,247,682,080,555,851 (43)
abstracting: (1<=p36)
states: 17,047,229,911,620,348,927,211,627,909,939,916,426,189,955 (43)
..............................................................................................................................................................................................................................................................................
before gc: list nodes free: 1051943

after gc: idd nodes used:1020338, unused:62979662; list nodes free:290962107
........................................MC time: 2m55.003sec

checking: EX [E [E [p256<=0 U ~ [AG [1<=p334]]] U ~ [[EG [[p116<=p71 | p294<=p304]] | [EX [p276<=p36] & [AF [p44<=p181] & AX [1<=p55]]]]]]]
normalized: EX [E [E [p256<=0 U E [true U ~ [1<=p334]]] U ~ [[[[~ [EX [~ [1<=p55]]] & ~ [EG [~ [p44<=p181]]]] & EX [p276<=p36]] | EG [[p116<=p71 | p294<=p304]]]]]]

abstracting: (p294<=p304)
states: 32,527,550,725,825,567,188,354,102,008,488,557,447,152,674 (43)
abstracting: (p116<=p71)
states: 32,527,550,725,825,567,188,354,102,008,488,557,447,152,674 (43)
.
EG iterations: 1
abstracting: (p276<=p36)
states: 37,530,697,502,248,675,851,485,242,120,638,957,485,783,087 (43)
.abstracting: (p44<=p181)
states: 32,393,592,242,406,026,130,255,798,414,632,850,706,326,744 (43)
........................
before gc: list nodes free: 911669

after gc: idd nodes used:587446, unused:63412554; list nodes free:292978150
.............................................................MC time: 2m41.005sec

checking: EG [[p296<=0 | [[AX [~ [p7<=p6]] & EG [E [p73<=0 U 1<=p161]]] & [AG [EX [p4<=p170]] & EF [[p187<=p174 & p330<=p163]]]]]]
normalized: EG [[p296<=0 | [[E [true U [p187<=p174 & p330<=p163]] & ~ [E [true U ~ [EX [p4<=p170]]]]] & [EG [E [p73<=0 U 1<=p161]] & ~ [EX [p7<=p6]]]]]]

abstracting: (p7<=p6)
states: 32,393,592,242,406,026,130,255,798,414,632,850,706,326,744 (43)

before gc: list nodes free: 245711

after gc: idd nodes used:309809, unused:63690191; list nodes free:294273617
.abstracting: (1<=p161)
states: 17,047,229,911,620,348,927,211,627,909,939,916,426,189,955 (43)
abstracting: (p73<=0)
states: 25,655,075,367,809,611,194,230,129,406,970,308,180,346,320 (43)
.
EG iterations: 1
abstracting: (p4<=p170)
states: 29,091,313,046,817,589,191,292,115,707,729,432,813,749,497 (43)
.abstracting: (p330<=p163)
states: 29,091,313,046,817,589,191,292,115,707,729,432,813,749,497 (43)
abstracting: (p187<=p174)
states: 41,344,270,216,673,556,068,334,712,384,399,287,483,620,680 (43)
abstracting: (p296<=0)
states: 25,655,075,367,809,611,194,230,129,406,970,308,180,346,320 (43)
.....................................................................................................................................................................................................................................................
before gc: list nodes free: 568815

after gc: idd nodes used:931335, unused:63068665; list nodes free:291420573
MC time: 2m29.218sec

checking: E [EF [~ [AX [p98<=p287]]] U [AG [~ [[p88<=0 & p184<=p147]]] & [[AG [1<=p141] | EF [AG [p183<=0]]] & [EF [[p279<=p9 | AF [p22<=p103]]] | p266<=p200]]]]
normalized: E [E [true U EX [~ [p98<=p287]]] U [[[p266<=p200 | E [true U [p279<=p9 | ~ [EG [~ [p22<=p103]]]]]] & [E [true U ~ [E [true U ~ [p183<=0]]]] | ~ [E [true U ~ [1<=p141]]]]] & ~ [E [true U [p88<=0 & p184<=p147]]]]]

abstracting: (p184<=p147)
states: 32,527,550,725,825,567,188,354,102,008,488,557,447,152,674 (43)
abstracting: (p88<=0)
states: 25,655,075,367,809,611,194,230,129,406,970,308,180,346,320 (43)
abstracting: (1<=p141)
states: 17,047,229,911,620,348,927,211,627,909,939,916,426,189,955 (43)
abstracting: (p183<=0)
states: 25,655,075,367,809,611,194,230,129,406,970,308,180,346,320 (43)
abstracting: (p22<=p103)
states: 32,393,592,242,406,026,130,255,798,414,632,850,706,326,744 (43)
..................................................
before gc: list nodes free: 1044756

after gc: idd nodes used:1397417, unused:62602583; list nodes free:289273120
MC time: 2m18.330sec

checking: AF [[[AF [[1<=p153 & 1<=p3]] & EG [~ [1<=p328]]] & [AG [EX [~ [p256<=0]]] & [[EG [[~ [E [p109<=p324 U 1<=p215]] & ~ [E [1<=p219 U p63<=p60]]]] | EX [~ [p24<=1]]] | [~ [p282<=0] | [p15<=0 | [p25<=0 & ~ [p333<=1]]]]]]]]
normalized: ~ [EG [~ [[[[[[p15<=0 | [p25<=0 & ~ [p333<=1]]] | ~ [p282<=0]] | [EX [~ [p24<=1]] | EG [[~ [E [1<=p219 U p63<=p60]] & ~ [E [p109<=p324 U 1<=p215]]]]]] & ~ [E [true U ~ [EX [~ [p256<=0]]]]]] & [EG [~ [1<=p328]] & ~ [EG [~ [[1<=p153 & 1<=p3]]]]]]]]]

abstracting: (1<=p3)
states: 17,047,229,911,620,348,927,211,627,909,939,916,426,189,955 (43)
abstracting: (1<=p153)
states: 8,607,845,456,189,262,267,018,501,497,030,391,754,156,365 (42)
.
EG iterations: 1
abstracting: (1<=p328)
states: 35,963,788,404,833,545,185,416,088,309,247,682,080,555,851 (43)
.......................................................................................................................................................................................................................................................................
before gc: list nodes free: 1045238

after gc: idd nodes used:1106648, unused:62893352; list nodes free:290604806
...........MC time: 2m 7.004sec

checking: EF [[EX [EG [[1<=p328 & [p38<=1 & p286<=0]]]] & [EF [EG [~ [p160<=0]]] & [[EX [~ [1<=p103]] | EG [~ [p61<=p137]]] | [[~ [p221<=p180] & ~ [1<=p219]] | [[AG [~ [p308<=p11]] & ~ [1<=p59]] & [~ [p39<=p332] & p251<=p298]]]]]]]
normalized: E [true U [[[[[[p251<=p298 & ~ [p39<=p332]] & [~ [1<=p59] & ~ [E [true U p308<=p11]]]] | [~ [1<=p219] & ~ [p221<=p180]]] | [EG [~ [p61<=p137]] | EX [~ [1<=p103]]]] & E [true U EG [~ [p160<=0]]]] & EX [EG [[1<=p328 & [p38<=1 & p286<=0]]]]]]

abstracting: (p286<=0)
states: 25,655,075,367,809,611,194,230,129,406,970,308,180,346,320 (43)
abstracting: (p38<=1)
states: 42,702,305,279,429,960,121,441,757,316,910,224,606,536,275 (43)
abstracting: (1<=p328)
states: 35,963,788,404,833,545,185,416,088,309,247,682,080,555,851 (43)
..............................................................................................................................................................................................
before gc: list nodes free: 840968

after gc: idd nodes used:905172, unused:63094828; list nodes free:291539540
............................................MC time: 1m57.002sec

checking: A [EG [EX [[EX [p235<=p59] | [[p150<=p23 & [1<=p154 & [1<=p147 | 1<=p77]]] | [p8<=p59 & 1<=p10]]]]] U ~ [[EF [1<=p296] | [[EF [1<=p113] & [E [p275<=p71 U p185<=p196] | [EG [p322<=p106] & [1<=p174 & p91<=1]]]] & [p138<=p316 & p126<=p190]]]]]
normalized: [~ [EG [[[[p138<=p316 & p126<=p190] & [[[[1<=p174 & p91<=1] & EG [p322<=p106]] | E [p275<=p71 U p185<=p196]] & E [true U 1<=p113]]] | E [true U 1<=p296]]]] & ~ [E [[[[p138<=p316 & p126<=p190] & [[[[1<=p174 & p91<=1] & EG [p322<=p106]] | E [p275<=p71 U p185<=p196]] & E [true U 1<=p113]]] | E [true U 1<=p296]] U [~ [EG [EX [[[[p8<=p59 & 1<=p10] | [p150<=p23 & [1<=p154 & [1<=p147 | 1<=p77]]]] | EX [p235<=p59]]]]] & [[[p138<=p316 & p126<=p190] & [[[[1<=p174 & p91<=1] & EG [p322<=p106]] | E [p275<=p71 U p185<=p196]] & E [true U 1<=p113]]] | E [true U 1<=p296]]]]]]

abstracting: (1<=p296)
states: 17,047,229,911,620,348,927,211,627,909,939,916,426,189,955 (43)
abstracting: (1<=p113)
states: 17,047,229,911,620,348,927,211,627,909,939,916,426,189,955 (43)
abstracting: (p185<=p196)
states: 32,393,592,242,406,026,130,255,798,414,632,850,706,326,744 (43)
abstracting: (p275<=p71)
states: 32,527,550,725,825,567,188,354,102,008,488,557,447,152,674 (43)
abstracting: (p322<=p106)
states: 10,894,922,107,099,562,823,935,551,744,158,917,546,955,588 (43)
..............................................................................................
before gc: list nodes free: 651618

after gc: idd nodes used:823221, unused:63176779; list nodes free:291911118
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6084088 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101052 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:23232 (121), effective:6144 (32)

initing FirstDep: 0m 0.000sec


net_ddint.h:600: Timeout: after 237 sec


net_ddint.h:600: Timeout: after 222 sec


net_ddint.h:600: Timeout: after 207 sec


iterations count:705 (3), effective:188 (0)

net_ddint.h:600: Timeout: after 206 sec


iterations count:277 (1), effective:29 (0)

iterations count:1868 (9), effective:472 (2)

iterations count:648 (3), effective:96 (0)

net_ddint.h:600: Timeout: after 204 sec


iterations count:618 (3), effective:84 (0)

net_ddint.h:600: Timeout: after 189 sec


iterations count:645 (3), effective:94 (0)

iterations count:447 (2), effective:94 (0)

net_ddint.h:600: Timeout: after 174 sec


net_ddint.h:600: Timeout: after 160 sec


iterations count:455 (2), effective:95 (0)

iterations count:1371 (7), effective:287 (1)

iterations count:904 (4), effective:189 (0)

net_ddint.h:600: Timeout: after 148 sec


iterations count:1100 (5), effective:190 (0)

iterations count:647 (3), effective:95 (0)

iterations count:654 (3), effective:97 (0)

net_ddint.h:600: Timeout: after 137 sec


net_ddint.h:600: Timeout: after 126 sec


net_ddint.h:600: Timeout: after 116 sec


iterations count:651 (3), effective:96 (0)

iterations count:454 (2), effective:96 (0)

iterations count:902 (4), effective:189 (0)

net_ddint.h:600: Timeout: after 107 sec

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-192"
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 CircularTrains-PT-192, 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 r074-smll-167814399900177"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CircularTrains-PT-192.tgz
mv CircularTrains-PT-192 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 ;