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.r132-tall-165271821300725.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 itstools
Input is MultiCrashLeafsetExtension-PT-S24C04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821300725
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 12K Apr 29 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 29 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 29 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 29 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K May 9 08:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 9 08:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 10M 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652842132850

Running Version 202205111006
[2022-05-18 02:48:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -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-05-18 02:48:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 02:48:54] [INFO ] Load time of PNML (sax parser for PT used): 661 ms
[2022-05-18 02:48:54] [INFO ] Transformed 9748 places.
[2022-05-18 02:48:54] [INFO ] Transformed 14659 transitions.
[2022-05-18 02:48:54] [INFO ] Parsed PT model containing 9748 places and 14659 transitions in 836 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Normalized transition count is 14059 out of 14659 initially.
// Phase 1: matrix 14059 rows 9748 cols
[2022-05-18 02:48:55] [INFO ] Computed 921 place invariants in 890 ms
Incomplete random walk after 10000 steps, including 241 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :1
[2022-05-18 02:48:57] [INFO ] Flow matrix only has 14059 transitions (discarded 600 similar events)
// Phase 1: matrix 14059 rows 9748 cols
[2022-05-18 02:48:57] [INFO ] Computed 921 place invariants in 663 ms
[2022-05-18 02:48:58] [INFO ] [Real]Absence check using 62 positive place invariants in 163 ms returned sat
[2022-05-18 02:48:59] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 286 ms returned unsat
[2022-05-18 02:49:00] [INFO ] [Real]Absence check using 62 positive place invariants in 157 ms returned sat
[2022-05-18 02:49:00] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 169 ms returned unsat
[2022-05-18 02:49:01] [INFO ] [Real]Absence check using 62 positive place invariants in 132 ms returned sat
[2022-05-18 02:49:01] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 171 ms returned unsat
[2022-05-18 02:49:02] [INFO ] [Real]Absence check using 62 positive place invariants in 137 ms returned sat
[2022-05-18 02:49:02] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 148 ms returned unsat
[2022-05-18 02:49:03] [INFO ] [Real]Absence check using 62 positive place invariants in 140 ms returned sat
[2022-05-18 02:49:04] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 413 ms returned sat
[2022-05-18 02:49:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:49:07] [INFO ] [Real]Absence check using state equation in 3517 ms returned unknown
[2022-05-18 02:49:08] [INFO ] [Real]Absence check using 62 positive place invariants in 128 ms returned sat
[2022-05-18 02:49:09] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 446 ms returned sat
[2022-05-18 02:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:49:12] [INFO ] [Real]Absence check using state equation in 3598 ms returned unknown
[2022-05-18 02:49:13] [INFO ] [Real]Absence check using 62 positive place invariants in 137 ms returned sat
[2022-05-18 02:49:14] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 197 ms returned unsat
[2022-05-18 02:49:15] [INFO ] [Real]Absence check using 62 positive place invariants in 135 ms returned sat
[2022-05-18 02:49:15] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 403 ms returned sat
[2022-05-18 02:49:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:49:19] [INFO ] [Real]Absence check using state equation in 3645 ms returned unknown
[2022-05-18 02:49:20] [INFO ] [Real]Absence check using 62 positive place invariants in 129 ms returned sat
[2022-05-18 02:49:20] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 168 ms returned unsat
[2022-05-18 02:49:21] [INFO ] [Real]Absence check using 62 positive place invariants in 135 ms returned sat
[2022-05-18 02:49:21] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 424 ms returned sat
[2022-05-18 02:49:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:49:25] [INFO ] [Real]Absence check using state equation in 3577 ms returned unknown
[2022-05-18 02:49:26] [INFO ] [Real]Absence check using 62 positive place invariants in 127 ms returned sat
[2022-05-18 02:49:26] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 166 ms returned unsat
[2022-05-18 02:49:27] [INFO ] [Real]Absence check using 62 positive place invariants in 126 ms returned sat
[2022-05-18 02:49:27] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 165 ms returned unsat
[2022-05-18 02:49:28] [INFO ] [Real]Absence check using 62 positive place invariants in 138 ms returned sat
[2022-05-18 02:49:28] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 149 ms returned unsat
[2022-05-18 02:49:29] [INFO ] [Real]Absence check using 62 positive place invariants in 126 ms returned sat
[2022-05-18 02:49:29] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 164 ms returned unsat
[2022-05-18 02:49:30] [INFO ] [Real]Absence check using 62 positive place invariants in 129 ms returned sat
[2022-05-18 02:49:30] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 162 ms returned unsat
[2022-05-18 02:49:31] [INFO ] [Real]Absence check using 62 positive place invariants in 143 ms returned sat
[2022-05-18 02:49:32] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 254 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 25, 1, 75, 1, 1, 1, 1, 1, 1] Max seen :[1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 9748 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 9748/9748 places, 14659/14659 transitions.
Graph (complete) has 33897 edges and 9748 vertex of which 9712 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.40 ms
Discarding 36 places :
Also discarding 0 output transitions
Drop transitions removed 2398 transitions
Trivial Post-agglo rules discarded 2398 transitions
Performed 2398 trivial Post agglomeration. Transition count delta: 2398
Iterating post reduction 0 with 2398 rules applied. Total rules applied 2399 place count 9712 transition count 12261
Reduce places removed 2398 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2399 rules applied. Total rules applied 4798 place count 7314 transition count 12260
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4799 place count 7313 transition count 12260
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 4799 place count 7313 transition count 12060
Deduced a syphon composed of 200 places in 10 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 5199 place count 7113 transition count 12060
Discarding 2198 places :
Symmetric choice reduction at 3 with 2198 rule applications. Total rules 7397 place count 4915 transition count 9862
Iterating global reduction 3 with 2198 rules applied. Total rules applied 9595 place count 4915 transition count 9862
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 9595 place count 4915 transition count 9856
Deduced a syphon composed of 6 places in 16 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 9607 place count 4909 transition count 9856
Discarding 548 places :
Symmetric choice reduction at 3 with 548 rule applications. Total rules 10155 place count 4361 transition count 7664
Iterating global reduction 3 with 548 rules applied. Total rules applied 10703 place count 4361 transition count 7664
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 10753 place count 4336 transition count 7639
Free-agglomeration rule (complex) applied 338 times.
Iterating global reduction 3 with 338 rules applied. Total rules applied 11091 place count 4336 transition count 8945
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 3 with 338 rules applied. Total rules applied 11429 place count 3998 transition count 8945
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 4 with 50 rules applied. Total rules applied 11479 place count 3998 transition count 8945
Applied a total of 11479 rules in 5021 ms. Remains 3998 /9748 variables (removed 5750) and now considering 8945/14659 (removed 5714) transitions.
Finished structural reductions, in 1 iterations. Remains : 3998/9748 places, 8945/14659 transitions.
Normalized transition count is 8059 out of 8945 initially.
// Phase 1: matrix 8059 rows 3998 cols
[2022-05-18 02:49:37] [INFO ] Computed 885 place invariants in 198 ms
Incomplete random walk after 1000000 steps, including 39707 resets, run finished after 25056 ms. (steps per millisecond=39 ) properties (out of 4) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 4780 resets, run finished after 3944 ms. (steps per millisecond=253 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4780 resets, run finished after 3908 ms. (steps per millisecond=255 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4780 resets, run finished after 3887 ms. (steps per millisecond=257 ) properties (out of 3) seen :1
[2022-05-18 02:50:14] [INFO ] Flow matrix only has 8059 transitions (discarded 886 similar events)
// Phase 1: matrix 8059 rows 3998 cols
[2022-05-18 02:50:14] [INFO ] Computed 885 place invariants in 187 ms
[2022-05-18 02:50:14] [INFO ] [Real]Absence check using 49 positive place invariants in 73 ms returned sat
[2022-05-18 02:50:15] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 193 ms returned sat
[2022-05-18 02:50:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:17] [INFO ] [Real]Absence check using state equation in 2745 ms returned sat
[2022-05-18 02:50:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:50:18] [INFO ] [Nat]Absence check using 49 positive place invariants in 73 ms returned sat
[2022-05-18 02:50:18] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 196 ms returned sat
[2022-05-18 02:50:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:21] [INFO ] [Nat]Absence check using state equation in 2827 ms returned sat
[2022-05-18 02:50:21] [INFO ] State equation strengthened by 4402 read => feed constraints.
[2022-05-18 02:50:22] [INFO ] [Nat]Added 4402 Read/Feed constraints in 1153 ms returned unsat
[2022-05-18 02:50:23] [INFO ] [Real]Absence check using 49 positive place invariants in 71 ms returned sat
[2022-05-18 02:50:23] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 193 ms returned sat
[2022-05-18 02:50:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:26] [INFO ] [Real]Absence check using state equation in 2725 ms returned sat
[2022-05-18 02:50:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:50:26] [INFO ] [Nat]Absence check using 49 positive place invariants in 72 ms returned sat
[2022-05-18 02:50:27] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 199 ms returned sat
[2022-05-18 02:50:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:50:30] [INFO ] [Nat]Absence check using state equation in 3027 ms returned sat
[2022-05-18 02:50:33] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 02:50:33] [INFO ] [Nat]Added 4402 Read/Feed constraints in 3682 ms returned unsat
[2022-05-18 02:50:34] [INFO ] [Real]Absence check using 49 positive place invariants in 70 ms returned sat
[2022-05-18 02:50:34] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 191 ms returned unsat
Current structural bounds on expressions (after SMT) : [0, 0, 1] Max seen :[0, 0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 100335 ms.

BK_STOP 1652842234363

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -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=@none -Xss128m -Xms40m -Xmx8192m

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="MultiCrashLeafsetExtension-PT-S24C04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S24C04, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271821300725"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C04.tgz
mv MultiCrashLeafsetExtension-PT-S24C04 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;