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.r261-smll-167863536200325.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 NoC3x3-PT-7A, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536200325
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 756K
-rw-r--r-- 1 mcc users 7.2K Feb 26 10:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 10:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 10:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 10:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 10:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 10:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 355K 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 NoC3x3-PT-7A-UpperBounds-00
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-01
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-02
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-03
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-04
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-05
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-06
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-07
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-08
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-09
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-10
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-11
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-12
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-13
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-14
FORMULA_NAME NoC3x3-PT-7A-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678893167628

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=NoC3x3-PT-7A
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-15 15:12:50] [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 15:12:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 15:12:50] [INFO ] Load time of PNML (sax parser for PT used): 226 ms
[2023-03-15 15:12:50] [INFO ] Transformed 801 places.
[2023-03-15 15:12:50] [INFO ] Transformed 1544 transitions.
[2023-03-15 15:12:50] [INFO ] Found NUPN structural information;
[2023-03-15 15:12:50] [INFO ] Parsed PT model containing 801 places and 1544 transitions and 4519 arcs in 356 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 107 transitions
Reduce redundant transitions removed 107 transitions.
Normalized transition count is 1355 out of 1437 initially.
// Phase 1: matrix 1355 rows 801 cols
[2023-03-15 15:12:50] [INFO ] Computed 111 place invariants in 111 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 16) seen :14
FORMULA NoC3x3-PT-7A-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
[2023-03-15 15:12:51] [INFO ] Flow matrix only has 1355 transitions (discarded 82 similar events)
// Phase 1: matrix 1355 rows 801 cols
[2023-03-15 15:12:51] [INFO ] Computed 111 place invariants in 42 ms
[2023-03-15 15:12:51] [INFO ] [Real]Absence check using 82 positive place invariants in 81 ms returned sat
[2023-03-15 15:12:51] [INFO ] [Real]Absence check using 82 positive and 29 generalized place invariants in 20 ms returned sat
[2023-03-15 15:12:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 15:12:52] [INFO ] [Real]Absence check using state equation in 802 ms returned sat
[2023-03-15 15:12:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 15:12:53] [INFO ] [Nat]Absence check using 82 positive place invariants in 57 ms returned sat
[2023-03-15 15:12:53] [INFO ] [Nat]Absence check using 82 positive and 29 generalized place invariants in 32 ms returned sat
[2023-03-15 15:12:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 15:12:53] [INFO ] [Nat]Absence check using state equation in 593 ms returned sat
[2023-03-15 15:12:53] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 15:12:53] [INFO ] [Nat]Added 38 Read/Feed constraints in 12 ms returned sat
[2023-03-15 15:12:54] [INFO ] Computed and/alt/rep : 1239/4104/1238 causal constraints (skipped 116 transitions) in 182 ms.
[2023-03-15 15:12:57] [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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
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 15:12:58] [INFO ] [Real]Absence check using 82 positive place invariants in 42 ms returned sat
[2023-03-15 15:12:58] [INFO ] [Real]Absence check using 82 positive and 29 generalized place invariants in 11 ms returned sat
[2023-03-15 15:12:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 15:12:58] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2023-03-15 15:12:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 15:12:58] [INFO ] [Nat]Absence check using 82 positive place invariants in 64 ms returned sat
[2023-03-15 15:12:58] [INFO ] [Nat]Absence check using 82 positive and 29 generalized place invariants in 15 ms returned sat
[2023-03-15 15:12:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 15:12:59] [INFO ] [Nat]Absence check using state equation in 652 ms returned sat
[2023-03-15 15:12:59] [INFO ] [Nat]Added 38 Read/Feed constraints in 13 ms returned sat
[2023-03-15 15:12:59] [INFO ] Computed and/alt/rep : 1239/4104/1238 causal constraints (skipped 116 transitions) in 107 ms.
[2023-03-15 15:13:03] [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 1
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
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)
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 801 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 1437/1437 transitions.
Graph (trivial) has 750 edges and 801 vertex of which 110 / 801 are part of one of the 9 SCC in 14 ms
Free SCC test removed 101 places
Drop transitions removed 204 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 222 transitions.
Discarding 180 places :
Symmetric choice reduction at 0 with 180 rule applications. Total rules 181 place count 520 transition count 951
Ensure Unique test removed 45 places
Iterating global reduction 0 with 225 rules applied. Total rules applied 406 place count 475 transition count 951
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 77 rules applied. Total rules applied 483 place count 475 transition count 874
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 497 place count 461 transition count 874
Performed 139 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 139 places in 2 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 278 rules applied. Total rules applied 775 place count 322 transition count 711
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 859 place count 322 transition count 627
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 889 place count 307 transition count 606
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 900 place count 307 transition count 595
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 928 place count 293 transition count 603
Drop transitions removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 4 with 100 rules applied. Total rules applied 1028 place count 293 transition count 503
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1037 place count 284 transition count 503
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 1037 place count 284 transition count 496
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1051 place count 277 transition count 496
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1055 place count 275 transition count 494
Free-agglomeration rule applied 41 times with reduction of 25 identical transitions.
Iterating global reduction 5 with 41 rules applied. Total rules applied 1096 place count 275 transition count 428
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 5 with 71 rules applied. Total rules applied 1167 place count 234 transition count 398
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 1174 place count 234 transition count 391
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1176 place count 234 transition count 389
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1180 place count 232 transition count 387
Free-agglomeration rule (complex) applied 15 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 15 rules applied. Total rules applied 1195 place count 232 transition count 425
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 1216 place count 217 transition count 419
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 8 with 31 rules applied. Total rules applied 1247 place count 217 transition count 388
Partial Free-agglomeration rule applied 36 times.
Drop transitions removed 36 transitions
Iterating global reduction 8 with 36 rules applied. Total rules applied 1283 place count 217 transition count 388
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1284 place count 216 transition count 387
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1287 place count 213 transition count 387
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1288 place count 213 transition count 387
Applied a total of 1288 rules in 489 ms. Remains 213 /801 variables (removed 588) and now considering 387/1437 (removed 1050) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 489 ms. Remains : 213/801 places, 387/1437 transitions.
// Phase 1: matrix 387 rows 213 cols
[2023-03-15 15:13:04] [INFO ] Computed 54 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4677 ms. (steps per millisecond=213 ) properties (out of 2) seen :2
FORMULA NoC3x3-PT-7A-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 18481 ms.

BK_STOP 1678893189799

--------------------
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="NoC3x3-PT-7A"
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 NoC3x3-PT-7A, 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 r261-smll-167863536200325"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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