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.r263-smll-167863538100319.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 lolaxred
Input is NoC3x3-PT-6B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538100319
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1004K
-rw-r--r-- 1 mcc users 7.9K Feb 26 09:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 09:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 09:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 09:47 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.7K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 09:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 09:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 09:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 09:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 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 552K 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-6B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-6B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678766104735

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=lolaxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-6B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 03:55:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 03:55:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 03:55:08] [INFO ] Load time of PNML (sax parser for PT used): 312 ms
[2023-03-14 03:55:08] [INFO ] Transformed 1544 places.
[2023-03-14 03:55:08] [INFO ] Transformed 2229 transitions.
[2023-03-14 03:55:08] [INFO ] Found NUPN structural information;
[2023-03-14 03:55:08] [INFO ] Parsed PT model containing 1544 places and 2229 transitions and 6663 arcs in 467 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 21 resets, run finished after 647 ms. (steps per millisecond=15 ) properties (out of 16) seen :9
FORMULA NoC3x3-PT-6B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :1
FORMULA NoC3x3-PT-6B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2229 rows 1544 cols
[2023-03-14 03:55:10] [INFO ] Computed 66 place invariants in 52 ms
[2023-03-14 03:55:11] [INFO ] After 1203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-14 03:55:12] [INFO ] [Nat]Absence check using 66 positive place invariants in 63 ms returned sat
[2023-03-14 03:55:36] [INFO ] After 23983ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-14 03:55:36] [INFO ] After 23996ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-14 03:55:36] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA NoC3x3-PT-6B-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 108 out of 1544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1544/1544 places, 2229/2229 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1544 transition count 2028
Reduce places removed 201 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 211 rules applied. Total rules applied 412 place count 1343 transition count 2018
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 422 place count 1333 transition count 2018
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 422 place count 1333 transition count 1960
Deduced a syphon composed of 58 places in 6 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 538 place count 1275 transition count 1960
Discarding 270 places :
Symmetric choice reduction at 3 with 270 rule applications. Total rules 808 place count 1005 transition count 1690
Iterating global reduction 3 with 270 rules applied. Total rules applied 1078 place count 1005 transition count 1690
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 1078 place count 1005 transition count 1668
Deduced a syphon composed of 22 places in 21 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 1122 place count 983 transition count 1668
Discarding 87 places :
Symmetric choice reduction at 3 with 87 rule applications. Total rules 1209 place count 896 transition count 1430
Iterating global reduction 3 with 87 rules applied. Total rules applied 1296 place count 896 transition count 1430
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 1343 place count 849 transition count 1330
Iterating global reduction 3 with 47 rules applied. Total rules applied 1390 place count 849 transition count 1330
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1406 place count 833 transition count 1298
Iterating global reduction 3 with 16 rules applied. Total rules applied 1422 place count 833 transition count 1298
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1431 place count 824 transition count 1275
Iterating global reduction 3 with 9 rules applied. Total rules applied 1440 place count 824 transition count 1275
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 2 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 1684 place count 702 transition count 1153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1685 place count 701 transition count 1148
Iterating global reduction 3 with 1 rules applied. Total rules applied 1686 place count 701 transition count 1148
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 1888 place count 600 transition count 1188
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 1934 place count 577 transition count 1222
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 1952 place count 577 transition count 1204
Free-agglomeration rule applied 15 times.
Iterating global reduction 3 with 15 rules applied. Total rules applied 1967 place count 577 transition count 1189
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 1984 place count 562 transition count 1187
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1988 place count 562 transition count 1183
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1989 place count 562 transition count 1182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1990 place count 561 transition count 1182
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1991 place count 561 transition count 1184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1992 place count 560 transition count 1184
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1996 place count 560 transition count 1184
Applied a total of 1996 rules in 1132 ms. Remains 560 /1544 variables (removed 984) and now considering 1184/2229 (removed 1045) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1133 ms. Remains : 560/1544 places, 1184/2229 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 5) seen :1
FORMULA NoC3x3-PT-6B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :1
FORMULA NoC3x3-PT-6B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-14 03:55:38] [INFO ] Flow matrix only has 1176 transitions (discarded 8 similar events)
// Phase 1: matrix 1176 rows 560 cols
[2023-03-14 03:55:38] [INFO ] Computed 66 place invariants in 12 ms
[2023-03-14 03:55:38] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 03:55:38] [INFO ] [Nat]Absence check using 66 positive place invariants in 36 ms returned sat
[2023-03-14 03:55:40] [INFO ] After 1169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 03:55:40] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-14 03:55:40] [INFO ] After 600ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-14 03:55:41] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 5 ms to minimize.
[2023-03-14 03:55:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-03-14 03:55:41] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2023-03-14 03:55:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-03-14 03:55:42] [INFO ] After 1948ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 322 ms.
[2023-03-14 03:55:42] [INFO ] After 3644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 79 ms.
Support contains 39 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 1184/1184 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 0 with 2 rules applied. Total rules applied 2 place count 560 transition count 1182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 558 transition count 1182
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 4 place count 558 transition count 1169
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 30 place count 545 transition count 1169
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 41 place count 534 transition count 1136
Iterating global reduction 2 with 11 rules applied. Total rules applied 52 place count 534 transition count 1136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 52 place count 534 transition count 1135
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 533 transition count 1135
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 106 place count 507 transition count 1109
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 110 place count 503 transition count 1096
Iterating global reduction 2 with 4 rules applied. Total rules applied 114 place count 503 transition count 1096
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 502 transition count 1092
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 502 transition count 1092
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 146 place count 487 transition count 1100
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 149 place count 484 transition count 1088
Iterating global reduction 2 with 3 rules applied. Total rules applied 152 place count 484 transition count 1088
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 154 place count 482 transition count 1080
Iterating global reduction 2 with 2 rules applied. Total rules applied 156 place count 482 transition count 1080
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 160 place count 482 transition count 1076
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 168 place count 482 transition count 1068
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 171 place count 479 transition count 1044
Iterating global reduction 3 with 3 rules applied. Total rules applied 174 place count 479 transition count 1044
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 177 place count 479 transition count 1041
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 180 place count 476 transition count 1041
Applied a total of 180 rules in 256 ms. Remains 476 /560 variables (removed 84) and now considering 1041/1184 (removed 143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 257 ms. Remains : 476/560 places, 1041/1184 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :1
FORMULA NoC3x3-PT-6B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 03:55:43] [INFO ] Flow matrix only has 1035 transitions (discarded 6 similar events)
// Phase 1: matrix 1035 rows 476 cols
[2023-03-14 03:55:43] [INFO ] Computed 66 place invariants in 11 ms
[2023-03-14 03:55:43] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 03:55:43] [INFO ] [Nat]Absence check using 66 positive place invariants in 22 ms returned sat
[2023-03-14 03:55:44] [INFO ] After 645ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 03:55:44] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-14 03:55:44] [INFO ] After 486ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 03:55:45] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2023-03-14 03:55:45] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2023-03-14 03:55:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 217 ms
[2023-03-14 03:55:45] [INFO ] After 1383ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 408 ms.
[2023-03-14 03:55:45] [INFO ] After 2595ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 37 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 1041/1041 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 476 transition count 1039
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 474 transition count 1039
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 474 transition count 1038
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 473 transition count 1033
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 473 transition count 1033
Applied a total of 7 rules in 58 ms. Remains 473 /476 variables (removed 3) and now considering 1033/1041 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 473/476 places, 1033/1041 transitions.
Incomplete random walk after 10000 steps, including 59 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) seen :1
FORMULA NoC3x3-PT-6B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 03:55:46] [INFO ] Flow matrix only has 1027 transitions (discarded 6 similar events)
// Phase 1: matrix 1027 rows 473 cols
[2023-03-14 03:55:46] [INFO ] Computed 66 place invariants in 11 ms
[2023-03-14 03:55:46] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 03:55:46] [INFO ] [Nat]Absence check using 66 positive place invariants in 25 ms returned sat
[2023-03-14 03:55:47] [INFO ] After 794ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 03:55:47] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-14 03:55:47] [INFO ] After 467ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 03:55:47] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2023-03-14 03:55:47] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2023-03-14 03:55:48] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2023-03-14 03:55:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 352 ms
[2023-03-14 03:55:48] [INFO ] After 1064ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 811 ms.
[2023-03-14 03:55:48] [INFO ] After 2801ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 35 out of 473 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 473/473 places, 1033/1033 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 473 transition count 1032
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 472 transition count 1032
Applied a total of 2 rules in 32 ms. Remains 472 /473 variables (removed 1) and now considering 1032/1033 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 472/473 places, 1032/1033 transitions.
Incomplete random walk after 10000 steps, including 55 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 242401 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 242401 steps, saw 77020 distinct states, run finished after 3002 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 03:55:52] [INFO ] Flow matrix only has 1026 transitions (discarded 6 similar events)
// Phase 1: matrix 1026 rows 472 cols
[2023-03-14 03:55:52] [INFO ] Computed 66 place invariants in 8 ms
[2023-03-14 03:55:52] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 03:55:52] [INFO ] [Nat]Absence check using 66 positive place invariants in 19 ms returned sat
[2023-03-14 03:55:52] [INFO ] After 446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 03:55:52] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-14 03:55:52] [INFO ] After 142ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 03:55:53] [INFO ] After 380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 183 ms.
[2023-03-14 03:55:53] [INFO ] After 1127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 35 out of 472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 1032/1032 transitions.
Applied a total of 0 rules in 13 ms. Remains 472 /472 variables (removed 0) and now considering 1032/1032 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 472/472 places, 1032/1032 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 1032/1032 transitions.
Applied a total of 0 rules in 14 ms. Remains 472 /472 variables (removed 0) and now considering 1032/1032 (removed 0) transitions.
[2023-03-14 03:55:53] [INFO ] Flow matrix only has 1026 transitions (discarded 6 similar events)
[2023-03-14 03:55:53] [INFO ] Invariant cache hit.
[2023-03-14 03:55:53] [INFO ] Implicit Places using invariants in 445 ms returned [18, 58, 105, 151, 309, 359, 398, 451]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 454 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 464/472 places, 1032/1032 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 446 transition count 1014
Applied a total of 36 rules in 36 ms. Remains 446 /464 variables (removed 18) and now considering 1014/1032 (removed 18) transitions.
[2023-03-14 03:55:53] [INFO ] Flow matrix only has 1008 transitions (discarded 6 similar events)
// Phase 1: matrix 1008 rows 446 cols
[2023-03-14 03:55:53] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-14 03:55:54] [INFO ] Implicit Places using invariants in 351 ms returned []
[2023-03-14 03:55:54] [INFO ] Flow matrix only has 1008 transitions (discarded 6 similar events)
[2023-03-14 03:55:54] [INFO ] Invariant cache hit.
[2023-03-14 03:55:54] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-14 03:55:55] [INFO ] Implicit Places using invariants and state equation in 921 ms returned []
Implicit Place search using SMT with State Equation took 1277 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 446/472 places, 1014/1032 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1783 ms. Remains : 446/472 places, 1014/1032 transitions.
Incomplete random walk after 10000 steps, including 62 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 259684 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 259684 steps, saw 119902 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 03:55:58] [INFO ] Flow matrix only has 1008 transitions (discarded 6 similar events)
[2023-03-14 03:55:58] [INFO ] Invariant cache hit.
[2023-03-14 03:55:58] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 03:55:58] [INFO ] [Nat]Absence check using 58 positive place invariants in 19 ms returned sat
[2023-03-14 03:55:59] [INFO ] After 834ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 03:55:59] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-14 03:56:00] [INFO ] After 832ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 03:56:00] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2023-03-14 03:56:00] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2023-03-14 03:56:00] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2023-03-14 03:56:00] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2023-03-14 03:56:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 384 ms
[2023-03-14 03:56:00] [INFO ] After 1390ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 240 ms.
[2023-03-14 03:56:00] [INFO ] After 2579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 35 out of 446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 1014/1014 transitions.
Applied a total of 0 rules in 14 ms. Remains 446 /446 variables (removed 0) and now considering 1014/1014 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 446/446 places, 1014/1014 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 1014/1014 transitions.
Applied a total of 0 rules in 14 ms. Remains 446 /446 variables (removed 0) and now considering 1014/1014 (removed 0) transitions.
[2023-03-14 03:56:00] [INFO ] Flow matrix only has 1008 transitions (discarded 6 similar events)
[2023-03-14 03:56:00] [INFO ] Invariant cache hit.
[2023-03-14 03:56:01] [INFO ] Implicit Places using invariants in 414 ms returned []
[2023-03-14 03:56:01] [INFO ] Flow matrix only has 1008 transitions (discarded 6 similar events)
[2023-03-14 03:56:01] [INFO ] Invariant cache hit.
[2023-03-14 03:56:01] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-14 03:56:02] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned []
Implicit Place search using SMT with State Equation took 1457 ms to find 0 implicit places.
[2023-03-14 03:56:02] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-14 03:56:02] [INFO ] Flow matrix only has 1008 transitions (discarded 6 similar events)
[2023-03-14 03:56:02] [INFO ] Invariant cache hit.
[2023-03-14 03:56:03] [INFO ] Dead Transitions using invariants and state equation in 697 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2256 ms. Remains : 446/446 places, 1014/1014 transitions.
Graph (complete) has 1938 edges and 446 vertex of which 445 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 445 transition count 1008
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 15 place count 441 transition count 1004
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 31 place count 441 transition count 988
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 40 place count 441 transition count 988
Applied a total of 40 rules in 44 ms. Remains 441 /446 variables (removed 5) and now considering 988/1014 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 988 rows 441 cols
[2023-03-14 03:56:03] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-14 03:56:03] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 03:56:03] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2023-03-14 03:56:04] [INFO ] After 586ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 03:56:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-14 03:56:04] [INFO ] After 163ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 03:56:04] [INFO ] After 335ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-14 03:56:04] [INFO ] After 1137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-14 03:56:04] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-14 03:56:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 446 places, 1014 transitions and 4238 arcs took 7 ms.
[2023-03-14 03:56:05] [INFO ] Flatten gal took : 286 ms
Total runtime 56829 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT NoC3x3-PT-6B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
ReachabilityFireability

FORMULA NoC3x3-PT-6B-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678766166879

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/ReachabilityFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 8 (type EXCL) for 0 NoC3x3-PT-6B-ReachabilityFireability-07
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 4 (type FNDP) for 0 NoC3x3-PT-6B-ReachabilityFireability-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 5 (type EQUN) for 0 NoC3x3-PT-6B-ReachabilityFireability-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type SRCH) for 0 NoC3x3-PT-6B-ReachabilityFireability-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 7 (type SRCH) for NoC3x3-PT-6B-ReachabilityFireability-07
lola: result : true
lola: markings : 38
lola: fired transitions : 37
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 4 (type FNDP) for NoC3x3-PT-6B-ReachabilityFireability-07 (obsolete)
lola: CANCELED task # 5 (type EQUN) for NoC3x3-PT-6B-ReachabilityFireability-07 (obsolete)
lola: CANCELED task # 8 (type EXCL) for NoC3x3-PT-6B-ReachabilityFireability-07 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
NoC3x3-PT-6B-ReachabilityFireability-07: AG false tandem / insertion


Time elapsed: 0 secs. Pages in use: 2

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-6B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is NoC3x3-PT-6B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-smll-167863538100319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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