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.r010-oct2-167813599100463.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is AutoFlight-PT-06b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599100463
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.2K Feb 25 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 18:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 18:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 18:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 18:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 134K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678691279850

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-06b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 07:08:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 07:08:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 07:08:02] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2023-03-13 07:08:02] [INFO ] Transformed 574 places.
[2023-03-13 07:08:02] [INFO ] Transformed 572 transitions.
[2023-03-13 07:08:02] [INFO ] Found NUPN structural information;
[2023-03-13 07:08:02] [INFO ] Parsed PT model containing 574 places and 572 transitions and 1334 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 34 resets, run finished after 458 ms. (steps per millisecond=21 ) properties (out of 16) seen :10
FORMULA AutoFlight-PT-06b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 572 rows 574 cols
[2023-03-13 07:08:03] [INFO ] Computed 40 place invariants in 13 ms
[2023-03-13 07:08:04] [INFO ] After 488ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 07:08:04] [INFO ] [Nat]Absence check using 39 positive place invariants in 53 ms returned sat
[2023-03-13 07:08:04] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 11 ms returned sat
[2023-03-13 07:08:05] [INFO ] After 733ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-13 07:08:05] [INFO ] Deduced a trap composed of 44 places in 208 ms of which 9 ms to minimize.
[2023-03-13 07:08:05] [INFO ] Deduced a trap composed of 53 places in 233 ms of which 2 ms to minimize.
[2023-03-13 07:08:05] [INFO ] Deduced a trap composed of 45 places in 178 ms of which 2 ms to minimize.
[2023-03-13 07:08:06] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 1 ms to minimize.
[2023-03-13 07:08:06] [INFO ] Deduced a trap composed of 17 places in 359 ms of which 27 ms to minimize.
[2023-03-13 07:08:06] [INFO ] Deduced a trap composed of 50 places in 182 ms of which 1 ms to minimize.
[2023-03-13 07:08:06] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 0 ms to minimize.
[2023-03-13 07:08:07] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 16 ms to minimize.
[2023-03-13 07:08:07] [INFO ] Deduced a trap composed of 46 places in 145 ms of which 1 ms to minimize.
[2023-03-13 07:08:07] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 0 ms to minimize.
[2023-03-13 07:08:07] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 0 ms to minimize.
[2023-03-13 07:08:07] [INFO ] Deduced a trap composed of 72 places in 178 ms of which 14 ms to minimize.
[2023-03-13 07:08:07] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2625 ms
[2023-03-13 07:08:08] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 0 ms to minimize.
[2023-03-13 07:08:08] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 0 ms to minimize.
[2023-03-13 07:08:08] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 0 ms to minimize.
[2023-03-13 07:08:08] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 0 ms to minimize.
[2023-03-13 07:08:08] [INFO ] Deduced a trap composed of 63 places in 180 ms of which 1 ms to minimize.
[2023-03-13 07:08:08] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 0 ms to minimize.
[2023-03-13 07:08:09] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 0 ms to minimize.
[2023-03-13 07:08:09] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 0 ms to minimize.
[2023-03-13 07:08:09] [INFO ] Deduced a trap composed of 66 places in 160 ms of which 1 ms to minimize.
[2023-03-13 07:08:09] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 2 ms to minimize.
[2023-03-13 07:08:09] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 0 ms to minimize.
[2023-03-13 07:08:09] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1884 ms
[2023-03-13 07:08:10] [INFO ] Deduced a trap composed of 84 places in 190 ms of which 1 ms to minimize.
[2023-03-13 07:08:10] [INFO ] Deduced a trap composed of 31 places in 263 ms of which 1 ms to minimize.
[2023-03-13 07:08:10] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 0 ms to minimize.
[2023-03-13 07:08:10] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 1 ms to minimize.
[2023-03-13 07:08:11] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 1 ms to minimize.
[2023-03-13 07:08:11] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 1 ms to minimize.
[2023-03-13 07:08:11] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 0 ms to minimize.
[2023-03-13 07:08:11] [INFO ] Deduced a trap composed of 48 places in 240 ms of which 0 ms to minimize.
[2023-03-13 07:08:11] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1785 ms
[2023-03-13 07:08:12] [INFO ] Deduced a trap composed of 91 places in 196 ms of which 1 ms to minimize.
[2023-03-13 07:08:12] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 0 ms to minimize.
[2023-03-13 07:08:12] [INFO ] Deduced a trap composed of 93 places in 76 ms of which 1 ms to minimize.
[2023-03-13 07:08:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 522 ms
[2023-03-13 07:08:12] [INFO ] After 7998ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 384 ms.
[2023-03-13 07:08:12] [INFO ] After 8716ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
FORMULA AutoFlight-PT-06b-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-06b-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
FORMULA AutoFlight-PT-06b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 78 ms.
Support contains 29 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 572/572 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 574 transition count 375
Reduce places removed 197 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 227 rules applied. Total rules applied 424 place count 377 transition count 345
Reduce places removed 10 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 23 rules applied. Total rules applied 447 place count 367 transition count 332
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 463 place count 354 transition count 329
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 67 Pre rules applied. Total rules applied 463 place count 354 transition count 262
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 597 place count 287 transition count 262
Discarding 46 places :
Symmetric choice reduction at 4 with 46 rule applications. Total rules 643 place count 241 transition count 216
Iterating global reduction 4 with 46 rules applied. Total rules applied 689 place count 241 transition count 216
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 689 place count 241 transition count 204
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 713 place count 229 transition count 204
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 825 place count 173 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 827 place count 172 transition count 148
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 833 place count 172 transition count 142
Free-agglomeration rule applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 846 place count 172 transition count 129
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 859 place count 159 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 860 place count 158 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 862 place count 156 transition count 128
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 862 place count 156 transition count 126
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 866 place count 154 transition count 126
Applied a total of 866 rules in 88 ms. Remains 154 /574 variables (removed 420) and now considering 126/572 (removed 446) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 154/574 places, 126/572 transitions.
Incomplete random walk after 10000 steps, including 235 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :1
FORMULA AutoFlight-PT-06b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 126 rows 154 cols
[2023-03-13 07:08:13] [INFO ] Computed 38 place invariants in 1 ms
[2023-03-13 07:08:13] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 07:08:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-13 07:08:13] [INFO ] [Nat]Absence check using 36 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 07:08:13] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 07:08:13] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-13 07:08:13] [INFO ] After 21ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 07:08:13] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 7 ms to minimize.
[2023-03-13 07:08:13] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 12 ms to minimize.
[2023-03-13 07:08:13] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
[2023-03-13 07:08:13] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 0 ms to minimize.
[2023-03-13 07:08:13] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2023-03-13 07:08:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 456 ms
[2023-03-13 07:08:13] [INFO ] After 496ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-13 07:08:13] [INFO ] After 617ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 126/126 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 154 transition count 123
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 151 transition count 123
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 151 transition count 121
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 149 transition count 121
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 22 place count 143 transition count 115
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 143 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 142 transition count 114
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 142 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 141 transition count 113
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 141 transition count 113
Applied a total of 27 rules in 40 ms. Remains 141 /154 variables (removed 13) and now considering 113/126 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 141/154 places, 113/126 transitions.
Incomplete random walk after 10000 steps, including 276 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1814720 steps, run timeout after 3001 ms. (steps per millisecond=604 ) properties seen :{}
Probabilistic random walk after 1814720 steps, saw 225990 distinct states, run finished after 3005 ms. (steps per millisecond=603 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 113 rows 141 cols
[2023-03-13 07:08:16] [INFO ] Computed 38 place invariants in 3 ms
[2023-03-13 07:08:16] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 07:08:16] [INFO ] [Nat]Absence check using 36 positive place invariants in 26 ms returned sat
[2023-03-13 07:08:16] [INFO ] [Nat]Absence check using 36 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-13 07:08:17] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 07:08:17] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-13 07:08:17] [INFO ] After 44ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 07:08:17] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2023-03-13 07:08:17] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2023-03-13 07:08:17] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2023-03-13 07:08:17] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 0 ms to minimize.
[2023-03-13 07:08:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 284 ms
[2023-03-13 07:08:17] [INFO ] After 381ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-13 07:08:17] [INFO ] After 536ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 113/113 transitions.
Applied a total of 0 rules in 6 ms. Remains 141 /141 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 141/141 places, 113/113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 113/113 transitions.
Applied a total of 0 rules in 4 ms. Remains 141 /141 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2023-03-13 07:08:17] [INFO ] Invariant cache hit.
[2023-03-13 07:08:17] [INFO ] Implicit Places using invariants in 143 ms returned [82, 102, 108, 122, 128, 134, 140]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 145 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 134/141 places, 113/113 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 129 transition count 108
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 129 transition count 108
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 11 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 16 place count 126 transition count 105
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 22 place count 126 transition count 99
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 28 place count 120 transition count 99
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 120 transition count 97
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 118 transition count 97
Applied a total of 32 rules in 22 ms. Remains 118 /134 variables (removed 16) and now considering 97/113 (removed 16) transitions.
// Phase 1: matrix 97 rows 118 cols
[2023-03-13 07:08:17] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-13 07:08:17] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-13 07:08:17] [INFO ] Invariant cache hit.
[2023-03-13 07:08:17] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-13 07:08:17] [INFO ] Implicit Places using invariants and state equation in 259 ms returned [4, 10, 13, 23, 39, 42, 43, 45]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 385 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 110/141 places, 97/113 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 110 transition count 92
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 105 transition count 92
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 10 place count 105 transition count 80
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 34 place count 93 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 92 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 92 transition count 79
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 2 with 2 rules applied. Total rules applied 38 place count 91 transition count 78
Applied a total of 38 rules in 9 ms. Remains 91 /110 variables (removed 19) and now considering 78/97 (removed 19) transitions.
// Phase 1: matrix 78 rows 91 cols
[2023-03-13 07:08:17] [INFO ] Computed 23 place invariants in 1 ms
[2023-03-13 07:08:18] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-13 07:08:18] [INFO ] Invariant cache hit.
[2023-03-13 07:08:18] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-13 07:08:18] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 91/141 places, 78/113 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 934 ms. Remains : 91/141 places, 78/113 transitions.
Incomplete random walk after 10000 steps, including 297 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2973077 steps, run timeout after 3001 ms. (steps per millisecond=990 ) properties seen :{}
Probabilistic random walk after 2973077 steps, saw 455322 distinct states, run finished after 3013 ms. (steps per millisecond=986 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 07:08:21] [INFO ] Invariant cache hit.
[2023-03-13 07:08:21] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 07:08:21] [INFO ] [Nat]Absence check using 23 positive place invariants in 7 ms returned sat
[2023-03-13 07:08:21] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 07:08:21] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-13 07:08:21] [INFO ] After 18ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 07:08:21] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 1 ms to minimize.
[2023-03-13 07:08:21] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2023-03-13 07:08:21] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2023-03-13 07:08:22] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 1 ms to minimize.
[2023-03-13 07:08:22] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2023-03-13 07:08:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 500 ms
[2023-03-13 07:08:22] [INFO ] After 544ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-13 07:08:22] [INFO ] After 677ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 20 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 78/78 transitions.
Applied a total of 0 rules in 2 ms. Remains 91 /91 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 91/91 places, 78/78 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 78/78 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2023-03-13 07:08:22] [INFO ] Invariant cache hit.
[2023-03-13 07:08:22] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-13 07:08:22] [INFO ] Invariant cache hit.
[2023-03-13 07:08:22] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-13 07:08:22] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-13 07:08:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-13 07:08:22] [INFO ] Invariant cache hit.
[2023-03-13 07:08:22] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 288 ms. Remains : 91/91 places, 78/78 transitions.
Graph (trivial) has 14 edges and 91 vertex of which 3 / 91 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 170 edges and 89 vertex of which 79 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 rules applied. Total rules applied 5 place count 79 transition count 72
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 77 transition count 72
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 7 place count 77 transition count 70
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 75 transition count 70
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 16 place count 75 transition count 65
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 21 place count 70 transition count 65
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 70 transition count 63
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 25 place count 68 transition count 63
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 26 place count 68 transition count 63
Applied a total of 26 rules in 13 ms. Remains 68 /91 variables (removed 23) and now considering 63/78 (removed 15) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 63 rows 68 cols
[2023-03-13 07:08:22] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-13 07:08:22] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 07:08:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-13 07:08:22] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 07:08:22] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-13 07:08:22] [INFO ] After 101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-13 07:08:22] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2023-03-13 07:08:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 91 places, 78 transitions and 278 arcs took 1 ms.
[2023-03-13 07:08:22] [INFO ] Flatten gal took : 51 ms
Total runtime 20553 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: AutoFlight_PT_06b
(NrP: 91 NrTr: 78 NrArc: 278)

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

