Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446900333.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-PT-S06J04T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446900333
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 18K Apr 11 17:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 17:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 443K Apr 11 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.9M Apr 11 17:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 11 17:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 17:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 268K Apr 11 17:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 11 17:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M 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 PolyORBLF-PT-S06J04T08-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716920184755

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-28 18:16:26] [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-28 18:16:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 18:16:26] [INFO ] Load time of PNML (sax parser for PT used): 651 ms
[2024-05-28 18:16:26] [INFO ] Transformed 810 places.
[2024-05-28 18:16:26] [INFO ] Transformed 14014 transitions.
[2024-05-28 18:16:26] [INFO ] Parsed PT model containing 810 places and 14014 transitions and 118428 arcs in 921 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Ensure Unique test removed 10760 transitions
Reduce redundant transitions removed 10760 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-28 18:16:27] [INFO ] Flow matrix only has 3206 transitions (discarded 48 similar events)
// Phase 1: matrix 3206 rows 810 cols
[2024-05-28 18:16:27] [INFO ] Computed 58 invariants in 198 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf, +inf, 1, 1, +inf, +inf, +inf, 11, +inf, +inf, 1]
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (82 resets) in 148 ms. (67 steps per ms)
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120007 steps (549 resets) in 592 ms. (202 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 8, 1, 4, 1, 1, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 11, +inf, +inf]
[2024-05-28 18:16:28] [INFO ] Flow matrix only has 3206 transitions (discarded 48 similar events)
[2024-05-28 18:16:28] [INFO ] Invariant cache hit.
[2024-05-28 18:16:28] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2024-05-28 18:16:28] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 50 ms returned unsat
[2024-05-28 18:16:28] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2024-05-28 18:16:28] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 55 ms returned unsat
[2024-05-28 18:16:28] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2024-05-28 18:16:28] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 50 ms returned unsat
[2024-05-28 18:16:29] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-28 18:16:29] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 38 ms returned unsat
[2024-05-28 18:16:29] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-28 18:16:29] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 36 ms returned unsat
[2024-05-28 18:16:29] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-28 18:16:29] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 49 ms returned unsat
[2024-05-28 18:16:29] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-28 18:16:29] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 37 ms returned unsat
[2024-05-28 18:16:29] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2024-05-28 18:16:29] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 65 ms returned unsat
[2024-05-28 18:16:29] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-28 18:16:29] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 38 ms returned unsat
[2024-05-28 18:16:30] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-28 18:16:30] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 13 ms returned unsat
[2024-05-28 18:16:30] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-05-28 18:16:30] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 38 ms returned unsat
[2024-05-28 18:16:30] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-28 18:16:30] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 50 ms returned sat
[2024-05-28 18:16:32] [INFO ] [Real]Absence check using state equation in 2450 ms returned sat
[2024-05-28 18:16:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 18:16:33] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-05-28 18:16:33] [INFO ] [Nat]Absence check using 17 positive and 41 generalized place invariants in 38 ms returned sat
[2024-05-28 18:16:35] [INFO ] [Nat]Absence check using state equation in 1859 ms returned sat
[2024-05-28 18:16:35] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-28 18:16:35] [INFO ] [Nat]Added 224 Read/Feed constraints in 175 ms returned sat
[2024-05-28 18:16:35] [INFO ] Deduced a trap composed of 86 places in 223 ms of which 23 ms to minimize.
[2024-05-28 18:16:35] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 1 ms to minimize.
[2024-05-28 18:16:35] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 1 ms to minimize.
[2024-05-28 18:16:36] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-05-28 18:16:36] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 2 ms to minimize.
[2024-05-28 18:16:36] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 1 ms to minimize.
[2024-05-28 18:16:37] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 2 ms to minimize.
[2024-05-28 18:16:38] [INFO ] Deduced a trap composed of 461 places in 970 ms of which 7 ms to minimize.
[2024-05-28 18:16:38] [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 11
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
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)
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 8, 1, 4, 1, 1, 1, 1] Max Struct:[1, 1, 1, 1, 1, 8, 1, 4, 1, 1, 1, +inf]
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-06 8 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 810 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 810/810 places, 3254/3254 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 804 transition count 3183
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 148 place count 733 transition count 3183
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 148 place count 733 transition count 3087
Deduced a syphon composed of 96 places in 7 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 340 place count 637 transition count 3087
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 4 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 530 place count 542 transition count 2992
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 546 place count 542 transition count 2976
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 562 place count 526 transition count 2976
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 563 place count 526 transition count 2976
Applied a total of 563 rules in 796 ms. Remains 526 /810 variables (removed 284) and now considering 2976/3254 (removed 278) transitions.
Running 2970 sub problems to find dead transitions.
[2024-05-28 18:16:39] [INFO ] Flow matrix only has 2928 transitions (discarded 48 similar events)
// Phase 1: matrix 2928 rows 526 cols
[2024-05-28 18:16:39] [INFO ] Computed 52 invariants in 93 ms
[2024-05-28 18:16:39] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2970 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 2970 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/3454 variables, and 41 constraints, problems are : Problem set: 0 solved, 2970 unsolved in 20075 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 27/37 constraints, State Equation: 0/526 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 2970/1170 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2970 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2970 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 2970 unsolved
[2024-05-28 18:17:32] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
[2024-05-28 18:17:33] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/3454 variables, and 43 constraints, problems are : Problem set: 0 solved, 2970 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 27/37 constraints, State Equation: 0/526 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1800/1170 constraints, Known Traps: 2/2 constraints]
After SMT, in 71563ms problems are : Problem set: 0 solved, 2970 unsolved
Search for dead transitions found 0 dead transitions in 71619ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72465 ms. Remains : 526/810 places, 2976/3254 transitions.
[2024-05-28 18:17:50] [INFO ] Flow matrix only has 2928 transitions (discarded 48 similar events)

BK_TIME_CONFINEMENT_REACHED

--------------------
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="PolyORBLF-PT-S06J04T08"
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-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-PT-S06J04T08, 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 r290-tajo-171654446900333"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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