Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r597-smll-171734926500111.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool gold2023
Input is MedleyA-PT-23, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926500111
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 150K Jun 2 16: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 MedleyA-PT-23-UpperBounds-00
FORMULA_NAME MedleyA-PT-23-UpperBounds-01
FORMULA_NAME MedleyA-PT-23-UpperBounds-02
FORMULA_NAME MedleyA-PT-23-UpperBounds-03
FORMULA_NAME MedleyA-PT-23-UpperBounds-04
FORMULA_NAME MedleyA-PT-23-UpperBounds-05
FORMULA_NAME MedleyA-PT-23-UpperBounds-06
FORMULA_NAME MedleyA-PT-23-UpperBounds-07
FORMULA_NAME MedleyA-PT-23-UpperBounds-08
FORMULA_NAME MedleyA-PT-23-UpperBounds-09
FORMULA_NAME MedleyA-PT-23-UpperBounds-10
FORMULA_NAME MedleyA-PT-23-UpperBounds-11
FORMULA_NAME MedleyA-PT-23-UpperBounds-12
FORMULA_NAME MedleyA-PT-23-UpperBounds-13
FORMULA_NAME MedleyA-PT-23-UpperBounds-14
FORMULA_NAME MedleyA-PT-23-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717367880556

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-23
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 22:38:03] [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]
[2024-06-02 22:38:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:38:04] [INFO ] Load time of PNML (sax parser for PT used): 235 ms
[2024-06-02 22:38:04] [INFO ] Transformed 378 places.
[2024-06-02 22:38:04] [INFO ] Transformed 614 transitions.
[2024-06-02 22:38:04] [INFO ] Found NUPN structural information;
[2024-06-02 22:38:04] [INFO ] Parsed PT model containing 378 places and 614 transitions and 1969 arcs in 481 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 614 rows 378 cols
[2024-06-02 22:38:04] [INFO ] Computed 11 invariants in 29 ms
Incomplete random walk after 10000 steps, including 8 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 16) seen :5
FORMULA MedleyA-PT-23-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :3
FORMULA MedleyA-PT-23-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :1
FORMULA MedleyA-PT-23-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :2
FORMULA MedleyA-PT-23-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-02 22:38:04] [INFO ] Invariant cache hit.
[2024-06-02 22:38:04] [INFO ] [Real]Absence check using 9 positive place invariants in 16 ms returned sat
[2024-06-02 22:38:04] [INFO ] [Real]Absence check using 9 positive and 2 generalized place invariants in 5 ms returned sat
[2024-06-02 22:38:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:38:05] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2024-06-02 22:38:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:38:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned sat
[2024-06-02 22:38:05] [INFO ] [Nat]Absence check using 9 positive and 2 generalized place invariants in 4 ms returned sat
[2024-06-02 22:38:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:38:05] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2024-06-02 22:38:06] [INFO ] Deduced a trap composed of 55 places in 487 ms of which 9 ms to minimize.
[2024-06-02 22:38:06] [INFO ] Deduced a trap composed of 83 places in 260 ms of which 2 ms to minimize.
[2024-06-02 22:38:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 881 ms
[2024-06-02 22:38:06] [INFO ] Computed and/alt/rep : 509/1869/509 causal constraints (skipped 104 transitions) in 88 ms.
[2024-06-02 22:38:08] [INFO ] Added : 167 causal constraints over 35 iterations in 1821 ms. Result :sat
Minimization took 177 ms.
[2024-06-02 22:38:08] [INFO ] [Real]Absence check using 9 positive place invariants in 11 ms returned sat
[2024-06-02 22:38:08] [INFO ] [Real]Absence check using 9 positive and 2 generalized place invariants in 8 ms returned sat
[2024-06-02 22:38:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:38:09] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2024-06-02 22:38:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:38:09] [INFO ] [Nat]Absence check using 9 positive place invariants in 13 ms returned sat
[2024-06-02 22:38:09] [INFO ] [Nat]Absence check using 9 positive and 2 generalized place invariants in 4 ms returned sat
[2024-06-02 22:38:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:38:09] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2024-06-02 22:38:09] [INFO ] Computed and/alt/rep : 509/1869/509 causal constraints (skipped 104 transitions) in 66 ms.
[2024-06-02 22:38:11] [INFO ] Added : 161 causal constraints over 33 iterations in 1621 ms. Result :sat
Minimization took 198 ms.
[2024-06-02 22:38:11] [INFO ] [Real]Absence check using 9 positive place invariants in 12 ms returned sat
[2024-06-02 22:38:11] [INFO ] [Real]Absence check using 9 positive and 2 generalized place invariants in 6 ms returned sat
[2024-06-02 22:38:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:38:11] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2024-06-02 22:38:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:38:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 12 ms returned sat
[2024-06-02 22:38:11] [INFO ] [Nat]Absence check using 9 positive and 2 generalized place invariants in 4 ms returned sat
[2024-06-02 22:38:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:38:12] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2024-06-02 22:38:12] [INFO ] Computed and/alt/rep : 509/1869/509 causal constraints (skipped 104 transitions) in 56 ms.
[2024-06-02 22:38:13] [INFO ] Added : 161 causal constraints over 33 iterations in 1482 ms. Result :sat
Minimization took 153 ms.
[2024-06-02 22:38:13] [INFO ] [Real]Absence check using 9 positive place invariants in 12 ms returned sat
[2024-06-02 22:38:13] [INFO ] [Real]Absence check using 9 positive and 2 generalized place invariants in 5 ms returned sat
[2024-06-02 22:38:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:38:14] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2024-06-02 22:38:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:38:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 13 ms returned sat
[2024-06-02 22:38:14] [INFO ] [Nat]Absence check using 9 positive and 2 generalized place invariants in 4 ms returned sat
[2024-06-02 22:38:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:38:14] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2024-06-02 22:38:14] [INFO ] Deduced a trap composed of 196 places in 214 ms of which 1 ms to minimize.
[2024-06-02 22:38:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2024-06-02 22:38:14] [INFO ] Computed and/alt/rep : 509/1869/509 causal constraints (skipped 104 transitions) in 50 ms.
[2024-06-02 22:38:16] [INFO ] Added : 157 causal constraints over 32 iterations in 1599 ms. Result :sat
Minimization took 191 ms.
[2024-06-02 22:38:16] [INFO ] [Real]Absence check using 9 positive place invariants in 12 ms returned sat
[2024-06-02 22:38:16] [INFO ] [Real]Absence check using 9 positive and 2 generalized place invariants in 4 ms returned sat
[2024-06-02 22:38:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:38:16] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2024-06-02 22:38:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:38:17] [INFO ] [Nat]Absence check using 9 positive place invariants in 12 ms returned sat
[2024-06-02 22:38:17] [INFO ] [Nat]Absence check using 9 positive and 2 generalized place invariants in 4 ms returned sat
[2024-06-02 22:38:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:38:17] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2024-06-02 22:38:17] [INFO ] Deduced a trap composed of 52 places in 217 ms of which 2 ms to minimize.
[2024-06-02 22:38:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2024-06-02 22:38:17] [INFO ] Computed and/alt/rep : 509/1869/509 causal constraints (skipped 104 transitions) in 57 ms.
[2024-06-02 22:38:19] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 0 ms to minimize.
[2024-06-02 22:38:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2024-06-02 22:38:20] [INFO ] Added : 234 causal constraints over 49 iterations in 2559 ms. Result :sat
Minimization took 207 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA MedleyA-PT-23-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-23-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-23-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-23-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 378 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 613/613 transitions.
Graph (trivial) has 337 edges and 378 vertex of which 39 / 378 are part of one of the 3 SCC in 6 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 1034 edges and 342 vertex of which 339 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 119 rules applied. Total rules applied 121 place count 338 transition count 446
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 240 place count 223 transition count 442
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 314 place count 149 transition count 368
Iterating global reduction 2 with 74 rules applied. Total rules applied 388 place count 149 transition count 368
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 388 place count 149 transition count 358
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 408 place count 139 transition count 358
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 411 place count 139 transition count 355
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 446 place count 104 transition count 250
Iterating global reduction 3 with 35 rules applied. Total rules applied 481 place count 104 transition count 250
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 15 rules applied. Total rules applied 496 place count 104 transition count 235
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 502 place count 101 transition count 232
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 505 place count 98 transition count 226
Iterating global reduction 5 with 3 rules applied. Total rules applied 508 place count 98 transition count 226
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 511 place count 95 transition count 217
Iterating global reduction 5 with 3 rules applied. Total rules applied 514 place count 95 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 517 place count 95 transition count 214
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 545 place count 81 transition count 200
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 563 place count 72 transition count 215
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 572 place count 72 transition count 206
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 575 place count 69 transition count 197
Iterating global reduction 6 with 3 rules applied. Total rules applied 578 place count 69 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 581 place count 69 transition count 194
Free-agglomeration rule applied 19 times.
Iterating global reduction 7 with 19 rules applied. Total rules applied 600 place count 69 transition count 175
Reduce places removed 19 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 625 place count 50 transition count 169
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 631 place count 47 transition count 166
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 632 place count 46 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 633 place count 45 transition count 165
Applied a total of 633 rules in 178 ms. Remains 45 /378 variables (removed 333) and now considering 165/613 (removed 448) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 45/378 places, 165/613 transitions.
Normalized transition count is 159 out of 165 initially.
// Phase 1: matrix 159 rows 45 cols
[2024-06-02 22:38:20] [INFO ] Computed 10 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 18332 resets, run finished after 2918 ms. (steps per millisecond=342 ) properties (out of 1) seen :1
FORMULA MedleyA-PT-23-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 20058 ms.

BK_STOP 1717367904708

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-23"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is MedleyA-PT-23, 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 r597-smll-171734926500111"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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