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.r096-smll-165260575900213.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 GPPP-PT-C0010N0000000010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260575900213
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 7.2K Apr 29 18:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 18:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 18:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 18:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 17 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1 May 10 09:33 large_marking
-rw-r--r-- 1 mcc users 21K May 10 09:33 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 GPPP-PT-C0010N0000000010-UpperBounds-00
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-01
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-02
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-03
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-04
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-05
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-06
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-07
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-08
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-09
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-10
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-11
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-12
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-13
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-14
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652686965686

Running Version 202205111006
[2022-05-16 07:42:48] [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-16 07:42:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 07:42:48] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2022-05-16 07:42:48] [INFO ] Transformed 33 places.
[2022-05-16 07:42:48] [INFO ] Transformed 22 transitions.
[2022-05-16 07:42:48] [INFO ] Parsed PT model containing 33 places and 22 transitions in 352 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 07:42:48] [INFO ] Computed 12 place invariants in 15 ms
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-15 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-06 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 24 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :345
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-09 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-00 70 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :224
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :226
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :214
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :174
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :224
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :224
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :233
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :230
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :222
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :230
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :212
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 07:42:49] [INFO ] Computed 12 place invariants in 15 ms
[2022-05-16 07:42:49] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2022-05-16 07:42:49] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 9 ms returned sat
[2022-05-16 07:42:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:42:49] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2022-05-16 07:42:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:42:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2022-05-16 07:42:49] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 12 ms returned sat
[2022-05-16 07:42:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:42:49] [INFO ] [Nat]Absence check using state equation in 424 ms returned unsat
[2022-05-16 07:42:50] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-16 07:42:50] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-16 07:42:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:42:50] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-05-16 07:42:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:42:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-16 07:42:50] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 722 ms returned sat
[2022-05-16 07:42:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:42:54] [INFO ] [Nat]Absence check using state equation in 3275 ms returned sat
[2022-05-16 07:42:54] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 07:42:54] [INFO ] Added : 15 causal constraints over 3 iterations in 72 ms. Result :sat
Minimization took 16 ms.
[2022-05-16 07:42:54] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2022-05-16 07:42:54] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-16 07:42:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:42:54] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-16 07:42:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:42:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-16 07:42:54] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned unsat
[2022-05-16 07:42:54] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-16 07:42:54] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-16 07:42:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:42:54] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-05-16 07:42:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:42:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-16 07:42:54] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 499 ms returned sat
[2022-05-16 07:42:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:42:55] [INFO ] [Nat]Absence check using state equation in 849 ms returned sat
[2022-05-16 07:42:55] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 19 ms.
[2022-05-16 07:42:55] [INFO ] Added : 20 causal constraints over 4 iterations in 93 ms. Result :sat
Minimization took 41 ms.
[2022-05-16 07:42:56] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-16 07:42:56] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-16 07:42:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:42:56] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 07:42:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:42:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 07:42:56] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 60 ms returned sat
[2022-05-16 07:42:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:42:56] [INFO ] [Nat]Absence check using state equation in 168 ms returned unsat
[2022-05-16 07:42:56] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 07:42:56] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-16 07:42:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:42:56] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 07:42:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:42:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-16 07:42:56] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 59 ms returned sat
[2022-05-16 07:42:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:42:56] [INFO ] [Nat]Absence check using state equation in 339 ms returned unsat
[2022-05-16 07:42:56] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-16 07:42:56] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 6 ms returned unsat
[2022-05-16 07:42:56] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-16 07:42:56] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-16 07:42:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:42:56] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-05-16 07:42:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:42:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-16 07:42:57] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 96 ms returned sat
[2022-05-16 07:42:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:42:58] [INFO ] [Nat]Absence check using state equation in 1556 ms returned unsat
[2022-05-16 07:42:58] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2022-05-16 07:42:58] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 8 ms returned sat
[2022-05-16 07:42:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:42:58] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-16 07:42:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:42:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 07:42:58] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-16 07:42:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:42:58] [INFO ] [Nat]Absence check using state equation in 137 ms returned unsat
[2022-05-16 07:42:58] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 07:42:58] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned unsat
[2022-05-16 07:42:58] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-16 07:42:58] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 20, 2, 130, 10, 10, 110, 10, 4, 30, 30] Max seen :[4, 9, 2, 40, 10, 10, 110, 10, 4, 30, 30]
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-14 30 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-13 30 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-10 110 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 14
Applied a total of 15 rules in 28 ms. Remains 24 /33 variables (removed 9) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 24 cols
[2022-05-16 07:42:59] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 07:42:59] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/33 places, 14/22 transitions.
// Phase 1: matrix 14 rows 24 cols
[2022-05-16 07:42:59] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000030 steps, including 5487 resets, run finished after 615 ms. (steps per millisecond=1626 ) properties (out of 2) seen :48
Incomplete Best-First random walk after 1000001 steps, including 1445 resets, run finished after 497 ms. (steps per millisecond=2012 ) properties (out of 2) seen :50
Incomplete Best-First random walk after 1000001 steps, including 2151 resets, run finished after 541 ms. (steps per millisecond=1848 ) properties (out of 2) seen :48
// Phase 1: matrix 14 rows 24 cols
[2022-05-16 07:43:00] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-16 07:43:00] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-05-16 07:43:00] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-16 07:43:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:43:00] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-16 07:43:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:43:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-16 07:43:00] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-16 07:43:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:43:00] [INFO ] [Nat]Absence check using state equation in 41 ms returned unsat
[2022-05-16 07:43:00] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-16 07:43:00] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-16 07:43:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:43:00] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-16 07:43:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:43:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-16 07:43:01] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 48 ms returned sat
[2022-05-16 07:43:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:43:01] [INFO ] [Nat]Absence check using state equation in 65 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 47] Max seen :[10, 47]
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-05 47 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 12937 ms.

BK_STOP 1652686981159

--------------------
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="GPPP-PT-C0010N0000000010"
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 GPPP-PT-C0010N0000000010, 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 r096-smll-165260575900213"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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