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.r266-smll-167863540700254.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 NoC3x3-PT-2B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540700254
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 972K
-rw-r--r-- 1 mcc users 5.8K Feb 26 10:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 10:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 10:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 10:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 10:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 10:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 548K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678924596165

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=NoC3x3-PT-2B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-15 23:56:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 23:56:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 23:56:40] [INFO ] Load time of PNML (sax parser for PT used): 357 ms
[2023-03-15 23:56:40] [INFO ] Transformed 2003 places.
[2023-03-15 23:56:40] [INFO ] Transformed 2292 transitions.
[2023-03-15 23:56:40] [INFO ] Found NUPN structural information;
[2023-03-15 23:56:40] [INFO ] Parsed PT model containing 2003 places and 2292 transitions and 5835 arcs in 565 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 16 resets, run finished after 837 ms. (steps per millisecond=11 ) properties (out of 15) seen :7
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :1
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :1
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2292 rows 2003 cols
[2023-03-15 23:56:42] [INFO ] Computed 66 place invariants in 80 ms
[2023-03-15 23:56:43] [INFO ] After 1290ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-15 23:56:44] [INFO ] [Nat]Absence check using 66 positive place invariants in 104 ms returned sat
[2023-03-15 23:56:47] [INFO ] After 3155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-15 23:56:48] [INFO ] Deduced a trap composed of 43 places in 877 ms of which 16 ms to minimize.
[2023-03-15 23:56:49] [INFO ] Deduced a trap composed of 46 places in 637 ms of which 2 ms to minimize.
[2023-03-15 23:56:50] [INFO ] Deduced a trap composed of 45 places in 503 ms of which 3 ms to minimize.
[2023-03-15 23:56:51] [INFO ] Deduced a trap composed of 85 places in 603 ms of which 3 ms to minimize.
[2023-03-15 23:56:51] [INFO ] Deduced a trap composed of 64 places in 337 ms of which 1 ms to minimize.
[2023-03-15 23:56:52] [INFO ] Deduced a trap composed of 96 places in 456 ms of which 2 ms to minimize.
[2023-03-15 23:56:52] [INFO ] Deduced a trap composed of 79 places in 392 ms of which 2 ms to minimize.
[2023-03-15 23:56:53] [INFO ] Deduced a trap composed of 77 places in 287 ms of which 1 ms to minimize.
[2023-03-15 23:56:53] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 5333 ms
[2023-03-15 23:56:54] [INFO ] Deduced a trap composed of 78 places in 398 ms of which 2 ms to minimize.
[2023-03-15 23:56:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 711 ms
[2023-03-15 23:56:55] [INFO ] Deduced a trap composed of 96 places in 537 ms of which 1 ms to minimize.
[2023-03-15 23:56:55] [INFO ] Deduced a trap composed of 60 places in 497 ms of which 1 ms to minimize.
[2023-03-15 23:56:56] [INFO ] Deduced a trap composed of 93 places in 321 ms of which 1 ms to minimize.
[2023-03-15 23:56:56] [INFO ] Deduced a trap composed of 79 places in 299 ms of which 1 ms to minimize.
[2023-03-15 23:56:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2421 ms
[2023-03-15 23:56:57] [INFO ] After 13114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1294 ms.
[2023-03-15 23:56:59] [INFO ] After 15684ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 489 ms.
Support contains 61 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Graph (trivial) has 1529 edges and 2003 vertex of which 64 / 2003 are part of one of the 8 SCC in 15 ms
Free SCC test removed 56 places
Drop transitions removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 372 transitions
Trivial Post-agglo rules discarded 372 transitions
Performed 372 trivial Post agglomeration. Transition count delta: 372
Iterating post reduction 0 with 381 rules applied. Total rules applied 382 place count 1938 transition count 1856
Reduce places removed 372 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 386 rules applied. Total rules applied 768 place count 1566 transition count 1842
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 782 place count 1552 transition count 1842
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 782 place count 1552 transition count 1816
Deduced a syphon composed of 26 places in 14 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 834 place count 1526 transition count 1816
Discarding 344 places :
Symmetric choice reduction at 3 with 344 rule applications. Total rules 1178 place count 1182 transition count 1472
Iterating global reduction 3 with 344 rules applied. Total rules applied 1522 place count 1182 transition count 1472
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 1522 place count 1182 transition count 1434
Deduced a syphon composed of 38 places in 12 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1598 place count 1144 transition count 1434
Discarding 123 places :
Symmetric choice reduction at 3 with 123 rule applications. Total rules 1721 place count 1021 transition count 1274
Iterating global reduction 3 with 123 rules applied. Total rules applied 1844 place count 1021 transition count 1274
Discarding 105 places :
Symmetric choice reduction at 3 with 105 rule applications. Total rules 1949 place count 916 transition count 1160
Iterating global reduction 3 with 105 rules applied. Total rules applied 2054 place count 916 transition count 1160
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 2088 place count 882 transition count 1098
Iterating global reduction 3 with 34 rules applied. Total rules applied 2122 place count 882 transition count 1098
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 12 rules applied. Total rules applied 2134 place count 880 transition count 1088
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2136 place count 878 transition count 1088
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 2160 place count 854 transition count 1064
Iterating global reduction 5 with 24 rules applied. Total rules applied 2184 place count 854 transition count 1064
Discarding 2 places :
Implicit places reduction removed 2 places
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 2188 place count 852 transition count 1062
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2190 place count 850 transition count 1062
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 2202 place count 838 transition count 1038
Iterating global reduction 7 with 12 rules applied. Total rules applied 2214 place count 838 transition count 1038
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 2226 place count 826 transition count 1026
Iterating global reduction 7 with 12 rules applied. Total rules applied 2238 place count 826 transition count 1026
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 2250 place count 826 transition count 1014
Performed 292 Post agglomeration using F-continuation condition.Transition count delta: 292
Deduced a syphon composed of 292 places in 0 ms
Reduce places removed 292 places and 0 transitions.
Iterating global reduction 8 with 584 rules applied. Total rules applied 2834 place count 534 transition count 722
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 2845 place count 523 transition count 711
Iterating global reduction 8 with 11 rules applied. Total rules applied 2856 place count 523 transition count 711
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 2863 place count 516 transition count 697
Iterating global reduction 8 with 7 rules applied. Total rules applied 2870 place count 516 transition count 697
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2871 place count 515 transition count 695
Iterating global reduction 8 with 1 rules applied. Total rules applied 2872 place count 515 transition count 695
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 38 rules applied. Total rules applied 2910 place count 496 transition count 728
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2911 place count 495 transition count 726
Iterating global reduction 8 with 1 rules applied. Total rules applied 2912 place count 495 transition count 726
Free-agglomeration rule applied 32 times.
Iterating global reduction 8 with 32 rules applied. Total rules applied 2944 place count 495 transition count 694
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 37 rules applied. Total rules applied 2981 place count 463 transition count 689
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 2987 place count 463 transition count 683
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2989 place count 463 transition count 682
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2991 place count 461 transition count 682
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 2998 place count 461 transition count 682
Partial Post-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 3005 place count 461 transition count 682
Applied a total of 3005 rules in 1239 ms. Remains 461 /2003 variables (removed 1542) and now considering 682/2292 (removed 1610) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1242 ms. Remains : 461/2003 places, 682/2292 transitions.
Incomplete random walk after 10000 steps, including 100 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 201928 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 201928 steps, saw 52217 distinct states, run finished after 3002 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-15 23:57:04] [INFO ] Flow matrix only has 680 transitions (discarded 2 similar events)
// Phase 1: matrix 680 rows 461 cols
[2023-03-15 23:57:04] [INFO ] Computed 55 place invariants in 10 ms
[2023-03-15 23:57:04] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 23:57:04] [INFO ] [Nat]Absence check using 55 positive place invariants in 18 ms returned sat
[2023-03-15 23:57:04] [INFO ] After 449ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 23:57:04] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-15 23:57:05] [INFO ] After 224ms SMT Verify possible using 62 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-15 23:57:05] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2023-03-15 23:57:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-03-15 23:57:05] [INFO ] After 631ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 240 ms.
[2023-03-15 23:57:05] [INFO ] After 1485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 76 ms.
Support contains 61 out of 461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 682/682 transitions.
Applied a total of 0 rules in 25 ms. Remains 461 /461 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 461/461 places, 682/682 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 682/682 transitions.
Applied a total of 0 rules in 23 ms. Remains 461 /461 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2023-03-15 23:57:05] [INFO ] Flow matrix only has 680 transitions (discarded 2 similar events)
[2023-03-15 23:57:05] [INFO ] Invariant cache hit.
[2023-03-15 23:57:06] [INFO ] Implicit Places using invariants in 561 ms returned [13, 48, 129, 277, 342, 373, 437]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 567 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 454/461 places, 682/682 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 454 transition count 681
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 453 transition count 680
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 31 place count 439 transition count 666
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 43 place count 439 transition count 654
Applied a total of 43 rules in 45 ms. Remains 439 /454 variables (removed 15) and now considering 654/682 (removed 28) transitions.
[2023-03-15 23:57:06] [INFO ] Flow matrix only has 652 transitions (discarded 2 similar events)
// Phase 1: matrix 652 rows 439 cols
[2023-03-15 23:57:06] [INFO ] Computed 48 place invariants in 5 ms
[2023-03-15 23:57:06] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-15 23:57:06] [INFO ] Flow matrix only has 652 transitions (discarded 2 similar events)
[2023-03-15 23:57:06] [INFO ] Invariant cache hit.
[2023-03-15 23:57:07] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-15 23:57:07] [INFO ] Implicit Places using invariants and state equation in 805 ms returned [8, 12, 34, 35, 38, 39, 43, 44, 82, 85, 86, 111, 112, 117, 118, 122, 154, 155, 156, 157, 160, 161, 162, 167, 168, 172, 173, 174, 254, 255, 256, 260, 262, 263, 266, 267, 268, 325, 329, 345, 346, 347, 350, 351, 356, 357, 411, 413, 416, 417]
Discarding 50 places :
Implicit Place search using SMT with State Equation took 1089 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 389/461 places, 654/682 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 389 transition count 647
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 382 transition count 646
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 381 transition count 646
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 86 place count 346 transition count 611
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 102 place count 338 transition count 615
Free-agglomeration rule (complex) applied 68 times.
Iterating global reduction 3 with 68 rules applied. Total rules applied 170 place count 338 transition count 557
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 75 rules applied. Total rules applied 245 place count 270 transition count 550
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 250 place count 270 transition count 545
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 256 place count 270 transition count 545
Applied a total of 256 rules in 69 ms. Remains 270 /389 variables (removed 119) and now considering 545/654 (removed 109) transitions.
[2023-03-15 23:57:07] [INFO ] Flow matrix only has 542 transitions (discarded 3 similar events)
// Phase 1: matrix 542 rows 270 cols
[2023-03-15 23:57:07] [INFO ] Computed 35 place invariants in 4 ms
[2023-03-15 23:57:07] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-03-15 23:57:07] [INFO ] Flow matrix only has 542 transitions (discarded 3 similar events)
[2023-03-15 23:57:07] [INFO ] Invariant cache hit.
[2023-03-15 23:57:08] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-15 23:57:08] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 808 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 270/461 places, 545/682 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2602 ms. Remains : 270/461 places, 545/682 transitions.
Incomplete random walk after 10000 steps, including 118 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 4) seen :1
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-15 23:57:08] [INFO ] Flow matrix only has 542 transitions (discarded 3 similar events)
[2023-03-15 23:57:08] [INFO ] Invariant cache hit.
[2023-03-15 23:57:09] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 23:57:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2023-03-15 23:57:09] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 23:57:09] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-15 23:57:09] [INFO ] After 140ms SMT Verify possible using 98 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 23:57:09] [INFO ] After 336ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 174 ms.
[2023-03-15 23:57:09] [INFO ] After 865ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 87 ms.
Support contains 55 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 545/545 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 270 transition count 542
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 267 transition count 542
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 267 transition count 541
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 266 transition count 541
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 265 transition count 540
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 264 transition count 546
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 264 transition count 545
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 263 transition count 545
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 263 transition count 545
Applied a total of 15 rules in 63 ms. Remains 263 /270 variables (removed 7) and now considering 545/545 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 263/270 places, 545/545 transitions.
Incomplete random walk after 10000 steps, including 120 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 323092 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 323092 steps, saw 76176 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-15 23:57:13] [INFO ] Flow matrix only has 542 transitions (discarded 3 similar events)
// Phase 1: matrix 542 rows 263 cols
[2023-03-15 23:57:13] [INFO ] Computed 35 place invariants in 7 ms
[2023-03-15 23:57:13] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 23:57:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2023-03-15 23:57:13] [INFO ] After 259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 23:57:13] [INFO ] State equation strengthened by 103 read => feed constraints.
[2023-03-15 23:57:14] [INFO ] After 161ms SMT Verify possible using 103 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 23:57:14] [INFO ] After 377ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 160 ms.
[2023-03-15 23:57:14] [INFO ] After 890ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 35 ms.
Support contains 55 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 545/545 transitions.
Applied a total of 0 rules in 12 ms. Remains 263 /263 variables (removed 0) and now considering 545/545 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 263/263 places, 545/545 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 545/545 transitions.
Applied a total of 0 rules in 11 ms. Remains 263 /263 variables (removed 0) and now considering 545/545 (removed 0) transitions.
[2023-03-15 23:57:14] [INFO ] Flow matrix only has 542 transitions (discarded 3 similar events)
[2023-03-15 23:57:14] [INFO ] Invariant cache hit.
[2023-03-15 23:57:14] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-03-15 23:57:14] [INFO ] Flow matrix only has 542 transitions (discarded 3 similar events)
[2023-03-15 23:57:14] [INFO ] Invariant cache hit.
[2023-03-15 23:57:15] [INFO ] State equation strengthened by 103 read => feed constraints.
[2023-03-15 23:57:15] [INFO ] Implicit Places using invariants and state equation in 811 ms returned []
Implicit Place search using SMT with State Equation took 1096 ms to find 0 implicit places.
[2023-03-15 23:57:15] [INFO ] Redundant transitions in 105 ms returned []
[2023-03-15 23:57:15] [INFO ] Flow matrix only has 542 transitions (discarded 3 similar events)
[2023-03-15 23:57:15] [INFO ] Invariant cache hit.
[2023-03-15 23:57:16] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1859 ms. Remains : 263/263 places, 545/545 transitions.
Graph (trivial) has 63 edges and 263 vertex of which 30 / 263 are part of one of the 15 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions removed 43 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 45 transitions.
Graph (complete) has 837 edges and 248 vertex of which 242 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 242 transition count 486
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 238 transition count 482
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 28 place count 238 transition count 478
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 41 place count 238 transition count 465
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 2 with 17 rules applied. Total rules applied 58 place count 238 transition count 465
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 238 transition count 464
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 238 transition count 463
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 237 transition count 462
Applied a total of 61 rules in 67 ms. Remains 237 /263 variables (removed 26) and now considering 462/545 (removed 83) transitions.
Running SMT prover for 3 properties.
[2023-03-15 23:57:16] [INFO ] Flow matrix only has 460 transitions (discarded 2 similar events)
// Phase 1: matrix 460 rows 237 cols
[2023-03-15 23:57:16] [INFO ] Computed 32 place invariants in 4 ms
[2023-03-15 23:57:16] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 23:57:16] [INFO ] [Nat]Absence check using 32 positive place invariants in 8 ms returned sat
[2023-03-15 23:57:16] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 23:57:16] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-03-15 23:57:16] [INFO ] After 95ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 23:57:17] [INFO ] After 212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 140 ms.
[2023-03-15 23:57:17] [INFO ] After 650ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-15 23:57:17] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-15 23:57:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 263 places, 545 transitions and 2162 arcs took 6 ms.
[2023-03-15 23:57:17] [INFO ] Flatten gal took : 174 ms
Total runtime 38162 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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: NoC3x3_PT_2B
(NrP: 263 NrTr: 545 NrArc: 2162)

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

