Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r146-tall-177961074200517.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 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 GPUForwardProgress-PT-36b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074200517
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.6K Mar 7 11:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 7 11:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 7 11:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 7 11:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 11:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Mar 7 11:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 7 11:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 7 11:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 10:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 179K 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 GPUForwardProgress-PT-36b-UpperBounds-00
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-01
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-02
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-03
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-04
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-05
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-06
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-07
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-08
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-09
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-10
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-11
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-12
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-13
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-14
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779733464864

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-36b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 18:24:25] [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 18:24:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 18:24:26] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2026-05-25 18:24:26] [INFO ] Transformed 720 places.
[2026-05-25 18:24:26] [INFO ] Transformed 757 transitions.
[2026-05-25 18:24:26] [INFO ] Found NUPN structural information;
[2026-05-25 18:24:26] [INFO ] Parsed PT model containing 720 places and 757 transitions and 1877 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
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-13720551479351872165.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6626969315640576262.kers'
[2026-05-25 18:24:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13720551479351872165.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6626969315640576262.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 757 rows 719 cols 1875 entries
Finished phase 1 with 681 SingleSign rule and 1 generalized
[2026-05-25 18:24:26] [INFO ] Computed 38 invariants in 4 ms
Computed 38 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6626969315640576262.kers
Total runtime 5 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 (33 resets) in 50 ms. (196 steps per ms)
FORMULA GPUForwardProgress-PT-36b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70006 steps (20 resets) in 80 ms. (864 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 18:24:26] [INFO ] Invariant cache hit.
[2026-05-25 18:24:26] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 27 ms returned sat
[2026-05-25 18:24:27] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2026-05-25 18:24:27] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 46 ms.
[2026-05-25 18:24:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 18:24:27] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 28 ms returned sat
[2026-05-25 18:24:27] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2026-05-25 18:24:27] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 38 ms.
[2026-05-25 18:24:32] [INFO ] Added : 435 causal constraints over 87 iterations in 4596 ms. Result :unknown
[2026-05-25 18:24:32] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 24 ms returned sat
[2026-05-25 18:24:32] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2026-05-25 18:24:32] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 36 ms.
[2026-05-25 18:24:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 18:24:33] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 27 ms returned sat
[2026-05-25 18:24:33] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2026-05-25 18:24:33] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 42 ms.
[2026-05-25 18:24:36] [INFO ] Added : 226 causal constraints over 46 iterations in 3042 ms. Result :sat
Minimization took 238 ms.
[2026-05-25 18:24:36] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 25 ms returned sat
[2026-05-25 18:24:37] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2026-05-25 18:24:37] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 37 ms.
[2026-05-25 18:24:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 18:24:37] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 27 ms returned sat
[2026-05-25 18:24:37] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2026-05-25 18:24:37] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 36 ms.
[2026-05-25 18:24:40] [INFO ] Added : 275 causal constraints over 55 iterations in 2847 ms. Result :sat
Minimization took 274 ms.
[2026-05-25 18:24:41] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 25 ms returned sat
[2026-05-25 18:24:41] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2026-05-25 18:24:41] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 35 ms.
[2026-05-25 18:24:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 18:24:41] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 23 ms returned sat
[2026-05-25 18:24:41] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2026-05-25 18:24:41] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 30 ms.
[2026-05-25 18:24:44] [INFO ] Added : 284 causal constraints over 57 iterations in 2712 ms. Result :sat
Minimization took 206 ms.
[2026-05-25 18:24:44] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 24 ms returned sat
[2026-05-25 18:24:45] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2026-05-25 18:24:45] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 33 ms.
[2026-05-25 18:24:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 18:24:45] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 24 ms returned sat
[2026-05-25 18:24:45] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2026-05-25 18:24:45] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 33 ms.
[2026-05-25 18:24:47] [INFO ] Added : 216 causal constraints over 44 iterations in 2267 ms. Result :sat
Minimization took 505 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, 0, 1, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA GPUForwardProgress-PT-36b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
Support contains 3 out of 720 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 720/720 places, 757/757 transitions.
Graph (trivial) has 638 edges and 720 vertex of which 7 / 720 are part of one of the 1 SCC in 13 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1084 edges and 714 vertex of which 673 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.2 ms
Discarding 41 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 404 transitions
Trivial Post-agglo rules discarded 404 transitions
Performed 404 trivial Post agglomeration. Transition count delta: 404
Iterating post reduction 0 with 406 rules applied. Total rules applied 408 place count 673 transition count 340
Reduce places removed 404 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 440 rules applied. Total rules applied 848 place count 269 transition count 304
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 851 place count 268 transition count 302
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 853 place count 266 transition count 302
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 70 Pre rules applied. Total rules applied 853 place count 266 transition count 232
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 993 place count 196 transition count 232
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 1033 place count 156 transition count 192
Iterating global reduction 4 with 40 rules applied. Total rules applied 1073 place count 156 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1074 place count 156 transition count 191
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 1074 place count 156 transition count 188
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1080 place count 153 transition count 188
Graph (complete) has 296 edges and 153 vertex of which 41 are kept as prefixes of interest. Removing 112 places using SCC suffix rule.0 ms
Discarding 112 places :
Also discarding 111 output transitions
Drop transitions (Output transitions of discarded places.) removed 111 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 5 with 22 rules applied. Total rules applied 1102 place count 41 transition count 56
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 6 with 57 rules applied. Total rules applied 1159 place count 20 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1159 place count 20 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1161 place count 19 transition count 19
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1162 place count 18 transition count 18
Iterating global reduction 7 with 1 rules applied. Total rules applied 1163 place count 18 transition count 18
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 13 rules applied. Total rules applied 1176 place count 11 transition count 12
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1177 place count 11 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1178 place count 10 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1179 place count 9 transition count 10
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 1179 place count 9 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 1185 place count 6 transition count 7
Applied a total of 1185 rules in 81 ms. Remains 6 /720 variables (removed 714) and now considering 7/757 (removed 750) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 6/720 places, 7/757 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17209519749354201555.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14489450542825986821.kers'
[2026-05-25 18:24:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17209519749354201555.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14489450542825986821.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 7 rows 4 cols 9 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-25 18:24:49] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14489450542825986821.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 360 ms. (2770 steps per ms)
FORMULA GPUForwardProgress-PT-36b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 197 ms. (5050 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 23617 ms.

BK_STOP 1779733489662

--------------------
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="GPUForwardProgress-PT-36b"
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 GPUForwardProgress-PT-36b, 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 r146-tall-177961074200517"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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