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.r113-smll-162075355700064.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is FlexibleBarrier-PT-18b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-162075355700064
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 159K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 11:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 11:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 19:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 19:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 FlexibleBarrier-PT-18b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620931989617

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 18:53:12] [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-13 18:53:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 18:53:13] [INFO ] Load time of PNML (sax parser for PT used): 399 ms
[2021-05-13 18:53:13] [INFO ] Transformed 4370 places.
[2021-05-13 18:53:13] [INFO ] Transformed 5037 transitions.
[2021-05-13 18:53:13] [INFO ] Found NUPN structural information;
[2021-05-13 18:53:13] [INFO ] Parsed PT model containing 4370 places and 5037 transitions in 498 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 116 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 82 resets, run finished after 155 ms. (steps per millisecond=64 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1]
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 5037 rows 4370 cols
[2021-05-13 18:53:14] [INFO ] Computed 20 place invariants in 389 ms
[2021-05-13 18:53:16] [INFO ] [Real]Absence check using 20 positive place invariants in 362 ms returned sat
[2021-05-13 18:53:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:53:19] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 18:53:19] [INFO ] [Real]Absence check using state equation in 3333 ms returned (error "Failed to check-sat")
[2021-05-13 18:53:21] [INFO ] [Real]Absence check using 20 positive place invariants in 535 ms returned sat
[2021-05-13 18:53:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:53:24] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 18:53:24] [INFO ] [Real]Absence check using state equation in 3380 ms returned (error "Failed to check-sat")
[2021-05-13 18:53:25] [INFO ] [Real]Absence check using 20 positive place invariants in 326 ms returned sat
[2021-05-13 18:53:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:53:29] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 18:53:29] [INFO ] [Real]Absence check using state equation in 3677 ms returned (error "Failed to check-sat")
[2021-05-13 18:53:30] [INFO ] [Real]Absence check using 20 positive place invariants in 500 ms returned sat
[2021-05-13 18:53:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:53:34] [INFO ] [Real]Absence check using state equation in 3800 ms returned (error "Solver has unexpectedly terminated")
[2021-05-13 18:53:35] [INFO ] [Real]Absence check using 20 positive place invariants in 324 ms returned sat
[2021-05-13 18:53:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:53:39] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 18:53:39] [INFO ] [Real]Absence check using state equation in 3867 ms returned (error "Failed to check-sat")
[2021-05-13 18:53:40] [INFO ] [Real]Absence check using 20 positive place invariants in 322 ms returned sat
[2021-05-13 18:53:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:53:44] [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 (= s485 (- t5021 t3832))") while checking expression at index 5
[2021-05-13 18:53:45] [INFO ] [Real]Absence check using 20 positive place invariants in 471 ms returned sat
[2021-05-13 18:53:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:53:49] [INFO ] [Real]Absence check using state equation in 3777 ms returned (error "Solver has unexpectedly terminated")
[2021-05-13 18:53:50] [INFO ] [Real]Absence check using 20 positive place invariants in 309 ms returned sat
[2021-05-13 18:53:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:53:54] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 18:53:54] [INFO ] [Real]Absence check using state equation in 4020 ms returned (error "Failed to check-sat")
[2021-05-13 18:53:55] [INFO ] [Real]Absence check using 20 positive place invariants in 321 ms returned sat
[2021-05-13 18:53:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:53:59] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 18:53:59] [INFO ] [Real]Absence check using state equation in 4019 ms returned (error "Failed to check-sat")
[2021-05-13 18:54:00] [INFO ] [Real]Absence check using 20 positive place invariants in 325 ms returned sat
[2021-05-13 18:54:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:54:04] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 18:54:04] [INFO ] [Real]Absence check using state equation in 3808 ms returned (error "Failed to check-sat")
[2021-05-13 18:54:05] [INFO ] [Real]Absence check using 20 positive place invariants in 468 ms returned sat
[2021-05-13 18:54:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:54:09] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 18:54:09] [INFO ] [Real]Absence check using state equation in 3872 ms returned (error "Failed to check-sat")
[2021-05-13 18:54:10] [INFO ] [Real]Absence check using 20 positive place invariants in 298 ms returned unsat
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 45 out of 4370 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4370/4370 places, 5037/5037 transitions.
Graph (trivial) has 3544 edges and 4370 vertex of which 86 / 4370 are part of one of the 14 SCC in 28 ms
Free SCC test removed 72 places
Drop transitions removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Performed 773 Post agglomeration using F-continuation condition.Transition count delta: 773
Iterating post reduction 0 with 860 rules applied. Total rules applied 861 place count 4298 transition count 4177
Reduce places removed 773 places and 0 transitions.
Iterating post reduction 1 with 773 rules applied. Total rules applied 1634 place count 3525 transition count 4177
Performed 586 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 586 Pre rules applied. Total rules applied 1634 place count 3525 transition count 3591
Deduced a syphon composed of 586 places in 13 ms
Reduce places removed 586 places and 0 transitions.
Iterating global reduction 2 with 1172 rules applied. Total rules applied 2806 place count 2939 transition count 3591
Symmetric choice reduction at 2 with 1748 rule applications. Total rules 4554 place count 2939 transition count 3591
Deduced a syphon composed of 1748 places in 12 ms
Reduce places removed 1748 places and 1748 transitions.
Iterating global reduction 2 with 3496 rules applied. Total rules applied 8050 place count 1191 transition count 1843
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 8050 place count 1191 transition count 1829
Deduced a syphon composed of 14 places in 7 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 8078 place count 1177 transition count 1829
Symmetric choice reduction at 2 with 276 rule applications. Total rules 8354 place count 1177 transition count 1829
Deduced a syphon composed of 276 places in 2 ms
Reduce places removed 276 places and 276 transitions.
Iterating global reduction 2 with 552 rules applied. Total rules applied 8906 place count 901 transition count 1553
Ensure Unique test removed 265 transitions
Reduce isomorphic transitions removed 265 transitions.
Iterating post reduction 2 with 265 rules applied. Total rules applied 9171 place count 901 transition count 1288
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 9375 place count 799 transition count 1186
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 9383 place count 795 transition count 1186
Free-agglomeration rule applied 270 times.
Iterating global reduction 3 with 270 rules applied. Total rules applied 9653 place count 795 transition count 916
Reduce places removed 270 places and 0 transitions.
Iterating post reduction 3 with 270 rules applied. Total rules applied 9923 place count 525 transition count 916
Symmetric choice reduction at 4 with 46 rule applications. Total rules 9969 place count 525 transition count 916
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 46 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 10061 place count 479 transition count 870
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 4 with 46 rules applied. Total rules applied 10107 place count 479 transition count 824
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 10112 place count 479 transition count 824
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 10126 place count 479 transition count 810
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 10127 place count 478 transition count 809
Applied a total of 10127 rules in 2680 ms. Remains 478 /4370 variables (removed 3892) and now considering 809/5037 (removed 4228) transitions.
Finished structural reductions, in 1 iterations. Remains : 478/4370 places, 809/5037 transitions.
Incomplete random walk after 1000000 steps, including 8739 resets, run finished after 4294 ms. (steps per millisecond=232 ) properties seen :[1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1]
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 311 resets, run finished after 752 ms. (steps per millisecond=1329 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1012 resets, run finished after 902 ms. (steps per millisecond=1108 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1006 resets, run finished after 805 ms. (steps per millisecond=1242 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 890 resets, run finished after 1163 ms. (steps per millisecond=859 ) properties seen :[0, 0, 0, 0]
[2021-05-13 18:54:21] [INFO ] Flow matrix only has 779 transitions (discarded 30 similar events)
// Phase 1: matrix 779 rows 478 cols
[2021-05-13 18:54:21] [INFO ] Computed 20 place invariants in 15 ms
[2021-05-13 18:54:21] [INFO ] [Real]Absence check using 20 positive place invariants in 30 ms returned sat
[2021-05-13 18:54:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:54:22] [INFO ] [Real]Absence check using state equation in 1016 ms returned sat
[2021-05-13 18:54:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 18:54:22] [INFO ] [Real]Added 1 Read/Feed constraints in 7 ms returned sat
[2021-05-13 18:54:22] [INFO ] Computed and/alt/rep : 796/2139/766 causal constraints in 74 ms.
[2021-05-13 18:54:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:54:23] [INFO ] [Nat]Absence check using 20 positive place invariants in 93 ms returned sat
[2021-05-13 18:54:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:54:24] [INFO ] [Nat]Absence check using state equation in 1177 ms returned sat
[2021-05-13 18:54:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2021-05-13 18:54:24] [INFO ] Computed and/alt/rep : 796/2139/766 causal constraints in 73 ms.
[2021-05-13 18:54:28] [INFO ] Added : 233 causal constraints over 47 iterations in 3591 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2021-05-13 18:54:28] [INFO ] [Real]Absence check using 20 positive place invariants in 53 ms returned sat
[2021-05-13 18:54:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:54:29] [INFO ] [Real]Absence check using state equation in 1137 ms returned sat
[2021-05-13 18:54:29] [INFO ] [Real]Added 1 Read/Feed constraints in 7 ms returned sat
[2021-05-13 18:54:29] [INFO ] Deduced a trap composed of 260 places in 263 ms
[2021-05-13 18:54:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 326 ms
[2021-05-13 18:54:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:54:30] [INFO ] [Nat]Absence check using 20 positive place invariants in 41 ms returned sat
[2021-05-13 18:54:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:54:31] [INFO ] [Nat]Absence check using state equation in 1025 ms returned sat
[2021-05-13 18:54:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2021-05-13 18:54:31] [INFO ] Deduced a trap composed of 260 places in 352 ms
[2021-05-13 18:54:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 421 ms
[2021-05-13 18:54:31] [INFO ] Computed and/alt/rep : 796/2139/766 causal constraints in 85 ms.
[2021-05-13 18:54:34] [INFO ] Added : 229 causal constraints over 46 iterations in 2966 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2021-05-13 18:54:34] [INFO ] [Real]Absence check using 20 positive place invariants in 48 ms returned sat
[2021-05-13 18:54:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:54:35] [INFO ] [Real]Absence check using state equation in 968 ms returned sat
[2021-05-13 18:54:35] [INFO ] [Real]Added 1 Read/Feed constraints in 7 ms returned sat
[2021-05-13 18:54:36] [INFO ] Computed and/alt/rep : 796/2139/766 causal constraints in 47 ms.
[2021-05-13 18:54:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:54:36] [INFO ] [Nat]Absence check using 20 positive place invariants in 50 ms returned sat
[2021-05-13 18:54:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:54:37] [INFO ] [Nat]Absence check using state equation in 970 ms returned sat
[2021-05-13 18:54:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2021-05-13 18:54:37] [INFO ] Computed and/alt/rep : 796/2139/766 causal constraints in 48 ms.
[2021-05-13 18:54:40] [INFO ] Added : 233 causal constraints over 47 iterations in 3231 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2021-05-13 18:54:40] [INFO ] [Real]Absence check using 20 positive place invariants in 52 ms returned sat
[2021-05-13 18:54:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:54:41] [INFO ] [Real]Absence check using state equation in 1088 ms returned sat
[2021-05-13 18:54:41] [INFO ] [Real]Added 1 Read/Feed constraints in 7 ms returned sat
[2021-05-13 18:54:42] [INFO ] Deduced a trap composed of 268 places in 306 ms
[2021-05-13 18:54:42] [INFO ] Deduced a trap composed of 261 places in 367 ms
[2021-05-13 18:54:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 779 ms
[2021-05-13 18:54:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:54:42] [INFO ] [Nat]Absence check using 20 positive place invariants in 95 ms returned sat
[2021-05-13 18:54:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:54:43] [INFO ] [Nat]Absence check using state equation in 1033 ms returned sat
[2021-05-13 18:54:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2021-05-13 18:54:44] [INFO ] Computed and/alt/rep : 796/2139/766 causal constraints in 47 ms.
[2021-05-13 18:54:47] [INFO ] Added : 220 causal constraints over 44 iterations in 3156 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
Incomplete Parikh walk after 45000 steps, including 576 resets, run finished after 432 ms. (steps per millisecond=104 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 52400 steps, including 634 resets, run finished after 419 ms. (steps per millisecond=125 ) properties seen :[0, 0, 1, 0] could not realise parikh vector
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 51800 steps, including 635 resets, run finished after 337 ms. (steps per millisecond=153 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 53200 steps, including 622 resets, run finished after 245 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 22 out of 478 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 478/478 places, 809/809 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 478 transition count 806
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 475 transition count 806
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 475 transition count 805
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 8 place count 474 transition count 805
Symmetric choice reduction at 2 with 5 rule applications. Total rules 13 place count 474 transition count 805
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 469 transition count 800
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 37 place count 462 transition count 793
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 462 transition count 792
Symmetric choice reduction at 3 with 6 rule applications. Total rules 44 place count 462 transition count 792
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 56 place count 456 transition count 786
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 62 place count 456 transition count 780
Free-agglomeration rule applied 7 times with reduction of 2 identical transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 69 place count 456 transition count 771
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 78 place count 449 transition count 769
Symmetric choice reduction at 5 with 20 rule applications. Total rules 98 place count 449 transition count 769
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 20 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 138 place count 429 transition count 749
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 158 place count 429 transition count 729
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 159 place count 429 transition count 728
Applied a total of 159 rules in 100 ms. Remains 429 /478 variables (removed 49) and now considering 728/809 (removed 81) transitions.
Finished structural reductions, in 1 iterations. Remains : 429/478 places, 728/809 transitions.
Incomplete random walk after 1000000 steps, including 5922 resets, run finished after 3572 ms. (steps per millisecond=279 ) properties seen :[0, 0, 1]
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 338 resets, run finished after 800 ms. (steps per millisecond=1250 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 729 resets, run finished after 902 ms. (steps per millisecond=1108 ) properties seen :[0, 0]
[2021-05-13 18:54:54] [INFO ] Flow matrix only has 698 transitions (discarded 30 similar events)
// Phase 1: matrix 698 rows 429 cols
[2021-05-13 18:54:54] [INFO ] Computed 20 place invariants in 8 ms
[2021-05-13 18:54:54] [INFO ] [Real]Absence check using 20 positive place invariants in 28 ms returned sat
[2021-05-13 18:54:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:54:55] [INFO ] [Real]Absence check using state equation in 867 ms returned sat
[2021-05-13 18:54:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 18:54:55] [INFO ] [Real]Added 1 Read/Feed constraints in 7 ms returned sat
[2021-05-13 18:54:55] [INFO ] Computed and/alt/rep : 722/1650/692 causal constraints in 43 ms.
[2021-05-13 18:54:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:54:55] [INFO ] [Nat]Absence check using 20 positive place invariants in 28 ms returned sat
[2021-05-13 18:54:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:54:56] [INFO ] [Nat]Absence check using state equation in 1050 ms returned sat
[2021-05-13 18:54:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2021-05-13 18:54:56] [INFO ] Computed and/alt/rep : 722/1650/692 causal constraints in 45 ms.
[2021-05-13 18:54:59] [INFO ] Added : 210 causal constraints over 42 iterations in 2591 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2021-05-13 18:54:59] [INFO ] [Real]Absence check using 20 positive place invariants in 41 ms returned sat
[2021-05-13 18:54:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:55:00] [INFO ] [Real]Absence check using state equation in 848 ms returned sat
[2021-05-13 18:55:00] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2021-05-13 18:55:00] [INFO ] Computed and/alt/rep : 722/1650/692 causal constraints in 46 ms.
[2021-05-13 18:55:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:55:00] [INFO ] [Nat]Absence check using 20 positive place invariants in 46 ms returned sat
[2021-05-13 18:55:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:55:01] [INFO ] [Nat]Absence check using state equation in 937 ms returned sat
[2021-05-13 18:55:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2021-05-13 18:55:01] [INFO ] Computed and/alt/rep : 722/1650/692 causal constraints in 44 ms.
[2021-05-13 18:55:04] [INFO ] Added : 218 causal constraints over 44 iterations in 2674 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
Incomplete Parikh walk after 46100 steps, including 618 resets, run finished after 349 ms. (steps per millisecond=132 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 45400 steps, including 594 resets, run finished after 304 ms. (steps per millisecond=149 ) properties seen :[0, 0] could not realise parikh vector
Support contains 10 out of 429 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 429/429 places, 728/728 transitions.
Graph (trivial) has 72 edges and 429 vertex of which 6 / 429 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 426 transition count 720
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 424 transition count 720
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 11 place count 424 transition count 718
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 15 place count 422 transition count 718
Symmetric choice reduction at 2 with 4 rule applications. Total rules 19 place count 422 transition count 718
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 27 place count 418 transition count 714
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 418 transition count 714
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 417 transition count 713
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 417 transition count 712
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 47 place count 409 transition count 704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 409 transition count 703
Symmetric choice reduction at 4 with 3 rule applications. Total rules 51 place count 409 transition count 703
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 57 place count 406 transition count 700
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 60 place count 406 transition count 697
Free-agglomeration rule applied 48 times.
Iterating global reduction 5 with 48 rules applied. Total rules applied 108 place count 406 transition count 649
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 156 place count 358 transition count 649
Symmetric choice reduction at 6 with 41 rule applications. Total rules 197 place count 358 transition count 649
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 41 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 279 place count 317 transition count 608
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 6 with 41 rules applied. Total rules applied 320 place count 317 transition count 567
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 323 place count 317 transition count 564
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 326 place count 317 transition count 561
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 329 place count 314 transition count 561
Applied a total of 329 rules in 96 ms. Remains 314 /429 variables (removed 115) and now considering 561/728 (removed 167) transitions.
Finished structural reductions, in 1 iterations. Remains : 314/429 places, 561/728 transitions.
Incomplete random walk after 1000000 steps, including 4969 resets, run finished after 3613 ms. (steps per millisecond=276 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 420 resets, run finished after 872 ms. (steps per millisecond=1146 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 580 resets, run finished after 868 ms. (steps per millisecond=1152 ) properties seen :[0, 1]
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2021-05-13 18:55:10] [INFO ] Flow matrix only has 528 transitions (discarded 33 similar events)
// Phase 1: matrix 528 rows 314 cols
[2021-05-13 18:55:10] [INFO ] Computed 20 place invariants in 5 ms
[2021-05-13 18:55:10] [INFO ] [Real]Absence check using 20 positive place invariants in 23 ms returned sat
[2021-05-13 18:55:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:55:10] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2021-05-13 18:55:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 18:55:10] [INFO ] [Real]Added 1 Read/Feed constraints in 7 ms returned sat
[2021-05-13 18:55:11] [INFO ] Computed and/alt/rep : 558/760/525 causal constraints in 47 ms.
[2021-05-13 18:55:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:55:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 53 ms returned sat
[2021-05-13 18:55:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:55:11] [INFO ] [Nat]Absence check using state equation in 647 ms returned sat
[2021-05-13 18:55:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-13 18:55:11] [INFO ] Computed and/alt/rep : 558/760/525 causal constraints in 40 ms.
[2021-05-13 18:55:12] [INFO ] Added : 74 causal constraints over 15 iterations in 485 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
Incomplete Parikh walk after 18000 steps, including 218 resets, run finished after 130 ms. (steps per millisecond=138 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 314 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 314/314 places, 561/561 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 310 transition count 557
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 310 transition count 557
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 20 place count 306 transition count 553
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 306 transition count 549
Applied a total of 24 rules in 30 ms. Remains 306 /314 variables (removed 8) and now considering 549/561 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/314 places, 549/561 transitions.
Finished random walk after 449600 steps, including 2227 resets, run visited all 1 properties in 1792 ms. (steps per millisecond=250 )
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

--------------------
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="FlexibleBarrier-PT-18b"
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 FlexibleBarrier-PT-18b, 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 r113-smll-162075355700064"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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