net check time: 0m 0.000sec

init dd package: 0m 2.896sec


RS generation: 0m 0.045sec


-> reachability set: #nodes 2305 (2.3e+03) #states 168,334,866 (8)



starting MCC model checker
--------------------------

checking: EF [[[[[[[[p21<=1 & 1<=p21] & [p10<=1 & 1<=p10]] & [[p12<=0 & 0<=p12] & [[p3<=0 & 0<=p3] & [p8<=0 & 0<=p8]]]] | [p42<=0 & 0<=p42]] & [[p82<=0 & 0<=p82] | [[p34<=0 & 0<=p34] | [p86<=0 & 0<=p86]]]] & [[[[p28<=0 & 0<=p28] | [[p19<=1 & 1<=p19] & [p66<=1 & 1<=p66]]] & [p13<=0 & 0<=p13]] | [[[p26<=0 & 0<=p26] | [p55<=0 & 0<=p55]] & [[p64<=1 & 1<=p64] | [p48<=1 & 1<=p48]]]]] & [[p5<=1 & 1<=p5] & [[p44<=0 & 0<=p44] & [p30<=1 & 1<=p30]]]]]
normalized: E [true U [[[p5<=1 & 1<=p5] & [[p30<=1 & 1<=p30] & [p44<=0 & 0<=p44]]] & [[[[[p64<=1 & 1<=p64] | [p48<=1 & 1<=p48]] & [[p55<=0 & 0<=p55] | [p26<=0 & 0<=p26]]] | [[p13<=0 & 0<=p13] & [[[p66<=1 & 1<=p66] & [p19<=1 & 1<=p19]] | [p28<=0 & 0<=p28]]]] & [[[[p86<=0 & 0<=p86] | [p34<=0 & 0<=p34]] | [p82<=0 & 0<=p82]] & [[p42<=0 & 0<=p42] | [[[[p8<=0 & 0<=p8] & [p3<=0 & 0<=p3]] & [p12<=0 & 0<=p12]] & [[p10<=1 & 1<=p10] & [p21<=1 & 1<=p21]]]]]]]]

