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.r263-tall-171654371800006.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 MultiCrashLeafsetExtension-PT-S16C03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654371800006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 07:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 07:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 12 07:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 12 07:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.5M May 18 16:43 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 MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716624080023

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=MultiCrashLeafsetExtension-PT-S16C03
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 08:01:21] [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-05-25 08:01:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 08:01:22] [INFO ] Load time of PNML (sax parser for PT used): 283 ms
[2024-05-25 08:01:22] [INFO ] Transformed 3606 places.
[2024-05-25 08:01:22] [INFO ] Transformed 5141 transitions.
[2024-05-25 08:01:22] [INFO ] Parsed PT model containing 3606 places and 5141 transitions and 20838 arcs in 389 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Normalized transition count is 4869 out of 5141 initially.
// Phase 1: matrix 4869 rows 3606 cols
[2024-05-25 08:01:22] [INFO ] Computed 459 invariants in 299 ms
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 317 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 15) seen :13
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :9
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :5
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :8
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :8
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :7
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :7
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :10
[2024-05-25 08:01:23] [INFO ] Flow matrix only has 4869 transitions (discarded 272 similar events)
// Phase 1: matrix 4869 rows 3606 cols
[2024-05-25 08:01:23] [INFO ] Computed 459 invariants in 114 ms
[2024-05-25 08:01:23] [INFO ] [Real]Absence check using 44 positive place invariants in 56 ms returned sat
[2024-05-25 08:01:23] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 35 ms returned unsat
[2024-05-25 08:01:24] [INFO ] [Real]Absence check using 44 positive place invariants in 48 ms returned sat
[2024-05-25 08:01:24] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 34 ms returned unsat
[2024-05-25 08:01:24] [INFO ] [Real]Absence check using 44 positive place invariants in 43 ms returned sat
[2024-05-25 08:01:24] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 31 ms returned unsat
[2024-05-25 08:01:25] [INFO ] [Real]Absence check using 44 positive place invariants in 39 ms returned sat
[2024-05-25 08:01:25] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 82 ms returned unsat
[2024-05-25 08:01:25] [INFO ] [Real]Absence check using 44 positive place invariants in 48 ms returned sat
[2024-05-25 08:01:25] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 72 ms returned unsat
[2024-05-25 08:01:25] [INFO ] [Real]Absence check using 44 positive place invariants in 43 ms returned sat
[2024-05-25 08:01:26] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 134 ms returned unsat
[2024-05-25 08:01:26] [INFO ] [Real]Absence check using 44 positive place invariants in 39 ms returned sat
[2024-05-25 08:01:26] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 123 ms returned sat
[2024-05-25 08:01:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:01:28] [INFO ] [Real]Absence check using state equation in 2357 ms returned sat
[2024-05-25 08:01:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:01:29] [INFO ] [Nat]Absence check using 44 positive place invariants in 45 ms returned sat
[2024-05-25 08:01:29] [INFO ] [Nat]Absence check using 44 positive and 415 generalized place invariants in 143 ms returned sat
[2024-05-25 08:01:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:01:31] [INFO ] [Nat]Absence check using state equation in 2053 ms returned sat
[2024-05-25 08:01:31] [INFO ] State equation strengthened by 1362 read => feed constraints.
[2024-05-25 08:01:33] [INFO ] [Nat]Added 1362 Read/Feed constraints in 1764 ms returned unsat
[2024-05-25 08:01:33] [INFO ] [Real]Absence check using 44 positive place invariants in 37 ms returned sat
[2024-05-25 08:01:34] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 113 ms returned unsat
[2024-05-25 08:01:34] [INFO ] [Real]Absence check using 44 positive place invariants in 34 ms returned sat
[2024-05-25 08:01:34] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 134 ms returned sat
[2024-05-25 08:01:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:01:37] [INFO ] [Real]Absence check using state equation in 2991 ms returned sat
[2024-05-25 08:01:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:01:37] [INFO ] [Nat]Absence check using 44 positive place invariants in 40 ms returned sat
[2024-05-25 08:01:38] [INFO ] [Nat]Absence check using 44 positive and 415 generalized place invariants in 133 ms returned sat
[2024-05-25 08:01:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:01:40] [INFO ] [Nat]Absence check using state equation in 1916 ms returned sat
[2024-05-25 08:01:40] [INFO ] [Nat]Added 1362 Read/Feed constraints in 617 ms returned sat
[2024-05-25 08:01:43] [INFO ] Deduced a trap composed of 534 places in 2915 ms of which 10 ms to minimize.
[2024-05-25 08:01:43] [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: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 08:01:44] [INFO ] [Real]Absence check using 44 positive place invariants in 37 ms returned sat
[2024-05-25 08:01:44] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 31 ms returned unsat
[2024-05-25 08:01:44] [INFO ] [Real]Absence check using 44 positive place invariants in 37 ms returned sat
[2024-05-25 08:01:44] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 28 ms returned unsat
[2024-05-25 08:01:44] [INFO ] [Real]Absence check using 44 positive place invariants in 38 ms returned sat
[2024-05-25 08:01:44] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 85 ms returned unsat
[2024-05-25 08:01:45] [INFO ] [Real]Absence check using 44 positive place invariants in 38 ms returned sat
[2024-05-25 08:01:45] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 121 ms returned unsat
[2024-05-25 08:01:45] [INFO ] [Real]Absence check using 44 positive place invariants in 41 ms returned sat
[2024-05-25 08:01:45] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 91 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 0, 1, 51, 1, 1, 1, 1, 1] Max seen :[1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 3606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3606/3606 places, 5141/5141 transitions.
Graph (complete) has 12103 edges and 3606 vertex of which 3580 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.16 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 815 transitions
Trivial Post-agglo rules discarded 815 transitions
Performed 815 trivial Post agglomeration. Transition count delta: 815
Iterating post reduction 0 with 815 rules applied. Total rules applied 816 place count 3580 transition count 4326
Reduce places removed 815 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 816 rules applied. Total rules applied 1632 place count 2765 transition count 4325
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1633 place count 2764 transition count 4325
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 1633 place count 2764 transition count 4223
Deduced a syphon composed of 102 places in 5 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 1837 place count 2662 transition count 4223
Discarding 713 places :
Symmetric choice reduction at 3 with 713 rule applications. Total rules 2550 place count 1949 transition count 3510
Iterating global reduction 3 with 713 rules applied. Total rules applied 3263 place count 1949 transition count 3510
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 3263 place count 1949 transition count 3505
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 3273 place count 1944 transition count 3505
Discarding 237 places :
Symmetric choice reduction at 3 with 237 rule applications. Total rules 3510 place count 1707 transition count 2794
Iterating global reduction 3 with 237 rules applied. Total rules applied 3747 place count 1707 transition count 2794
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3781 place count 1690 transition count 2777
Free-agglomeration rule (complex) applied 161 times.
Iterating global reduction 3 with 161 rules applied. Total rules applied 3942 place count 1690 transition count 3090
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 3 with 161 rules applied. Total rules applied 4103 place count 1529 transition count 3090
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 4120 place count 1529 transition count 3090
Applied a total of 4120 rules in 1220 ms. Remains 1529 /3606 variables (removed 2077) and now considering 3090/5141 (removed 2051) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1221 ms. Remains : 1529/3606 places, 3090/5141 transitions.
Normalized transition count is 2692 out of 3090 initially.
// Phase 1: matrix 2692 rows 1529 cols
[2024-05-25 08:01:47] [INFO ] Computed 433 invariants in 35 ms
Incomplete random walk after 1000000 steps, including 52073 resets, run finished after 9529 ms. (steps per millisecond=104 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 8912 resets, run finished after 2230 ms. (steps per millisecond=448 ) properties (out of 1) seen :1
[2024-05-25 08:01:58] [INFO ] Flow matrix only has 2692 transitions (discarded 398 similar events)
// Phase 1: matrix 2692 rows 1529 cols
[2024-05-25 08:01:58] [INFO ] Computed 433 invariants in 35 ms
[2024-05-25 08:01:59] [INFO ] [Real]Absence check using 33 positive place invariants in 27 ms returned sat
[2024-05-25 08:01:59] [INFO ] [Real]Absence check using 33 positive and 400 generalized place invariants in 54 ms returned unsat
Current structural bounds on expressions (after SMT) : [1] Max seen :[1]
FORMULA MultiCrashLeafsetExtension-PT-S16C03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 37390 ms.

BK_STOP 1716624120233

--------------------
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="MultiCrashLeafsetExtension-PT-S16C03"
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 MultiCrashLeafsetExtension-PT-S16C03, 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 r263-tall-171654371800006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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