fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r151-tall-162089151200148
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for NoC3x3-PT-5A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9183.323 3600000.00 358284.00 896.60 TTTFTTFFTTTFTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r151-tall-162089151200148.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is NoC3x3-PT-5A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089151200148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 133K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 06:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 06:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 248K May 5 16:51 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 NoC3x3-PT-5A-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-5A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620997248978

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 13:00:50] [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]
[2021-05-14 13:00:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 13:00:50] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2021-05-14 13:00:50] [INFO ] Transformed 417 places.
[2021-05-14 13:00:50] [INFO ] Transformed 933 transitions.
[2021-05-14 13:00:50] [INFO ] Found NUPN structural information;
[2021-05-14 13:00:50] [INFO ] Parsed PT model containing 417 places and 933 transitions in 144 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 97 ms. (steps per millisecond=103 ) properties seen :[0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1]
FORMULA NoC3x3-PT-5A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 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 16 ms. (steps per millisecond=625 ) 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 25 ms. (steps per millisecond=400 ) properties seen :[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]
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, 1]
FORMULA NoC3x3-PT-5A-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2021-05-14 13:00:50] [INFO ] Flow matrix only has 851 transitions (discarded 82 similar events)
// Phase 1: matrix 851 rows 417 cols
[2021-05-14 13:00:50] [INFO ] Computed 66 place invariants in 17 ms
[2021-05-14 13:00:51] [INFO ] [Real]Absence check using 66 positive place invariants in 45 ms returned sat
[2021-05-14 13:00:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:00:51] [INFO ] [Real]Absence check using state equation in 553 ms returned sat
[2021-05-14 13:00:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:00:51] [INFO ] [Nat]Absence check using 66 positive place invariants in 35 ms returned sat
[2021-05-14 13:00:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:00:52] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2021-05-14 13:00:52] [INFO ] State equation strengthened by 50 read => feed constraints.
[2021-05-14 13:00:52] [INFO ] [Nat]Added 50 Read/Feed constraints in 175 ms returned sat
[2021-05-14 13:00:52] [INFO ] Deduced a trap composed of 38 places in 81 ms
[2021-05-14 13:00:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2021-05-14 13:00:52] [INFO ] Computed and/alt/rep : 932/7863/850 causal constraints in 60 ms.
[2021-05-14 13:00:56] [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 (=> (> t219 0) (and (or (and (> t206 0) (< o206 o219)) (and (> t208 0) (< o208 o219)) (and (> t217 0) (< o217 o219)) (and (> t224 0) (< o224 o219)) (and (> t227 0) (< o227 o219)) (and (> t229 0) (< o229 o219))) (or (and (> t224 0) (< o224 o219)) (and (> t225 0) (< o225 o219)))))") while checking expression at index 0
[2021-05-14 13:00:56] [INFO ] [Real]Absence check using 66 positive place invariants in 29 ms returned sat
[2021-05-14 13:00:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:00:57] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2021-05-14 13:00:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:00:57] [INFO ] [Nat]Absence check using 66 positive place invariants in 37 ms returned sat
[2021-05-14 13:00:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:00:58] [INFO ] [Nat]Absence check using state equation in 607 ms returned sat
[2021-05-14 13:00:58] [INFO ] [Nat]Added 50 Read/Feed constraints in 131 ms returned sat
[2021-05-14 13:00:58] [INFO ] Computed and/alt/rep : 932/7863/850 causal constraints in 51 ms.
[2021-05-14 13:01:02] [INFO ] Added : 140 causal constraints over 28 iterations in 4155 ms. Result :(error "Solver has unexpectedly terminated")
[2021-05-14 13:01:02] [INFO ] [Real]Absence check using 66 positive place invariants in 14 ms returned unsat
[2021-05-14 13:01:02] [INFO ] [Real]Absence check using 66 positive place invariants in 30 ms returned sat
[2021-05-14 13:01:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:01:03] [INFO ] [Real]Absence check using state equation in 546 ms returned sat
[2021-05-14 13:01:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:01:03] [INFO ] [Nat]Absence check using 66 positive place invariants in 33 ms returned sat
[2021-05-14 13:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:01:03] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2021-05-14 13:01:03] [INFO ] [Nat]Added 50 Read/Feed constraints in 128 ms returned sat
[2021-05-14 13:01:03] [INFO ] Computed and/alt/rep : 932/7863/850 causal constraints in 61 ms.
[2021-05-14 13:01:08] [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 (=> (> t253 0) (and (or (and (> t250 0) (< o250 o253)) (and (> t252 0) (< o252 o253)) (and (> t254 0) (< o254 o253)) (and (> t260 0) (< o260 o253)) (and (> t264 0) (< o264 o253)) (and (> t266 0) (< o266 o253))) (or (and (> t173 0) (< o173 o253)) (and (> t174 0) (< o174 o253)) (and (> t175 0) (< o175 o253)) (and (> t176 0) (< o176 o253)))))") while checking expression at index 3
[2021-05-14 13:01:08] [INFO ] [Real]Absence check using 66 positive place invariants in 30 ms returned sat
[2021-05-14 13:01:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:01:08] [INFO ] [Real]Absence check using state equation in 559 ms returned sat
[2021-05-14 13:01:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:01:08] [INFO ] [Nat]Absence check using 66 positive place invariants in 47 ms returned sat
[2021-05-14 13:01:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:01:09] [INFO ] [Nat]Absence check using state equation in 585 ms returned sat
[2021-05-14 13:01:09] [INFO ] [Nat]Added 50 Read/Feed constraints in 176 ms returned sat
[2021-05-14 13:01:09] [INFO ] Computed and/alt/rep : 932/7863/850 causal constraints in 60 ms.
[2021-05-14 13:01:13] [INFO ] Added : 155 causal constraints over 31 iterations in 4124 ms. Result :unknown
[2021-05-14 13:01:13] [INFO ] [Real]Absence check using 66 positive place invariants in 30 ms returned sat
[2021-05-14 13:01:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:01:14] [INFO ] [Real]Absence check using state equation in 526 ms returned sat
[2021-05-14 13:01:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:01:14] [INFO ] [Nat]Absence check using 66 positive place invariants in 31 ms returned sat
[2021-05-14 13:01:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:01:15] [INFO ] [Nat]Absence check using state equation in 551 ms returned sat
[2021-05-14 13:01:15] [INFO ] [Nat]Added 50 Read/Feed constraints in 129 ms returned sat
[2021-05-14 13:01:15] [INFO ] Deduced a trap composed of 23 places in 25 ms
[2021-05-14 13:01:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2021-05-14 13:01:15] [INFO ] Computed and/alt/rep : 932/7863/850 causal constraints in 46 ms.
[2021-05-14 13:01:19] [INFO ] Added : 130 causal constraints over 26 iterations in 4179 ms. Result :unknown
FORMULA NoC3x3-PT-5A-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 168500 steps, including 997 resets, run finished after 837 ms. (steps per millisecond=201 ) properties seen :[1, 0, 0, 1, 1] could not realise parikh vector
FORMULA NoC3x3-PT-5A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-5A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 144900 steps, including 978 resets, run finished after 675 ms. (steps per millisecond=214 ) properties seen :[0, 0] could not realise parikh vector
Support contains 24 out of 417 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 417/417 places, 933/933 transitions.
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 417 transition count 933
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 100 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 162 place count 363 transition count 833
Symmetric choice reduction at 0 with 4 rule applications. Total rules 166 place count 363 transition count 833
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 16 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 174 place count 359 transition count 817
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 182 place count 359 transition count 809
Partial Free-agglomeration rule applied 32 times.
Drop transitions removed 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 214 place count 359 transition count 809
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 224 place count 359 transition count 799
Applied a total of 224 rules in 107 ms. Remains 359 /417 variables (removed 58) and now considering 799/933 (removed 134) transitions.
Finished structural reductions, in 1 iterations. Remains : 359/417 places, 799/933 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 3320 ms. (steps per millisecond=301 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1345 ms. (steps per millisecond=743 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1838 ms. (steps per millisecond=544 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 8608587 steps, run timeout after 30001 ms. (steps per millisecond=286 ) properties seen :[0, 0]
Probabilistic random walk after 8608587 steps, saw 353018 distinct states, run finished after 30001 ms. (steps per millisecond=286 ) properties seen :[0, 0]
[2021-05-14 13:01:57] [INFO ] Flow matrix only has 738 transitions (discarded 61 similar events)
// Phase 1: matrix 738 rows 359 cols
[2021-05-14 13:01:57] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 13:01:57] [INFO ] [Real]Absence check using 66 positive place invariants in 26 ms returned sat
[2021-05-14 13:01:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:01:58] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2021-05-14 13:01:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:01:58] [INFO ] [Nat]Absence check using 66 positive place invariants in 28 ms returned sat
[2021-05-14 13:01:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:01:58] [INFO ] [Nat]Absence check using state equation in 437 ms returned sat
[2021-05-14 13:01:58] [INFO ] State equation strengthened by 47 read => feed constraints.
[2021-05-14 13:01:58] [INFO ] [Nat]Added 47 Read/Feed constraints in 123 ms returned sat
[2021-05-14 13:01:58] [INFO ] Deduced a trap composed of 29 places in 70 ms
[2021-05-14 13:01:58] [INFO ] Deduced a trap composed of 29 places in 74 ms
[2021-05-14 13:01:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2021-05-14 13:01:58] [INFO ] Computed and/alt/rep : 798/6657/737 causal constraints in 40 ms.
[2021-05-14 13:02:20] [INFO ] Added : 425 causal constraints over 85 iterations in 21188 ms.(timeout) Result :sat
[2021-05-14 13:02:20] [INFO ] Deduced a trap composed of 21 places in 23 ms
[2021-05-14 13:02:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 559 ms
Attempting to minimize the solution found.
Minimization took 52 ms.
[2021-05-14 13:02:20] [INFO ] [Real]Absence check using 66 positive place invariants in 28 ms returned sat
[2021-05-14 13:02:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:02:21] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2021-05-14 13:02:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:02:21] [INFO ] [Nat]Absence check using 66 positive place invariants in 30 ms returned sat
[2021-05-14 13:02:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:02:21] [INFO ] [Nat]Absence check using state equation in 547 ms returned sat
[2021-05-14 13:02:21] [INFO ] [Nat]Added 47 Read/Feed constraints in 140 ms returned sat
[2021-05-14 13:02:21] [INFO ] Deduced a trap composed of 16 places in 19 ms
[2021-05-14 13:02:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2021-05-14 13:02:22] [INFO ] Computed and/alt/rep : 798/6657/737 causal constraints in 42 ms.
[2021-05-14 13:02:43] [INFO ] Added : 425 causal constraints over 85 iterations in 21231 ms.(timeout) Result :sat
[2021-05-14 13:02:43] [INFO ] Deduced a trap composed of 21 places in 31 ms
[2021-05-14 13:02:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2194 ms
Attempting to minimize the solution found.
Minimization took 66 ms.
Incomplete Parikh walk after 166900 steps, including 682 resets, run finished after 826 ms. (steps per millisecond=202 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 148500 steps, including 738 resets, run finished after 718 ms. (steps per millisecond=206 ) properties seen :[0, 0] could not realise parikh vector
Support contains 24 out of 359 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 359/359 places, 799/799 transitions.
Applied a total of 0 rules in 19 ms. Remains 359 /359 variables (removed 0) and now considering 799/799 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 359/359 places, 799/799 transitions.
Starting structural reductions, iteration 0 : 359/359 places, 799/799 transitions.
Applied a total of 0 rules in 18 ms. Remains 359 /359 variables (removed 0) and now considering 799/799 (removed 0) transitions.
[2021-05-14 13:02:47] [INFO ] Flow matrix only has 738 transitions (discarded 61 similar events)
// Phase 1: matrix 738 rows 359 cols
[2021-05-14 13:02:47] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 13:02:47] [INFO ] Implicit Places using invariants in 362 ms returned [13, 47, 85, 120, 174, 234, 273, 308, 345]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 365 ms to find 9 implicit places.
[2021-05-14 13:02:47] [INFO ] Redundant transitions in 107 ms returned []
[2021-05-14 13:02:47] [INFO ] Flow matrix only has 738 transitions (discarded 61 similar events)
// Phase 1: matrix 738 rows 350 cols
[2021-05-14 13:02:47] [INFO ] Computed 57 place invariants in 3 ms
[2021-05-14 13:02:48] [INFO ] Dead Transitions using invariants and state equation in 714 ms returned []
Starting structural reductions, iteration 1 : 350/359 places, 799/799 transitions.
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 350 transition count 799
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 350 transition count 795
Applied a total of 14 rules in 38 ms. Remains 350 /350 variables (removed 0) and now considering 795/799 (removed 4) transitions.
[2021-05-14 13:02:48] [INFO ] Flow matrix only has 734 transitions (discarded 61 similar events)
// Phase 1: matrix 734 rows 350 cols
[2021-05-14 13:02:48] [INFO ] Computed 57 place invariants in 3 ms
[2021-05-14 13:02:48] [INFO ] Implicit Places using invariants in 335 ms returned []
[2021-05-14 13:02:48] [INFO ] Flow matrix only has 734 transitions (discarded 61 similar events)
// Phase 1: matrix 734 rows 350 cols
[2021-05-14 13:02:48] [INFO ] Computed 57 place invariants in 3 ms
[2021-05-14 13:02:49] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-14 13:02:50] [INFO ] Implicit Places using invariants and state equation in 1829 ms returned []
Implicit Place search using SMT with State Equation took 2167 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 350/359 places, 795/799 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2882 ms. (steps per millisecond=346 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1262 ms. (steps per millisecond=792 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1699 ms. (steps per millisecond=588 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 9572821 steps, run timeout after 30001 ms. (steps per millisecond=319 ) properties seen :[0, 1]
Probabilistic random walk after 9572821 steps, saw 399641 distinct states, run finished after 30001 ms. (steps per millisecond=319 ) properties seen :[0, 1]
FORMULA NoC3x3-PT-5A-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2021-05-14 13:03:26] [INFO ] Flow matrix only has 734 transitions (discarded 61 similar events)
// Phase 1: matrix 734 rows 350 cols
[2021-05-14 13:03:26] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 13:03:26] [INFO ] [Real]Absence check using 57 positive place invariants in 23 ms returned sat
[2021-05-14 13:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:03:26] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2021-05-14 13:03:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:03:26] [INFO ] [Nat]Absence check using 57 positive place invariants in 29 ms returned sat
[2021-05-14 13:03:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:03:27] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2021-05-14 13:03:27] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-14 13:03:27] [INFO ] [Nat]Added 35 Read/Feed constraints in 134 ms returned sat
[2021-05-14 13:03:27] [INFO ] Computed and/alt/rep : 794/6734/733 causal constraints in 39 ms.
[2021-05-14 13:03:49] [INFO ] Added : 435 causal constraints over 87 iterations in 21978 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 45 ms.
Incomplete Parikh walk after 127500 steps, including 740 resets, run finished after 598 ms. (steps per millisecond=213 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 350 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 350/350 places, 795/795 transitions.
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 350 transition count 795
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 349 transition count 794
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 8 place count 349 transition count 794
Applied a total of 8 rules in 25 ms. Remains 349 /350 variables (removed 1) and now considering 794/795 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 349/350 places, 794/795 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 3563 ms. (steps per millisecond=280 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1215 ms. (steps per millisecond=823 ) properties seen :[0]
Interrupted probabilistic random walk after 9785118 steps, run timeout after 30060 ms. (steps per millisecond=325 ) properties seen :[0]
Probabilistic random walk after 9785118 steps, saw 405097 distinct states, run finished after 30061 ms. (steps per millisecond=325 ) properties seen :[0]
[2021-05-14 13:04:24] [INFO ] Flow matrix only has 733 transitions (discarded 61 similar events)
// Phase 1: matrix 733 rows 349 cols
[2021-05-14 13:04:24] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 13:04:25] [INFO ] [Real]Absence check using 57 positive place invariants in 24 ms returned sat
[2021-05-14 13:04:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:04:25] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2021-05-14 13:04:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:04:25] [INFO ] [Nat]Absence check using 57 positive place invariants in 28 ms returned sat
[2021-05-14 13:04:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:04:25] [INFO ] [Nat]Absence check using state equation in 462 ms returned sat
[2021-05-14 13:04:25] [INFO ] State equation strengthened by 38 read => feed constraints.
[2021-05-14 13:04:26] [INFO ] [Nat]Added 38 Read/Feed constraints in 153 ms returned sat
[2021-05-14 13:04:26] [INFO ] Deduced a trap composed of 18 places in 62 ms
[2021-05-14 13:04:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2021-05-14 13:04:26] [INFO ] Computed and/alt/rep : 793/6833/732 causal constraints in 39 ms.
[2021-05-14 13:04:48] [INFO ] Added : 410 causal constraints over 82 iterations in 21794 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 56 ms.
Incomplete Parikh walk after 120100 steps, including 746 resets, run finished after 583 ms. (steps per millisecond=206 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 349 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 349/349 places, 794/794 transitions.
Applied a total of 0 rules in 16 ms. Remains 349 /349 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 349/349 places, 794/794 transitions.
Starting structural reductions, iteration 0 : 349/349 places, 794/794 transitions.
Applied a total of 0 rules in 9 ms. Remains 349 /349 variables (removed 0) and now considering 794/794 (removed 0) transitions.
[2021-05-14 13:04:48] [INFO ] Flow matrix only has 733 transitions (discarded 61 similar events)
// Phase 1: matrix 733 rows 349 cols
[2021-05-14 13:04:48] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 13:04:49] [INFO ] Implicit Places using invariants in 347 ms returned []
[2021-05-14 13:04:49] [INFO ] Flow matrix only has 733 transitions (discarded 61 similar events)
// Phase 1: matrix 733 rows 349 cols
[2021-05-14 13:04:49] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 13:04:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2021-05-14 13:04:51] [INFO ] Implicit Places using invariants and state equation in 1982 ms returned []
Implicit Place search using SMT with State Equation took 2330 ms to find 0 implicit places.
[2021-05-14 13:04:51] [INFO ] Redundant transitions in 70 ms returned []
[2021-05-14 13:04:51] [INFO ] Flow matrix only has 733 transitions (discarded 61 similar events)
// Phase 1: matrix 733 rows 349 cols
[2021-05-14 13:04:51] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 13:04:51] [INFO ] Dead Transitions using invariants and state equation in 702 ms returned []
Finished structural reductions, in 1 iterations. Remains : 349/349 places, 794/794 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 309 ms. (steps per millisecond=323 ) properties seen :[0]
[2021-05-14 13:04:52] [INFO ] Flow matrix only has 733 transitions (discarded 61 similar events)
// Phase 1: matrix 733 rows 349 cols
[2021-05-14 13:04:52] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 13:04:52] [INFO ] [Real]Absence check using 57 positive place invariants in 24 ms returned sat
[2021-05-14 13:04:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:04:52] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2021-05-14 13:04:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:04:52] [INFO ] [Nat]Absence check using 57 positive place invariants in 29 ms returned sat
[2021-05-14 13:04:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:04:53] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2021-05-14 13:04:53] [INFO ] State equation strengthened by 38 read => feed constraints.
[2021-05-14 13:04:53] [INFO ] [Nat]Added 38 Read/Feed constraints in 153 ms returned sat
[2021-05-14 13:04:53] [INFO ] Deduced a trap composed of 18 places in 68 ms
[2021-05-14 13:04:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2021-05-14 13:04:53] [INFO ] Computed and/alt/rep : 793/6833/732 causal constraints in 36 ms.
[2021-05-14 13:05:12] [INFO ] Added : 405 causal constraints over 81 iterations in 19075 ms. Result :unknown
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 349 transition count 733
Symmetric choice reduction at 1 with 22 rule applications. Total rules 83 place count 349 transition count 733
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 22 transitions.
Iterating global reduction 1 with 44 rules applied. Total rules applied 127 place count 327 transition count 711
Partial Free-agglomeration rule applied 31 times.
Drop transitions removed 31 transitions
Iterating global reduction 1 with 31 rules applied. Total rules applied 158 place count 327 transition count 711
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 165 place count 327 transition count 704
Symmetric choice reduction at 2 with 2 rule applications. Total rules 167 place count 327 transition count 704
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 6 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 171 place count 325 transition count 698
Applied a total of 171 rules in 30 ms. Remains 325 /349 variables (removed 24) and now considering 698/794 (removed 96) transitions.
// Phase 1: matrix 698 rows 325 cols
[2021-05-14 13:05:12] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 13:05:12] [INFO ] [Real]Absence check using 57 positive place invariants in 22 ms returned sat
[2021-05-14 13:05:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:05:13] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2021-05-14 13:05:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:05:13] [INFO ] [Nat]Absence check using 57 positive place invariants in 27 ms returned sat
[2021-05-14 13:05:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:05:13] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2021-05-14 13:05:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-14 13:05:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 46 ms returned sat
[2021-05-14 13:05:13] [INFO ] Computed and/alt/rep : 697/6161/697 causal constraints in 35 ms.
[2021-05-14 13:05:34] [INFO ] Added : 410 causal constraints over 82 iterations in 20598 ms.(timeout) Result :sat
[2021-05-14 13:05:34] [INFO ] Deduced a trap composed of 15 places in 17 ms
[2021-05-14 13:05:35] [INFO ] Deduced a trap composed of 15 places in 15 ms
[2021-05-14 13:05:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1113 ms
Attempting to minimize the solution found.
Minimization took 37 ms.
[2021-05-14 13:05:35] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2021-05-14 13:05:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 13 ms.
[2021-05-14 13:05:35] [INFO ] Flatten gal took : 99 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ NoC3x3-PT-5A @ 3570 seconds

FORMULA NoC3x3-PT-5A-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3557
rslt: Output for ReachabilityFireability @ NoC3x3-PT-5A

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 14 13:05:36 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 24264,
"runtime": 13.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p4) AND (1 <= p15) AND (1 <= p254) AND (1 <= p269) AND (p154 <= 1) AND (1 <= p154) AND (1 <= p198))))",
"processed_size": 114,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 3124,
"conflict_clusters": 10,
"places": 349,
"places_significant": 292,
"singleton_clusters": 0,
"transitions": 794
},
"result":
{
"edges": 657,
"markings": 571,
"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": 7,
"problems": 7
},
"type": "reachability",
"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: 1143/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 349
lola: finding significant places
lola: 349 places, 794 transitions, 292 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: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p254 <= 1)
lola: LP says that atomic proposition is always true: (p269 <= 1)
lola: LP says that atomic proposition is always true: (p198 <= 1)
lola: E (F (((1 <= p4) AND (1 <= p15) AND (1 <= p254) AND (1 <= p269) AND (p154 <= 1) AND (1 <= p154) AND (1 <= p198))))
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p4) AND (1 <= p15) AND (1 <= p254) AND (1 <= p269) AND (p154 <= 1) AND (1 <= p154) AND (1 <= p198))))
lola: processed formula length: 114
lola: 1 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:711
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 <= p4) AND (1 <= p15) AND (1 <= p254) AND (1 <= p269) AND (p154 <= 1) AND (1 <= p154) AND (1 <= p198))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 7 literals and 1 conjunctive subformulas
lola: RESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 571 markings, 657 edges
lola: memory consumption: 24264 KB
lola: time consumption: 13 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="NoC3x3-PT-5A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is NoC3x3-PT-5A, 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 r151-tall-162089151200148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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