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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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 Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 07:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 07:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 07:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 07:29 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 608K 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-4B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716689885057

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-4B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 02:18:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-26 02:18:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 02:18:06] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2024-05-26 02:18:06] [INFO ] Transformed 2328 places.
[2024-05-26 02:18:06] [INFO ] Transformed 2701 transitions.
[2024-05-26 02:18:06] [INFO ] Found NUPN structural information;
[2024-05-26 02:18:06] [INFO ] Parsed PT model containing 2328 places and 2701 transitions and 6091 arcs in 292 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 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 2701 rows 2328 cols
[2024-05-26 02:18:06] [INFO ] Computed 66 invariants in 46 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 (5 resets) in 64 ms. (153 steps per ms)
FORMULA NoC3x3-PT-4B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60005 steps (12 resets) in 81 ms. (731 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2024-05-26 02:18:06] [INFO ] Invariant cache hit.
[2024-05-26 02:18:07] [INFO ] [Real]Absence check using 66 positive place invariants in 92 ms returned sat
[2024-05-26 02:18:08] [INFO ] [Real]Absence check using state equation in 1009 ms returned sat
[2024-05-26 02:18:09] [INFO ] Deduced a trap composed of 69 places in 698 ms of which 69 ms to minimize.
[2024-05-26 02:18:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:18:10] [INFO ] [Nat]Absence check using 66 positive place invariants in 73 ms returned sat
[2024-05-26 02:18:11] [INFO ] [Nat]Absence check using state equation in 918 ms returned sat
[2024-05-26 02:18:11] [INFO ] Deduced a trap composed of 69 places in 470 ms of which 15 ms to minimize.
[2024-05-26 02:18:12] [INFO ] Deduced a trap composed of 67 places in 435 ms of which 7 ms to minimize.
[2024-05-26 02:18:12] [INFO ] Deduced a trap composed of 75 places in 381 ms of which 10 ms to minimize.
[2024-05-26 02:18:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1683 ms
[2024-05-26 02:18:12] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 162 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-26 02:18:15] [INFO ] [Real]Absence check using 66 positive place invariants in 65 ms returned sat
[2024-05-26 02:18:16] [INFO ] [Real]Absence check using state equation in 916 ms returned sat
[2024-05-26 02:18:16] [INFO ] Deduced a trap composed of 126 places in 327 ms of which 3 ms to minimize.
[2024-05-26 02:18:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:18:17] [INFO ] [Nat]Absence check using 66 positive place invariants in 71 ms returned sat
[2024-05-26 02:18:18] [INFO ] [Nat]Absence check using state equation in 843 ms returned sat
[2024-05-26 02:18:18] [INFO ] Deduced a trap composed of 126 places in 133 ms of which 3 ms to minimize.
[2024-05-26 02:18:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2024-05-26 02:18:18] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 131 ms.
[2024-05-26 02:18:21] [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: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-05-26 02:18:22] [INFO ] [Real]Absence check using 66 positive place invariants in 67 ms returned sat
[2024-05-26 02:18:23] [INFO ] [Real]Absence check using state equation in 916 ms returned sat
[2024-05-26 02:18:23] [INFO ] Deduced a trap composed of 70 places in 306 ms of which 6 ms to minimize.
[2024-05-26 02:18:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:18:24] [INFO ] [Nat]Absence check using 66 positive place invariants in 65 ms returned sat
[2024-05-26 02:18:24] [INFO ] [Nat]Absence check using state equation in 856 ms returned sat
[2024-05-26 02:18:25] [INFO ] Deduced a trap composed of 70 places in 298 ms of which 6 ms to minimize.
[2024-05-26 02:18:25] [INFO ] Deduced a trap composed of 106 places in 289 ms of which 10 ms to minimize.
[2024-05-26 02:18:26] [INFO ] Deduced a trap composed of 154 places in 268 ms of which 6 ms to minimize.
[2024-05-26 02:18:26] [INFO ] Deduced a trap composed of 107 places in 272 ms of which 5 ms to minimize.
[2024-05-26 02:18:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1553 ms
[2024-05-26 02:18:26] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 150 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-26 02:18:29] [INFO ] [Real]Absence check using 66 positive place invariants in 69 ms returned sat
[2024-05-26 02:18:30] [INFO ] [Real]Absence check using state equation in 833 ms returned sat
[2024-05-26 02:18:30] [INFO ] Deduced a trap composed of 120 places in 292 ms of which 6 ms to minimize.
[2024-05-26 02:18:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:18:30] [INFO ] [Nat]Absence check using 66 positive place invariants in 65 ms returned sat
[2024-05-26 02:18:31] [INFO ] [Nat]Absence check using state equation in 843 ms returned sat
[2024-05-26 02:18:32] [INFO ] Deduced a trap composed of 120 places in 295 ms of which 5 ms to minimize.
[2024-05-26 02:18:32] [INFO ] Deduced a trap composed of 98 places in 273 ms of which 5 ms to minimize.
[2024-05-26 02:18:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 826 ms
[2024-05-26 02:18:32] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 118 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-26 02:18:36] [INFO ] [Real]Absence check using 66 positive place invariants in 69 ms returned sat
[2024-05-26 02:18:36] [INFO ] [Real]Absence check using state equation in 896 ms returned sat
[2024-05-26 02:18:37] [INFO ] Deduced a trap composed of 81 places in 369 ms of which 7 ms to minimize.
[2024-05-26 02:18:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:18:38] [INFO ] [Nat]Absence check using 66 positive place invariants in 68 ms returned sat
[2024-05-26 02:18:38] [INFO ] [Nat]Absence check using state equation in 892 ms returned sat
[2024-05-26 02:18:39] [INFO ] Deduced a trap composed of 81 places in 365 ms of which 7 ms to minimize.
[2024-05-26 02:18:39] [INFO ] Deduced a trap composed of 67 places in 338 ms of which 6 ms to minimize.
[2024-05-26 02:18:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 969 ms
[2024-05-26 02:18:39] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 129 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-26 02:18:43] [INFO ] [Real]Absence check using 66 positive place invariants in 73 ms returned sat
[2024-05-26 02:18:43] [INFO ] [Real]Absence check using state equation in 895 ms returned sat
[2024-05-26 02:18:44] [INFO ] Deduced a trap composed of 126 places in 125 ms of which 3 ms to minimize.
[2024-05-26 02:18:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:18:44] [INFO ] [Nat]Absence check using 66 positive place invariants in 69 ms returned sat
[2024-05-26 02:18:45] [INFO ] [Nat]Absence check using state equation in 892 ms returned sat
[2024-05-26 02:18:45] [INFO ] Deduced a trap composed of 126 places in 133 ms of which 3 ms to minimize.
[2024-05-26 02:18:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 303 ms
[2024-05-26 02:18:46] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 124 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 2328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2328/2328 places, 2701/2701 transitions.
Graph (trivial) has 2312 edges and 2328 vertex of which 1389 / 2328 are part of one of the 33 SCC in 9 ms
Free SCC test removed 1356 places
Drop transitions (Empty/Sink Transition effects.) removed 1640 transitions
Reduce isomorphic transitions removed 1640 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 972 transition count 1024
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 935 transition count 1023
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 934 transition count 1023
Discarding 326 places :
Symmetric choice reduction at 3 with 326 rule applications. Total rules 403 place count 608 transition count 697
Iterating global reduction 3 with 326 rules applied. Total rules applied 729 place count 608 transition count 697
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 730 place count 608 transition count 696
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 67 Pre rules applied. Total rules applied 730 place count 608 transition count 629
Deduced a syphon composed of 67 places in 2 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 864 place count 541 transition count 629
Discarding 54 places :
Symmetric choice reduction at 4 with 54 rule applications. Total rules 918 place count 487 transition count 542
Iterating global reduction 4 with 54 rules applied. Total rules applied 972 place count 487 transition count 542
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 1174 place count 386 transition count 441
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1176 place count 385 transition count 455
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1178 place count 385 transition count 453
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 1184 place count 385 transition count 447
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 1186 place count 384 transition count 458
Free-agglomeration rule applied 199 times.
Iterating global reduction 5 with 199 rules applied. Total rules applied 1385 place count 384 transition count 259
Reduce places removed 199 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (complete) has 503 edges and 185 vertex of which 88 are kept as prefixes of interest. Removing 97 places using SCC suffix rule.1 ms
Discarding 97 places :
Also discarding 50 output transitions
Drop transitions (Output transitions of discarded places.) removed 50 transitions
Iterating post reduction 5 with 236 rules applied. Total rules applied 1621 place count 88 transition count 173
Drop transitions (Empty/Sink Transition effects.) removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Iterating post reduction 6 with 67 rules applied. Total rules applied 1688 place count 88 transition count 106
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1689 place count 88 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1690 place count 87 transition count 105
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1691 place count 87 transition count 105
Applied a total of 1691 rules in 325 ms. Remains 87 /2328 variables (removed 2241) and now considering 105/2701 (removed 2596) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 336 ms. Remains : 87/2328 places, 105/2701 transitions.
// Phase 1: matrix 105 rows 87 cols
[2024-05-26 02:18:49] [INFO ] Computed 34 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1660 ms. (602 steps per ms)
FORMULA NoC3x3-PT-4B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 594 ms. (1680 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 45749 ms.
ITS solved all properties within timeout

BK_STOP 1716689932041

--------------------
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-4B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is NoC3x3-PT-4B, 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 r245-tall-171654350300613"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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