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.r140-tall-162089127800371.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 itstools
Input is ParamProductionCell-PT-1, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127800371
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 23K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 146K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K 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 4.1K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 27 06:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 06:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 07:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 07:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 174K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620979547471

Running Version 0
[2021-05-14 08:05:49] [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]
[2021-05-14 08:05:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 08:05:49] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2021-05-14 08:05:49] [INFO ] Transformed 231 places.
[2021-05-14 08:05:49] [INFO ] Transformed 202 transitions.
[2021-05-14 08:05:49] [INFO ] Found NUPN structural information;
[2021-05-14 08:05:49] [INFO ] Parsed PT model containing 231 places and 202 transitions in 114 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 202 rows 231 cols
[2021-05-14 08:05:49] [INFO ] Computed 59 place invariants in 24 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 16) seen :11
FORMULA ParamProductionCell-PT-1-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
// Phase 1: matrix 202 rows 231 cols
[2021-05-14 08:05:49] [INFO ] Computed 59 place invariants in 12 ms
[2021-05-14 08:05:49] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2021-05-14 08:05:49] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-14 08:05:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:05:49] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2021-05-14 08:05:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:05:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2021-05-14 08:05:49] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 5 ms returned sat
[2021-05-14 08:05:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:05:49] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2021-05-14 08:05:49] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-14 08:05:49] [INFO ] [Nat]Added 68 Read/Feed constraints in 11 ms returned sat
[2021-05-14 08:05:49] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 3 ms to minimize.
[2021-05-14 08:05:50] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2021-05-14 08:05:50] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
[2021-05-14 08:05:50] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2021-05-14 08:05:50] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2021-05-14 08:05:50] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 0 ms to minimize.
[2021-05-14 08:05:50] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2021-05-14 08:05:50] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2021-05-14 08:05:50] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2021-05-14 08:05:50] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2021-05-14 08:05:50] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2021-05-14 08:05:50] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2021-05-14 08:05:50] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2021-05-14 08:05:50] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2021-05-14 08:05:50] [INFO ] Deduced a trap composed of 70 places in 40 ms of which 0 ms to minimize.
[2021-05-14 08:05:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 15 trap constraints in 996 ms
[2021-05-14 08:05:50] [INFO ] [Real]Absence check using 35 positive place invariants in 10 ms returned sat
[2021-05-14 08:05:50] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 5 ms returned sat
[2021-05-14 08:05:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:05:50] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-14 08:05:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:05:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2021-05-14 08:05:51] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 5 ms returned sat
[2021-05-14 08:05:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:05:51] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-14 08:05:51] [INFO ] [Nat]Added 68 Read/Feed constraints in 16 ms returned sat
[2021-05-14 08:05:51] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2021-05-14 08:05:51] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2021-05-14 08:05:51] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2021-05-14 08:05:51] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2021-05-14 08:05:51] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2021-05-14 08:05:51] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2021-05-14 08:05:51] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 0 ms to minimize.
[2021-05-14 08:05:51] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2021-05-14 08:05:51] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2021-05-14 08:05:51] [INFO ] Deduced a trap composed of 45 places in 26 ms of which 1 ms to minimize.
[2021-05-14 08:05:51] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2021-05-14 08:05:51] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2021-05-14 08:05:51] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2021-05-14 08:05:51] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
[2021-05-14 08:05:51] [INFO ] Deduced a trap composed of 43 places in 25 ms of which 0 ms to minimize.
[2021-05-14 08:05:51] [INFO ] Deduced a trap composed of 41 places in 23 ms of which 1 ms to minimize.
[2021-05-14 08:05:51] [INFO ] Deduced a trap composed of 42 places in 25 ms of which 0 ms to minimize.
[2021-05-14 08:05:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 17 trap constraints in 870 ms
[2021-05-14 08:05:52] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2021-05-14 08:05:52] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2021-05-14 08:05:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:05:52] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2021-05-14 08:05:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:05:52] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2021-05-14 08:05:52] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 5 ms returned sat
[2021-05-14 08:05:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:05:52] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2021-05-14 08:05:52] [INFO ] [Nat]Added 68 Read/Feed constraints in 12 ms returned sat
[2021-05-14 08:05:52] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2021-05-14 08:05:52] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2021-05-14 08:05:52] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 4 ms to minimize.
[2021-05-14 08:05:52] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2021-05-14 08:05:52] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2021-05-14 08:05:52] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2021-05-14 08:05:52] [INFO ] Deduced a trap composed of 78 places in 40 ms of which 1 ms to minimize.
[2021-05-14 08:05:52] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
[2021-05-14 08:05:52] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2021-05-14 08:05:52] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2021-05-14 08:05:52] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2021-05-14 08:05:52] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2021-05-14 08:05:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 691 ms
[2021-05-14 08:05:52] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2021-05-14 08:05:52] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 5 ms returned sat
[2021-05-14 08:05:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:05:53] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2021-05-14 08:05:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:05:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2021-05-14 08:05:53] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 5 ms returned sat
[2021-05-14 08:05:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:05:53] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-14 08:05:53] [INFO ] [Nat]Added 68 Read/Feed constraints in 17 ms returned sat
[2021-05-14 08:05:53] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2021-05-14 08:05:53] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2021-05-14 08:05:53] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2021-05-14 08:05:53] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2021-05-14 08:05:53] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2021-05-14 08:05:53] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 0 ms to minimize.
[2021-05-14 08:05:53] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2021-05-14 08:05:53] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2021-05-14 08:05:53] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2021-05-14 08:05:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 541 ms
[2021-05-14 08:05:53] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2021-05-14 08:05:53] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned sat
[2021-05-14 08:05:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:05:53] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2021-05-14 08:05:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:05:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2021-05-14 08:05:53] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 5 ms returned sat
[2021-05-14 08:05:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:05:53] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2021-05-14 08:05:53] [INFO ] [Nat]Added 68 Read/Feed constraints in 13 ms returned sat
[2021-05-14 08:05:53] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2021-05-14 08:05:54] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2021-05-14 08:05:54] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2021-05-14 08:05:54] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2021-05-14 08:05:54] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2021-05-14 08:05:54] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2021-05-14 08:05:54] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2021-05-14 08:05:54] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2021-05-14 08:05:54] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2021-05-14 08:05:54] [INFO ] Deduced a trap composed of 77 places in 35 ms of which 0 ms to minimize.
[2021-05-14 08:05:54] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2021-05-14 08:05:54] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2021-05-14 08:05:54] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2021-05-14 08:05:54] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 2 ms to minimize.
[2021-05-14 08:05:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 781 ms
Current structural bounds on expressions (after SMT) : [0, 0, 0, 0, 0] Max seen :[0, 0, 0, 0, 0]
FORMULA ParamProductionCell-PT-1-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620979555543

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

+ 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
+ [[ -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 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=/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="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 ParamProductionCell-PT-1, 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 r140-tall-162089127800371"
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 [ "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 ;