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.r002-oct2-177944366100285.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 ASLink-PT-01a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366100285
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.8K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 5 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:06 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 201K 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 ASLink-PT-01a-UpperBounds-00
FORMULA_NAME ASLink-PT-01a-UpperBounds-01
FORMULA_NAME ASLink-PT-01a-UpperBounds-02
FORMULA_NAME ASLink-PT-01a-UpperBounds-03
FORMULA_NAME ASLink-PT-01a-UpperBounds-04
FORMULA_NAME ASLink-PT-01a-UpperBounds-05
FORMULA_NAME ASLink-PT-01a-UpperBounds-06
FORMULA_NAME ASLink-PT-01a-UpperBounds-07
FORMULA_NAME ASLink-PT-01a-UpperBounds-08
FORMULA_NAME ASLink-PT-01a-UpperBounds-09
FORMULA_NAME ASLink-PT-01a-UpperBounds-10
FORMULA_NAME ASLink-PT-01a-UpperBounds-11
FORMULA_NAME ASLink-PT-01a-UpperBounds-12
FORMULA_NAME ASLink-PT-01a-UpperBounds-13
FORMULA_NAME ASLink-PT-01a-UpperBounds-14
FORMULA_NAME ASLink-PT-01a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779470337400

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-01a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-22 17:18:59] [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-22 17:18:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 17:18:59] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2026-05-22 17:18:59] [INFO ] Transformed 431 places.
[2026-05-22 17:18:59] [INFO ] Transformed 735 transitions.
[2026-05-22 17:18:59] [INFO ] Found NUPN structural information;
[2026-05-22 17:18:59] [INFO ] Parsed PT model containing 431 places and 735 transitions and 2801 arcs in 359 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 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-10852222760769009781.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7434279591040026376.kers'
[2026-05-22 17:18:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10852222760769009781.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7434279591040026376.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 728 rows 427 cols 2779 entries
Finished phase 1 with 142 SingleSign rule and 209 generalized
[2026-05-22 17:18:59] [INFO ] Computed 80 invariants in 3 ms
Computed 80 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7434279591040026376.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 (192 resets) in 76 ms. (129 steps per ms)
FORMULA ASLink-PT-01a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (130 resets) in 41 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-22 17:19:00] [INFO ] Invariant cache hit.
[2026-05-22 17:19:00] [INFO ] [Real]Absence check using 14 positive place invariants in 27 ms returned sat
[2026-05-22 17:19:00] [INFO ] [Real]Absence check using 14 positive and 66 generalized place invariants in 59 ms returned sat
[2026-05-22 17:19:00] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2026-05-22 17:19:00] [INFO ] Computed and/alt/rep : 238/958/238 causal constraints (skipped 489 transitions) in 77 ms.
[2026-05-22 17:19:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 17:19:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2026-05-22 17:19:01] [INFO ] [Nat]Absence check using 14 positive and 66 generalized place invariants in 18 ms returned sat
[2026-05-22 17:19:01] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2026-05-22 17:19:01] [INFO ] Computed and/alt/rep : 238/958/238 causal constraints (skipped 489 transitions) in 43 ms.
[2026-05-22 17:19:04] [INFO ] Added : 196 causal constraints over 40 iterations in 3071 ms. Result :sat
Minimization took 520 ms.
[2026-05-22 17:19:05] [INFO ] [Real]Absence check using 14 positive place invariants in 37 ms returned sat
[2026-05-22 17:19:05] [INFO ] [Real]Absence check using 14 positive and 66 generalized place invariants in 53 ms returned sat
[2026-05-22 17:19:05] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2026-05-22 17:19:06] [INFO ] Computed and/alt/rep : 238/958/238 causal constraints (skipped 489 transitions) in 73 ms.
[2026-05-22 17:19:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 17:19:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2026-05-22 17:19:06] [INFO ] [Nat]Absence check using 14 positive and 66 generalized place invariants in 16 ms returned sat
[2026-05-22 17:19:06] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2026-05-22 17:19:06] [INFO ] Computed and/alt/rep : 238/958/238 causal constraints (skipped 489 transitions) in 92 ms.
[2026-05-22 17:19:09] [INFO ] Added : 174 causal constraints over 35 iterations in 2705 ms. Result :sat
Minimization took 506 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 728/728 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 425 transition count 696
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 70 place count 393 transition count 696
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 70 place count 393 transition count 667
Deduced a syphon composed of 29 places in 2 ms
Ensure Unique test removed 11 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 69 rules applied. Total rules applied 139 place count 353 transition count 667
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 2 with 1 rules applied. Total rules applied 140 place count 353 transition count 666
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 141 place count 352 transition count 666
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 145 place count 348 transition count 649
Ensure Unique test removed 1 places
Iterating global reduction 4 with 5 rules applied. Total rules applied 150 place count 347 transition count 649
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 156 place count 346 transition count 644
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 159 place count 343 transition count 644
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 160 place count 342 transition count 636
Iterating global reduction 6 with 1 rules applied. Total rules applied 161 place count 342 transition count 636
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 162 place count 341 transition count 628
Iterating global reduction 6 with 1 rules applied. Total rules applied 163 place count 341 transition count 628
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 164 place count 340 transition count 620
Iterating global reduction 6 with 1 rules applied. Total rules applied 165 place count 340 transition count 620
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 166 place count 339 transition count 612
Iterating global reduction 6 with 1 rules applied. Total rules applied 167 place count 339 transition count 612
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 168 place count 338 transition count 604
Iterating global reduction 6 with 1 rules applied. Total rules applied 169 place count 338 transition count 604
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 170 place count 337 transition count 596
Iterating global reduction 6 with 1 rules applied. Total rules applied 171 place count 337 transition count 596
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 172 place count 336 transition count 588
Iterating global reduction 6 with 1 rules applied. Total rules applied 173 place count 336 transition count 588
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 174 place count 335 transition count 580
Iterating global reduction 6 with 1 rules applied. Total rules applied 175 place count 335 transition count 580
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 176 place count 334 transition count 572
Iterating global reduction 6 with 1 rules applied. Total rules applied 177 place count 334 transition count 572
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 178 place count 333 transition count 564
Iterating global reduction 6 with 1 rules applied. Total rules applied 179 place count 333 transition count 564
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 180 place count 332 transition count 556
Iterating global reduction 6 with 1 rules applied. Total rules applied 181 place count 332 transition count 556
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 182 place count 331 transition count 548
Iterating global reduction 6 with 1 rules applied. Total rules applied 183 place count 331 transition count 548
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 184 place count 330 transition count 540
Iterating global reduction 6 with 1 rules applied. Total rules applied 185 place count 330 transition count 540
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 186 place count 329 transition count 532
Iterating global reduction 6 with 1 rules applied. Total rules applied 187 place count 329 transition count 532
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 188 place count 328 transition count 524
Iterating global reduction 6 with 1 rules applied. Total rules applied 189 place count 328 transition count 524
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 190 place count 327 transition count 516
Iterating global reduction 6 with 1 rules applied. Total rules applied 191 place count 327 transition count 516
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 205 place count 320 transition count 509
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 207 place count 320 transition count 509
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 208 place count 319 transition count 508
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 210 place count 317 transition count 508
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 210 place count 317 transition count 504
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 9 rules applied. Total rules applied 219 place count 312 transition count 504
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 221 place count 310 transition count 504
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 221 place count 310 transition count 503
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 223 place count 309 transition count 503
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 227 place count 307 transition count 501
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 228 place count 306 transition count 500
Iterating global reduction 8 with 1 rules applied. Total rules applied 229 place count 306 transition count 500
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 230 place count 306 transition count 499
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 231 place count 305 transition count 499
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 232 place count 305 transition count 499
Applied a total of 232 rules in 534 ms. Remains 305 /431 variables (removed 126) and now considering 499/728 (removed 229) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 547 ms. Remains : 305/431 places, 499/728 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9975409008427989608.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12013448570100869965.kers'
[2026-05-22 17:19:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9975409008427989608.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12013448570100869965.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 499 rows 300 cols 1946 entries
Finished phase 1 with 74 SingleSign rule and 175 generalized
[2026-05-22 17:19:10] [INFO ] Computed 56 invariants in 3 ms
Computed 56 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12013448570100869965.kers
Total runtime 4 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (21493 resets) in 1620 ms. (616 steps per ms)
FORMULA ASLink-PT-01a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (9317 resets) in 989 ms. (1010 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 13595 ms.

BK_STOP 1779470353098

--------------------
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="ASLink-PT-01a"
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 ASLink-PT-01a, 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 r002-oct2-177944366100285"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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