Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r209-tall-174894546700065.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is ShieldIIPt-PT-010B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r209-tall-174894546700065
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 167K May 29 14:32 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 ShieldIIPt-PT-010B-UpperBounds-00
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-01
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-02
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-03
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-04
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-05
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-06
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-07
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-08
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-09
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-10
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-11
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-12
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-13
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-14
FORMULA_NAME ShieldIIPt-PT-010B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749020203054

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-010B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-04 06:56:44] [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]
[2025-06-04 06:56:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 06:56:44] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2025-06-04 06:56:44] [INFO ] Transformed 703 places.
[2025-06-04 06:56:44] [INFO ] Transformed 653 transitions.
[2025-06-04 06:56:44] [INFO ] Found NUPN structural information;
[2025-06-04 06:56:44] [INFO ] Parsed PT model containing 703 places and 653 transitions and 1626 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 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]
// Phase 1: matrix 653 rows 703 cols
[2025-06-04 06:56:44] [INFO ] Computed 91 invariants in 16 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 (2 resets) in 59 ms. (166 steps per ms)
FORMULA ShieldIIPt-PT-010B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20001 steps (4 resets) in 25 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-04 06:56:44] [INFO ] Invariant cache hit.
[2025-06-04 06:56:45] [INFO ] [Real]Absence check using 91 positive place invariants in 35 ms returned sat
[2025-06-04 06:56:45] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2025-06-04 06:56:45] [INFO ] Deduced a trap composed of 24 places in 223 ms of which 19 ms to minimize.
[2025-06-04 06:56:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 06:56:45] [INFO ] [Nat]Absence check using 91 positive place invariants in 29 ms returned sat
[2025-06-04 06:56:46] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2025-06-04 06:56:46] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 25 ms to minimize.
[2025-06-04 06:56:46] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 4 ms to minimize.
[2025-06-04 06:56:46] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 4 ms to minimize.
[2025-06-04 06:56:46] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 3 ms to minimize.
[2025-06-04 06:56:46] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 3 ms to minimize.
[2025-06-04 06:56:47] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 3 ms to minimize.
[2025-06-04 06:56:47] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2025-06-04 06:56:47] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 3 ms to minimize.
[2025-06-04 06:56:47] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2025-06-04 06:56:47] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 3 ms to minimize.
[2025-06-04 06:56:47] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 2 ms to minimize.
[2025-06-04 06:56:47] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1794 ms
[2025-06-04 06:56:47] [INFO ] Computed and/alt/rep : 652/983/652 causal constraints (skipped 0 transitions) in 38 ms.
[2025-06-04 06:56:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-04 06:56:50] [INFO ] [Real]Absence check using 91 positive place invariants in 29 ms returned sat
[2025-06-04 06:56:51] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2025-06-04 06:56:51] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 4 ms to minimize.
[2025-06-04 06:56:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 06:56:51] [INFO ] [Nat]Absence check using 91 positive place invariants in 31 ms returned sat
[2025-06-04 06:56:51] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2025-06-04 06:56:51] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 3 ms to minimize.
[2025-06-04 06:56:52] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 5 ms to minimize.
[2025-06-04 06:56:52] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 4 ms to minimize.
[2025-06-04 06:56:52] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 4 ms to minimize.
[2025-06-04 06:56:52] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 4 ms to minimize.
[2025-06-04 06:56:52] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 4 ms to minimize.
[2025-06-04 06:56:52] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 3 ms to minimize.
[2025-06-04 06:56:53] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 3 ms to minimize.
[2025-06-04 06:56:53] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 3 ms to minimize.
[2025-06-04 06:56:53] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 4 ms to minimize.
[2025-06-04 06:56:53] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 3 ms to minimize.
[2025-06-04 06:56:53] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 3 ms to minimize.
[2025-06-04 06:56:53] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 3 ms to minimize.
[2025-06-04 06:56:54] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 3 ms to minimize.
[2025-06-04 06:56:54] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 3 ms to minimize.
[2025-06-04 06:56:54] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 3 ms to minimize.
[2025-06-04 06:56:54] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 3 ms to minimize.
[2025-06-04 06:56:54] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
[2025-06-04 06:56:54] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 3 ms to minimize.
[2025-06-04 06:56:54] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 3 ms to minimize.
[2025-06-04 06:56:55] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2025-06-04 06:56:55] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3523 ms
[2025-06-04 06:56:55] [INFO ] Computed and/alt/rep : 652/983/652 causal constraints (skipped 0 transitions) in 35 ms.
Maximisation of solution failed !
Minimization took 4 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 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 653/653 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 171 rules applied. Total rules applied 171 place count 703 transition count 482
Reduce places removed 171 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 173 rules applied. Total rules applied 344 place count 532 transition count 480
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 346 place count 531 transition count 479
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 347 place count 530 transition count 479
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 347 place count 530 transition count 438
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 429 place count 489 transition count 438
Discarding 69 places :
Symmetric choice reduction at 4 with 69 rule applications. Total rules 498 place count 420 transition count 369
Iterating global reduction 4 with 69 rules applied. Total rules applied 567 place count 420 transition count 369
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 567 place count 420 transition count 340
Deduced a syphon composed of 29 places in 3 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 625 place count 391 transition count 340
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 1 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 4 with 340 rules applied. Total rules applied 965 place count 221 transition count 170
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1023 place count 192 transition count 189
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1024 place count 192 transition count 188
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 1033 place count 192 transition count 188
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1034 place count 191 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1036 place count 189 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1036 place count 189 transition count 186
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1038 place count 188 transition count 186
Applied a total of 1038 rules in 222 ms. Remains 188 /703 variables (removed 515) and now considering 186/653 (removed 467) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 188/703 places, 186/653 transitions.
// Phase 1: matrix 186 rows 188 cols
[2025-06-04 06:56:56] [INFO ] Computed 89 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 3090 ms. (323 steps per ms)
FORMULA ShieldIIPt-PT-010B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-010B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 1453 ms. (687 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-04 06:57:01] [INFO ] Flatten gal took : 52 ms
[2025-06-04 06:57:01] [INFO ] Flatten gal took : 18 ms
[2025-06-04 06:57:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2364801298022657861.gal : 11 ms
[2025-06-04 06:57:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality334202618636352013.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2364801298022657861.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality334202618636352013.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 17116 ms.

BK_STOP 1749020221495

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="ShieldIIPt-PT-010B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is ShieldIIPt-PT-010B, 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 r209-tall-174894546700065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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