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.r075-tall-162039097400224.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 DLCround-PT-13b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097400224
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 09:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 09:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 16:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:10 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 2.1M 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 DLCround-PT-13b-ReachabilityFireability-00
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-01
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-02
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-03
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-04
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-05
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-06
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-07
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-08
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-09
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-10
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-11
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-12
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-13
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-14
FORMULA_NAME DLCround-PT-13b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620547495094

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-09 08:04:56] [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-09 08:04:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:04:56] [INFO ] Load time of PNML (sax parser for PT used): 268 ms
[2021-05-09 08:04:57] [INFO ] Transformed 5343 places.
[2021-05-09 08:04:57] [INFO ] Transformed 8727 transitions.
[2021-05-09 08:04:57] [INFO ] Found NUPN structural information;
[2021-05-09 08:04:57] [INFO ] Parsed PT model containing 5343 places and 8727 transitions in 434 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 366 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 166 ms. (steps per millisecond=60 ) properties seen :[0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0]
FORMULA DLCround-PT-13b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 8727 rows 5343 cols
[2021-05-09 08:04:58] [INFO ] Computed 312 place invariants in 145 ms
[2021-05-09 08:04:59] [INFO ] [Real]Absence check using 312 positive place invariants in 1051 ms returned sat
[2021-05-09 08:04:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:05:03] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 08:05:03] [INFO ] [Real]Absence check using state equation in 3112 ms returned (error "Failed to check-sat")
[2021-05-09 08:05:04] [INFO ] [Real]Absence check using 312 positive place invariants in 1115 ms returned sat
[2021-05-09 08:05:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:05:08] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 08:05:08] [INFO ] [Real]Absence check using state equation in 3115 ms returned (error "Failed to check-sat")
[2021-05-09 08:05:09] [INFO ] [Real]Absence check using 312 positive place invariants in 1122 ms returned sat
[2021-05-09 08:05:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:05:13] [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 (= s275 (- t4879 t4880))") while checking expression at index 2
[2021-05-09 08:05:14] [INFO ] [Real]Absence check using 312 positive place invariants in 1076 ms returned sat
[2021-05-09 08:05:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:05:18] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 08:05:18] [INFO ] [Real]Absence check using state equation in 3271 ms returned (error "Failed to check-sat")
[2021-05-09 08:05:19] [INFO ] [Real]Absence check using 312 positive place invariants in 1138 ms returned sat
[2021-05-09 08:05:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:05:23] [INFO ] [Real]Absence check using state equation in 3198 ms returned (error "Failed to check-sat")
[2021-05-09 08:05:24] [INFO ] [Real]Absence check using 312 positive place invariants in 1134 ms returned sat
[2021-05-09 08:05:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:05:28] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 08:05:28] [INFO ] [Real]Absence check using state equation in 3204 ms returned (error "Failed to check-sat")
[2021-05-09 08:05:29] [INFO ] [Real]Absence check using 312 positive place invariants in 1070 ms returned sat
[2021-05-09 08:05:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:05:33] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 08:05:33] [INFO ] [Real]Absence check using state equation in 3172 ms returned (error "Failed to check-sat")
[2021-05-09 08:05:34] [INFO ] [Real]Absence check using 312 positive place invariants in 1069 ms returned sat
[2021-05-09 08:05:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:05:38] [INFO ] [Real]Absence check using state equation in 3205 ms returned (error "Failed to check-sat")
[2021-05-09 08:05:39] [INFO ] [Real]Absence check using 312 positive place invariants in 1068 ms returned sat
[2021-05-09 08:05:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:05:43] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 08:05:43] [INFO ] [Real]Absence check using state equation in 3311 ms returned (error "Failed to check-sat")
[2021-05-09 08:05:44] [INFO ] [Real]Absence check using 312 positive place invariants in 1057 ms returned sat
[2021-05-09 08:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:05:48] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-09 08:05:48] [INFO ] [Real]Absence check using state equation in 3312 ms returned (error "Failed to check-sat")
Support contains 61 out of 5343 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5343/5343 places, 8727/8727 transitions.
Graph (trivial) has 4759 edges and 5343 vertex of which 747 / 5343 are part of one of the 59 SCC in 40 ms
Free SCC test removed 688 places
Drop transitions removed 772 transitions
Reduce isomorphic transitions removed 772 transitions.
Performed 1918 Post agglomeration using F-continuation condition.Transition count delta: 1918
Iterating post reduction 0 with 2690 rules applied. Total rules applied 2691 place count 4655 transition count 6037
Reduce places removed 1918 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Iterating post reduction 1 with 2003 rules applied. Total rules applied 4694 place count 2737 transition count 5952
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 44 rules applied. Total rules applied 4738 place count 2700 transition count 5945
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 4741 place count 2697 transition count 5945
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 4741 place count 2697 transition count 5918
Deduced a syphon composed of 27 places in 44 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 4795 place count 2670 transition count 5918
Symmetric choice reduction at 4 with 741 rule applications. Total rules 5536 place count 2670 transition count 5918
Deduced a syphon composed of 741 places in 46 ms
Reduce places removed 741 places and 741 transitions.
Iterating global reduction 4 with 1482 rules applied. Total rules applied 7018 place count 1929 transition count 5177
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 7023 place count 1929 transition count 5172
Performed 327 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 327 Pre rules applied. Total rules applied 7023 place count 1929 transition count 4845
Deduced a syphon composed of 327 places in 37 ms
Reduce places removed 327 places and 0 transitions.
Iterating global reduction 5 with 654 rules applied. Total rules applied 7677 place count 1602 transition count 4845
Symmetric choice reduction at 5 with 82 rule applications. Total rules 7759 place count 1602 transition count 4845
Deduced a syphon composed of 82 places in 128 ms
Reduce places removed 82 places and 1347 transitions.
Iterating global reduction 5 with 164 rules applied. Total rules applied 7923 place count 1520 transition count 3498
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 7946 place count 1520 transition count 3475
Performed 394 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 394 places in 2 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 6 with 788 rules applied. Total rules applied 8734 place count 1126 transition count 3070
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 8743 place count 1126 transition count 3061
Renaming transitions due to excessive name length > 1024 char.
Symmetric choice reduction at 7 with 5 rule applications. Total rules 8748 place count 1126 transition count 3061
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 85 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 8758 place count 1121 transition count 2976
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -174
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 8794 place count 1103 transition count 3150
Drop transitions removed 12 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 8810 place count 1103 transition count 3134
Free-agglomeration rule applied 600 times with reduction of 238 identical transitions.
Iterating global reduction 8 with 600 rules applied. Total rules applied 9410 place count 1103 transition count 2296
Reduce places removed 600 places and 0 transitions.
Drop transitions removed 602 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 612 transitions.
Iterating post reduction 8 with 1212 rules applied. Total rules applied 10622 place count 503 transition count 1684
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 10623 place count 503 transition count 1683
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 10639 place count 502 transition count 1668
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 10 with 29 rules applied. Total rules applied 10668 place count 502 transition count 2110
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 456 transitions
Reduce isomorphic transitions removed 456 transitions.
Iterating post reduction 10 with 485 rules applied. Total rules applied 11153 place count 473 transition count 1654
Symmetric choice reduction at 11 with 1 rule applications. Total rules 11154 place count 473 transition count 1654
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 11156 place count 472 transition count 1653
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 11 with 17 rules applied. Total rules applied 11173 place count 472 transition count 1636
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 11177 place count 470 transition count 1634
Drop transitions removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 12 with 34 rules applied. Total rules applied 11211 place count 470 transition count 1600
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 13 with 6 rules applied. Total rules applied 11217 place count 470 transition count 1600
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 11218 place count 470 transition count 1600
Drop transitions removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 13 with 54 rules applied. Total rules applied 11272 place count 470 transition count 1546
Symmetric choice reduction at 13 with 2 rule applications. Total rules 11274 place count 470 transition count 1546
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 11278 place count 468 transition count 1544
Symmetric choice reduction at 13 with 2 rule applications. Total rules 11280 place count 468 transition count 1544
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 35 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 11284 place count 466 transition count 1509
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 11285 place count 466 transition count 1508
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 11286 place count 465 transition count 1508
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 11288 place count 465 transition count 1508
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 14 with 4 rules applied. Total rules applied 11292 place count 465 transition count 1504
Symmetric choice reduction at 14 with 2 rule applications. Total rules 11294 place count 465 transition count 1504
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 11298 place count 463 transition count 1502
Symmetric choice reduction at 14 with 2 rule applications. Total rules 11300 place count 463 transition count 1502
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 34 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 11304 place count 461 transition count 1468
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 11306 place count 461 transition count 1466
Applied a total of 11306 rules in 2706 ms. Remains 461 /5343 variables (removed 4882) and now considering 1466/8727 (removed 7261) transitions.
Finished structural reductions, in 1 iterations. Remains : 461/5343 places, 1466/8727 transitions.
Finished random walk after 3635 steps, including 0 resets, run visited all 10 properties in 45 ms. (steps per millisecond=80 )
FORMULA DLCround-PT-13b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityFireability-00 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="DLCround-PT-13b"
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 DLCround-PT-13b, 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 r075-tall-162039097400224"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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