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-159033477300359.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 ShieldIIPt-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477300359
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 3.6K May 14 01:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 14 01:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 18:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 18:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.6K May 13 13:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 13:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 08:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 08:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 686K 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 ShieldIIPt-PT-040B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591301452740

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 20:10:54] [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 20:10:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 20:10:54] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2020-06-04 20:10:54] [INFO ] Transformed 2803 places.
[2020-06-04 20:10:54] [INFO ] Transformed 2603 transitions.
[2020-06-04 20:10:54] [INFO ] Found NUPN structural information;
[2020-06-04 20:10:54] [INFO ] Parsed PT model containing 2803 places and 2603 transitions in 233 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 94 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 150 ms. (steps per millisecond=66 ) properties seen :[0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1]
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 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, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
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, 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, 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, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2603 rows 2803 cols
[2020-06-04 20:10:55] [INFO ] Computed 361 place invariants in 50 ms
[2020-06-04 20:10:56] [INFO ] [Real]Absence check using 361 positive place invariants in 570 ms returned sat
[2020-06-04 20:10:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:11:00] [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: Broken pipe (= s1038 (- t1456 t1457))") while checking expression at index 0
[2020-06-04 20:11:01] [INFO ] [Real]Absence check using 361 positive place invariants in 533 ms returned sat
[2020-06-04 20:11:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:11:05] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:11:05] [INFO ] [Real]Absence check using state equation in 4039 ms returned (error "Failed to check-sat")
[2020-06-04 20:11:05] [INFO ] [Real]Absence check using 361 positive place invariants in 436 ms returned sat
[2020-06-04 20:11:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:11:10] [INFO ] [Real]Absence check using state equation in 4230 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 20:11:11] [INFO ] [Real]Absence check using 361 positive place invariants in 678 ms returned sat
[2020-06-04 20:11:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:11:15] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:11:15] [INFO ] [Real]Absence check using state equation in 3899 ms returned (error "Failed to check-sat")
[2020-06-04 20:11:15] [INFO ] [Real]Absence check using 361 positive place invariants in 434 ms returned sat
[2020-06-04 20:11:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:11:20] [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: Broken pipe (= s1149 (- t1307 t1318))") while checking expression at index 4
[2020-06-04 20:11:20] [INFO ] [Real]Absence check using 361 positive place invariants in 433 ms returned sat
[2020-06-04 20:11:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:11:25] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:11:25] [INFO ] [Real]Absence check using state equation in 4198 ms returned (error "Failed to check-sat")
[2020-06-04 20:11:25] [INFO ] [Real]Absence check using 361 positive place invariants in 453 ms returned sat
[2020-06-04 20:11:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:11:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:11:30] [INFO ] [Real]Absence check using state equation in 4196 ms returned (error "Failed to check-sat")
[2020-06-04 20:11:30] [INFO ] [Real]Absence check using 361 positive place invariants in 463 ms returned sat
[2020-06-04 20:11:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:11:35] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:11:35] [INFO ] [Real]Absence check using state equation in 4226 ms returned (error "Failed to check-sat")
[2020-06-04 20:11:35] [INFO ] [Real]Absence check using 361 positive place invariants in 459 ms returned sat
[2020-06-04 20:11:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:11:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:11:40] [INFO ] [Real]Absence check using state equation in 4206 ms returned (error "Failed to check-sat")
[2020-06-04 20:11:40] [INFO ] [Real]Absence check using 361 positive place invariants in 419 ms returned sat
[2020-06-04 20:11:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:11:45] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:11:45] [INFO ] [Real]Absence check using state equation in 4251 ms returned (error "Failed to check-sat")
Support contains 46 out of 2803 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Performed 651 Post agglomeration using F-continuation condition.Transition count delta: 651
Iterating post reduction 0 with 651 rules applied. Total rules applied 651 place count 2803 transition count 1952
Reduce places removed 651 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 653 rules applied. Total rules applied 1304 place count 2152 transition count 1950
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1305 place count 2151 transition count 1950
Performed 168 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 168 Pre rules applied. Total rules applied 1305 place count 2151 transition count 1782
Deduced a syphon composed of 168 places in 5 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 3 with 336 rules applied. Total rules applied 1641 place count 1983 transition count 1782
Symmetric choice reduction at 3 with 280 rule applications. Total rules 1921 place count 1983 transition count 1782
Deduced a syphon composed of 280 places in 19 ms
Reduce places removed 280 places and 280 transitions.
Iterating global reduction 3 with 560 rules applied. Total rules applied 2481 place count 1703 transition count 1502
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 2481 place count 1703 transition count 1389
Deduced a syphon composed of 113 places in 13 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 226 rules applied. Total rules applied 2707 place count 1590 transition count 1389
Performed 657 Post agglomeration using F-continuation condition.Transition count delta: 657
Deduced a syphon composed of 657 places in 4 ms
Reduce places removed 657 places and 0 transitions.
Iterating global reduction 3 with 1314 rules applied. Total rules applied 4021 place count 933 transition count 732
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -62
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4223 place count 832 transition count 794
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 4237 place count 825 transition count 798
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4238 place count 825 transition count 797
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4242 place count 825 transition count 793
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 4246 place count 821 transition count 793
Partial Free-agglomeration rule applied 37 times.
Drop transitions removed 37 transitions
Iterating global reduction 5 with 37 rules applied. Total rules applied 4283 place count 821 transition count 793
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 4284 place count 821 transition count 793
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4285 place count 820 transition count 792
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 4287 place count 818 transition count 792
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 4287 place count 818 transition count 791
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4289 place count 817 transition count 791
Applied a total of 4289 rules in 1199 ms. Remains 817 /2803 variables (removed 1986) and now considering 791/2603 (removed 1812) transitions.
Finished structural reductions, in 1 iterations. Remains : 817/2803 places, 791/2603 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 6704 ms. (steps per millisecond=149 ) properties seen :[0, 0, 1, 0, 1, 1, 0, 1, 1, 1]
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4317 ms. (steps per millisecond=231 ) properties seen :[1, 0, 0, 0]
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3822 ms. (steps per millisecond=261 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 8 resets, run finished after 3998 ms. (steps per millisecond=250 ) properties seen :[0, 1, 0]
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3972 ms. (steps per millisecond=251 ) properties seen :[0, 0]
// Phase 1: matrix 791 rows 817 cols
[2020-06-04 20:12:09] [INFO ] Computed 359 place invariants in 3 ms
[2020-06-04 20:12:09] [INFO ] [Real]Absence check using 359 positive place invariants in 192 ms returned sat
[2020-06-04 20:12:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:12:10] [INFO ] [Real]Absence check using state equation in 1289 ms returned sat
[2020-06-04 20:12:10] [INFO ] State equation strengthened by 75 read => feed constraints.
[2020-06-04 20:12:10] [INFO ] [Real]Added 75 Read/Feed constraints in 21 ms returned sat
[2020-06-04 20:12:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:12:11] [INFO ] [Nat]Absence check using 359 positive place invariants in 196 ms returned sat
[2020-06-04 20:12:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:12:12] [INFO ] [Nat]Absence check using state equation in 1470 ms returned sat
[2020-06-04 20:12:12] [INFO ] [Nat]Added 75 Read/Feed constraints in 19 ms returned sat
[2020-06-04 20:12:12] [INFO ] Computed and/alt/rep : 769/1904/769 causal constraints in 54 ms.
[2020-06-04 20:12:23] [INFO ] Added : 715 causal constraints over 144 iterations in 10279 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 59 ms.
[2020-06-04 20:12:23] [INFO ] [Real]Absence check using 359 positive place invariants in 193 ms returned sat
[2020-06-04 20:12:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:12:24] [INFO ] [Real]Absence check using state equation in 1353 ms returned sat
[2020-06-04 20:12:24] [INFO ] [Real]Added 75 Read/Feed constraints in 17 ms returned sat
[2020-06-04 20:12:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:12:25] [INFO ] [Nat]Absence check using 359 positive place invariants in 209 ms returned sat
[2020-06-04 20:12:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:12:26] [INFO ] [Nat]Absence check using state equation in 1352 ms returned sat
[2020-06-04 20:12:26] [INFO ] [Nat]Added 75 Read/Feed constraints in 21 ms returned sat
[2020-06-04 20:12:26] [INFO ] Computed and/alt/rep : 769/1904/769 causal constraints in 54 ms.
[2020-06-04 20:12:42] [INFO ] Added : 680 causal constraints over 136 iterations in 16018 ms. Result :unknown
Incomplete Parikh walk after 246400 steps, including 1000 resets, run finished after 1440 ms. (steps per millisecond=171 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 159100 steps, including 230 resets, run finished after 882 ms. (steps per millisecond=180 ) properties seen :[1, 0] could not realise parikh vector
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 9 out of 817 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 817/817 places, 791/791 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 817 transition count 780
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 806 transition count 780
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 22 place count 806 transition count 771
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 40 place count 797 transition count 771
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 62 place count 786 transition count 760
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 74 place count 780 transition count 765
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 780 transition count 765
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 779 transition count 764
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 778 transition count 763
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 777 transition count 762
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 776 transition count 761
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 775 transition count 760
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 774 transition count 759
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 773 transition count 758
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 772 transition count 757
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 771 transition count 756
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 770 transition count 755
Applied a total of 85 rules in 339 ms. Remains 770 /817 variables (removed 47) and now considering 755/791 (removed 36) transitions.
Finished structural reductions, in 1 iterations. Remains : 770/817 places, 755/791 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 5997 ms. (steps per millisecond=166 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4286 ms. (steps per millisecond=233 ) properties seen :[0]
Interrupted probabilistic random walk after 3284724 steps, run timeout after 30001 ms. (steps per millisecond=109 ) properties seen :[0]
Probabilistic random walk after 3284724 steps, saw 433102 distinct states, run finished after 30001 ms. (steps per millisecond=109 ) properties seen :[0]
// Phase 1: matrix 755 rows 770 cols
[2020-06-04 20:13:25] [INFO ] Computed 359 place invariants in 2 ms
[2020-06-04 20:13:26] [INFO ] [Real]Absence check using 359 positive place invariants in 211 ms returned sat
[2020-06-04 20:13:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:13:27] [INFO ] [Real]Absence check using state equation in 1172 ms returned sat
[2020-06-04 20:13:27] [INFO ] State equation strengthened by 59 read => feed constraints.
[2020-06-04 20:13:27] [INFO ] [Real]Added 59 Read/Feed constraints in 17 ms returned sat
[2020-06-04 20:13:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:13:27] [INFO ] [Nat]Absence check using 359 positive place invariants in 145 ms returned sat
[2020-06-04 20:13:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:13:28] [INFO ] [Nat]Absence check using state equation in 1051 ms returned sat
[2020-06-04 20:13:28] [INFO ] [Nat]Added 59 Read/Feed constraints in 12 ms returned sat
[2020-06-04 20:13:28] [INFO ] Computed and/alt/rep : 747/1732/747 causal constraints in 42 ms.
[2020-06-04 20:13:41] [INFO ] Added : 668 causal constraints over 134 iterations in 12970 ms. Result :unknown
Incomplete Parikh walk after 91200 steps, including 942 resets, run finished after 529 ms. (steps per millisecond=172 ) properties seen :[0] could not realise parikh vector
Support contains 9 out of 770 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 770/770 places, 755/755 transitions.
Applied a total of 0 rules in 12 ms. Remains 770 /770 variables (removed 0) and now considering 755/755 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 770/770 places, 755/755 transitions.
Starting structural reductions, iteration 0 : 770/770 places, 755/755 transitions.
Applied a total of 0 rules in 12 ms. Remains 770 /770 variables (removed 0) and now considering 755/755 (removed 0) transitions.
// Phase 1: matrix 755 rows 770 cols
[2020-06-04 20:13:42] [INFO ] Computed 359 place invariants in 2 ms
[2020-06-04 20:13:44] [INFO ] Implicit Places using invariants in 1798 ms returned [759]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1802 ms to find 1 implicit places.
[2020-06-04 20:13:44] [INFO ] Redundant transitions in 38 ms returned []
// Phase 1: matrix 755 rows 769 cols
[2020-06-04 20:13:44] [INFO ] Computed 358 place invariants in 2 ms
[2020-06-04 20:13:45] [INFO ] Dead Transitions using invariants and state equation in 1204 ms returned []
Starting structural reductions, iteration 1 : 769/770 places, 755/755 transitions.
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 769 transition count 755
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 768 transition count 754
Applied a total of 3 rules in 29 ms. Remains 768 /769 variables (removed 1) and now considering 754/755 (removed 1) transitions.
// Phase 1: matrix 754 rows 768 cols
[2020-06-04 20:13:45] [INFO ] Computed 358 place invariants in 2 ms
[2020-06-04 20:13:46] [INFO ] Implicit Places using invariants in 1407 ms returned []
// Phase 1: matrix 754 rows 768 cols
[2020-06-04 20:13:46] [INFO ] Computed 358 place invariants in 2 ms
[2020-06-04 20:13:47] [INFO ] State equation strengthened by 58 read => feed constraints.
[2020-06-04 20:13:52] [INFO ] Implicit Places using invariants and state equation in 5912 ms returned []
Implicit Place search using SMT with State Equation took 7320 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 768/770 places, 754/755 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 5787 ms. (steps per millisecond=172 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4297 ms. (steps per millisecond=232 ) properties seen :[0]
Interrupted probabilistic random walk after 3306307 steps, run timeout after 30001 ms. (steps per millisecond=110 ) properties seen :[0]
Probabilistic random walk after 3306307 steps, saw 414824 distinct states, run finished after 30001 ms. (steps per millisecond=110 ) properties seen :[0]
// Phase 1: matrix 754 rows 768 cols
[2020-06-04 20:14:32] [INFO ] Computed 358 place invariants in 2 ms
[2020-06-04 20:14:32] [INFO ] [Real]Absence check using 358 positive place invariants in 137 ms returned sat
[2020-06-04 20:14:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:14:34] [INFO ] [Real]Absence check using state equation in 1181 ms returned sat
[2020-06-04 20:14:34] [INFO ] State equation strengthened by 58 read => feed constraints.
[2020-06-04 20:14:34] [INFO ] [Real]Added 58 Read/Feed constraints in 11 ms returned sat
[2020-06-04 20:14:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:14:34] [INFO ] [Nat]Absence check using 358 positive place invariants in 192 ms returned sat
[2020-06-04 20:14:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:14:35] [INFO ] [Nat]Absence check using state equation in 1181 ms returned sat
[2020-06-04 20:14:35] [INFO ] [Nat]Added 58 Read/Feed constraints in 13 ms returned sat
[2020-06-04 20:14:35] [INFO ] Computed and/alt/rep : 746/1726/746 causal constraints in 55 ms.
[2020-06-04 20:14:50] [INFO ] Added : 663 causal constraints over 133 iterations in 14497 ms. Result :unknown
Incomplete Parikh walk after 122100 steps, including 1000 resets, run finished after 889 ms. (steps per millisecond=137 ) properties seen :[0] could not realise parikh vector
Support contains 9 out of 768 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 768/768 places, 754/754 transitions.
Applied a total of 0 rules in 20 ms. Remains 768 /768 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 754/754 transitions.
Starting structural reductions, iteration 0 : 768/768 places, 754/754 transitions.
Applied a total of 0 rules in 21 ms. Remains 768 /768 variables (removed 0) and now considering 754/754 (removed 0) transitions.
// Phase 1: matrix 754 rows 768 cols
[2020-06-04 20:14:51] [INFO ] Computed 358 place invariants in 2 ms
[2020-06-04 20:14:52] [INFO ] Implicit Places using invariants in 1700 ms returned []
// Phase 1: matrix 754 rows 768 cols
[2020-06-04 20:14:52] [INFO ] Computed 358 place invariants in 2 ms
[2020-06-04 20:14:54] [INFO ] State equation strengthened by 58 read => feed constraints.
[2020-06-04 20:14:58] [INFO ] Implicit Places using invariants and state equation in 5885 ms returned []
Implicit Place search using SMT with State Equation took 7587 ms to find 0 implicit places.
[2020-06-04 20:14:58] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 754 rows 768 cols
[2020-06-04 20:14:58] [INFO ] Computed 358 place invariants in 4 ms
[2020-06-04 20:15:00] [INFO ] Dead Transitions using invariants and state equation in 1518 ms returned []
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 754/754 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 606 ms. (steps per millisecond=165 ) properties seen :[0]
// Phase 1: matrix 754 rows 768 cols
[2020-06-04 20:15:00] [INFO ] Computed 358 place invariants in 2 ms
[2020-06-04 20:15:01] [INFO ] [Real]Absence check using 358 positive place invariants in 190 ms returned sat
[2020-06-04 20:15:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:15:02] [INFO ] [Real]Absence check using state equation in 1154 ms returned sat
[2020-06-04 20:15:02] [INFO ] State equation strengthened by 58 read => feed constraints.
[2020-06-04 20:15:02] [INFO ] [Real]Added 58 Read/Feed constraints in 17 ms returned sat
[2020-06-04 20:15:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:15:02] [INFO ] [Nat]Absence check using 358 positive place invariants in 226 ms returned sat
[2020-06-04 20:15:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:15:03] [INFO ] [Nat]Absence check using state equation in 1062 ms returned sat
[2020-06-04 20:15:03] [INFO ] [Nat]Added 58 Read/Feed constraints in 18 ms returned sat
[2020-06-04 20:15:04] [INFO ] Computed and/alt/rep : 746/1726/746 causal constraints in 48 ms.
[2020-06-04 20:15:19] [INFO ] Added : 663 causal constraints over 133 iterations in 15075 ms. Result :unknown
Partial Free-agglomeration rule applied 96 times.
Drop transitions removed 96 transitions
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 768 transition count 754
Partial Post-agglomeration rule applied 89 times.
Drop transitions removed 89 transitions
Iterating global reduction 0 with 89 rules applied. Total rules applied 185 place count 768 transition count 754
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 188 place count 768 transition count 751
Applied a total of 188 rules in 94 ms. Remains 768 /768 variables (removed 0) and now considering 751/754 (removed 3) transitions.
// Phase 1: matrix 751 rows 768 cols
[2020-06-04 20:15:19] [INFO ] Computed 358 place invariants in 3 ms
[2020-06-04 20:15:19] [INFO ] [Real]Absence check using 358 positive place invariants in 201 ms returned sat
[2020-06-04 20:15:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:15:20] [INFO ] [Real]Absence check using state equation in 1246 ms returned sat
[2020-06-04 20:15:20] [INFO ] State equation strengthened by 89 read => feed constraints.
[2020-06-04 20:15:20] [INFO ] [Real]Added 89 Read/Feed constraints in 15 ms returned sat
[2020-06-04 20:15:20] [INFO ] Computed and/alt/rep : 743/2093/743 causal constraints in 54 ms.
[2020-06-04 20:15:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:15:21] [INFO ] [Nat]Absence check using 358 positive place invariants in 191 ms returned sat
[2020-06-04 20:15:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:15:22] [INFO ] [Nat]Absence check using state equation in 1413 ms returned sat
[2020-06-04 20:15:22] [INFO ] [Nat]Added 89 Read/Feed constraints in 27 ms returned sat
[2020-06-04 20:15:22] [INFO ] Deduced a trap composed of 6 places in 46 ms
[2020-06-04 20:15:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2020-06-04 20:15:23] [INFO ] Computed and/alt/rep : 743/2093/743 causal constraints in 71 ms.
[2020-06-04 20:15:33] [INFO ] Added : 610 causal constraints over 122 iterations in 11020 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-06-04 20:15:34] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2020-06-04 20:15:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 19 ms.
[2020-06-04 20:15:34] [INFO ] Flatten gal took : 127 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldIIPt-PT-040B @ 3570 seconds
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityFireability @ ShieldIIPt-PT-040B

{
"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 20:15:34 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 27476,
"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": 3,
"adisj": 2,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A (G (((p154 <= 0) OR (p659 <= 0) OR (p79 <= 0) OR ((1 <= p569) AND (1 <= p574) AND (1 <= p581) AND (1 <= p754) AND (((1 <= p443)) OR ((1 <= p311)))))))",
"processed_size": 156,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 3735,
"conflict_clusters": 255,
"places": 768,
"places_significant": 410,
"singleton_clusters": 0,
"transitions": 754
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 21,
"problems": 5
},
"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: 1522/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 24576
lola: finding significant places
lola: 768 places, 754 transitions, 410 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: (p154 <= 1)
lola: LP says that atomic proposition is always true: (p659 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p569 <= 1)
lola: LP says that atomic proposition is always true: (p574 <= 1)
lola: LP says that atomic proposition is always true: (p581 <= 1)
lola: LP says that atomic proposition is always true: (p754 <= 1)
lola: LP says that atomic proposition is always true: (p443 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: A (G (((p154 <= 0) OR (p659 <= 0) OR (p79 <= 0) OR ((1 <= p569) AND (1 <= p574) AND (1 <= p581) AND (1 <= p754) AND (((1 <= p443)) OR ((1 <= p311)))))))
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 (((p154 <= 0) OR (p659 <= 0) OR (p79 <= 0) OR ((1 <= p569) AND (1 <= p574) AND (1 <= p581) AND (1 <= p754) AND (((1 <= p443)) OR ((1 <= p311)))))))
lola: processed formula length: 156
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: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p154) AND (1 <= p659) AND (1 <= p79) AND ((p569 <= 0) OR (p574 <= 0) OR (p581 <= 0) OR (p754 <= 0) OR (((p443 <= 0)) AND ((p311 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 21 literals and 5 conjunctive subformulas
lola: memory consumption: 27476 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="ShieldIIPt-PT-040B"
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 ShieldIIPt-PT-040B, 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-159033477300359"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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