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.r523-tall-167987247800271.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 smartxred
Input is EisenbergMcGuire-PT-09, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r523-tall-167987247800271
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 6.3K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 16K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 2.3M Mar 31 16:48 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 EisenbergMcGuire-PT-09-ReachabilityFireability-00
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-01
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-02
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-03
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-04
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-05
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-06
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-07
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-08
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-09
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-10
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-11
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-12
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-13
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-14
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1680815275364

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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-09
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-06 21:07:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-04-06 21:07:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 21:07:57] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2023-04-06 21:07:57] [INFO ] Transformed 891 places.
[2023-04-06 21:07:57] [INFO ] Transformed 3888 transitions.
[2023-04-06 21:07:57] [INFO ] Found NUPN structural information;
[2023-04-06 21:07:57] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 292 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 534 ms. (steps per millisecond=18 ) properties (out of 16) seen :2
FORMULA EisenbergMcGuire-PT-09-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) 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 14) seen :0
Running SMT prover for 14 properties.
[2023-04-06 21:07:58] [INFO ] Flow matrix only has 1809 transitions (discarded 2079 similar events)
// Phase 1: matrix 1809 rows 891 cols
[2023-04-06 21:07:58] [INFO ] Computed 28 invariants in 26 ms
[2023-04-06 21:07:59] [INFO ] After 645ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-04-06 21:08:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 34 ms returned sat
[2023-04-06 21:08:00] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2023-04-06 21:08:02] [INFO ] After 1798ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :11
[2023-04-06 21:08:02] [INFO ] State equation strengthened by 932 read => feed constraints.
[2023-04-06 21:08:04] [INFO ] After 2003ms SMT Verify possible using 932 Read/Feed constraints in natural domain returned unsat :3 sat :11
[2023-04-06 21:08:04] [INFO ] Deduced a trap composed of 3 places in 314 ms of which 9 ms to minimize.
[2023-04-06 21:08:04] [INFO ] Deduced a trap composed of 3 places in 228 ms of which 1 ms to minimize.
[2023-04-06 21:08:05] [INFO ] Deduced a trap composed of 3 places in 389 ms of which 3 ms to minimize.
[2023-04-06 21:08:05] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 1 ms to minimize.
[2023-04-06 21:08:05] [INFO ] Deduced a trap composed of 3 places in 203 ms of which 1 ms to minimize.
[2023-04-06 21:08:06] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 0 ms to minimize.
[2023-04-06 21:08:06] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 1 ms to minimize.
[2023-04-06 21:08:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2088 ms
[2023-04-06 21:08:06] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 3 ms to minimize.
[2023-04-06 21:08:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2023-04-06 21:08:07] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 1 ms to minimize.
[2023-04-06 21:08:07] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
[2023-04-06 21:08:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 441 ms
[2023-04-06 21:08:07] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 0 ms to minimize.
[2023-04-06 21:08:08] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 0 ms to minimize.
[2023-04-06 21:08:08] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 1 ms to minimize.
[2023-04-06 21:08:08] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 0 ms to minimize.
[2023-04-06 21:08:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 907 ms
[2023-04-06 21:08:08] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2023-04-06 21:08:09] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 0 ms to minimize.
[2023-04-06 21:08:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 365 ms
[2023-04-06 21:08:09] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 0 ms to minimize.
[2023-04-06 21:08:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-04-06 21:08:10] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 0 ms to minimize.
[2023-04-06 21:08:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
[2023-04-06 21:08:10] [INFO ] After 8551ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :11
Attempting to minimize the solution found.
Minimization took 1571 ms.
[2023-04-06 21:08:12] [INFO ] After 12538ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :11
FORMULA EisenbergMcGuire-PT-09-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-09-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-09-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 294 ms.
Support contains 157 out of 891 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 891/891 places, 3888/3888 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 891 transition count 3886
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 889 transition count 3886
Performed 214 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 214 Pre rules applied. Total rules applied 4 place count 889 transition count 3672
Deduced a syphon composed of 214 places in 4 ms
Reduce places removed 214 places and 0 transitions.
Iterating global reduction 2 with 428 rules applied. Total rules applied 432 place count 675 transition count 3672
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 481 place count 626 transition count 3231
Iterating global reduction 2 with 49 rules applied. Total rules applied 530 place count 626 transition count 3231
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 4 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 660 place count 561 transition count 3166
Applied a total of 660 rules in 404 ms. Remains 561 /891 variables (removed 330) and now considering 3166/3888 (removed 722) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 405 ms. Remains : 561/891 places, 3166/3888 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 164100 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{6=1, 8=1}
Probabilistic random walk after 164100 steps, saw 119673 distinct states, run finished after 3002 ms. (steps per millisecond=54 ) properties seen :2
FORMULA EisenbergMcGuire-PT-09-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 9 properties.
[2023-04-06 21:08:16] [INFO ] Flow matrix only has 1087 transitions (discarded 2079 similar events)
// Phase 1: matrix 1087 rows 561 cols
[2023-04-06 21:08:16] [INFO ] Computed 28 invariants in 5 ms
[2023-04-06 21:08:16] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-06 21:08:17] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-04-06 21:08:17] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-06 21:08:18] [INFO ] After 970ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-06 21:08:18] [INFO ] State equation strengthened by 540 read => feed constraints.
[2023-04-06 21:08:19] [INFO ] After 1035ms SMT Verify possible using 540 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-06 21:08:19] [INFO ] Deduced a trap composed of 7 places in 279 ms of which 1 ms to minimize.
[2023-04-06 21:08:20] [INFO ] Deduced a trap composed of 11 places in 358 ms of which 1 ms to minimize.
[2023-04-06 21:08:20] [INFO ] Deduced a trap composed of 3 places in 315 ms of which 1 ms to minimize.
[2023-04-06 21:08:20] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 1 ms to minimize.
[2023-04-06 21:08:20] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 0 ms to minimize.
[2023-04-06 21:08:20] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 1 ms to minimize.
[2023-04-06 21:08:21] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 0 ms to minimize.
[2023-04-06 21:08:21] [INFO ] Deduced a trap composed of 58 places in 153 ms of which 1 ms to minimize.
[2023-04-06 21:08:21] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 0 ms to minimize.
[2023-04-06 21:08:21] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 0 ms to minimize.
[2023-04-06 21:08:21] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 0 ms to minimize.
[2023-04-06 21:08:21] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2023-04-06 21:08:21] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2680 ms
[2023-04-06 21:08:22] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 0 ms to minimize.
[2023-04-06 21:08:22] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 0 ms to minimize.
[2023-04-06 21:08:22] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 1 ms to minimize.
[2023-04-06 21:08:22] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 4 ms to minimize.
[2023-04-06 21:08:23] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 0 ms to minimize.
[2023-04-06 21:08:23] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 0 ms to minimize.
[2023-04-06 21:08:23] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 0 ms to minimize.
[2023-04-06 21:08:23] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 1 ms to minimize.
[2023-04-06 21:08:24] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 1 ms to minimize.
[2023-04-06 21:08:24] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 0 ms to minimize.
[2023-04-06 21:08:24] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 1 ms to minimize.
[2023-04-06 21:08:24] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2023-04-06 21:08:24] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 0 ms to minimize.
[2023-04-06 21:08:24] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2630 ms
[2023-04-06 21:08:24] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 0 ms to minimize.
[2023-04-06 21:08:25] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 0 ms to minimize.
[2023-04-06 21:08:25] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 1 ms to minimize.
[2023-04-06 21:08:25] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 0 ms to minimize.
[2023-04-06 21:08:25] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 1 ms to minimize.
[2023-04-06 21:08:25] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2023-04-06 21:08:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1092 ms
[2023-04-06 21:08:26] [INFO ] Deduced a trap composed of 3 places in 239 ms of which 1 ms to minimize.
[2023-04-06 21:08:26] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 0 ms to minimize.
[2023-04-06 21:08:26] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 1 ms to minimize.
[2023-04-06 21:08:26] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 0 ms to minimize.
[2023-04-06 21:08:27] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2023-04-06 21:08:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1020 ms
[2023-04-06 21:08:27] [INFO ] Deduced a trap composed of 64 places in 333 ms of which 3 ms to minimize.
[2023-04-06 21:08:28] [INFO ] Deduced a trap composed of 30 places in 345 ms of which 0 ms to minimize.
[2023-04-06 21:08:28] [INFO ] Deduced a trap composed of 118 places in 361 ms of which 0 ms to minimize.
[2023-04-06 21:08:28] [INFO ] Deduced a trap composed of 31 places in 286 ms of which 0 ms to minimize.
[2023-04-06 21:08:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1554 ms
[2023-04-06 21:08:29] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 2 ms to minimize.
[2023-04-06 21:08:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2023-04-06 21:08:29] [INFO ] After 11629ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 880 ms.
[2023-04-06 21:08:30] [INFO ] After 13744ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 87 ms.
Support contains 132 out of 561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 561/561 places, 3166/3166 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 561 transition count 3156
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 551 transition count 3156
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 545 transition count 3102
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 545 transition count 3102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 543 transition count 3100
Applied a total of 36 rules in 212 ms. Remains 543 /561 variables (removed 18) and now considering 3100/3166 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212 ms. Remains : 543/561 places, 3100/3166 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 145960 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 145960 steps, saw 105782 distinct states, run finished after 3002 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 9 properties.
[2023-04-06 21:08:34] [INFO ] Flow matrix only has 1021 transitions (discarded 2079 similar events)
// Phase 1: matrix 1021 rows 543 cols
[2023-04-06 21:08:34] [INFO ] Computed 28 invariants in 6 ms
[2023-04-06 21:08:34] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-06 21:08:34] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-04-06 21:08:34] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-06 21:08:36] [INFO ] After 995ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-06 21:08:36] [INFO ] State equation strengthened by 492 read => feed constraints.
[2023-04-06 21:08:37] [INFO ] After 1052ms SMT Verify possible using 492 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-06 21:08:37] [INFO ] Deduced a trap composed of 3 places in 246 ms of which 1 ms to minimize.
[2023-04-06 21:08:37] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 1 ms to minimize.
[2023-04-06 21:08:37] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 1 ms to minimize.
[2023-04-06 21:08:38] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 1 ms to minimize.
[2023-04-06 21:08:38] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 0 ms to minimize.
[2023-04-06 21:08:38] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2023-04-06 21:08:38] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
[2023-04-06 21:08:38] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 0 ms to minimize.
[2023-04-06 21:08:38] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2023-04-06 21:08:38] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1625 ms
[2023-04-06 21:08:38] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 1 ms to minimize.
[2023-04-06 21:08:39] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 0 ms to minimize.
[2023-04-06 21:08:39] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 0 ms to minimize.
[2023-04-06 21:08:39] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 0 ms to minimize.
[2023-04-06 21:08:39] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2023-04-06 21:08:39] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 0 ms to minimize.
[2023-04-06 21:08:39] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 0 ms to minimize.
[2023-04-06 21:08:39] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 0 ms to minimize.
[2023-04-06 21:08:39] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1156 ms
[2023-04-06 21:08:40] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 1 ms to minimize.
[2023-04-06 21:08:40] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 1 ms to minimize.
[2023-04-06 21:08:40] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 0 ms to minimize.
[2023-04-06 21:08:40] [INFO ] Deduced a trap composed of 56 places in 143 ms of which 0 ms to minimize.
[2023-04-06 21:08:41] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 0 ms to minimize.
[2023-04-06 21:08:41] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 0 ms to minimize.
[2023-04-06 21:08:41] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2023-04-06 21:08:41] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2023-04-06 21:08:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1410 ms
[2023-04-06 21:08:41] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 1 ms to minimize.
[2023-04-06 21:08:41] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 0 ms to minimize.
[2023-04-06 21:08:42] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2023-04-06 21:08:42] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2023-04-06 21:08:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 594 ms
[2023-04-06 21:08:42] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2023-04-06 21:08:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-04-06 21:08:42] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 0 ms to minimize.
[2023-04-06 21:08:43] [INFO ] Deduced a trap composed of 88 places in 329 ms of which 1 ms to minimize.
[2023-04-06 21:08:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 531 ms
[2023-04-06 21:08:43] [INFO ] After 7664ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 949 ms.
[2023-04-06 21:08:44] [INFO ] After 9883ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 39 ms.
Support contains 132 out of 543 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 543/543 places, 3100/3100 transitions.
Applied a total of 0 rules in 124 ms. Remains 543 /543 variables (removed 0) and now considering 3100/3100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 543/543 places, 3100/3100 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 543/543 places, 3100/3100 transitions.
Applied a total of 0 rules in 106 ms. Remains 543 /543 variables (removed 0) and now considering 3100/3100 (removed 0) transitions.
[2023-04-06 21:08:44] [INFO ] Flow matrix only has 1021 transitions (discarded 2079 similar events)
[2023-04-06 21:08:44] [INFO ] Invariant cache hit.
[2023-04-06 21:08:45] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-04-06 21:08:45] [INFO ] Flow matrix only has 1021 transitions (discarded 2079 similar events)
[2023-04-06 21:08:45] [INFO ] Invariant cache hit.
[2023-04-06 21:08:45] [INFO ] State equation strengthened by 492 read => feed constraints.
[2023-04-06 21:08:47] [INFO ] Implicit Places using invariants and state equation in 1826 ms returned []
Implicit Place search using SMT with State Equation took 2096 ms to find 0 implicit places.
[2023-04-06 21:08:47] [INFO ] Redundant transitions in 187 ms returned []
[2023-04-06 21:08:47] [INFO ] Flow matrix only has 1021 transitions (discarded 2079 similar events)
[2023-04-06 21:08:47] [INFO ] Invariant cache hit.
[2023-04-06 21:08:48] [INFO ] Dead Transitions using invariants and state equation in 1233 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3636 ms. Remains : 543/543 places, 3100/3100 transitions.
Graph (trivial) has 1361 edges and 543 vertex of which 70 / 543 are part of one of the 9 SCC in 4 ms
Free SCC test removed 61 places
Drop transitions removed 212 transitions
Ensure Unique test removed 2140 transitions
Reduce isomorphic transitions removed 2352 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 482 transition count 699
Reduce places removed 49 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 54 rules applied. Total rules applied 104 place count 433 transition count 694
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 109 place count 428 transition count 694
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 109 place count 428 transition count 684
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 129 place count 418 transition count 684
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 137 place count 410 transition count 676
Iterating global reduction 3 with 8 rules applied. Total rules applied 145 place count 410 transition count 676
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 317 place count 324 transition count 590
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 334 place count 324 transition count 573
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
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 340 place count 321 transition count 596
Drop transitions removed 59 transitions
Redundant transition composition rules discarded 59 transitions
Iterating global reduction 4 with 59 rules applied. Total rules applied 399 place count 321 transition count 537
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 401 place count 320 transition count 536
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 402 place count 320 transition count 535
Free-agglomeration rule applied 96 times.
Iterating global reduction 4 with 96 rules applied. Total rules applied 498 place count 320 transition count 439
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 4 with 96 rules applied. Total rules applied 594 place count 224 transition count 439
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 596 place count 224 transition count 437
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 603 place count 224 transition count 437
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 604 place count 224 transition count 436
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 605 place count 224 transition count 436
Applied a total of 605 rules in 109 ms. Remains 224 /543 variables (removed 319) and now considering 436/3100 (removed 2664) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 436 rows 224 cols
[2023-04-06 21:08:48] [INFO ] Computed 28 invariants in 1 ms
[2023-04-06 21:08:48] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-06 21:08:48] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-04-06 21:08:48] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 2 ms returned sat
[2023-04-06 21:08:49] [INFO ] After 545ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-06 21:08:49] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-04-06 21:08:49] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2023-04-06 21:08:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-04-06 21:08:49] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2023-04-06 21:08:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 209 ms
[2023-04-06 21:08:49] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-04-06 21:08:49] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2023-04-06 21:08:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 111 ms
[2023-04-06 21:08:49] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2023-04-06 21:08:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-04-06 21:08:50] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-04-06 21:08:50] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-04-06 21:08:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2023-04-06 21:08:50] [INFO ] After 1527ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 445 ms.
[2023-04-06 21:08:50] [INFO ] After 2090ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2023-04-06 21:08:50] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-04-06 21:08:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 543 places, 3100 transitions and 16226 arcs took 18 ms.
[2023-04-06 21:08:51] [INFO ] Flatten gal took : 232 ms
Total runtime 54002 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running EisenbergMcGuire (PT), instance 09
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 543 places, 3100 transitions, 16226 arcs.
Final Score: 120624.864
Took : 44 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1680815377642

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 19894:
syntax error

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="EisenbergMcGuire-PT-09"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is EisenbergMcGuire-PT-09, 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 r523-tall-167987247800271"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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