Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286026100975.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVt-PT-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286026100975
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 5.7K Apr 30 00:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 30 00:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 00:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 00:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 09:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 09:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 09:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 30 00:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Apr 30 00:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 30 00:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 30 00:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 119K May 10 09:34 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 ShieldRVt-PT-010B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654282406834

Running Version 202205111006
[2022-06-03 18:53:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-03 18:53:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 18:53:28] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2022-06-03 18:53:28] [INFO ] Transformed 503 places.
[2022-06-03 18:53:28] [INFO ] Transformed 503 transitions.
[2022-06-03 18:53:28] [INFO ] Found NUPN structural information;
[2022-06-03 18:53:28] [INFO ] Parsed PT model containing 503 places and 503 transitions in 214 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 592 ms. (steps per millisecond=16 ) properties (out of 16) seen :8
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) 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 8) 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 8) seen :2
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 6 properties.
// Phase 1: matrix 503 rows 503 cols
[2022-06-03 18:53:29] [INFO ] Computed 41 place invariants in 17 ms
[2022-06-03 18:53:29] [INFO ] After 286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-03 18:53:29] [INFO ] [Nat]Absence check using 41 positive place invariants in 17 ms returned sat
[2022-06-03 18:53:30] [INFO ] After 664ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2022-06-03 18:53:30] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 5 ms to minimize.
[2022-06-03 18:53:31] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 2 ms to minimize.
[2022-06-03 18:53:31] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2022-06-03 18:53:31] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
[2022-06-03 18:53:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 688 ms
[2022-06-03 18:53:31] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 1 ms to minimize.
[2022-06-03 18:53:31] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 0 ms to minimize.
[2022-06-03 18:53:31] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2022-06-03 18:53:31] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 2 ms to minimize.
[2022-06-03 18:53:32] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2022-06-03 18:53:32] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2022-06-03 18:53:32] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 0 ms to minimize.
[2022-06-03 18:53:32] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2022-06-03 18:53:32] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 0 ms to minimize.
[2022-06-03 18:53:32] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 0 ms to minimize.
[2022-06-03 18:53:32] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2022-06-03 18:53:32] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1135 ms
[2022-06-03 18:53:32] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2022-06-03 18:53:32] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2022-06-03 18:53:32] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2022-06-03 18:53:33] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2022-06-03 18:53:33] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2022-06-03 18:53:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 486 ms
[2022-06-03 18:53:33] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2022-06-03 18:53:33] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 1 ms to minimize.
[2022-06-03 18:53:33] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 0 ms to minimize.
[2022-06-03 18:53:33] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2022-06-03 18:53:33] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2022-06-03 18:53:33] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2022-06-03 18:53:33] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2022-06-03 18:53:34] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 0 ms to minimize.
[2022-06-03 18:53:34] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 814 ms
[2022-06-03 18:53:34] [INFO ] After 4127ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 354 ms.
[2022-06-03 18:53:34] [INFO ] After 4735ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 2567 ms.
Support contains 112 out of 503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 503/503 places, 503/503 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 503 transition count 443
Reduce places removed 60 places and 0 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Iterating post reduction 1 with 88 rules applied. Total rules applied 148 place count 443 transition count 415
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 176 place count 415 transition count 415
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 176 place count 415 transition count 369
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 268 place count 369 transition count 369
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 323 place count 314 transition count 314
Iterating global reduction 3 with 55 rules applied. Total rules applied 378 place count 314 transition count 314
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 378 place count 314 transition count 309
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 388 place count 309 transition count 309
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 498 place count 254 transition count 254
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 512 place count 247 transition count 254
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 513 place count 247 transition count 253
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 517 place count 247 transition count 249
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 521 place count 243 transition count 249
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 526 place count 243 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 527 place count 242 transition count 248
Applied a total of 527 rules in 120 ms. Remains 242 /503 variables (removed 261) and now considering 248/503 (removed 255) transitions.
Finished structural reductions, in 1 iterations. Remains : 242/503 places, 248/503 transitions.
Incomplete random walk after 1000000 steps, including 60 resets, run finished after 3754 ms. (steps per millisecond=266 ) properties (out of 5) seen :4
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 12 resets, run finished after 1323 ms. (steps per millisecond=755 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 242 cols
[2022-06-03 18:53:42] [INFO ] Computed 41 place invariants in 3 ms
[2022-06-03 18:53:42] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 18:53:42] [INFO ] [Nat]Absence check using 41 positive place invariants in 6 ms returned sat
[2022-06-03 18:53:42] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 18:53:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-06-03 18:53:42] [INFO ] After 28ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 18:53:42] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2022-06-03 18:53:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2022-06-03 18:53:42] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-06-03 18:53:42] [INFO ] After 315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 39 ms.
Support contains 24 out of 242 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 242/242 places, 248/248 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 242 transition count 218
Reduce places removed 30 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 34 rules applied. Total rules applied 64 place count 212 transition count 214
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 68 place count 208 transition count 214
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 68 place count 208 transition count 192
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 112 place count 186 transition count 192
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 117 place count 181 transition count 187
Iterating global reduction 3 with 5 rules applied. Total rules applied 122 place count 181 transition count 187
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 122 place count 181 transition count 183
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 130 place count 177 transition count 183
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 214 place count 135 transition count 141
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 242 place count 121 transition count 153
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 243 place count 121 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 244 place count 120 transition count 152
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 245 place count 120 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 246 place count 119 transition count 151
Applied a total of 246 rules in 38 ms. Remains 119 /242 variables (removed 123) and now considering 151/248 (removed 97) transitions.
Finished structural reductions, in 1 iterations. Remains : 119/242 places, 151/248 transitions.
Incomplete random walk after 1000000 steps, including 10 resets, run finished after 2194 ms. (steps per millisecond=455 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 1308 ms. (steps per millisecond=764 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5438934 steps, run timeout after 9001 ms. (steps per millisecond=604 ) properties seen :{}
Probabilistic random walk after 5438934 steps, saw 1229843 distinct states, run finished after 9002 ms. (steps per millisecond=604 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 151 rows 119 cols
[2022-06-03 18:53:55] [INFO ] Computed 41 place invariants in 5 ms
[2022-06-03 18:53:55] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 18:53:55] [INFO ] [Nat]Absence check using 41 positive place invariants in 5 ms returned sat
[2022-06-03 18:53:55] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 18:53:55] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-06-03 18:53:55] [INFO ] After 25ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 18:53:55] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-06-03 18:53:55] [INFO ] After 182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 24 out of 119 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 119/119 places, 151/151 transitions.
Applied a total of 0 rules in 4 ms. Remains 119 /119 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 119/119 places, 151/151 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 119/119 places, 151/151 transitions.
Applied a total of 0 rules in 4 ms. Remains 119 /119 variables (removed 0) and now considering 151/151 (removed 0) transitions.
// Phase 1: matrix 151 rows 119 cols
[2022-06-03 18:53:55] [INFO ] Computed 41 place invariants in 2 ms
[2022-06-03 18:53:55] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 151 rows 119 cols
[2022-06-03 18:53:55] [INFO ] Computed 41 place invariants in 1 ms
[2022-06-03 18:53:55] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-06-03 18:53:55] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2022-06-03 18:53:55] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 151 rows 119 cols
[2022-06-03 18:53:55] [INFO ] Computed 41 place invariants in 1 ms
[2022-06-03 18:53:55] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 119/119 places, 151/151 transitions.
Incomplete random walk after 1000000 steps, including 15 resets, run finished after 2140 ms. (steps per millisecond=467 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3 resets, run finished after 1342 ms. (steps per millisecond=745 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5408424 steps, run timeout after 9001 ms. (steps per millisecond=600 ) properties seen :{}
Probabilistic random walk after 5408424 steps, saw 1226950 distinct states, run finished after 9001 ms. (steps per millisecond=600 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 151 rows 119 cols
[2022-06-03 18:54:08] [INFO ] Computed 41 place invariants in 4 ms
[2022-06-03 18:54:08] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 18:54:08] [INFO ] [Nat]Absence check using 41 positive place invariants in 10 ms returned sat
[2022-06-03 18:54:08] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 18:54:08] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-06-03 18:54:08] [INFO ] After 28ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 18:54:08] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-06-03 18:54:08] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 24 out of 119 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 119/119 places, 151/151 transitions.
Applied a total of 0 rules in 6 ms. Remains 119 /119 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 119/119 places, 151/151 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 119/119 places, 151/151 transitions.
Applied a total of 0 rules in 4 ms. Remains 119 /119 variables (removed 0) and now considering 151/151 (removed 0) transitions.
// Phase 1: matrix 151 rows 119 cols
[2022-06-03 18:54:08] [INFO ] Computed 41 place invariants in 0 ms
[2022-06-03 18:54:08] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 151 rows 119 cols
[2022-06-03 18:54:08] [INFO ] Computed 41 place invariants in 1 ms
[2022-06-03 18:54:08] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-06-03 18:54:08] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2022-06-03 18:54:08] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 151 rows 119 cols
[2022-06-03 18:54:08] [INFO ] Computed 41 place invariants in 4 ms
[2022-06-03 18:54:08] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 119/119 places, 151/151 transitions.
Graph (complete) has 342 edges and 119 vertex of which 118 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 118 transition count 146
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 118 transition count 146
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 118 transition count 145
Applied a total of 8 rules in 18 ms. Remains 118 /119 variables (removed 1) and now considering 145/151 (removed 6) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 145 rows 118 cols
[2022-06-03 18:54:08] [INFO ] Computed 40 place invariants in 0 ms
[2022-06-03 18:54:09] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 18:54:09] [INFO ] [Nat]Absence check using 40 positive place invariants in 7 ms returned sat
[2022-06-03 18:54:09] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 18:54:09] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2022-06-03 18:54:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2022-06-03 18:54:09] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-06-03 18:54:09] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-03 18:54:09] [INFO ] Flatten gal took : 54 ms
[2022-06-03 18:54:09] [INFO ] Flatten gal took : 15 ms
[2022-06-03 18:54:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10879715874123692711.gal : 7 ms
[2022-06-03 18:54:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4224797877745918200.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10879715874123692711.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4224797877745918200.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality4224797877745918200.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 28
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :28 after 111
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1554 after 4252
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4252 after 4625
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4625 after 6981
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6981 after 120144
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :120144 after 8.58867e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8.58867e+06 after 3.355e+11
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.80338e+16,0.144502,8516,2,904,16,19919,7,0,655,27942,0
Total reachable state count : 18033757172785374

Verifying 1 reachability properties.
Invariant property ShieldRVt-PT-010B-ReachabilityFireability-09 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-010B-ReachabilityFireability-09,3.55347e+14,0.152547,8780,2,1733,16,19919,7,0,689,27942,0
[2022-06-03 18:54:09] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6740241540133986233
[2022-06-03 18:54:09] [INFO ] Applying decomposition
[2022-06-03 18:54:09] [INFO ] Computing symmetric may disable matrix : 151 transitions.
[2022-06-03 18:54:09] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 18:54:09] [INFO ] Computing symmetric may enable matrix : 151 transitions.
[2022-06-03 18:54:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 18:54:09] [INFO ] Flatten gal took : 38 ms
[2022-06-03 18:54:09] [INFO ] Computing Do-Not-Accords matrix : 151 transitions.
[2022-06-03 18:54:09] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 18:54:09] [INFO ] Flatten gal took : 61 ms
[2022-06-03 18:54:09] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6740241540133986233
[2022-06-03 18:54:09] [INFO ] Input system was already deterministic with 151 transitions.
Running compilation step : cd /tmp/ltsmin6740241540133986233;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1263226800622229646.txt' '-o' '/tmp/graph1263226800622229646.bin' '-w' '/tmp/graph1263226800622229646.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1263226800622229646.bin' '-l' '-1' '-v' '-w' '/tmp/graph1263226800622229646.weights' '-q' '0' '-e' '0.001'
[2022-06-03 18:54:09] [INFO ] Decomposing Gal with order
[2022-06-03 18:54:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 18:54:09] [INFO ] Ran tautology test, simplified 0 / 1 in 253 ms.
[2022-06-03 18:54:10] [INFO ] Removed a total of 154 redundant transitions.
[2022-06-03 18:54:10] [INFO ] BMC solution for property ShieldRVt-PT-010B-ReachabilityFireability-09(UNSAT) depth K=0 took 86 ms
[2022-06-03 18:54:10] [INFO ] BMC solution for property ShieldRVt-PT-010B-ReachabilityFireability-09(UNSAT) depth K=1 took 2 ms
[2022-06-03 18:54:10] [INFO ] Flatten gal took : 167 ms
[2022-06-03 18:54:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 18 ms.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 151 rows 119 cols
[2022-06-03 18:54:10] [INFO ] Computed 41 place invariants in 1 ms
[2022-06-03 18:54:10] [INFO ] Computed 41 place invariants in 2 ms
[2022-06-03 18:54:10] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability16238842902811675026.gal : 9 ms
[2022-06-03 18:54:10] [INFO ] BMC solution for property ShieldRVt-PT-010B-ReachabilityFireability-09(UNSAT) depth K=2 took 102 ms
[2022-06-03 18:54:10] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15996635172771526208.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability16238842902811675026.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability15996635172771526208.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityFireability15996635172771526208.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :13 after 37
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :37 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 7548
Invariant property ShieldRVt-PT-010B-ReachabilityFireability-09 does not hold.
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.07669e+11,0.097303,5620,283,102,3035,584,417,4666,105,1681,0
Total reachable state count : 107669033148

Verifying 1 reachability properties.
Invariant property ShieldRVt-PT-010B-ReachabilityFireability-09 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-010B-ReachabilityFireability-09,6.27202e+08,0.118502,5884,180,69,3035,584,516,4666,119,1681,0
[2022-06-03 18:54:10] [WARNING] Interrupting SMT solver.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 18:54:10] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
Exception in thread "Thread-7" java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:117)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:283)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-03 18:54:10] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-03 18:54:10] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldRVt-PT-010B-ReachabilityFireability-09 SMT depth 3
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 2 more
[2022-06-03 18:54:10] [INFO ] During BMC, SMT solver timed out at depth 3
[2022-06-03 18:54:10] [INFO ] BMC solving timed out (3600000 secs) at depth 3
[2022-06-03 18:54:10] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
Total runtime 42438 ms.

BK_STOP 1654282450540

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="ShieldRVt-PT-010B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-010B, 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 r222-tall-165286026100975"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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