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.r138-smll-167819419200025.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 Dekker-PT-050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819419200025
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.3K Feb 26 01:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 01:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:49 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.5K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 02:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 02:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 02:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 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 1.5M 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 Dekker-PT-050-CTLCardinality-00
FORMULA_NAME Dekker-PT-050-CTLCardinality-01
FORMULA_NAME Dekker-PT-050-CTLCardinality-02
FORMULA_NAME Dekker-PT-050-CTLCardinality-03
FORMULA_NAME Dekker-PT-050-CTLCardinality-04
FORMULA_NAME Dekker-PT-050-CTLCardinality-05
FORMULA_NAME Dekker-PT-050-CTLCardinality-06
FORMULA_NAME Dekker-PT-050-CTLCardinality-07
FORMULA_NAME Dekker-PT-050-CTLCardinality-08
FORMULA_NAME Dekker-PT-050-CTLCardinality-09
FORMULA_NAME Dekker-PT-050-CTLCardinality-10
FORMULA_NAME Dekker-PT-050-CTLCardinality-11
FORMULA_NAME Dekker-PT-050-CTLCardinality-12
FORMULA_NAME Dekker-PT-050-CTLCardinality-13
FORMULA_NAME Dekker-PT-050-CTLCardinality-14
FORMULA_NAME Dekker-PT-050-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678531600981

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=Dekker-PT-050
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 10:46:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 10:46:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 10:46:45] [INFO ] Load time of PNML (sax parser for PT used): 475 ms
[2023-03-11 10:46:45] [INFO ] Transformed 250 places.
[2023-03-11 10:46:45] [INFO ] Transformed 2600 transitions.
[2023-03-11 10:46:45] [INFO ] Found NUPN structural information;
[2023-03-11 10:46:45] [INFO ] Parsed PT model containing 250 places and 2600 transitions and 20100 arcs in 661 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 26 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Dekker-PT-050-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 72 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 106 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-11 10:46:45] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2023-03-11 10:46:45] [INFO ] Computed 150 place invariants in 23 ms
[2023-03-11 10:46:47] [INFO ] Implicit Places using invariants in 1776 ms returned [100, 103, 109, 112, 115, 118, 121, 124, 130, 136, 145, 151, 154, 157, 160, 166, 172, 178, 184, 187, 190, 193, 196, 199, 202, 205, 208, 211, 214, 220, 223, 226, 229, 238, 244, 247]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 1826 ms to find 36 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 214/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 32 ms. Remains 214 /214 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1967 ms. Remains : 214/250 places, 2600/2600 transitions.
Support contains 72 out of 214 places after structural reductions.
[2023-03-11 10:46:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-11 10:46:47] [INFO ] Flatten gal took : 326 ms
FORMULA Dekker-PT-050-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 10:46:48] [INFO ] Flatten gal took : 206 ms
[2023-03-11 10:46:48] [INFO ] Input system was already deterministic with 2600 transitions.
Support contains 71 out of 214 places (down from 72) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 923 ms. (steps per millisecond=10 ) properties (out of 49) seen :42
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-11 10:46:49] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 214 cols
[2023-03-11 10:46:49] [INFO ] Computed 114 place invariants in 8 ms
[2023-03-11 10:46:50] [INFO ] [Real]Absence check using 100 positive place invariants in 34 ms returned sat
[2023-03-11 10:46:50] [INFO ] [Real]Absence check using 100 positive and 14 generalized place invariants in 7 ms returned sat
[2023-03-11 10:46:50] [INFO ] After 263ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:1
[2023-03-11 10:46:50] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 10:46:50] [INFO ] After 153ms SMT Verify possible using 50 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 10:46:50] [INFO ] After 829ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 10:46:50] [INFO ] [Nat]Absence check using 100 positive place invariants in 28 ms returned sat
[2023-03-11 10:46:50] [INFO ] [Nat]Absence check using 100 positive and 14 generalized place invariants in 7 ms returned sat
[2023-03-11 10:46:51] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-11 10:46:51] [INFO ] After 137ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-11 10:46:51] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 9 ms to minimize.
[2023-03-11 10:46:51] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 1 ms to minimize.
[2023-03-11 10:46:52] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 1 ms to minimize.
[2023-03-11 10:46:52] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 3 ms to minimize.
[2023-03-11 10:46:52] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 2 ms to minimize.
[2023-03-11 10:46:52] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2023-03-11 10:46:53] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2023-03-11 10:46:53] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 1 ms to minimize.
[2023-03-11 10:46:53] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2023-03-11 10:46:53] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2023-03-11 10:46:53] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2023-03-11 10:46:54] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 1 ms to minimize.
[2023-03-11 10:46:54] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2023-03-11 10:46:54] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 0 ms to minimize.
[2023-03-11 10:46:54] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2023-03-11 10:46:54] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2023-03-11 10:46:54] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2023-03-11 10:46:55] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2023-03-11 10:46:55] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2023-03-11 10:46:55] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3798 ms
[2023-03-11 10:46:55] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3799 ms
[2023-03-11 10:46:55] [INFO ] After 4195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-03-11 10:46:55] [INFO ] After 4873ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 10 out of 214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 2600/2600 transitions.
Applied a total of 0 rules in 320 ms. Remains 214 /214 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 322 ms. Remains : 214/214 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 126939 steps, run timeout after 3002 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 126939 steps, saw 106187 distinct states, run finished after 3009 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-11 10:46:59] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:46:59] [INFO ] Invariant cache hit.
[2023-03-11 10:46:59] [INFO ] [Real]Absence check using 100 positive place invariants in 35 ms returned sat
[2023-03-11 10:46:59] [INFO ] [Real]Absence check using 100 positive and 14 generalized place invariants in 6 ms returned sat
[2023-03-11 10:47:00] [INFO ] After 296ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:1
[2023-03-11 10:47:00] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 10:47:00] [INFO ] After 191ms SMT Verify possible using 50 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 10:47:00] [INFO ] After 797ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 10:47:00] [INFO ] [Nat]Absence check using 100 positive place invariants in 40 ms returned sat
[2023-03-11 10:47:00] [INFO ] [Nat]Absence check using 100 positive and 14 generalized place invariants in 8 ms returned sat
[2023-03-11 10:47:00] [INFO ] After 274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-11 10:47:00] [INFO ] After 182ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-11 10:47:01] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 1 ms to minimize.
[2023-03-11 10:47:01] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 1 ms to minimize.
[2023-03-11 10:47:01] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2023-03-11 10:47:01] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 1 ms to minimize.
[2023-03-11 10:47:02] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 1 ms to minimize.
[2023-03-11 10:47:02] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2023-03-11 10:47:02] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 0 ms to minimize.
[2023-03-11 10:47:02] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2023-03-11 10:47:02] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2023-03-11 10:47:03] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2023-03-11 10:47:03] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2023-03-11 10:47:03] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2023-03-11 10:47:03] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 1 ms to minimize.
[2023-03-11 10:47:03] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 1 ms to minimize.
[2023-03-11 10:47:04] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 9 ms to minimize.
[2023-03-11 10:47:04] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2023-03-11 10:47:04] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2023-03-11 10:47:04] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2023-03-11 10:47:04] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2023-03-11 10:47:04] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2023-03-11 10:47:04] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2023-03-11 10:47:05] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 2 ms to minimize.
[2023-03-11 10:47:05] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2023-03-11 10:47:05] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2023-03-11 10:47:05] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2023-03-11 10:47:05] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4282 ms
[2023-03-11 10:47:05] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4282 ms
[2023-03-11 10:47:05] [INFO ] After 4661ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-11 10:47:05] [INFO ] After 5291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 10 out of 214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 2600/2600 transitions.
Applied a total of 0 rules in 92 ms. Remains 214 /214 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 214/214 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 2600/2600 transitions.
Applied a total of 0 rules in 87 ms. Remains 214 /214 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-11 10:47:05] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:47:05] [INFO ] Invariant cache hit.
[2023-03-11 10:47:06] [INFO ] Implicit Places using invariants in 852 ms returned [119, 124, 129, 132, 137, 148, 153, 158, 163, 188, 199, 202, 207]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 861 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 201/214 places, 2600/2600 transitions.
Applied a total of 0 rules in 77 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1027 ms. Remains : 201/214 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 486 ms. (steps per millisecond=20 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) 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 7) 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 7) seen :1
Running SMT prover for 6 properties.
[2023-03-11 10:47:07] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2023-03-11 10:47:07] [INFO ] Computed 101 place invariants in 5 ms
[2023-03-11 10:47:07] [INFO ] [Real]Absence check using 100 positive place invariants in 38 ms returned sat
[2023-03-11 10:47:07] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 10:47:07] [INFO ] After 265ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:1
[2023-03-11 10:47:07] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 10:47:08] [INFO ] After 167ms SMT Verify possible using 50 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 10:47:08] [INFO ] After 692ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 10:47:08] [INFO ] [Nat]Absence check using 100 positive place invariants in 27 ms returned sat
[2023-03-11 10:47:08] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 10:47:08] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 10:47:08] [INFO ] After 101ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 10:47:08] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2023-03-11 10:47:08] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2023-03-11 10:47:09] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2023-03-11 10:47:09] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2023-03-11 10:47:09] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2023-03-11 10:47:09] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2023-03-11 10:47:09] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2023-03-11 10:47:09] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2023-03-11 10:47:10] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2023-03-11 10:47:10] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2023-03-11 10:47:10] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 3 ms to minimize.
[2023-03-11 10:47:10] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1705 ms
[2023-03-11 10:47:10] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1705 ms
[2023-03-11 10:47:10] [INFO ] After 1976ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-11 10:47:10] [INFO ] After 2432ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 111 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 201/201 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 175440 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 175440 steps, saw 145518 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-11 10:47:14] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:47:14] [INFO ] Invariant cache hit.
[2023-03-11 10:47:14] [INFO ] [Real]Absence check using 100 positive place invariants in 25 ms returned sat
[2023-03-11 10:47:14] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 10:47:14] [INFO ] After 202ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:1
[2023-03-11 10:47:14] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 10:47:14] [INFO ] After 121ms SMT Verify possible using 50 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 10:47:14] [INFO ] After 505ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 10:47:14] [INFO ] [Nat]Absence check using 100 positive place invariants in 27 ms returned sat
[2023-03-11 10:47:14] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 10:47:14] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 10:47:15] [INFO ] After 109ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 10:47:15] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2023-03-11 10:47:15] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 1 ms to minimize.
[2023-03-11 10:47:15] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2023-03-11 10:47:15] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2023-03-11 10:47:16] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2023-03-11 10:47:16] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2023-03-11 10:47:16] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2023-03-11 10:47:16] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2023-03-11 10:47:16] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2023-03-11 10:47:16] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 3 ms to minimize.
[2023-03-11 10:47:16] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2023-03-11 10:47:16] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1688 ms
[2023-03-11 10:47:16] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1689 ms
[2023-03-11 10:47:16] [INFO ] After 1978ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-11 10:47:17] [INFO ] After 2441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 91 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 201/201 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 84 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-11 10:47:17] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:47:17] [INFO ] Invariant cache hit.
[2023-03-11 10:47:18] [INFO ] Implicit Places using invariants in 896 ms returned []
[2023-03-11 10:47:18] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:47:18] [INFO ] Invariant cache hit.
[2023-03-11 10:47:18] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 10:47:19] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1911 ms to find 0 implicit places.
[2023-03-11 10:47:19] [INFO ] Redundant transitions in 319 ms returned []
[2023-03-11 10:47:19] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:47:19] [INFO ] Invariant cache hit.
[2023-03-11 10:47:22] [INFO ] Dead Transitions using invariants and state equation in 2555 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4885 ms. Remains : 201/201 places, 2600/2600 transitions.
Graph (complete) has 305 edges and 201 vertex of which 33 are kept as prefixes of interest. Removing 168 places using SCC suffix rule.3 ms
Discarding 168 places :
Also discarding 2184 output transitions
Drop transitions removed 2184 transitions
Ensure Unique test removed 1 places
Ensure Unique test removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 385 rules applied. Total rules applied 386 place count 32 transition count 32
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 404 place count 20 transition count 26
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 410 place count 20 transition count 20
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 411 place count 20 transition count 19
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 414 place count 18 transition count 18
Applied a total of 414 rules in 44 ms. Remains 18 /201 variables (removed 183) and now considering 18/2600 (removed 2582) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 18 rows 18 cols
[2023-03-11 10:47:22] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 10:47:22] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-11 10:47:22] [INFO ] After 34ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2023-03-11 10:47:22] [INFO ] After 65ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-11 10:47:22] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :6
[2023-03-11 10:47:22] [INFO ] Flatten gal took : 152 ms
[2023-03-11 10:47:22] [INFO ] Flatten gal took : 148 ms
[2023-03-11 10:47:22] [INFO ] Input system was already deterministic with 2600 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 214/214 places, 2600/2600 transitions.
Applied a total of 0 rules in 309 ms. Remains 214 /214 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 312 ms. Remains : 214/214 places, 2600/2600 transitions.
[2023-03-11 10:47:23] [INFO ] Flatten gal took : 116 ms
[2023-03-11 10:47:23] [INFO ] Flatten gal took : 127 ms
[2023-03-11 10:47:23] [INFO ] Input system was already deterministic with 2600 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 2600/2600 transitions.
Applied a total of 0 rules in 18 ms. Remains 214 /214 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 214/214 places, 2600/2600 transitions.
[2023-03-11 10:47:23] [INFO ] Flatten gal took : 97 ms
[2023-03-11 10:47:23] [INFO ] Flatten gal took : 110 ms
[2023-03-11 10:47:24] [INFO ] Input system was already deterministic with 2600 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 2600/2600 transitions.
Applied a total of 0 rules in 19 ms. Remains 214 /214 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 214/214 places, 2600/2600 transitions.
[2023-03-11 10:47:24] [INFO ] Flatten gal took : 96 ms
[2023-03-11 10:47:24] [INFO ] Flatten gal took : 106 ms
[2023-03-11 10:47:24] [INFO ] Input system was already deterministic with 2600 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 2600/2600 transitions.
Applied a total of 0 rules in 17 ms. Remains 214 /214 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 214/214 places, 2600/2600 transitions.
[2023-03-11 10:47:24] [INFO ] Flatten gal took : 96 ms
[2023-03-11 10:47:24] [INFO ] Flatten gal took : 109 ms
[2023-03-11 10:47:25] [INFO ] Input system was already deterministic with 2600 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 2600/2600 transitions.
Applied a total of 0 rules in 29 ms. Remains 214 /214 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 214/214 places, 2600/2600 transitions.
[2023-03-11 10:47:25] [INFO ] Flatten gal took : 145 ms
[2023-03-11 10:47:25] [INFO ] Flatten gal took : 161 ms
[2023-03-11 10:47:25] [INFO ] Input system was already deterministic with 2600 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 2600/2600 transitions.
Applied a total of 0 rules in 20 ms. Remains 214 /214 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 214/214 places, 2600/2600 transitions.
[2023-03-11 10:47:25] [INFO ] Flatten gal took : 88 ms
[2023-03-11 10:47:25] [INFO ] Flatten gal took : 101 ms
[2023-03-11 10:47:26] [INFO ] Input system was already deterministic with 2600 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 2600/2600 transitions.
Applied a total of 0 rules in 16 ms. Remains 214 /214 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 214/214 places, 2600/2600 transitions.
[2023-03-11 10:47:26] [INFO ] Flatten gal took : 85 ms
[2023-03-11 10:47:26] [INFO ] Flatten gal took : 92 ms
[2023-03-11 10:47:26] [INFO ] Input system was already deterministic with 2600 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 2600/2600 transitions.
Applied a total of 0 rules in 17 ms. Remains 214 /214 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 214/214 places, 2600/2600 transitions.
[2023-03-11 10:47:26] [INFO ] Flatten gal took : 83 ms
[2023-03-11 10:47:26] [INFO ] Flatten gal took : 93 ms
[2023-03-11 10:47:26] [INFO ] Input system was already deterministic with 2600 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 2600/2600 transitions.
Applied a total of 0 rules in 17 ms. Remains 214 /214 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 214/214 places, 2600/2600 transitions.
[2023-03-11 10:47:26] [INFO ] Flatten gal took : 82 ms
[2023-03-11 10:47:27] [INFO ] Flatten gal took : 95 ms
[2023-03-11 10:47:27] [INFO ] Input system was already deterministic with 2600 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 2600/2600 transitions.
Applied a total of 0 rules in 17 ms. Remains 214 /214 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 214/214 places, 2600/2600 transitions.
[2023-03-11 10:47:27] [INFO ] Flatten gal took : 82 ms
[2023-03-11 10:47:27] [INFO ] Flatten gal took : 94 ms
[2023-03-11 10:47:27] [INFO ] Input system was already deterministic with 2600 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 2600/2600 transitions.
Applied a total of 0 rules in 16 ms. Remains 214 /214 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 214/214 places, 2600/2600 transitions.
[2023-03-11 10:47:27] [INFO ] Flatten gal took : 82 ms
[2023-03-11 10:47:27] [INFO ] Flatten gal took : 94 ms
[2023-03-11 10:47:27] [INFO ] Input system was already deterministic with 2600 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 2600/2600 transitions.
Applied a total of 0 rules in 16 ms. Remains 214 /214 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 214/214 places, 2600/2600 transitions.
[2023-03-11 10:47:28] [INFO ] Flatten gal took : 82 ms
[2023-03-11 10:47:28] [INFO ] Flatten gal took : 93 ms
[2023-03-11 10:47:28] [INFO ] Input system was already deterministic with 2600 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 2600/2600 transitions.
Applied a total of 0 rules in 16 ms. Remains 214 /214 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 214/214 places, 2600/2600 transitions.
[2023-03-11 10:47:28] [INFO ] Flatten gal took : 81 ms
[2023-03-11 10:47:28] [INFO ] Flatten gal took : 93 ms
[2023-03-11 10:47:28] [INFO ] Input system was already deterministic with 2600 transitions.
[2023-03-11 10:47:28] [INFO ] Flatten gal took : 105 ms
[2023-03-11 10:47:28] [INFO ] Flatten gal took : 117 ms
[2023-03-11 10:47:28] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-11 10:47:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 214 places, 2600 transitions and 18264 arcs took 26 ms.
Total runtime 44473 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: 214 NrTr: 2600 NrArc: 18264)

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

net check time: 0m 0.003sec

init dd package: 0m 3.679sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 10585096 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16097876 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.021sec

272098

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="Dekker-PT-050"
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 Dekker-PT-050, 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 r138-smll-167819419200025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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