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.r508-tall-171654351900565.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 ltsminxred
Input is NoC3x3-PT-1B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654351900565
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.5K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 12 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 07:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 07:10 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 362K 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-1B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-1B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717240171126

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-1B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:09:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 11:09:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:09:32] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2024-06-01 11:09:32] [INFO ] Transformed 1416 places.
[2024-06-01 11:09:32] [INFO ] Transformed 1640 transitions.
[2024-06-01 11:09:32] [INFO ] Found NUPN structural information;
[2024-06-01 11:09:32] [INFO ] Parsed PT model containing 1416 places and 1640 transitions and 3639 arcs in 255 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1640 rows 1416 cols
[2024-06-01 11:09:32] [INFO ] Computed 40 invariants in 26 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (8 resets) in 57 ms. (172 steps per ms)
FORMULA NoC3x3-PT-1B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (10 resets) in 60 ms. (819 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-06-01 11:09:32] [INFO ] Invariant cache hit.
[2024-06-01 11:09:33] [INFO ] [Real]Absence check using 40 positive place invariants in 45 ms returned sat
[2024-06-01 11:09:33] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2024-06-01 11:09:34] [INFO ] Deduced a trap composed of 103 places in 431 ms of which 45 ms to minimize.
[2024-06-01 11:09:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:09:34] [INFO ] [Nat]Absence check using 40 positive place invariants in 41 ms returned sat
[2024-06-01 11:09:35] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2024-06-01 11:09:35] [INFO ] Deduced a trap composed of 103 places in 174 ms of which 3 ms to minimize.
[2024-06-01 11:09:35] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 3 ms to minimize.
[2024-06-01 11:09:35] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 2 ms to minimize.
[2024-06-01 11:09:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 594 ms
[2024-06-01 11:09:35] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 91 ms.
[2024-06-01 11:09:39] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
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)
[2024-06-01 11:09:39] [INFO ] [Real]Absence check using 40 positive place invariants in 37 ms returned sat
[2024-06-01 11:09:40] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2024-06-01 11:09:40] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 3 ms to minimize.
[2024-06-01 11:09:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:09:40] [INFO ] [Nat]Absence check using 40 positive place invariants in 35 ms returned sat
[2024-06-01 11:09:41] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2024-06-01 11:09:41] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 2 ms to minimize.
[2024-06-01 11:09:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2024-06-01 11:09:41] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 88 ms.
Maximisation of solution failed !
Minimization took 5 ms.
[2024-06-01 11:09:45] [INFO ] [Real]Absence check using 40 positive place invariants in 35 ms returned sat
[2024-06-01 11:09:46] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2024-06-01 11:09:46] [INFO ] Deduced a trap composed of 98 places in 139 ms of which 3 ms to minimize.
[2024-06-01 11:09:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:09:46] [INFO ] [Nat]Absence check using 40 positive place invariants in 35 ms returned sat
[2024-06-01 11:09:47] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2024-06-01 11:09:47] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 3 ms to minimize.
[2024-06-01 11:09:47] [INFO ] Deduced a trap composed of 121 places in 120 ms of which 3 ms to minimize.
[2024-06-01 11:09:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 420 ms
[2024-06-01 11:09:47] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 89 ms.
[2024-06-01 11:09:51] [INFO ] Added : 260 causal constraints over 52 iterations in 3881 ms. Result :unknown
[2024-06-01 11:09:51] [INFO ] [Real]Absence check using 40 positive place invariants in 34 ms returned sat
[2024-06-01 11:09:52] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2024-06-01 11:09:52] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 2 ms to minimize.
[2024-06-01 11:09:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:09:52] [INFO ] [Nat]Absence check using 40 positive place invariants in 38 ms returned sat
[2024-06-01 11:09:53] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2024-06-01 11:09:53] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 2 ms to minimize.
[2024-06-01 11:09:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2024-06-01 11:09:53] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 96 ms.
[2024-06-01 11:09:57] [INFO ] Added : 260 causal constraints over 52 iterations in 4043 ms. Result :unknown
[2024-06-01 11:09:57] [INFO ] [Real]Absence check using 40 positive place invariants in 35 ms returned sat
[2024-06-01 11:09:58] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2024-06-01 11:09:58] [INFO ] Deduced a trap composed of 66 places in 183 ms of which 4 ms to minimize.
[2024-06-01 11:09:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:09:59] [INFO ] [Nat]Absence check using 40 positive place invariants in 35 ms returned sat
[2024-06-01 11:09:59] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2024-06-01 11:09:59] [INFO ] Deduced a trap composed of 66 places in 167 ms of which 4 ms to minimize.
[2024-06-01 11:09:59] [INFO ] Deduced a trap composed of 82 places in 166 ms of which 3 ms to minimize.
[2024-06-01 11:10:00] [INFO ] Deduced a trap composed of 103 places in 128 ms of which 3 ms to minimize.
[2024-06-01 11:10:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 678 ms
[2024-06-01 11:10:00] [INFO ] Computed and/alt/rep : 1639/2475/1639 causal constraints (skipped 0 transitions) in 82 ms.
[2024-06-01 11:10:03] [INFO ] Added : 240 causal constraints over 48 iterations in 3578 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA NoC3x3-PT-1B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-1B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 1416 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p595) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 1416/1416 places, 1639/1639 transitions.
Graph (trivial) has 1440 edges and 1416 vertex of which 916 / 1416 are part of one of the 20 SCC in 8 ms
Free SCC test removed 896 places
Drop transitions (Empty/Sink Transition effects.) removed 1084 transitions
Reduce isomorphic transitions removed 1084 transitions.
Graph (complete) has 1023 edges and 520 vertex of which 519 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 2 places and 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 517 transition count 532
Reduce places removed 22 places and 1 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 47 place count 495 transition count 531
Discarding 165 places :
Symmetric choice reduction at 2 with 165 rule applications. Total rules 212 place count 330 transition count 366
Iterating global reduction 2 with 165 rules applied. Total rules applied 377 place count 330 transition count 366
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 377 place count 330 transition count 330
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 449 place count 294 transition count 330
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 476 place count 267 transition count 290
Iterating global reduction 2 with 27 rules applied. Total rules applied 503 place count 267 transition count 290
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 621 place count 208 transition count 231
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 623 place count 207 transition count 245
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 625 place count 207 transition count 243
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 631 place count 207 transition count 237
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 633 place count 206 transition count 248
Free-agglomeration rule applied 103 times.
Iterating global reduction 3 with 103 rules applied. Total rules applied 736 place count 206 transition count 145
Reduce places removed 103 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 283 edges and 103 vertex of which 3 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.0 ms
Discarding 100 places :
Also discarding 117 output transitions
Drop transitions (Output transitions of discarded places.) removed 117 transitions
Iterating post reduction 3 with 123 rules applied. Total rules applied 859 place count 3 transition count 9
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 866 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 866 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 868 place count 2 transition count 1
Applied a total of 868 rules in 173 ms. Remains 2 /1416 variables (removed 1414) and now considering 1/1639 (removed 1638) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 2/1416 places, 1/1639 transitions.
// Phase 1: matrix 1 rows 2 cols
[2024-06-01 11:10:05] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (500000 resets) in 249 ms. (4000 steps per ms)
FORMULA NoC3x3-PT-1B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (500000 resets) in 238 ms. (4184 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 33708 ms.
ITS solved all properties within timeout

BK_STOP 1717240206005

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-1B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is NoC3x3-PT-1B, 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 r508-tall-171654351900565"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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