fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r161-smll-165277002800099
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for ParamProductionCell-PT-1

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
256.071 18524.00 33244.00 351.90 TFTFFTTFFFTTTFTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r161-smll-165277002800099.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 gold2021
Input is ParamProductionCell-PT-1, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r161-smll-165277002800099
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 8.6K Apr 29 17:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 29 17:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 29 17:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 17:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 9 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 08:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 29 17:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 29 17:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 29 17:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Apr 29 17:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 174K May 10 09:34 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 ParamProductionCell-PT-1-ReachabilityFireability-00
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-01
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-02
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-03
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-04
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-05
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-06
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-07
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-08
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-09
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-10
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-11
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-12
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-13
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-14
FORMULA_NAME ParamProductionCell-PT-1-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655077424724

Running Version 0
[2022-06-12 23:43:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 23:43:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 23:43:47] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2022-06-12 23:43:47] [INFO ] Transformed 231 places.
[2022-06-12 23:43:47] [INFO ] Transformed 202 transitions.
[2022-06-12 23:43:47] [INFO ] Found NUPN structural information;
[2022-06-12 23:43:47] [INFO ] Parsed PT model containing 231 places and 202 transitions in 264 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 40 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 16) seen :5
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 202 rows 231 cols
[2022-06-12 23:43:49] [INFO ] Computed 59 place invariants in 21 ms
[2022-06-12 23:43:49] [INFO ] [Real]Absence check using 35 positive place invariants in 56 ms returned sat
[2022-06-12 23:43:49] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 54 ms returned sat
[2022-06-12 23:43:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:43:50] [INFO ] [Real]Absence check using state equation in 1165 ms returned sat
[2022-06-12 23:43:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:43:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 36 ms returned sat
[2022-06-12 23:43:51] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 19 ms returned unsat
[2022-06-12 23:43:51] [INFO ] [Real]Absence check using 35 positive place invariants in 39 ms returned unsat
[2022-06-12 23:43:51] [INFO ] [Real]Absence check using 35 positive place invariants in 34 ms returned sat
[2022-06-12 23:43:51] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 40 ms returned sat
[2022-06-12 23:43:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:43:52] [INFO ] [Real]Absence check using state equation in 909 ms returned sat
[2022-06-12 23:43:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:43:52] [INFO ] [Nat]Absence check using 35 positive place invariants in 34 ms returned sat
[2022-06-12 23:43:52] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 32 ms returned sat
[2022-06-12 23:43:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:43:52] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2022-06-12 23:43:52] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-06-12 23:43:52] [INFO ] [Nat]Added 68 Read/Feed constraints in 47 ms returned sat
[2022-06-12 23:43:53] [INFO ] Deduced a trap composed of 8 places in 250 ms of which 5 ms to minimize.
[2022-06-12 23:43:53] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 3 ms to minimize.
[2022-06-12 23:43:53] [INFO ] Deduced a trap composed of 7 places in 231 ms of which 2 ms to minimize.
[2022-06-12 23:43:53] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
[2022-06-12 23:43:54] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 2 ms to minimize.
[2022-06-12 23:43:54] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 1 ms to minimize.
[2022-06-12 23:43:54] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 1 ms to minimize.
[2022-06-12 23:43:54] [INFO ] Deduced a trap composed of 78 places in 78 ms of which 1 ms to minimize.
[2022-06-12 23:43:54] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2022-06-12 23:43:54] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2022-06-12 23:43:55] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2022-06-12 23:43:55] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2022-06-12 23:43:55] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
[2022-06-12 23:43:55] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2022-06-12 23:43:55] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2022-06-12 23:43:55] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2022-06-12 23:43:55] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2022-06-12 23:43:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 17 trap constraints in 2702 ms
[2022-06-12 23:43:55] [INFO ] [Real]Absence check using 35 positive place invariants in 20 ms returned sat
[2022-06-12 23:43:55] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2022-06-12 23:43:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:43:55] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2022-06-12 23:43:55] [INFO ] [Real]Added 68 Read/Feed constraints in 12 ms returned sat
[2022-06-12 23:43:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:43:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 25 ms returned sat
[2022-06-12 23:43:56] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 15 ms returned sat
[2022-06-12 23:43:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:43:56] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2022-06-12 23:43:56] [INFO ] [Nat]Added 68 Read/Feed constraints in 76 ms returned sat
[2022-06-12 23:43:56] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2022-06-12 23:43:56] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 0 ms to minimize.
[2022-06-12 23:43:57] [INFO ] Deduced a trap composed of 7 places in 304 ms of which 1 ms to minimize.
[2022-06-12 23:43:57] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 1 ms to minimize.
[2022-06-12 23:43:57] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 6 ms to minimize.
[2022-06-12 23:43:57] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 0 ms to minimize.
[2022-06-12 23:43:57] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 0 ms to minimize.
[2022-06-12 23:43:57] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2022-06-12 23:43:57] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2022-06-12 23:43:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 1325 ms
[2022-06-12 23:43:57] [INFO ] [Real]Absence check using 35 positive place invariants in 24 ms returned sat
[2022-06-12 23:43:57] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 17 ms returned sat
[2022-06-12 23:43:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:43:58] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2022-06-12 23:43:58] [INFO ] [Real]Added 68 Read/Feed constraints in 40 ms returned sat
[2022-06-12 23:43:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:43:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 27 ms returned sat
[2022-06-12 23:43:58] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2022-06-12 23:43:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:43:58] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2022-06-12 23:43:58] [INFO ] [Nat]Added 68 Read/Feed constraints in 22 ms returned sat
[2022-06-12 23:43:58] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2022-06-12 23:43:58] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2022-06-12 23:43:58] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2022-06-12 23:43:58] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2022-06-12 23:43:58] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2022-06-12 23:43:58] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2022-06-12 23:43:59] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2022-06-12 23:43:59] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2022-06-12 23:43:59] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2022-06-12 23:43:59] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2022-06-12 23:43:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 941 ms
[2022-06-12 23:43:59] [INFO ] [Real]Absence check using 35 positive place invariants in 23 ms returned sat
[2022-06-12 23:43:59] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 47 ms returned sat
[2022-06-12 23:43:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:44:00] [INFO ] [Real]Absence check using state equation in 1011 ms returned sat
[2022-06-12 23:44:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:44:00] [INFO ] [Nat]Absence check using 35 positive place invariants in 35 ms returned sat
[2022-06-12 23:44:00] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 18 ms returned unsat
[2022-06-12 23:44:00] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2022-06-12 23:44:00] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 26 ms returned sat
[2022-06-12 23:44:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:44:01] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2022-06-12 23:44:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:44:01] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned unsat
[2022-06-12 23:44:01] [INFO ] [Real]Absence check using 35 positive place invariants in 17 ms returned sat
[2022-06-12 23:44:01] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned unsat
[2022-06-12 23:44:01] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned unsat
[2022-06-12 23:44:01] [INFO ] [Real]Absence check using 35 positive place invariants in 21 ms returned sat
[2022-06-12 23:44:01] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 18 ms returned sat
[2022-06-12 23:44:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:44:01] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2022-06-12 23:44:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:44:01] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned unsat
[2022-06-12 23:44:02] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned unsat
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ParamProductionCell-PT-1-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 0 different solutions.
All properties solved without resorting to model-checking.

BK_STOP 1655077443248

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="ParamProductionCell-PT-1"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is ParamProductionCell-PT-1, 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 r161-smll-165277002800099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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