abstracting: (1<=p21)
states: 49,870,080 (7)
abstracting: (p21<=1)
states: 168,334,866 (8)
abstracting: (1<=p10)
states: 78,288,768 (7)
abstracting: (p10<=1)
states: 168,334,866 (8)
abstracting: (0<=p12)
states: 168,334,866 (8)
abstracting: (p12<=0)
states: 119,812,626 (8)
abstracting: (0<=p3)
states: 168,334,866 (8)
abstracting: (p3<=0)
states: 112,223,250 (8)
abstracting: (0<=p8)
states: 168,334,866 (8)
abstracting: (p8<=0)
states: 126,577,746 (8)
abstracting: (0<=p42)
states: 168,334,866 (8)
abstracting: (p42<=0)
states: 133,498,386 (8)
abstracting: (0<=p82)
states: 168,334,866 (8)
abstracting: (p82<=0)
states: 147,059,724 (8)
abstracting: (0<=p34)
states: 168,334,866 (8)
abstracting: (p34<=0)
states: 112,223,250 (8)
abstracting: (0<=p86)
states: 168,334,866 (8)
abstracting: (p86<=0)
states: 161,803,026 (8)
abstracting: (0<=p28)
states: 168,334,866 (8)
abstracting: (p28<=0)
states: 125,520,210 (8)
abstracting: (1<=p19)
states: 42,083,712 (7)
abstracting: (p19<=1)
states: 168,334,866 (8)
abstracting: (1<=p66)
states: 2,177,280 (6)
abstracting: (p66<=1)
states: 168,334,866 (8)
abstracting: (0<=p13)
states: 168,334,866 (8)
abstracting: (p13<=0)
states: 145,566,738 (8)
abstracting: (0<=p26)
states: 168,334,866 (8)
abstracting: (p26<=0)
states: 126,251,154 (8)
abstracting: (0<=p55)
states: 168,334,866 (8)
abstracting: (p55<=0)
states: 166,095,378 (8)
abstracting: (1<=p48)
states: 58,343,328 (7)
abstracting: (p48<=1)
states: 168,334,866 (8)
abstracting: (1<=p64)
states: 48,107,526 (7)
abstracting: (p64<=1)
states: 168,334,866 (8)
abstracting: (0<=p44)
states: 168,334,866 (8)
abstracting: (p44<=0)
states: 112,223,250 (8)
abstracting: (1<=p30)
states: 19,945,440 (7)
abstracting: (p30<=1)
states: 168,334,866 (8)
abstracting: (1<=p5)
states: 1,306,368 (6)
abstracting: (p5<=1)
states: 168,334,866 (8)
-> the formula is TRUE

FORMULA AutoFlight-PT-06b-ReachabilityFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.137sec

totally nodes used: 117861 (1.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 171937 561642 733579
used/not used/entry size/cache size: 642470 66466394 16 1024MB
basic ops cache: hits/miss/sum: 39516 126783 166299
used/not used/entry size/cache size: 259246 16517970 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 4797 16456 21253
used/not used/entry size/cache size: 16456 8372152 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66994364
1 111254
2 3131
3 115
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.882sec


BK_STOP 1678691308111

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:3684 (47), effective:479 (6)

initing FirstDep: 0m 0.000sec


iterations count:1787 (22), effective:225 (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="AutoFlight-PT-06b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is AutoFlight-PT-06b, 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 r010-oct2-167813599100463"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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