Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r263-tall-171654372800421.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is NoC3x3-PT-8B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372800421
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 07:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 07:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 07:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 12 07:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.0M 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 NoC3x3-PT-8B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716695745806

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-8B
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-26 03:55:47] [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-26 03:55:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 03:55:47] [INFO ] Load time of PNML (sax parser for PT used): 327 ms
[2024-05-26 03:55:47] [INFO ] Transformed 9140 places.
[2024-05-26 03:55:47] [INFO ] Transformed 14577 transitions.
[2024-05-26 03:55:47] [INFO ] Found NUPN structural information;
[2024-05-26 03:55:47] [INFO ] Parsed PT model containing 9140 places and 14577 transitions and 30726 arcs in 478 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 14577 rows 9140 cols
[2024-05-26 03:55:48] [INFO ] Computed 99 invariants in 167 ms
Incomplete random walk after 10000 steps, including 4 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 16) seen :6
FORMULA NoC3x3-PT-8B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
[2024-05-26 03:55:48] [INFO ] Invariant cache hit.
[2024-05-26 03:55:50] [INFO ] [Real]Absence check using 99 positive place invariants in 361 ms returned sat
[2024-05-26 03:55:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 03:55:53] [INFO ] [Real]Absence check using state equation in 3064 ms returned unknown
[2024-05-26 03:55:55] [INFO ] [Real]Absence check using 99 positive place invariants in 351 ms returned sat
[2024-05-26 03:55:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 03:55:58] [INFO ] [Real]Absence check using state equation in 3371 ms returned unknown
[2024-05-26 03:56:00] [INFO ] [Real]Absence check using 99 positive place invariants in 356 ms returned sat
[2024-05-26 03:56:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 03:56:03] [INFO ] [Real]Absence check using state equation in 3351 ms returned unknown
[2024-05-26 03:56:05] [INFO ] [Real]Absence check using 99 positive place invariants in 354 ms returned sat
[2024-05-26 03:56:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 03:56:08] [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 3
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.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-26 03:56:10] [INFO ] [Real]Absence check using 99 positive place invariants in 338 ms returned sat
[2024-05-26 03:56:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 03:56:13] [INFO ] [Real]Absence check using state equation in 3445 ms returned unknown
[2024-05-26 03:56:15] [INFO ] [Real]Absence check using 99 positive place invariants in 352 ms returned sat
[2024-05-26 03:56:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 03:56:18] [INFO ] [Real]Absence check using state equation in 3373 ms returned unknown
[2024-05-26 03:56:20] [INFO ] [Real]Absence check using 99 positive place invariants in 341 ms returned sat
[2024-05-26 03:56:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 03:56:23] [INFO ] [Real]Absence check using state equation in 3390 ms returned unknown
[2024-05-26 03:56:25] [INFO ] [Real]Absence check using 99 positive place invariants in 342 ms returned sat
[2024-05-26 03:56:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 03:56:28] [INFO ] [Real]Absence check using state equation in 3383 ms returned unknown
[2024-05-26 03:56:30] [INFO ] [Real]Absence check using 99 positive place invariants in 341 ms returned sat
[2024-05-26 03:56:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 03:56:33] [INFO ] [Real]Absence check using state equation in 3375 ms returned unknown
[2024-05-26 03:56:35] [INFO ] [Real]Absence check using 99 positive place invariants in 356 ms returned sat
[2024-05-26 03:56:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 03:56:38] [INFO ] [Real]Absence check using state equation in 3328 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 10 out of 9140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9140/9140 places, 14577/14577 transitions.
Graph (trivial) has 13721 edges and 9140 vertex of which 2397 / 9140 are part of one of the 33 SCC in 33 ms
Free SCC test removed 2364 places
Drop transitions removed 3756 transitions
Reduce isomorphic transitions removed 3756 transitions.
Graph (complete) has 12298 edges and 6776 vertex of which 6663 are kept as prefixes of interest. Removing 113 places using SCC suffix rule.19 ms
Discarding 113 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Drop transitions removed 4188 transitions
Trivial Post-agglo rules discarded 4188 transitions
Performed 4188 trivial Post agglomeration. Transition count delta: 4188
Iterating post reduction 0 with 4292 rules applied. Total rules applied 4294 place count 6663 transition count 6449
Reduce places removed 4188 places and 0 transitions.
Ensure Unique test removed 2366 transitions
Reduce isomorphic transitions removed 2366 transitions.
Drop transitions removed 1193 transitions
Trivial Post-agglo rules discarded 1193 transitions
Performed 1193 trivial Post agglomeration. Transition count delta: 1193
Iterating post reduction 1 with 7747 rules applied. Total rules applied 12041 place count 2475 transition count 2890
Reduce places removed 1193 places and 0 transitions.
Ensure Unique test removed 1193 transitions
Reduce isomorphic transitions removed 1193 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 2 with 2416 rules applied. Total rules applied 14457 place count 1282 transition count 1667
Reduce places removed 30 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 3 with 34 rules applied. Total rules applied 14491 place count 1252 transition count 1663
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 14497 place count 1248 transition count 1661
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 42 Pre rules applied. Total rules applied 14497 place count 1248 transition count 1619
Deduced a syphon composed of 42 places in 5 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 14581 place count 1206 transition count 1619
Discarding 358 places :
Symmetric choice reduction at 5 with 358 rule applications. Total rules 14939 place count 848 transition count 1261
Iterating global reduction 5 with 358 rules applied. Total rules applied 15297 place count 848 transition count 1261
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 5 with 55 rules applied. Total rules applied 15352 place count 848 transition count 1206
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 61 Pre rules applied. Total rules applied 15352 place count 848 transition count 1145
Deduced a syphon composed of 61 places in 7 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 6 with 122 rules applied. Total rules applied 15474 place count 787 transition count 1145
Discarding 80 places :
Symmetric choice reduction at 6 with 80 rule applications. Total rules 15554 place count 707 transition count 973
Iterating global reduction 6 with 80 rules applied. Total rules applied 15634 place count 707 transition count 973
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 6 with 24 rules applied. Total rules applied 15658 place count 707 transition count 949
Performed 243 Post agglomeration using F-continuation condition.Transition count delta: 243
Deduced a syphon composed of 243 places in 1 ms
Reduce places removed 243 places and 0 transitions.
Iterating global reduction 7 with 486 rules applied. Total rules applied 16144 place count 464 transition count 706
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 24 rules applied. Total rules applied 16168 place count 464 transition count 682
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 16174 place count 461 transition count 723
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 16175 place count 461 transition count 722
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 9 with 19 rules applied. Total rules applied 16194 place count 461 transition count 703
Free-agglomeration rule applied 206 times.
Iterating global reduction 9 with 206 rules applied. Total rules applied 16400 place count 461 transition count 497
Reduce places removed 206 places and 0 transitions.
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 808 edges and 255 vertex of which 248 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 220 rules applied. Total rules applied 16620 place count 248 transition count 484
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 16627 place count 248 transition count 477
Drop transitions removed 169 transitions
Redundant transition composition rules discarded 169 transitions
Iterating global reduction 11 with 169 rules applied. Total rules applied 16796 place count 248 transition count 308
Reduce places removed 8 places and 0 transitions.
Graph (complete) has 624 edges and 240 vertex of which 218 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 0 output transitions
Iterating post reduction 11 with 9 rules applied. Total rules applied 16805 place count 218 transition count 308
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 12 with 22 rules applied. Total rules applied 16827 place count 218 transition count 286
Partial Free-agglomeration rule applied 23 times.
Drop transitions removed 23 transitions
Iterating global reduction 13 with 23 rules applied. Total rules applied 16850 place count 218 transition count 286
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 16851 place count 218 transition count 285
Applied a total of 16851 rules in 821 ms. Remains 218 /9140 variables (removed 8922) and now considering 285/14577 (removed 14292) transitions.
// Phase 1: matrix 285 rows 218 cols
[2024-05-26 03:56:39] [INFO ] Computed 58 invariants in 4 ms
[2024-05-26 03:56:39] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1008 ms. Remains : 218/9140 places, 285/14577 transitions.
Successfully produced net in file /tmp/petri1000_584216485993548216.dot
Drop transitions removed 1 transitions
Dominated transitions for bounds rules discarded 1 transitions
// Phase 1: matrix 284 rows 218 cols
[2024-05-26 03:56:39] [INFO ] Computed 58 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3071 ms. (steps per millisecond=325 ) properties (out of 10) seen :10
FORMULA NoC3x3-PT-8B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 55810 ms.

BK_STOP 1716695803974

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-8B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is NoC3x3-PT-8B, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-tall-171654372800421"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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