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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 952K
-rw-r--r-- 1 mcc users 7.7K Feb 26 09:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 09:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 09:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 09:54 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.4K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 6.5K Feb 26 09:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 09:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 09:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 09:56 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 581K 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-3B-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678941408581

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-3B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 04:36:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 04:36:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 04:36:52] [INFO ] Load time of PNML (sax parser for PT used): 451 ms
[2023-03-16 04:36:52] [INFO ] Transformed 2117 places.
[2023-03-16 04:36:52] [INFO ] Transformed 2435 transitions.
[2023-03-16 04:36:52] [INFO ] Found NUPN structural information;
[2023-03-16 04:36:52] [INFO ] Parsed PT model containing 2117 places and 2435 transitions and 6177 arcs in 652 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 17 resets, run finished after 771 ms. (steps per millisecond=12 ) properties (out of 13) seen :9
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2435 rows 2117 cols
[2023-03-16 04:36:53] [INFO ] Computed 66 place invariants in 49 ms
[2023-03-16 04:36:55] [INFO ] After 1309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-16 04:36:56] [INFO ] [Nat]Absence check using 66 positive place invariants in 97 ms returned sat
[2023-03-16 04:36:58] [INFO ] After 2007ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-16 04:36:58] [INFO ] Deduced a trap composed of 80 places in 427 ms of which 11 ms to minimize.
[2023-03-16 04:36:59] [INFO ] Deduced a trap composed of 76 places in 634 ms of which 2 ms to minimize.
[2023-03-16 04:37:00] [INFO ] Deduced a trap composed of 59 places in 473 ms of which 2 ms to minimize.
[2023-03-16 04:37:00] [INFO ] Deduced a trap composed of 73 places in 407 ms of which 1 ms to minimize.
[2023-03-16 04:37:01] [INFO ] Deduced a trap composed of 107 places in 315 ms of which 2 ms to minimize.
[2023-03-16 04:37:01] [INFO ] Deduced a trap composed of 100 places in 252 ms of which 1 ms to minimize.
[2023-03-16 04:37:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3617 ms
[2023-03-16 04:37:02] [INFO ] After 6631ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 634 ms.
[2023-03-16 04:37:03] [INFO ] After 8558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 142 ms.
Support contains 34 out of 2117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Graph (trivial) has 1698 edges and 2117 vertex of which 64 / 2117 are part of one of the 8 SCC in 30 ms
Free SCC test removed 56 places
Drop transitions removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 427 transitions
Trivial Post-agglo rules discarded 427 transitions
Performed 427 trivial Post agglomeration. Transition count delta: 427
Iterating post reduction 0 with 432 rules applied. Total rules applied 433 place count 2056 transition count 1944
Reduce places removed 427 places and 0 transitions.
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 1 with 431 rules applied. Total rules applied 864 place count 1629 transition count 1940
Reduce places removed 2 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 9 rules applied. Total rules applied 873 place count 1627 transition count 1933
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 880 place count 1620 transition count 1933
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 880 place count 1620 transition count 1908
Deduced a syphon composed of 25 places in 11 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 930 place count 1595 transition count 1908
Discarding 360 places :
Symmetric choice reduction at 4 with 360 rule applications. Total rules 1290 place count 1235 transition count 1548
Iterating global reduction 4 with 360 rules applied. Total rules applied 1650 place count 1235 transition count 1548
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 1650 place count 1235 transition count 1509
Deduced a syphon composed of 39 places in 11 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1728 place count 1196 transition count 1509
Discarding 130 places :
Symmetric choice reduction at 4 with 130 rule applications. Total rules 1858 place count 1066 transition count 1340
Iterating global reduction 4 with 130 rules applied. Total rules applied 1988 place count 1066 transition count 1340
Discarding 130 places :
Symmetric choice reduction at 4 with 130 rule applications. Total rules 2118 place count 936 transition count 1196
Iterating global reduction 4 with 130 rules applied. Total rules applied 2248 place count 936 transition count 1196
Discarding 47 places :
Symmetric choice reduction at 4 with 47 rule applications. Total rules 2295 place count 889 transition count 1112
Iterating global reduction 4 with 47 rules applied. Total rules applied 2342 place count 889 transition count 1112
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 14 rules applied. Total rules applied 2356 place count 888 transition count 1099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2357 place count 887 transition count 1099
Discarding 35 places :
Symmetric choice reduction at 6 with 35 rule applications. Total rules 2392 place count 852 transition count 1064
Iterating global reduction 6 with 35 rules applied. Total rules applied 2427 place count 852 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 6 with 4 rules applied. Total rules applied 2431 place count 850 transition count 1062
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 2433 place count 848 transition count 1062
Discarding 24 places :
Symmetric choice reduction at 8 with 24 rule applications. Total rules 2457 place count 824 transition count 1014
Iterating global reduction 8 with 24 rules applied. Total rules applied 2481 place count 824 transition count 1014
Discarding 23 places :
Symmetric choice reduction at 8 with 23 rule applications. Total rules 2504 place count 801 transition count 991
Iterating global reduction 8 with 23 rules applied. Total rules applied 2527 place count 801 transition count 991
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 27 rules applied. Total rules applied 2554 place count 798 transition count 967
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 2557 place count 795 transition count 967
Performed 301 Post agglomeration using F-continuation condition.Transition count delta: 301
Deduced a syphon composed of 301 places in 0 ms
Reduce places removed 301 places and 0 transitions.
Iterating global reduction 10 with 602 rules applied. Total rules applied 3159 place count 494 transition count 666
Discarding 16 places :
Symmetric choice reduction at 10 with 16 rule applications. Total rules 3175 place count 478 transition count 649
Iterating global reduction 10 with 16 rules applied. Total rules applied 3191 place count 478 transition count 649
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 3198 place count 471 transition count 635
Iterating global reduction 10 with 7 rules applied. Total rules applied 3205 place count 471 transition count 635
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 3207 place count 469 transition count 631
Iterating global reduction 10 with 2 rules applied. Total rules applied 3209 place count 469 transition count 631
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 10 with 2 rules applied. Total rules applied 3211 place count 468 transition count 630
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 10 with 36 rules applied. Total rules applied 3247 place count 450 transition count 646
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 3248 place count 449 transition count 644
Iterating global reduction 10 with 1 rules applied. Total rules applied 3249 place count 449 transition count 644
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 3252 place count 449 transition count 641
Free-agglomeration rule applied 30 times.
Iterating global reduction 10 with 30 rules applied. Total rules applied 3282 place count 449 transition count 611
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 35 rules applied. Total rules applied 3317 place count 419 transition count 606
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 3322 place count 419 transition count 601
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 3325 place count 419 transition count 598
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 3328 place count 416 transition count 598
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 12 with 7 rules applied. Total rules applied 3335 place count 416 transition count 598
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 12 with 4 rules applied. Total rules applied 3339 place count 416 transition count 598
Applied a total of 3339 rules in 1349 ms. Remains 416 /2117 variables (removed 1701) and now considering 598/2435 (removed 1837) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1350 ms. Remains : 416/2117 places, 598/2435 transitions.
Incomplete random walk after 10000 steps, including 106 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 4) seen :1
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 598 rows 416 cols
[2023-03-16 04:37:05] [INFO ] Computed 57 place invariants in 8 ms
[2023-03-16 04:37:05] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 04:37:05] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2023-03-16 04:37:06] [INFO ] After 345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 04:37:06] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 04:37:06] [INFO ] After 111ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-16 04:37:06] [INFO ] After 258ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-16 04:37:06] [INFO ] After 869ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 23 ms.
Support contains 22 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 598/598 transitions.
Graph (trivial) has 19 edges and 416 vertex of which 2 / 416 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 415 transition count 595
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 414 transition count 595
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 414 transition count 593
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 412 transition count 593
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 10 place count 409 transition count 588
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 409 transition count 588
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 19 place count 409 transition count 582
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 408 transition count 580
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 408 transition count 580
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 22 place count 407 transition count 578
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 407 transition count 578
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 24 place count 407 transition count 577
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 30 place count 404 transition count 574
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 32 place count 402 transition count 568
Iterating global reduction 4 with 2 rules applied. Total rules applied 34 place count 402 transition count 568
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 35 place count 401 transition count 566
Iterating global reduction 4 with 1 rules applied. Total rules applied 36 place count 401 transition count 566
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 37 place count 401 transition count 565
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 39 place count 400 transition count 576
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 43 place count 400 transition count 572
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 49 place count 396 transition count 570
Applied a total of 49 rules in 171 ms. Remains 396 /416 variables (removed 20) and now considering 570/598 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 396/416 places, 570/598 transitions.
Incomplete random walk after 10000 steps, including 117 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 443445 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :{}
Probabilistic random walk after 443445 steps, saw 87396 distinct states, run finished after 3008 ms. (steps per millisecond=147 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 570 rows 396 cols
[2023-03-16 04:37:09] [INFO ] Computed 57 place invariants in 9 ms
[2023-03-16 04:37:10] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 04:37:10] [INFO ] [Nat]Absence check using 57 positive place invariants in 27 ms returned sat
[2023-03-16 04:37:10] [INFO ] After 384ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 04:37:10] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 04:37:10] [INFO ] After 143ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 04:37:10] [INFO ] After 236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-16 04:37:10] [INFO ] After 861ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 22 out of 396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 570/570 transitions.
Applied a total of 0 rules in 25 ms. Remains 396 /396 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 396/396 places, 570/570 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 570/570 transitions.
Applied a total of 0 rules in 22 ms. Remains 396 /396 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2023-03-16 04:37:10] [INFO ] Invariant cache hit.
[2023-03-16 04:37:11] [INFO ] Implicit Places using invariants in 520 ms returned [11, 41, 80, 114, 165, 297, 331, 380]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 533 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 388/396 places, 570/570 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 371 transition count 553
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 51 place count 371 transition count 536
Applied a total of 51 rules in 47 ms. Remains 371 /388 variables (removed 17) and now considering 536/570 (removed 34) transitions.
// Phase 1: matrix 536 rows 371 cols
[2023-03-16 04:37:11] [INFO ] Computed 49 place invariants in 4 ms
[2023-03-16 04:37:11] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-16 04:37:11] [INFO ] Invariant cache hit.
[2023-03-16 04:37:12] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-16 04:37:12] [INFO ] Implicit Places using invariants and state equation in 815 ms returned [6, 10, 27, 28, 31, 32, 36, 37, 69, 71, 74, 75, 96, 97, 102, 103, 106, 133, 134, 135, 136, 139, 140, 141, 145, 146, 147, 151, 152, 153, 219, 220, 221, 224, 225, 226, 227, 230, 231, 232, 276, 277, 281, 301, 302, 303, 306, 310, 311, 312, 352, 353, 356, 357]
Discarding 54 places :
Implicit Place search using SMT with State Equation took 1267 ms to find 54 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 317/396 places, 536/570 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 317 transition count 524
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 305 transition count 524
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 100 place count 267 transition count 486
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 114 place count 260 transition count 488
Free-agglomeration rule (complex) applied 57 times.
Iterating global reduction 2 with 57 rules applied. Total rules applied 171 place count 260 transition count 448
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 239 place count 203 transition count 437
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 242 place count 203 transition count 434
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 249 place count 203 transition count 434
Applied a total of 249 rules in 73 ms. Remains 203 /317 variables (removed 114) and now considering 434/536 (removed 102) transitions.
[2023-03-16 04:37:12] [INFO ] Flow matrix only has 430 transitions (discarded 4 similar events)
// Phase 1: matrix 430 rows 203 cols
[2023-03-16 04:37:12] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-16 04:37:13] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-16 04:37:13] [INFO ] Flow matrix only has 430 transitions (discarded 4 similar events)
[2023-03-16 04:37:13] [INFO ] Invariant cache hit.
[2023-03-16 04:37:13] [INFO ] State equation strengthened by 115 read => feed constraints.
[2023-03-16 04:37:13] [INFO ] Implicit Places using invariants and state equation in 587 ms returned [41, 79]
Discarding 2 places :
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT with State Equation took 803 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 201/396 places, 430/570 transitions.
Applied a total of 0 rules in 7 ms. Remains 201 /201 variables (removed 0) and now considering 430/430 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 2754 ms. Remains : 201/396 places, 430/570 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 588579 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :{}
Probabilistic random walk after 588579 steps, saw 138316 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 04:37:16] [INFO ] Flow matrix only has 426 transitions (discarded 4 similar events)
// Phase 1: matrix 426 rows 201 cols
[2023-03-16 04:37:16] [INFO ] Computed 32 place invariants in 4 ms
[2023-03-16 04:37:16] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 04:37:16] [INFO ] [Nat]Absence check using 32 positive place invariants in 10 ms returned sat
[2023-03-16 04:37:16] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 04:37:16] [INFO ] State equation strengthened by 97 read => feed constraints.
[2023-03-16 04:37:17] [INFO ] After 59ms SMT Verify possible using 97 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 04:37:17] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-16 04:37:17] [INFO ] After 342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 22 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 430/430 transitions.
Applied a total of 0 rules in 7 ms. Remains 201 /201 variables (removed 0) and now considering 430/430 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 201/201 places, 430/430 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 430/430 transitions.
Applied a total of 0 rules in 6 ms. Remains 201 /201 variables (removed 0) and now considering 430/430 (removed 0) transitions.
[2023-03-16 04:37:17] [INFO ] Flow matrix only has 426 transitions (discarded 4 similar events)
[2023-03-16 04:37:17] [INFO ] Invariant cache hit.
[2023-03-16 04:37:17] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-16 04:37:17] [INFO ] Flow matrix only has 426 transitions (discarded 4 similar events)
[2023-03-16 04:37:17] [INFO ] Invariant cache hit.
[2023-03-16 04:37:17] [INFO ] State equation strengthened by 97 read => feed constraints.
[2023-03-16 04:37:17] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2023-03-16 04:37:17] [INFO ] Redundant transitions in 64 ms returned []
[2023-03-16 04:37:17] [INFO ] Flow matrix only has 426 transitions (discarded 4 similar events)
[2023-03-16 04:37:17] [INFO ] Invariant cache hit.
[2023-03-16 04:37:18] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 998 ms. Remains : 201/201 places, 430/430 transitions.
Graph (trivial) has 63 edges and 201 vertex of which 40 / 201 are part of one of the 20 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Graph (complete) has 567 edges and 181 vertex of which 161 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 0 output transitions
Drop transitions removed 44 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 161 transition count 309
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 158 transition count 306
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 76 place count 158 transition count 304
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 158 transition count 302
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 93 place count 158 transition count 302
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 158 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 157 transition count 299
Applied a total of 96 rules in 29 ms. Remains 157 /201 variables (removed 44) and now considering 299/430 (removed 131) transitions.
Running SMT prover for 1 properties.
[2023-03-16 04:37:18] [INFO ] Flow matrix only has 292 transitions (discarded 7 similar events)
// Phase 1: matrix 292 rows 157 cols
[2023-03-16 04:37:18] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-16 04:37:18] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 04:37:18] [INFO ] [Nat]Absence check using 24 positive place invariants in 7 ms returned sat
[2023-03-16 04:37:18] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 04:37:18] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-16 04:37:18] [INFO ] After 36ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 04:37:18] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-16 04:37:18] [INFO ] After 282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-16 04:37:18] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-16 04:37:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 201 places, 430 transitions and 1927 arcs took 6 ms.
[2023-03-16 04:37:18] [INFO ] Flatten gal took : 104 ms
Total runtime 27121 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_3B
(NrP: 201 NrTr: 430 NrArc: 1927)

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

