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.r267-smll-167863541600269.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 smartxred
Input is NoC3x3-PT-3B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-167863541600269
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 944K
-rw-r--r-- 1 mcc users 7.7K Feb 26 09:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 09:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 09:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 09:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 09:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 09:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 09:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 09:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 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 581K 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-3B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-3B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678823444468

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-3B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 19:50:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-14 19:50:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 19:50:47] [INFO ] Load time of PNML (sax parser for PT used): 249 ms
[2023-03-14 19:50:47] [INFO ] Transformed 2117 places.
[2023-03-14 19:50:47] [INFO ] Transformed 2435 transitions.
[2023-03-14 19:50:47] [INFO ] Found NUPN structural information;
[2023-03-14 19:50:47] [INFO ] Parsed PT model containing 2117 places and 2435 transitions and 6177 arcs in 388 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 2435 rows 2117 cols
[2023-03-14 19:50:47] [INFO ] Computed 66 place invariants in 66 ms
Incomplete random walk after 10000 steps, including 16 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 16) seen :14
FORMULA NoC3x3-PT-3B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
[2023-03-14 19:50:48] [INFO ] Invariant cache hit.
[2023-03-14 19:50:49] [INFO ] [Real]Absence check using 66 positive place invariants in 96 ms returned sat
[2023-03-14 19:50:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 19:50:50] [INFO ] [Real]Absence check using state equation in 1470 ms returned sat
[2023-03-14 19:50:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 19:50:51] [INFO ] [Nat]Absence check using 66 positive place invariants in 98 ms returned sat
[2023-03-14 19:50:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 19:50:52] [INFO ] [Nat]Absence check using state equation in 1261 ms returned sat
[2023-03-14 19:50:53] [INFO ] Deduced a trap composed of 71 places in 615 ms of which 12 ms to minimize.
[2023-03-14 19:50:54] [INFO ] Deduced a trap composed of 75 places in 858 ms of which 3 ms to minimize.
[2023-03-14 19:50:55] [INFO ] Deduced a trap composed of 62 places in 741 ms of which 2 ms to minimize.
[2023-03-14 19:50:56] [INFO ] Deduced a trap composed of 68 places in 708 ms of which 3 ms to minimize.
[2023-03-14 19:50:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-14 19:50:57] [INFO ] [Real]Absence check using 66 positive place invariants in 129 ms returned sat
[2023-03-14 19:50:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 19:50:58] [INFO ] [Real]Absence check using state equation in 1506 ms returned sat
[2023-03-14 19:50:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 19:50:59] [INFO ] [Nat]Absence check using 66 positive place invariants in 87 ms returned sat
[2023-03-14 19:50:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 19:51:00] [INFO ] [Nat]Absence check using state equation in 1367 ms returned sat
[2023-03-14 19:51:01] [INFO ] Deduced a trap composed of 78 places in 727 ms of which 2 ms to minimize.
[2023-03-14 19:51:02] [INFO ] Deduced a trap composed of 106 places in 568 ms of which 2 ms to minimize.
[2023-03-14 19:51:02] [INFO ] Deduced a trap composed of 78 places in 506 ms of which 1 ms to minimize.
[2023-03-14 19:51:03] [INFO ] Deduced a trap composed of 89 places in 391 ms of which 1 ms to minimize.
[2023-03-14 19:51:03] [INFO ] Deduced a trap composed of 72 places in 391 ms of which 1 ms to minimize.
[2023-03-14 19:51: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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 2117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Graph (trivial) has 1746 edges and 2117 vertex of which 72 / 2117 are part of one of the 9 SCC in 13 ms
Free SCC test removed 63 places
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 441 transitions
Trivial Post-agglo rules discarded 441 transitions
Performed 441 trivial Post agglomeration. Transition count delta: 441
Iterating post reduction 0 with 446 rules applied. Total rules applied 447 place count 2049 transition count 1922
Reduce places removed 441 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 447 rules applied. Total rules applied 894 place count 1608 transition count 1916
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 898 place count 1605 transition count 1915
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 899 place count 1604 transition count 1915
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 899 place count 1604 transition count 1891
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 947 place count 1580 transition count 1891
Discarding 364 places :
Symmetric choice reduction at 4 with 364 rule applications. Total rules 1311 place count 1216 transition count 1527
Iterating global reduction 4 with 364 rules applied. Total rules applied 1675 place count 1216 transition count 1527
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 1675 place count 1216 transition count 1486
Deduced a syphon composed of 41 places in 11 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 1757 place count 1175 transition count 1486
Discarding 136 places :
Symmetric choice reduction at 4 with 136 rule applications. Total rules 1893 place count 1039 transition count 1310
Iterating global reduction 4 with 136 rules applied. Total rules applied 2029 place count 1039 transition count 1310
Discarding 139 places :
Symmetric choice reduction at 4 with 139 rule applications. Total rules 2168 place count 900 transition count 1156
Iterating global reduction 4 with 139 rules applied. Total rules applied 2307 place count 900 transition count 1156
Discarding 57 places :
Symmetric choice reduction at 4 with 57 rule applications. Total rules 2364 place count 843 transition count 1055
Iterating global reduction 4 with 57 rules applied. Total rules applied 2421 place count 843 transition count 1055
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 19 rules applied. Total rules applied 2440 place count 841 transition count 1038
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2442 place count 839 transition count 1038
Discarding 41 places :
Symmetric choice reduction at 6 with 41 rule applications. Total rules 2483 place count 798 transition count 997
Iterating global reduction 6 with 41 rules applied. Total rules applied 2524 place count 798 transition count 997
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 8 rules applied. Total rules applied 2532 place count 794 transition count 993
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2536 place count 790 transition count 993
Discarding 30 places :
Symmetric choice reduction at 8 with 30 rule applications. Total rules 2566 place count 760 transition count 933
Iterating global reduction 8 with 30 rules applied. Total rules applied 2596 place count 760 transition count 933
Discarding 30 places :
Symmetric choice reduction at 8 with 30 rule applications. Total rules 2626 place count 730 transition count 903
Iterating global reduction 8 with 30 rules applied. Total rules applied 2656 place count 730 transition count 903
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 40 rules applied. Total rules applied 2696 place count 725 transition count 868
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 2701 place count 720 transition count 868
Performed 304 Post agglomeration using F-continuation condition.Transition count delta: 304
Deduced a syphon composed of 304 places in 1 ms
Reduce places removed 304 places and 0 transitions.
Iterating global reduction 10 with 608 rules applied. Total rules applied 3309 place count 416 transition count 564
Discarding 15 places :
Symmetric choice reduction at 10 with 15 rule applications. Total rules 3324 place count 401 transition count 549
Iterating global reduction 10 with 15 rules applied. Total rules applied 3339 place count 401 transition count 549
Discarding 11 places :
Symmetric choice reduction at 10 with 11 rule applications. Total rules 3350 place count 390 transition count 527
Iterating global reduction 10 with 11 rules applied. Total rules applied 3361 place count 390 transition count 527
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 3363 place count 390 transition count 525
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 3365 place count 388 transition count 521
Iterating global reduction 11 with 2 rules applied. Total rules applied 3367 place count 388 transition count 521
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 11 with 34 rules applied. Total rules applied 3401 place count 371 transition count 544
Free-agglomeration rule applied 23 times.
Iterating global reduction 11 with 23 rules applied. Total rules applied 3424 place count 371 transition count 521
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 30 rules applied. Total rules applied 3454 place count 348 transition count 514
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 12 with 3 rules applied. Total rules applied 3457 place count 348 transition count 511
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 3460 place count 345 transition count 511
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 3462 place count 345 transition count 511
Applied a total of 3462 rules in 1151 ms. Remains 345 /2117 variables (removed 1772) and now considering 511/2435 (removed 1924) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1152 ms. Remains : 345/2117 places, 511/2435 transitions.
// Phase 1: matrix 511 rows 345 cols
[2023-03-14 19:51:04] [INFO ] Computed 54 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 13880 resets, run finished after 4389 ms. (steps per millisecond=227 ) properties (out of 2) seen :2
FORMULA NoC3x3-PT-3B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 21927 ms.
ITS solved all properties within timeout

BK_STOP 1678823470202

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-3B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is NoC3x3-PT-3B, 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 r267-smll-167863541600269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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