fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r178-oct2-177969019900181
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for MedleyA-PT-11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
450.191 15254.00 27056.00 76.80 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969019900181.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is MedleyA-PT-11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969019900181
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.7K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 11:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 160K Mar 3 18:30 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

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

=== Now, execution of the tool begins

BK_START 1779699950496

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 09:05:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 09:05:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:05:52] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2026-05-25 09:05:52] [INFO ] Transformed 150 places.
[2026-05-25 09:05:52] [INFO ] Transformed 478 transitions.
[2026-05-25 09:05:52] [INFO ] Found NUPN structural information;
[2026-05-25 09:05:52] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 263 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10696848240371730108.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3141679237914567732.kers'
[2026-05-25 09:05:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10696848240371730108.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3141679237914567732.kers]
Normalized transition count is 397 out of 469 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 397 rows 147 cols 1568 entries
Finished phase 1 with 123 SingleSign rule and 4 generalized
[2026-05-25 09:05:52] [INFO ] Computed 23 invariants in 1 ms
Computed 23 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3141679237914567732.kers
Total runtime 4 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (780 resets) in 95 ms. (104 steps per ms)
FORMULA MedleyA-PT-11-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (698 resets) in 91 ms. (543 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2026-05-25 09:05:52] [INFO ] Flow matrix only has 397 transitions (discarded 72 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14197990736382246112.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-89184415764901579.kers'
[2026-05-25 09:05:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14197990736382246112.kers, --Pflows, --basisKERS=/tmp/petrispot-output-89184415764901579.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 397 rows 147 cols 1568 entries
Finished phase 1 with 123 SingleSign rule and 4 generalized
[2026-05-25 09:05:52] [INFO ] Computed 23 invariants in 1 ms
Computed 23 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-89184415764901579.kers
Total runtime 1 ms.
[2026-05-25 09:05:53] [INFO ] [Real]Absence check using 15 positive place invariants in 22 ms returned sat
[2026-05-25 09:05:53] [INFO ] [Real]Absence check using 15 positive and 8 generalized place invariants in 4 ms returned sat
[2026-05-25 09:05:53] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2026-05-25 09:05:53] [INFO ] State equation strengthened by 171 read => feed constraints.
[2026-05-25 09:05:53] [INFO ] [Real]Added 171 Read/Feed constraints in 28 ms returned sat
[2026-05-25 09:05:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:05:53] [INFO ] [Nat]Absence check using 15 positive place invariants in 34 ms returned sat
[2026-05-25 09:05:53] [INFO ] [Nat]Absence check using 15 positive and 8 generalized place invariants in 1 ms returned sat
[2026-05-25 09:05:53] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2026-05-25 09:05:53] [INFO ] [Nat]Added 171 Read/Feed constraints in 91 ms returned sat
[2026-05-25 09:05:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2026-05-25 09:05:53] [INFO ] Computed and/alt/rep : 211/1037/211 causal constraints (skipped 185 transitions) in 30 ms.
[2026-05-25 09:05:54] [INFO ] Added : 27 causal constraints over 6 iterations in 693 ms. Result :sat
Minimization took 98 ms.
[2026-05-25 09:05:54] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2026-05-25 09:05:54] [INFO ] [Real]Absence check using 15 positive and 8 generalized place invariants in 5 ms returned sat
[2026-05-25 09:05:54] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2026-05-25 09:05:55] [INFO ] [Real]Added 171 Read/Feed constraints in 53 ms returned sat
[2026-05-25 09:05:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:05:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2026-05-25 09:05:55] [INFO ] [Nat]Absence check using 15 positive and 8 generalized place invariants in 2 ms returned sat
[2026-05-25 09:05:55] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2026-05-25 09:05:55] [INFO ] [Nat]Added 171 Read/Feed constraints in 51 ms returned sat
[2026-05-25 09:05:55] [INFO ] Computed and/alt/rep : 211/1037/211 causal constraints (skipped 185 transitions) in 31 ms.
[2026-05-25 09:05:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2026-05-25 09:05:55] [INFO ] Added : 17 causal constraints over 5 iterations in 398 ms. Result :sat
Minimization took 76 ms.
[2026-05-25 09:05:55] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2026-05-25 09:05:55] [INFO ] [Real]Absence check using 15 positive and 8 generalized place invariants in 15 ms returned sat
[2026-05-25 09:05:56] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2026-05-25 09:05:56] [INFO ] [Real]Added 171 Read/Feed constraints in 22 ms returned sat
[2026-05-25 09:05:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:05:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2026-05-25 09:05:56] [INFO ] [Nat]Absence check using 15 positive and 8 generalized place invariants in 1 ms returned sat
[2026-05-25 09:05:56] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2026-05-25 09:05:56] [INFO ] [Nat]Added 171 Read/Feed constraints in 34 ms returned sat
[2026-05-25 09:05:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2026-05-25 09:05:56] [INFO ] Computed and/alt/rep : 211/1037/211 causal constraints (skipped 185 transitions) in 35 ms.
[2026-05-25 09:05:56] [INFO ] Added : 20 causal constraints over 4 iterations in 249 ms. Result :sat
Minimization took 88 ms.
[2026-05-25 09:05:56] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2026-05-25 09:05:56] [INFO ] [Real]Absence check using 15 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-25 09:05:56] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2026-05-25 09:05:56] [INFO ] [Real]Added 171 Read/Feed constraints in 16 ms returned sat
[2026-05-25 09:05:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:05:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2026-05-25 09:05:56] [INFO ] [Nat]Absence check using 15 positive and 8 generalized place invariants in 2 ms returned sat
[2026-05-25 09:05:57] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2026-05-25 09:05:57] [INFO ] [Nat]Added 171 Read/Feed constraints in 91 ms returned sat
[2026-05-25 09:05:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2026-05-25 09:05:57] [INFO ] Computed and/alt/rep : 211/1037/211 causal constraints (skipped 185 transitions) in 66 ms.
[2026-05-25 09:05:57] [INFO ] Added : 9 causal constraints over 2 iterations in 261 ms. Result :sat
Minimization took 94 ms.
[2026-05-25 09:05:57] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2026-05-25 09:05:57] [INFO ] [Real]Absence check using 15 positive and 8 generalized place invariants in 40 ms returned sat
[2026-05-25 09:05:57] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2026-05-25 09:05:57] [INFO ] [Real]Added 171 Read/Feed constraints in 30 ms returned sat
[2026-05-25 09:05:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:05:58] [INFO ] [Nat]Absence check using 15 positive place invariants in 64 ms returned sat
[2026-05-25 09:05:58] [INFO ] [Nat]Absence check using 15 positive and 8 generalized place invariants in 2 ms returned sat
[2026-05-25 09:05:58] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2026-05-25 09:05:58] [INFO ] [Nat]Added 171 Read/Feed constraints in 55 ms returned sat
[2026-05-25 09:05:58] [INFO ] Computed and/alt/rep : 211/1037/211 causal constraints (skipped 185 transitions) in 26 ms.
[2026-05-25 09:05:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2026-05-25 09:05:58] [INFO ] Added : 23 causal constraints over 7 iterations in 679 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA MedleyA-PT-11-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
FORMULA MedleyA-PT-11-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 469/469 transitions.
Graph (complete) has 749 edges and 150 vertex of which 147 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 36 place count 112 transition count 414
Iterating global reduction 0 with 35 rules applied. Total rules applied 71 place count 112 transition count 414
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 82 place count 101 transition count 354
Iterating global reduction 0 with 11 rules applied. Total rules applied 93 place count 101 transition count 354
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 99 place count 95 transition count 330
Iterating global reduction 0 with 6 rules applied. Total rules applied 105 place count 95 transition count 330
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 107 place count 94 transition count 329
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 117 place count 89 transition count 360
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 139 place count 89 transition count 338
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 141 place count 88 transition count 348
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 156 place count 88 transition count 449
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 180 place count 73 transition count 440
Applied a total of 180 rules in 117 ms. Remains 73 /150 variables (removed 77) and now considering 440/469 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 73/150 places, 440/469 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5790191343758010166.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5544179399044337712.kers'
[2026-05-25 09:05:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5790191343758010166.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5544179399044337712.kers]
Normalized transition count is 368 out of 440 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 368 rows 70 cols 1934 entries
Finished phase 1 with 46 SingleSign rule and 4 generalized
[2026-05-25 09:05:59] [INFO ] Computed 23 invariants in 1 ms
Computed 23 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5544179399044337712.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (190887 resets) in 5226 ms. (191 steps per ms)
FORMULA MedleyA-PT-11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-11-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (36130 resets) in 1136 ms. (879 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 13392 ms.

BK_STOP 1779699965750

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="MedleyA-PT-11"
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-5973"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-11, 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 r178-oct2-177969019900181"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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