net check time: 0m 0.000sec

init dd package: 0m 3.697sec


before gc: list nodes free: 1889708

after gc: idd nodes used:3383, unused:63996617; list nodes free:276807569

before gc: list nodes free: 1900258

after gc: idd nodes used:4028, unused:63995972; list nodes free:278901900

before gc: list nodes free: 666612

after gc: idd nodes used:7243, unused:63992757; list nodes free:280984766
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6327112 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098948 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.002sec

1467 1496 1423 1431 1477 1438 1490 1547 1598 1555 1529 1537 1631 1632 1613 1680 1635 1681 1696 1737 1587 1621 1613 1657 1663 1708 2789 2818 2844 2985 2746 2753 2950 2756 2946 2881 3011 2962 2848 2920 2893 2928 2958 3090 2791 2867 3064 2840 3046 2984 3091 2869 2920 3000 2525 2484 2634 2602 2420 2580 2615 2540 2522 2474 2653 2563 2460 2614 2724 2958 2896 2948 2825 2948 2940 2857 2756 2960 2994 2832 2933 3056 2752 2894 2923 3003 2861 2994 2976 2880 2760 2956 3041 2892 2945 3070 2080 2906 2931 3001 2853 3013 2960 3078 2657 3029 3106 2877 3016 3145 3003 2972 3043 3087 2939 3101 3054 3156 2838 2911 3125 2916 3037 3156 3032 2979 3194 3237 3328 3121 3189 3337 3350 3023 3194 3321 2991 3269 3308 3239 3572 3649 3596 3558 3629 3624 3743 3505 3588 3706 3415 3622 3661 3703 3522 3626 3675 3542 3521 3633 3674 3193 3600 3638 3500 3649 3499 3715 3379 3422 3517 3413 3301 3499 3786 3138 3351 3418 3254 3292 3258 3373 3208 3256 3394 3384 3334 3533 3561 3361 3525 3542 3492 3537 3424 3459 3510 3583 3509 3617 3501 3440 3604 3456 3541 3632 3481 3505 3582 3582 3310 3477 3297 3493 3382 3358 3392 3236 3206 3395 3330 3272 3293 3318 3047 3579 3555 3557 3687 3601 3713 3742 3782 3764 3755 3620 3825 3747 3820 3673 3810 3744 3771 3768 3736 3883 3708 3663 3867 3627 3796 3771 3736 3944 3934 3970 4007 3891 3954 4048 3854 3880 3789 4072 3901 3938 3951 3856 3721 3869 3956 3706 3862 3872 3591 3636 3531 3558 3621 3508 3691 4402 6711 6649 6993 7013 6992 7203 7019 7063 7119 7327 6982 7034 7194 6999 7049 7259 6914 6989 7199 6673 6755 6808 6964 6602 6724 6845 6606 6896 6884 7045 7101 7241 7354 7115 7151 7151 7060 7105 7220 7093 7118 7162 7057 7226 7081 7293 6806 6858 7018 6759 6867 7016 5684 5808 4927 3512 6468 6742 6911 6907 7159 7322 6951 6975 7223 7257 6681 7061 6961 6363 6642 6729 6351 6555 6551 6583 7072 7186 7362 6862 7064 7289 6648 6978 7005 7180 6701 6990 6880 6544 6633 6642 6198 6516 6679 6538

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-3B"
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-3B, 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-167863540700270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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