net check time: 0m 0.000sec

init dd package: 0m 3.507sec


before gc: list nodes free: 738751

after gc: idd nodes used:4173, unused:63995827; list nodes free:270512855

before gc: list nodes free: 1760361

after gc: idd nodes used:9864, unused:63990136; list nodes free:272585383

before gc: list nodes free: 146787

after gc: idd nodes used:14722, unused:63985278; list nodes free:274661672

before gc: list nodes free: 2018082

after gc: idd nodes used:19011, unused:63980989; list nodes free:278835704

before gc: list nodes free: 2615278

after gc: idd nodes used:12642, unused:63987358; list nodes free:278864760

before gc: list nodes free: 886078

after gc: idd nodes used:16435, unused:63983565; list nodes free:278848884

before gc: list nodes free: 433207

after gc: idd nodes used:17157, unused:63982843; list nodes free:278845861

before gc: list nodes free: 1108419

after gc: idd nodes used:14663, unused:63985337; list nodes free:278856377

before gc: list nodes free: 5041155

after gc: idd nodes used:15361, unused:63984639; list nodes free:278853415
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 6358444 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16097712 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 0.003sec

1562 2460 2359 2519 2330 2277 2286 2142 3053 3078 3676 3049 2661 3063 2621 4072 4953 4272 2677 2612 3387 3471 4203 4405 5418 2514 2438 2604 3735 3591 4331 5517 5024 4331 4273 4338 5856 5091 4514 5431 5634 4798 4584 4637 5475 4548 5044 4937 4327 4326 4522 5549 5622 4889 5257 5296 4561 4641 4568 5271 5693 4589 5241 7153 4303 4340 5387 5344 8630 9548 10238 10525 11624 11988 10855 13139 14537 12060 12209 12237 13488 14855 14403 13274 13264 13270 14536 15602 15049 14676 14515 14726 13970 15227 16604 15413 14758 14663 14492 15889 13967 14342 14254 14420 15606 15257 14319 14388 14303 12267 14553 13718 13430 13341 13392 13936 16045 16239 14408 15312 15093 15805 15946 14411 14576 14631 14994 16363 15834 14527 14705 14631 15924 16144 16419 14577 15024 14750 14522 17742 16384 14734 15453 14736 11813 11774 10630 11695 11707 10958 11677 11259 11830 10927 13519 16005 15795 14413 14354 14584 15495 17188 17201 15703 15623 16415 16522 17552 18802 16784 16168 16734 17816 18105 16254 16191 16447 16825 18951 17933 16361 16507 16661 16485 17903 18271 16822 16731 16471 14162 16026 17757 16152 15494 16509 16256 17977 15822 15752 15915 17031 18618 17820 16557 16776 16718 17180 18144 18477 16973 17016 16932 16736 18825 19515 17693 17054 16948 16709 17980 16213 16244 16193 13027 12255 13362 13785 12788 14753 13840 13885 14084 12942 13009 12119 11824 13933 13880 14143 15855 13950 14187 14750 13063 16004 16881 15167 14660 15595 16139 16519 15171 15012 15375 16492 17849 17327 16368 16303 16461 17418

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="NoC3x3-PT-2B"
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 NoC3x3-PT-2B, 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 r266-smll-167863540700254"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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