Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r293-tall-167873945500525.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is PolyORBLF-PT-S02J06T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945500525
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 21K Feb 26 14:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 26 14:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 29K Feb 26 14:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 157K Feb 26 14:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 36K Feb 26 14:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 175K Feb 26 14:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 807K Mar 5 18:23 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-S02J06T08-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678885574587

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T08
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-15 13:06:16] [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]
[2023-03-15 13:06:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 13:06:16] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2023-03-15 13:06:16] [INFO ] Transformed 690 places.
[2023-03-15 13:06:16] [INFO ] Transformed 1434 transitions.
[2023-03-15 13:06:16] [INFO ] Parsed PT model containing 690 places and 1434 transitions and 6564 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Normalized transition count is 1290 out of 1306 initially.
// Phase 1: matrix 1290 rows 690 cols
[2023-03-15 13:06:16] [INFO ] Computed 54 place invariants in 86 ms
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 15) seen :24
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :23
[2023-03-15 13:06:16] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2023-03-15 13:06:17] [INFO ] Computed 54 place invariants in 68 ms
[2023-03-15 13:06:17] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-15 13:06:17] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 43 ms returned sat
[2023-03-15 13:06:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 13:06:18] [INFO ] [Real]Absence check using state equation in 956 ms returned sat
[2023-03-15 13:06:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 13:06:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-15 13:06:18] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 28 ms returned sat
[2023-03-15 13:06:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 13:06:21] [INFO ] [Nat]Absence check using state equation in 2908 ms returned sat
[2023-03-15 13:06:21] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 13:06:23] [INFO ] [Nat]Added 96 Read/Feed constraints in 1585 ms returned sat
[2023-03-15 13:06:23] [INFO ] Deduced a trap composed of 139 places in 323 ms of which 24 ms to minimize.
[2023-03-15 13:06:23] [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 0
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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-15 13:06:23] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 13:06:23] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 9 ms returned unsat
[2023-03-15 13:06:23] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-15 13:06:23] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 8 ms returned unsat
[2023-03-15 13:06:23] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 13:06:23] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 9 ms returned unsat
[2023-03-15 13:06:23] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-15 13:06:23] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 17 ms returned unsat
[2023-03-15 13:06:23] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 13:06:23] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 16 ms returned unsat
[2023-03-15 13:06:23] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 13:06:24] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 28 ms returned unsat
[2023-03-15 13:06:24] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 13:06:24] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 10 ms returned unsat
[2023-03-15 13:06:24] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-15 13:06:24] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 8 ms returned unsat
[2023-03-15 13:06:24] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-15 13:06:24] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 16 ms returned unsat
[2023-03-15 13:06:24] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 13:06:24] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 10 ms returned unsat
[2023-03-15 13:06:24] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 13:06:24] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 8 ms returned unsat
[2023-03-15 13:06:24] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-15 13:06:24] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 9 ms returned unsat
[2023-03-15 13:06:24] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 13:06:24] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 9 ms returned unsat
Current structural bounds on expressions (after SMT) : [104, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1] Max seen :[7, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1]
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 8 out of 690 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 688 transition count 1234
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 616 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 146 place count 616 transition count 1154
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 306 place count 536 transition count 1154
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 418 place count 480 transition count 1098
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 434 place count 480 transition count 1082
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 450 place count 464 transition count 1082
Applied a total of 450 rules in 213 ms. Remains 464 /690 variables (removed 226) and now considering 1082/1306 (removed 224) transitions.
[2023-03-15 13:06:24] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
// Phase 1: matrix 1066 rows 464 cols
[2023-03-15 13:06:24] [INFO ] Computed 52 place invariants in 21 ms
[2023-03-15 13:06:25] [INFO ] Dead Transitions using invariants and state equation in 773 ms found 88 transitions.
Found 88 dead transitions using SMT.
Drop transitions removed 88 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 464/690 places, 994/1306 transitions.
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 462 transition count 978
Reduce places removed 16 places and 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 18 place count 446 transition count 962
Applied a total of 18 rules in 45 ms. Remains 446 /464 variables (removed 18) and now considering 962/994 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1035 ms. Remains : 446/690 places, 962/1306 transitions.
Normalized transition count is 946 out of 962 initially.
// Phase 1: matrix 946 rows 446 cols
[2023-03-15 13:06:25] [INFO ] Computed 52 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 400 resets, run finished after 4405 ms. (steps per millisecond=227 ) properties (out of 1) seen :7
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1900 ms. (steps per millisecond=526 ) properties (out of 1) seen :7
[2023-03-15 13:06:32] [INFO ] Flow matrix only has 946 transitions (discarded 16 similar events)
// Phase 1: matrix 946 rows 446 cols
[2023-03-15 13:06:32] [INFO ] Computed 52 place invariants in 22 ms
[2023-03-15 13:06:32] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-15 13:06:32] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 15 ms returned sat
[2023-03-15 13:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 13:06:33] [INFO ] [Real]Absence check using state equation in 968 ms returned sat
[2023-03-15 13:06:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 13:06:33] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-15 13:06:33] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 15 ms returned sat
[2023-03-15 13:06:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 13:06:33] [INFO ] [Nat]Absence check using state equation in 652 ms returned sat
[2023-03-15 13:06:33] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-15 13:06:34] [INFO ] [Nat]Added 96 Read/Feed constraints in 1015 ms returned sat
[2023-03-15 13:06:35] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 1 ms to minimize.
[2023-03-15 13:06:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 207 ms
Current structural bounds on expressions (after SMT) : [7] Max seen :[7]
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 19044 ms.

BK_STOP 1678885601042

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-S02J06T08"
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-5348"
echo " Executing tool itstools"
echo " Input is PolyORBLF-PT-S02J06T08, 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 r293-tall-167873945500525"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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