Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033477500487.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ShieldPPPs-PT-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477500487
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 3.7K May 14 01:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 01:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 18:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 18:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 13:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 13:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 172K May 12 20:42 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 ShieldPPPs-PT-010B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591309076590

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 22:17:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 22:17:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 22:17:58] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2020-06-04 22:17:58] [INFO ] Transformed 683 places.
[2020-06-04 22:17:58] [INFO ] Transformed 633 transitions.
[2020-06-04 22:17:58] [INFO ] Found NUPN structural information;
[2020-06-04 22:17:58] [INFO ] Parsed PT model containing 683 places and 633 transitions in 115 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 6 resets, run finished after 72 ms. (steps per millisecond=138 ) properties seen :[1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1]
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 633 rows 683 cols
[2020-06-04 22:17:58] [INFO ] Computed 111 place invariants in 20 ms
[2020-06-04 22:17:58] [INFO ] [Real]Absence check using 111 positive place invariants in 30 ms returned unsat
[2020-06-04 22:17:58] [INFO ] [Real]Absence check using 111 positive place invariants in 56 ms returned sat
[2020-06-04 22:17:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:17:59] [INFO ] [Real]Absence check using state equation in 752 ms returned sat
[2020-06-04 22:18:00] [INFO ] Deduced a trap composed of 24 places in 578 ms
[2020-06-04 22:18:00] [INFO ] Deduced a trap composed of 21 places in 514 ms
[2020-06-04 22:18:05] [INFO ] Deduced a trap composed of 20 places in 4198 ms
[2020-06-04 22:18:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s574 s575 s576 s579 s580 s616 s617 s618 s627 s628 s629 s632 s633 s662 s664 s668 s669 s670 s671) 0)") while checking expression at index 1
[2020-06-04 22:18:06] [INFO ] [Real]Absence check using 111 positive place invariants in 729 ms returned sat
[2020-06-04 22:18:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:18:07] [INFO ] [Real]Absence check using state equation in 1571 ms returned sat
[2020-06-04 22:18:07] [INFO ] Deduced a trap composed of 20 places in 272 ms
[2020-06-04 22:18:08] [INFO ] Deduced a trap composed of 20 places in 394 ms
[2020-06-04 22:18:08] [INFO ] Deduced a trap composed of 21 places in 161 ms
[2020-06-04 22:18:08] [INFO ] Deduced a trap composed of 27 places in 211 ms
[2020-06-04 22:18:09] [INFO ] Deduced a trap composed of 24 places in 203 ms
[2020-06-04 22:18:09] [INFO ] Deduced a trap composed of 31 places in 208 ms
[2020-06-04 22:18:09] [INFO ] Deduced a trap composed of 31 places in 241 ms
[2020-06-04 22:18:09] [INFO ] Deduced a trap composed of 19 places in 200 ms
[2020-06-04 22:18:10] [INFO ] Deduced a trap composed of 20 places in 216 ms
[2020-06-04 22:18:10] [INFO ] Deduced a trap composed of 23 places in 161 ms
[2020-06-04 22:18:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s147 s148 s149 s150 s151 s152 s172 s261 s262 s263 s264 s265 s266 s267 s268) 0)") while checking expression at index 2
[2020-06-04 22:18:10] [INFO ] [Real]Absence check using 111 positive place invariants in 78 ms returned sat
[2020-06-04 22:18:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:18:11] [INFO ] [Real]Absence check using state equation in 742 ms returned sat
[2020-06-04 22:18:11] [INFO ] Deduced a trap composed of 15 places in 253 ms
[2020-06-04 22:18:11] [INFO ] Deduced a trap composed of 21 places in 293 ms
[2020-06-04 22:18:11] [INFO ] Deduced a trap composed of 22 places in 137 ms
[2020-06-04 22:18:12] [INFO ] Deduced a trap composed of 17 places in 146 ms
[2020-06-04 22:18:12] [INFO ] Deduced a trap composed of 21 places in 179 ms
[2020-06-04 22:18:12] [INFO ] Deduced a trap composed of 23 places in 181 ms
[2020-06-04 22:18:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 1398 ms
[2020-06-04 22:18:12] [INFO ] [Real]Absence check using 111 positive place invariants in 82 ms returned sat
[2020-06-04 22:18:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:18:13] [INFO ] [Real]Absence check using state equation in 904 ms returned sat
[2020-06-04 22:18:13] [INFO ] Deduced a trap composed of 17 places in 227 ms
[2020-06-04 22:18:14] [INFO ] Deduced a trap composed of 23 places in 198 ms
[2020-06-04 22:18:14] [INFO ] Deduced a trap composed of 24 places in 260 ms
[2020-06-04 22:18:14] [INFO ] Deduced a trap composed of 19 places in 178 ms
[2020-06-04 22:18:15] [INFO ] Deduced a trap composed of 10 places in 238 ms
[2020-06-04 22:18:15] [INFO ] Deduced a trap composed of 16 places in 197 ms
[2020-06-04 22:18:15] [INFO ] Deduced a trap composed of 22 places in 233 ms
[2020-06-04 22:18:15] [INFO ] Deduced a trap composed of 17 places in 222 ms
[2020-06-04 22:18:16] [INFO ] Deduced a trap composed of 17 places in 241 ms
[2020-06-04 22:18:16] [INFO ] Deduced a trap composed of 16 places in 216 ms
[2020-06-04 22:18:16] [INFO ] Deduced a trap composed of 25 places in 219 ms
[2020-06-04 22:18:16] [INFO ] Deduced a trap composed of 24 places in 216 ms
[2020-06-04 22:18:17] [INFO ] Deduced a trap composed of 25 places in 202 ms
[2020-06-04 22:18:17] [INFO ] Deduced a trap composed of 19 places in 200 ms
[2020-06-04 22:18:17] [INFO ] Deduced a trap composed of 45 places in 169 ms
[2020-06-04 22:18:17] [INFO ] Deduced a trap composed of 26 places in 184 ms
[2020-06-04 22:18:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s214 s215 s216 s217 s218 s219 s220 s232 s234 s237 s271 s272 s273 s274 s275 s276 s277 s278 s279) 0)") while checking expression at index 4
[2020-06-04 22:18:17] [INFO ] [Real]Absence check using 111 positive place invariants in 78 ms returned sat
[2020-06-04 22:18:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:18:18] [INFO ] [Real]Absence check using state equation in 952 ms returned sat
[2020-06-04 22:18:19] [INFO ] Deduced a trap composed of 22 places in 259 ms
[2020-06-04 22:18:19] [INFO ] Deduced a trap composed of 18 places in 221 ms
[2020-06-04 22:18:19] [INFO ] Deduced a trap composed of 19 places in 254 ms
[2020-06-04 22:18:19] [INFO ] Deduced a trap composed of 31 places in 231 ms
[2020-06-04 22:18:20] [INFO ] Deduced a trap composed of 34 places in 241 ms
[2020-06-04 22:18:20] [INFO ] Deduced a trap composed of 23 places in 220 ms
[2020-06-04 22:18:20] [INFO ] Deduced a trap composed of 17 places in 181 ms
[2020-06-04 22:18:20] [INFO ] Deduced a trap composed of 17 places in 193 ms
[2020-06-04 22:18:21] [INFO ] Deduced a trap composed of 19 places in 204 ms
[2020-06-04 22:18:21] [INFO ] Deduced a trap composed of 35 places in 194 ms
[2020-06-04 22:18:21] [INFO ] Deduced a trap composed of 20 places in 192 ms
[2020-06-04 22:18:21] [INFO ] Deduced a trap composed of 25 places in 183 ms
[2020-06-04 22:18:22] [INFO ] Deduced a trap composed of 26 places in 186 ms
[2020-06-04 22:18:22] [INFO ] Deduced a trap composed of 27 places in 175 ms
[2020-06-04 22:18:22] [INFO ] Deduced a trap composed of 18 places in 175 ms
[2020-06-04 22:18:22] [INFO ] Deduced a trap composed of 32 places in 186 ms
[2020-06-04 22:18:22] [INFO ] Deduced a trap composed of 21 places in 171 ms
[2020-06-04 22:18:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s314 s315 s316 s317 s318 s319 s320 s321 s348 s349 s350 s351 s352 s353 s354 s366) 0)") while checking expression at index 5
[2020-06-04 22:18:23] [INFO ] [Real]Absence check using 111 positive place invariants in 79 ms returned sat
[2020-06-04 22:18:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:18:24] [INFO ] [Real]Absence check using state equation in 1004 ms returned sat
[2020-06-04 22:18:24] [INFO ] Deduced a trap composed of 17 places in 303 ms
[2020-06-04 22:18:24] [INFO ] Deduced a trap composed of 17 places in 286 ms
[2020-06-04 22:18:25] [INFO ] Deduced a trap composed of 36 places in 275 ms
[2020-06-04 22:18:25] [INFO ] Deduced a trap composed of 32 places in 268 ms
[2020-06-04 22:18:25] [INFO ] Deduced a trap composed of 28 places in 245 ms
[2020-06-04 22:18:25] [INFO ] Deduced a trap composed of 25 places in 235 ms
[2020-06-04 22:18:26] [INFO ] Deduced a trap composed of 19 places in 241 ms
[2020-06-04 22:18:26] [INFO ] Deduced a trap composed of 29 places in 254 ms
[2020-06-04 22:18:26] [INFO ] Deduced a trap composed of 27 places in 228 ms
[2020-06-04 22:18:26] [INFO ] Deduced a trap composed of 22 places in 230 ms
[2020-06-04 22:18:27] [INFO ] Deduced a trap composed of 22 places in 250 ms
[2020-06-04 22:18:27] [INFO ] Deduced a trap composed of 25 places in 234 ms
[2020-06-04 22:18:27] [INFO ] Deduced a trap composed of 22 places in 270 ms
[2020-06-04 22:18:28] [INFO ] Deduced a trap composed of 19 places in 232 ms
[2020-06-04 22:18:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s415 s416 s417 s418 s419 s420 s440 s529 s530 s531 s532 s533 s534 s535 s536) 0)") while checking expression at index 6
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 33 out of 683 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 683/683 places, 633/633 transitions.
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 683 transition count 564
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 138 place count 614 transition count 564
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 138 place count 614 transition count 514
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 238 place count 564 transition count 514
Symmetric choice reduction at 2 with 64 rule applications. Total rules 302 place count 564 transition count 514
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 64 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 430 place count 500 transition count 450
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 430 place count 500 transition count 427
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 476 place count 477 transition count 427
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 764 place count 333 transition count 283
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 2 with 78 rules applied. Total rules applied 842 place count 333 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 843 place count 332 transition count 282
Applied a total of 843 rules in 128 ms. Remains 332 /683 variables (removed 351) and now considering 282/633 (removed 351) transitions.
Finished structural reductions, in 1 iterations. Remains : 332/683 places, 282/633 transitions.
Incomplete random walk after 1000000 steps, including 609 resets, run finished after 3153 ms. (steps per millisecond=317 ) properties seen :[1, 1, 0, 1, 0]
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 67 resets, run finished after 1560 ms. (steps per millisecond=641 ) properties seen :[1, 0]
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 41 resets, run finished after 1906 ms. (steps per millisecond=524 ) properties seen :[0]
// Phase 1: matrix 282 rows 332 cols
[2020-06-04 22:18:34] [INFO ] Computed 111 place invariants in 13 ms
[2020-06-04 22:18:34] [INFO ] [Real]Absence check using 107 positive place invariants in 46 ms returned sat
[2020-06-04 22:18:34] [INFO ] [Real]Absence check using 107 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-04 22:18:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:18:35] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2020-06-04 22:18:35] [INFO ] Deduced a trap composed of 4 places in 103 ms
[2020-06-04 22:18:35] [INFO ] Deduced a trap composed of 6 places in 80 ms
[2020-06-04 22:18:35] [INFO ] Deduced a trap composed of 7 places in 65 ms
[2020-06-04 22:18:35] [INFO ] Deduced a trap composed of 8 places in 82 ms
[2020-06-04 22:18:35] [INFO ] Deduced a trap composed of 6 places in 103 ms
[2020-06-04 22:18:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 517 ms
[2020-06-04 22:18:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 22:18:35] [INFO ] [Nat]Absence check using 107 positive place invariants in 56 ms returned sat
[2020-06-04 22:18:35] [INFO ] [Nat]Absence check using 107 positive and 4 generalized place invariants in 1 ms returned sat
[2020-06-04 22:18:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 22:18:36] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2020-06-04 22:18:36] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2020-06-04 22:18:36] [INFO ] Deduced a trap composed of 6 places in 71 ms
[2020-06-04 22:18:36] [INFO ] Deduced a trap composed of 7 places in 74 ms
[2020-06-04 22:18:36] [INFO ] Deduced a trap composed of 6 places in 75 ms
[2020-06-04 22:18:36] [INFO ] Deduced a trap composed of 5 places in 130 ms
[2020-06-04 22:18:36] [INFO ] Deduced a trap composed of 7 places in 105 ms
[2020-06-04 22:18:36] [INFO ] Deduced a trap composed of 8 places in 100 ms
[2020-06-04 22:18:36] [INFO ] Deduced a trap composed of 7 places in 105 ms
[2020-06-04 22:18:37] [INFO ] Deduced a trap composed of 5 places in 64 ms
[2020-06-04 22:18:37] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 969 ms
[2020-06-04 22:18:37] [INFO ] Computed and/alt/rep : 274/829/274 causal constraints in 31 ms.
[2020-06-04 22:18:44] [INFO ] Added : 247 causal constraints over 58 iterations in 7708 ms. Result :unknown
Incomplete Parikh walk after 17600 steps, including 370 resets, run finished after 111 ms. (steps per millisecond=158 ) properties seen :[0] could not realise parikh vector
Support contains 3 out of 332 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 332/332 places, 282/282 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 332 transition count 280
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 330 transition count 280
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 330 transition count 277
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 327 transition count 277
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 34 place count 315 transition count 265
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 36 place count 314 transition count 264
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 314 transition count 264
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 43 place count 314 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 313 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 312 transition count 262
Applied a total of 45 rules in 86 ms. Remains 312 /332 variables (removed 20) and now considering 262/282 (removed 20) transitions.
Finished structural reductions, in 1 iterations. Remains : 312/332 places, 262/282 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2614 ms. (steps per millisecond=382 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1503 ms. (steps per millisecond=665 ) properties seen :[0]
Interrupted probabilistic random walk after 8204804 steps, run timeout after 30001 ms. (steps per millisecond=273 ) properties seen :[0]
Probabilistic random walk after 8204804 steps, saw 1329386 distinct states, run finished after 30001 ms. (steps per millisecond=273 ) properties seen :[0]
// Phase 1: matrix 262 rows 312 cols
[2020-06-04 22:19:19] [INFO ] Computed 111 place invariants in 17 ms
[2020-06-04 22:19:19] [INFO ] [Real]Absence check using 108 positive place invariants in 38 ms returned sat
[2020-06-04 22:19:19] [INFO ] [Real]Absence check using 108 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 22:19:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:19:19] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2020-06-04 22:19:19] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-06-04 22:19:19] [INFO ] Deduced a trap composed of 5 places in 57 ms
[2020-06-04 22:19:19] [INFO ] Deduced a trap composed of 12 places in 52 ms
[2020-06-04 22:19:19] [INFO ] Deduced a trap composed of 7 places in 36 ms
[2020-06-04 22:19:19] [INFO ] Deduced a trap composed of 4 places in 36 ms
[2020-06-04 22:19:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 344 ms
[2020-06-04 22:19:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 22:19:19] [INFO ] [Nat]Absence check using 108 positive place invariants in 47 ms returned sat
[2020-06-04 22:19:19] [INFO ] [Nat]Absence check using 108 positive and 3 generalized place invariants in 8 ms returned sat
[2020-06-04 22:19:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 22:19:20] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2020-06-04 22:19:20] [INFO ] Deduced a trap composed of 7 places in 92 ms
[2020-06-04 22:19:20] [INFO ] Deduced a trap composed of 9 places in 110 ms
[2020-06-04 22:19:20] [INFO ] Deduced a trap composed of 9 places in 69 ms
[2020-06-04 22:19:20] [INFO ] Deduced a trap composed of 9 places in 62 ms
[2020-06-04 22:19:20] [INFO ] Deduced a trap composed of 6 places in 56 ms
[2020-06-04 22:19:20] [INFO ] Deduced a trap composed of 5 places in 47 ms
[2020-06-04 22:19:20] [INFO ] Deduced a trap composed of 6 places in 71 ms
[2020-06-04 22:19:20] [INFO ] Deduced a trap composed of 5 places in 63 ms
[2020-06-04 22:19:20] [INFO ] Deduced a trap composed of 17 places in 45 ms
[2020-06-04 22:19:21] [INFO ] Deduced a trap composed of 6 places in 59 ms
[2020-06-04 22:19:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 858 ms
[2020-06-04 22:19:21] [INFO ] Computed and/alt/rep : 259/775/259 causal constraints in 18 ms.
[2020-06-04 22:19:28] [INFO ] Added : 236 causal constraints over 53 iterations in 7218 ms. Result :unknown
Incomplete Parikh walk after 10100 steps, including 511 resets, run finished after 77 ms. (steps per millisecond=131 ) properties seen :[0] could not realise parikh vector
Support contains 3 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 12 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 262/262 transitions.
Starting structural reductions, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 16 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 312 cols
[2020-06-04 22:19:28] [INFO ] Computed 111 place invariants in 7 ms
[2020-06-04 22:19:28] [INFO ] Implicit Places using invariants in 492 ms returned []
// Phase 1: matrix 262 rows 312 cols
[2020-06-04 22:19:28] [INFO ] Computed 111 place invariants in 7 ms
[2020-06-04 22:19:29] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned []
Implicit Place search using SMT with State Equation took 1601 ms to find 0 implicit places.
[2020-06-04 22:19:30] [INFO ] Redundant transitions in 37 ms returned []
// Phase 1: matrix 262 rows 312 cols
[2020-06-04 22:19:30] [INFO ] Computed 111 place invariants in 10 ms
[2020-06-04 22:19:30] [INFO ] Dead Transitions using invariants and state equation in 302 ms returned []
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 262/262 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 380 ms. (steps per millisecond=263 ) properties seen :[0]
// Phase 1: matrix 262 rows 312 cols
[2020-06-04 22:19:30] [INFO ] Computed 111 place invariants in 3 ms
[2020-06-04 22:19:30] [INFO ] [Real]Absence check using 108 positive place invariants in 51 ms returned sat
[2020-06-04 22:19:30] [INFO ] [Real]Absence check using 108 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-04 22:19:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:19:31] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2020-06-04 22:19:31] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-06-04 22:19:31] [INFO ] Deduced a trap composed of 5 places in 63 ms
[2020-06-04 22:19:31] [INFO ] Deduced a trap composed of 12 places in 53 ms
[2020-06-04 22:19:31] [INFO ] Deduced a trap composed of 7 places in 52 ms
[2020-06-04 22:19:31] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2020-06-04 22:19:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 370 ms
[2020-06-04 22:19:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 22:19:31] [INFO ] [Nat]Absence check using 108 positive place invariants in 46 ms returned sat
[2020-06-04 22:19:31] [INFO ] [Nat]Absence check using 108 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 22:19:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 22:19:31] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2020-06-04 22:19:31] [INFO ] Deduced a trap composed of 7 places in 80 ms
[2020-06-04 22:19:32] [INFO ] Deduced a trap composed of 9 places in 70 ms
[2020-06-04 22:19:32] [INFO ] Deduced a trap composed of 9 places in 63 ms
[2020-06-04 22:19:32] [INFO ] Deduced a trap composed of 9 places in 82 ms
[2020-06-04 22:19:32] [INFO ] Deduced a trap composed of 6 places in 64 ms
[2020-06-04 22:19:32] [INFO ] Deduced a trap composed of 5 places in 67 ms
[2020-06-04 22:19:32] [INFO ] Deduced a trap composed of 6 places in 68 ms
[2020-06-04 22:19:32] [INFO ] Deduced a trap composed of 5 places in 55 ms
[2020-06-04 22:19:32] [INFO ] Deduced a trap composed of 17 places in 61 ms
[2020-06-04 22:19:32] [INFO ] Deduced a trap composed of 6 places in 54 ms
[2020-06-04 22:19:32] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 829 ms
[2020-06-04 22:19:32] [INFO ] Computed and/alt/rep : 259/775/259 causal constraints in 16 ms.
[2020-06-04 22:19:39] [INFO ] Added : 236 causal constraints over 53 iterations in 7139 ms. Result :unknown
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 262
Applied a total of 2 rules in 30 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 312 cols
[2020-06-04 22:19:39] [INFO ] Computed 111 place invariants in 3 ms
[2020-06-04 22:19:40] [INFO ] [Real]Absence check using 109 positive place invariants in 50 ms returned sat
[2020-06-04 22:19:40] [INFO ] [Real]Absence check using 109 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 22:19:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:19:40] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2020-06-04 22:19:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-04 22:19:40] [INFO ] [Real]Added 2 Read/Feed constraints in 4 ms returned sat
[2020-06-04 22:19:40] [INFO ] Deduced a trap composed of 9 places in 87 ms
[2020-06-04 22:19:40] [INFO ] Deduced a trap composed of 6 places in 78 ms
[2020-06-04 22:19:40] [INFO ] Deduced a trap composed of 20 places in 58 ms
[2020-06-04 22:19:40] [INFO ] Deduced a trap composed of 7 places in 52 ms
[2020-06-04 22:19:40] [INFO ] Deduced a trap composed of 7 places in 55 ms
[2020-06-04 22:19:40] [INFO ] Deduced a trap composed of 9 places in 44 ms
[2020-06-04 22:19:40] [INFO ] Deduced a trap composed of 4 places in 38 ms
[2020-06-04 22:19:40] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 525 ms
[2020-06-04 22:19:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 22:19:40] [INFO ] [Nat]Absence check using 109 positive place invariants in 44 ms returned sat
[2020-06-04 22:19:40] [INFO ] [Nat]Absence check using 109 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-04 22:19:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 22:19:41] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2020-06-04 22:19:41] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2020-06-04 22:19:41] [INFO ] Deduced a trap composed of 6 places in 70 ms
[2020-06-04 22:19:41] [INFO ] Deduced a trap composed of 8 places in 63 ms
[2020-06-04 22:19:41] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-06-04 22:19:41] [INFO ] Deduced a trap composed of 5 places in 72 ms
[2020-06-04 22:19:41] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-04 22:19:41] [INFO ] Deduced a trap composed of 7 places in 59 ms
[2020-06-04 22:19:41] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-06-04 22:19:41] [INFO ] Deduced a trap composed of 7 places in 57 ms
[2020-06-04 22:19:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 617 ms
[2020-06-04 22:19:41] [INFO ] Computed and/alt/rep : 259/784/259 causal constraints in 24 ms.
[2020-06-04 22:19:50] [INFO ] Added : 244 causal constraints over 57 iterations in 8552 ms. Result :unknown
[2020-06-04 22:19:50] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2020-06-04 22:19:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 13 ms.
[2020-06-04 22:19:50] [INFO ] Flatten gal took : 60 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldPPPs-PT-010B @ 3570 seconds

FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityFireability @ ShieldPPPs-PT-010B

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 22:19:50 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 18704,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((p130 <= 0) OR (p132 <= 0) OR (p243 <= 0))))",
"processed_size": 53,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 1154,
"conflict_clusters": 60,
"places": 312,
"places_significant": 201,
"singleton_clusters": 0,
"transitions": 262
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": true
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 574/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 9984
lola: finding significant places
lola: 312 places, 262 transitions, 201 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p243 <= 1)
lola: A (G (((p130 <= 0) OR (p132 <= 0) OR (p243 <= 0))))
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p130 <= 0) OR (p132 <= 0) OR (p243 <= 0))))
lola: processed formula length: 53
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: local time limit reached - aborting
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: RESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: 3 markings, 2 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p130) AND (1 <= p132) AND (1 <= p243))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: memory consumption: 18704 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

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

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="ShieldPPPs-PT-010B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is ShieldPPPs-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 r211-tajo-159033477500487"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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