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

About the Execution of Marcie+red for DLCflexbar-PT-5b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9551.407 3600000.00 3676238.00 5670.40 TTTFTFTFTFFTFTFF 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.r106-tall-167814482900566.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 DLCflexbar-PT-5b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482900566
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.0M
-rw-r--r-- 1 mcc users 6.4K Feb 25 15:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 15:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 15:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 15:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 15:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 25 15:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 15:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 25 15:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 6.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 DLCflexbar-PT-5b-ReachabilityCardinality-00
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-01
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-02
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-03
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-04
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-05
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-06
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-07
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-08
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-09
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-10
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-11
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-12
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-13
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-14
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678431170166

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCflexbar-PT-5b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 06:52:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 06:52:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 06:52:52] [INFO ] Load time of PNML (sax parser for PT used): 518 ms
[2023-03-10 06:52:52] [INFO ] Transformed 17305 places.
[2023-03-10 06:52:52] [INFO ] Transformed 26483 transitions.
[2023-03-10 06:52:52] [INFO ] Found NUPN structural information;
[2023-03-10 06:52:52] [INFO ] Parsed PT model containing 17305 places and 26483 transitions and 73264 arcs in 1266 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCflexbar-PT-5b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-5b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-5b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 635 ms. (steps per millisecond=15 ) properties (out of 13) seen :2
FORMULA DLCflexbar-PT-5b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) 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 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) 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 11) 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 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 26483 rows 17305 cols
[2023-03-10 06:52:56] [INFO ] Computed 979 place invariants in 207 ms
[2023-03-10 06:53:05] [INFO ] [Real]Absence check using 979 positive place invariants in 3028 ms returned sat
[2023-03-10 06:53:05] [INFO ] After 9609ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-10 06:53:14] [INFO ] [Nat]Absence check using 979 positive place invariants in 2999 ms returned sat
[2023-03-10 06:53:30] [INFO ] After 13564ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-10 06:53:30] [INFO ] After 13606ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-10 06:53:30] [INFO ] After 25072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 148 out of 17305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17305/17305 places, 26483/26483 transitions.
Graph (trivial) has 15579 edges and 17305 vertex of which 1264 / 17305 are part of one of the 84 SCC in 35 ms
Free SCC test removed 1180 places
Drop transitions removed 1330 transitions
Reduce isomorphic transitions removed 1330 transitions.
Drop transitions removed 7651 transitions
Trivial Post-agglo rules discarded 7651 transitions
Performed 7651 trivial Post agglomeration. Transition count delta: 7651
Iterating post reduction 0 with 7651 rules applied. Total rules applied 7652 place count 16125 transition count 17502
Reduce places removed 7651 places and 0 transitions.
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 189 transitions
Trivial Post-agglo rules discarded 189 transitions
Performed 189 trivial Post agglomeration. Transition count delta: 189
Iterating post reduction 1 with 8038 rules applied. Total rules applied 15690 place count 8474 transition count 17115
Reduce places removed 189 places and 0 transitions.
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 2 with 300 rules applied. Total rules applied 15990 place count 8285 transition count 17004
Reduce places removed 54 places and 0 transitions.
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Iterating post reduction 3 with 127 rules applied. Total rules applied 16117 place count 8231 transition count 16931
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 16191 place count 8158 transition count 16930
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 114 Pre rules applied. Total rules applied 16191 place count 8158 transition count 16816
Deduced a syphon composed of 114 places in 640 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 5 with 228 rules applied. Total rules applied 16419 place count 8044 transition count 16816
Discarding 2186 places :
Symmetric choice reduction at 5 with 2186 rule applications. Total rules 18605 place count 5858 transition count 14630
Iterating global reduction 5 with 2186 rules applied. Total rules applied 20791 place count 5858 transition count 14630
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 20795 place count 5858 transition count 14626
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 20798 place count 5856 transition count 14625
Performed 909 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 909 Pre rules applied. Total rules applied 20798 place count 5856 transition count 13716
Deduced a syphon composed of 909 places in 534 ms
Reduce places removed 909 places and 0 transitions.
Iterating global reduction 7 with 1818 rules applied. Total rules applied 22616 place count 4947 transition count 13716
Discarding 149 places :
Symmetric choice reduction at 7 with 149 rule applications. Total rules 22765 place count 4798 transition count 9928
Iterating global reduction 7 with 149 rules applied. Total rules applied 22914 place count 4798 transition count 9928
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 7 with 116 rules applied. Total rules applied 23030 place count 4798 transition count 9812
Performed 1187 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 1187 places in 10 ms
Reduce places removed 1187 places and 0 transitions.
Iterating global reduction 8 with 2374 rules applied. Total rules applied 25404 place count 3611 transition count 8621
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 25410 place count 3611 transition count 8615
Renaming transitions due to excessive name length > 1024 char.
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 25412 place count 3609 transition count 8479
Iterating global reduction 9 with 2 rules applied. Total rules applied 25414 place count 3609 transition count 8479
Performed 101 Post agglomeration using F-continuation condition with reduction of 189 identical transitions.
Deduced a syphon composed of 101 places in 8 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 9 with 202 rules applied. Total rules applied 25616 place count 3508 transition count 9222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 25618 place count 3508 transition count 9220
Discarding 30 places :
Symmetric choice reduction at 10 with 30 rule applications. Total rules 25648 place count 3478 transition count 8800
Iterating global reduction 10 with 30 rules applied. Total rules applied 25678 place count 3478 transition count 8800
Ensure Unique test removed 182 transitions
Reduce isomorphic transitions removed 182 transitions.
Iterating post reduction 10 with 182 rules applied. Total rules applied 25860 place count 3478 transition count 8618
Performed 101 Post agglomeration using F-continuation condition with reduction of 175 identical transitions.
Deduced a syphon composed of 101 places in 8 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 11 with 202 rules applied. Total rules applied 26062 place count 3377 transition count 9337
Drop transitions removed 17 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 11 with 22 rules applied. Total rules applied 26084 place count 3377 transition count 9315
Discarding 28 places :
Symmetric choice reduction at 12 with 28 rule applications. Total rules 26112 place count 3349 transition count 8920
Iterating global reduction 12 with 28 rules applied. Total rules applied 26140 place count 3349 transition count 8920
Ensure Unique test removed 171 transitions
Reduce isomorphic transitions removed 171 transitions.
Iterating post reduction 12 with 171 rules applied. Total rules applied 26311 place count 3349 transition count 8749
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -759
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 13 with 202 rules applied. Total rules applied 26513 place count 3248 transition count 9508
Drop transitions removed 158 transitions
Reduce isomorphic transitions removed 158 transitions.
Iterating post reduction 13 with 158 rules applied. Total rules applied 26671 place count 3248 transition count 9350
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 26675 place count 3246 transition count 9372
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 26677 place count 3246 transition count 9370
Drop transitions removed 198 transitions
Redundant transition composition rules discarded 198 transitions
Iterating global reduction 15 with 198 rules applied. Total rules applied 26875 place count 3246 transition count 9172
Discarding 12 places :
Symmetric choice reduction at 15 with 12 rule applications. Total rules 26887 place count 3234 transition count 9160
Iterating global reduction 15 with 12 rules applied. Total rules applied 26899 place count 3234 transition count 9160
Discarding 12 places :
Symmetric choice reduction at 15 with 12 rule applications. Total rules 26911 place count 3222 transition count 8273
Iterating global reduction 15 with 12 rules applied. Total rules applied 26923 place count 3222 transition count 8273
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 15 with 12 rules applied. Total rules applied 26935 place count 3222 transition count 8261
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 16 with 14 rules applied. Total rules applied 26949 place count 3215 transition count 8254
Discarding 7 places :
Symmetric choice reduction at 16 with 7 rule applications. Total rules 26956 place count 3208 transition count 7731
Iterating global reduction 16 with 7 rules applied. Total rules applied 26963 place count 3208 transition count 7731
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 16 with 7 rules applied. Total rules applied 26970 place count 3208 transition count 7724
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 26978 place count 3204 transition count 7747
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 26982 place count 3204 transition count 7743
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 18 with 20 rules applied. Total rules applied 27002 place count 3204 transition count 7723
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 27010 place count 3200 transition count 7744
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 27014 place count 3200 transition count 7740
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 19 with 19 rules applied. Total rules applied 27033 place count 3200 transition count 7721
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 27041 place count 3196 transition count 7740
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 27045 place count 3196 transition count 7736
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 20 with 19 rules applied. Total rules applied 27064 place count 3196 transition count 7717
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 20 with 8 rules applied. Total rules applied 27072 place count 3192 transition count 7736
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 27076 place count 3192 transition count 7732
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 21 with 19 rules applied. Total rules applied 27095 place count 3192 transition count 7713
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 27103 place count 3188 transition count 7732
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 27107 place count 3188 transition count 7728
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 22 with 19 rules applied. Total rules applied 27126 place count 3188 transition count 7709
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 22 with 8 rules applied. Total rules applied 27134 place count 3184 transition count 7728
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 27138 place count 3184 transition count 7724
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 23 with 19 rules applied. Total rules applied 27157 place count 3184 transition count 7705
Free-agglomeration rule applied 1733 times with reduction of 1083 identical transitions.
Iterating global reduction 23 with 1733 rules applied. Total rules applied 28890 place count 3184 transition count 4889
Reduce places removed 1733 places and 0 transitions.
Drop transitions removed 2020 transitions
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 2055 transitions.
Graph (complete) has 3853 edges and 1451 vertex of which 1317 are kept as prefixes of interest. Removing 134 places using SCC suffix rule.3 ms
Discarding 134 places :
Also discarding 116 output transitions
Drop transitions removed 116 transitions
Iterating post reduction 23 with 3789 rules applied. Total rules applied 32679 place count 1317 transition count 2718
Drop transitions removed 82 transitions
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 156 transitions.
Iterating post reduction 24 with 156 rules applied. Total rules applied 32835 place count 1317 transition count 2562
Discarding 338 places :
Symmetric choice reduction at 25 with 338 rule applications. Total rules 33173 place count 979 transition count 2100
Iterating global reduction 25 with 338 rules applied. Total rules applied 33511 place count 979 transition count 2100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 33512 place count 979 transition count 2099
Drop transitions removed 82 transitions
Redundant transition composition rules discarded 82 transitions
Iterating global reduction 26 with 82 rules applied. Total rules applied 33594 place count 979 transition count 2017
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 26 with 3 rules applied. Total rules applied 33597 place count 976 transition count 2017
Discarding 15 places :
Symmetric choice reduction at 27 with 15 rule applications. Total rules 33612 place count 961 transition count 1999
Iterating global reduction 27 with 15 rules applied. Total rules applied 33627 place count 961 transition count 1999
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 27 with 3 rules applied. Total rules applied 33630 place count 961 transition count 1999
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 27 with 1 rules applied. Total rules applied 33631 place count 960 transition count 1998
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 27 with 7 rules applied. Total rules applied 33638 place count 958 transition count 1993
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 28 with 5 rules applied. Total rules applied 33643 place count 953 transition count 1993
Performed 9 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 29 with 18 rules applied. Total rules applied 33661 place count 944 transition count 1973
Drop transitions removed 13 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 29 with 31 rules applied. Total rules applied 33692 place count 944 transition count 1942
Discarding 9 places :
Symmetric choice reduction at 30 with 9 rule applications. Total rules 33701 place count 935 transition count 1927
Iterating global reduction 30 with 9 rules applied. Total rules applied 33710 place count 935 transition count 1927
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 30 with 18 rules applied. Total rules applied 33728 place count 923 transition count 1921
Drop transitions removed 4 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 10 edges and 923 vertex of which 3 / 923 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 30 with 14 rules applied. Total rules applied 33742 place count 921 transition count 1908
Drop transitions removed 58 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 79 transitions.
Graph (complete) has 2678 edges and 921 vertex of which 894 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.1 ms
Discarding 27 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Iterating post reduction 31 with 80 rules applied. Total rules applied 33822 place count 894 transition count 1810
Drop transitions removed 22 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 32 with 44 rules applied. Total rules applied 33866 place count 894 transition count 1766
Discarding 42 places :
Symmetric choice reduction at 33 with 42 rule applications. Total rules 33908 place count 852 transition count 1699
Iterating global reduction 33 with 42 rules applied. Total rules applied 33950 place count 852 transition count 1699
Drop transitions removed 113 transitions
Redundant transition composition rules discarded 113 transitions
Iterating global reduction 33 with 113 rules applied. Total rules applied 34063 place count 852 transition count 1586
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 2410 edges and 850 vertex of which 826 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Iterating post reduction 33 with 3 rules applied. Total rules applied 34066 place count 826 transition count 1568
Drop transitions removed 14 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 34 with 36 rules applied. Total rules applied 34102 place count 826 transition count 1532
Discarding 74 places :
Symmetric choice reduction at 35 with 74 rule applications. Total rules 34176 place count 752 transition count 1406
Iterating global reduction 35 with 74 rules applied. Total rules applied 34250 place count 752 transition count 1406
Free-agglomeration rule applied 1 times.
Iterating global reduction 35 with 1 rules applied. Total rules applied 34251 place count 752 transition count 1405
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 35 with 1 rules applied. Total rules applied 34252 place count 751 transition count 1405
Applied a total of 34252 rules in 11105 ms. Remains 751 /17305 variables (removed 16554) and now considering 1405/26483 (removed 25078) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11106 ms. Remains : 751/17305 places, 1405/26483 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 11) seen :10
FORMULA DLCflexbar-PT-5b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 06:53:42] [INFO ] Flow matrix only has 955 transitions (discarded 450 similar events)
// Phase 1: matrix 955 rows 751 cols
[2023-03-10 06:53:42] [INFO ] Computed 358 place invariants in 16 ms
[2023-03-10 06:53:42] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 06:53:42] [INFO ] [Nat]Absence check using 358 positive place invariants in 97 ms returned sat
[2023-03-10 06:53:42] [INFO ] After 367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 06:53:42] [INFO ] State equation strengthened by 227 read => feed constraints.
[2023-03-10 06:53:43] [INFO ] After 135ms SMT Verify possible using 227 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 06:53:43] [INFO ] After 234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-10 06:53:43] [INFO ] After 879ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 36 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 1405/1405 transitions.
Graph (trivial) has 205 edges and 751 vertex of which 39 / 751 are part of one of the 17 SCC in 0 ms
Free SCC test removed 22 places
Drop transitions removed 42 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 46 transitions.
Graph (complete) has 2150 edges and 729 vertex of which 540 are kept as prefixes of interest. Removing 189 places using SCC suffix rule.1 ms
Discarding 189 places :
Also discarding 219 output transitions
Drop transitions removed 219 transitions
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t202.t8496 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 89 transitions
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 149 transitions.
Graph (trivial) has 140 edges and 536 vertex of which 3 / 536 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 173 rules applied. Total rules applied 175 place count 534 transition count 968
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 200 place count 512 transition count 965
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 200 place count 512 transition count 950
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 230 place count 497 transition count 950
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 239 place count 497 transition count 941
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 283 place count 453 transition count 843
Iterating global reduction 3 with 44 rules applied. Total rules applied 327 place count 453 transition count 843
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 331 place count 453 transition count 839
Performed 67 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 465 place count 386 transition count 724
Drop transitions removed 99 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 162 transitions.
Graph (complete) has 1065 edges and 386 vertex of which 377 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Iterating post reduction 4 with 163 rules applied. Total rules applied 628 place count 377 transition count 557
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 632 place count 377 transition count 553
Discarding 57 places :
Symmetric choice reduction at 6 with 57 rule applications. Total rules 689 place count 320 transition count 482
Iterating global reduction 6 with 57 rules applied. Total rules applied 746 place count 320 transition count 482
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 750 place count 320 transition count 478
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 786 place count 302 transition count 460
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 789 place count 302 transition count 457
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 799 place count 297 transition count 480
Drop transitions removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 806 place count 297 transition count 473
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 814 place count 297 transition count 465
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 815 place count 296 transition count 465
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 816 place count 295 transition count 464
Iterating global reduction 10 with 1 rules applied. Total rules applied 817 place count 295 transition count 464
Free-agglomeration rule applied 8 times.
Iterating global reduction 10 with 8 rules applied. Total rules applied 825 place count 295 transition count 456
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 37 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 38 transitions.
Graph (complete) has 754 edges and 286 vertex of which 260 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.0 ms
Discarding 26 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Iterating post reduction 10 with 48 rules applied. Total rules applied 873 place count 260 transition count 391
Drop transitions removed 3 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 11 with 23 rules applied. Total rules applied 896 place count 260 transition count 368
Discarding 27 places :
Symmetric choice reduction at 12 with 27 rule applications. Total rules 923 place count 233 transition count 334
Iterating global reduction 12 with 27 rules applied. Total rules applied 950 place count 233 transition count 334
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 954 place count 231 transition count 332
Drop transitions removed 5 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 962 place count 231 transition count 324
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 964 place count 229 transition count 321
Iterating global reduction 13 with 2 rules applied. Total rules applied 966 place count 229 transition count 321
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 970 place count 227 transition count 319
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 971 place count 227 transition count 318
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 972 place count 226 transition count 318
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 973 place count 226 transition count 318
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 975 place count 224 transition count 316
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 976 place count 223 transition count 316
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 978 place count 222 transition count 315
Drop transitions removed 1 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 988 place count 222 transition count 305
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 989 place count 221 transition count 304
Iterating global reduction 16 with 1 rules applied. Total rules applied 990 place count 221 transition count 304
Applied a total of 990 rules in 119 ms. Remains 221 /751 variables (removed 530) and now considering 304/1405 (removed 1101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 221/751 places, 304/1405 transitions.
Finished random walk after 70 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=70 )
FORMULA DLCflexbar-PT-5b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 51745 ms.
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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DLCflexbar_PT_5b
(NrP: 17305 NrTr: 26483 NrArc: 73264)

parse formulas
formulas created successfully
place and transition orderings generation:1m24.304sec

net check time: 0m 0.013sec

init dd package: 0m 2.767sec


before gc: list nodes free: 1915754

after gc: idd nodes used:11314, unused:63988686; list nodes free:257870498

before gc: list nodes free: 1901699

after gc: idd nodes used:15999, unused:63984001; list nodes free:257837703
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6594436 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16096912 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 ReachabilityCardinality -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 5.589sec

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="DLCflexbar-PT-5b"
export BK_EXAMINATION="ReachabilityCardinality"
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 DLCflexbar-PT-5b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r106-tall-167814482900566"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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