Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r153-tall-174876824700035.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is NoC3x3-PT-8B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-174876824700035
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 3.0M May 29 14:32 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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748841413126

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-8B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 05:16:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 05:16:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:16:54] [INFO ] Load time of PNML (sax parser for PT used): 361 ms
[2025-06-02 05:16:54] [INFO ] Transformed 9140 places.
[2025-06-02 05:16:54] [INFO ] Transformed 14577 transitions.
[2025-06-02 05:16:54] [INFO ] Found NUPN structural information;
[2025-06-02 05:16:54] [INFO ] Parsed PT model containing 9140 places and 14577 transitions and 30726 arcs in 566 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 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 14577 rows 9140 cols
[2025-06-02 05:16:55] [INFO ] Computed 99 invariants in 167 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 162 ms. (61 steps per ms)
FORMULA NoC3x3-PT-8B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130013 steps (26 resets) in 229 ms. (565 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[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]
[2025-06-02 05:16:55] [INFO ] Invariant cache hit.
[2025-06-02 05:16:57] [INFO ] [Real]Absence check using 99 positive place invariants in 372 ms returned sat
[2025-06-02 05:17:01] [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.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
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)
[2025-06-02 05:17:02] [INFO ] [Real]Absence check using 99 positive place invariants in 364 ms returned sat
[2025-06-02 05:17:06] [INFO ] [Real]Absence check using state equation in 3102 ms returned unknown
[2025-06-02 05:17:07] [INFO ] [Real]Absence check using 99 positive place invariants in 363 ms returned sat
[2025-06-02 05:17:11] [INFO ] [Real]Absence check using state equation in 3234 ms returned unknown
[2025-06-02 05:17:12] [INFO ] [Real]Absence check using 99 positive place invariants in 357 ms returned sat
[2025-06-02 05:17:16] [INFO ] [Real]Absence check using state equation in 3117 ms returned unknown
[2025-06-02 05:17:17] [INFO ] [Real]Absence check using 99 positive place invariants in 375 ms returned sat
[2025-06-02 05:17:21] [INFO ] [Real]Absence check using state equation in 3120 ms returned unknown
[2025-06-02 05:17:23] [INFO ] [Real]Absence check using 99 positive place invariants in 383 ms returned sat
[2025-06-02 05:17:26] [INFO ] [Real]Absence check using state equation in 3090 ms returned unknown
[2025-06-02 05:17:28] [INFO ] [Real]Absence check using 99 positive place invariants in 371 ms returned sat
[2025-06-02 05:17:31] [INFO ] [Real]Absence check using state equation in 3087 ms returned unknown
[2025-06-02 05:17:32] [INFO ] [Real]Absence check using 99 positive place invariants in 349 ms returned sat
[2025-06-02 05:17:36] [INFO ] [Real]Absence check using state equation in 3179 ms returned unknown
[2025-06-02 05:17:38] [INFO ] [Real]Absence check using 99 positive place invariants in 349 ms returned sat
[2025-06-02 05:17:41] [INFO ] [Real]Absence check using state equation in 3142 ms returned unknown
[2025-06-02 05:17:42] [INFO ] [Real]Absence check using 99 positive place invariants in 359 ms returned sat
[2025-06-02 05:17:46] [INFO ] [Real]Absence check using state equation in 3167 ms returned unknown
[2025-06-02 05:17:48] [INFO ] [Real]Absence check using 99 positive place invariants in 358 ms returned sat
[2025-06-02 05:17:51] [INFO ] [Real]Absence check using state equation in 3142 ms returned unknown
[2025-06-02 05:17:53] [INFO ] [Real]Absence check using 99 positive place invariants in 356 ms returned sat
[2025-06-02 05:17:56] [INFO ] [Real]Absence check using state equation in 3151 ms returned unknown
[2025-06-02 05:17:57] [INFO ] [Real]Absence check using 99 positive place invariants in 361 ms returned sat
[2025-06-02 05:18:01] [INFO ] [Real]Absence check using state equation in 3275 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[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]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[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]
Support contains 13 out of 9140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9140/9140 places, 14577/14577 transitions.
Graph (trivial) has 13715 edges and 9140 vertex of which 2395 / 9140 are part of one of the 33 SCC in 31 ms
Free SCC test removed 2362 places
Drop transitions (Empty/Sink Transition effects.) removed 3752 transitions
Reduce isomorphic transitions removed 3752 transitions.
Graph (complete) has 12302 edges and 6778 vertex of which 6665 are kept as prefixes of interest. Removing 113 places using SCC suffix rule.24 ms
Discarding 113 places :
Also discarding 80 output transitions
Drop transitions (Output transitions of discarded places.) removed 80 transitions
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4189 transitions
Trivial Post-agglo rules discarded 4189 transitions
Performed 4189 trivial Post agglomeration. Transition count delta: 4189
Iterating post reduction 0 with 4293 rules applied. Total rules applied 4295 place count 6665 transition count 6452
Reduce places removed 4189 places and 0 transitions.
Ensure Unique test removed 2366 transitions
Reduce isomorphic transitions removed 2366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1191 transitions
Trivial Post-agglo rules discarded 1191 transitions
Performed 1191 trivial Post agglomeration. Transition count delta: 1191
Iterating post reduction 1 with 7746 rules applied. Total rules applied 12041 place count 2476 transition count 2895
Reduce places removed 1191 places and 0 transitions.
Ensure Unique test removed 1191 transitions
Reduce isomorphic transitions removed 1191 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 2 with 2418 rules applied. Total rules applied 14459 place count 1285 transition count 1668
Reduce places removed 36 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 3 with 41 rules applied. Total rules applied 14500 place count 1249 transition count 1663
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 14507 place count 1244 transition count 1661
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 39 Pre rules applied. Total rules applied 14507 place count 1244 transition count 1622
Deduced a syphon composed of 39 places in 3 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 14585 place count 1205 transition count 1622
Discarding 359 places :
Symmetric choice reduction at 5 with 359 rule applications. Total rules 14944 place count 846 transition count 1263
Iterating global reduction 5 with 359 rules applied. Total rules applied 15303 place count 846 transition count 1263
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 5 with 56 rules applied. Total rules applied 15359 place count 846 transition count 1207
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 61 Pre rules applied. Total rules applied 15359 place count 846 transition count 1146
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 6 with 122 rules applied. Total rules applied 15481 place count 785 transition count 1146
Discarding 80 places :
Symmetric choice reduction at 6 with 80 rule applications. Total rules 15561 place count 705 transition count 974
Iterating global reduction 6 with 80 rules applied. Total rules applied 15641 place count 705 transition count 974
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 6 with 24 rules applied. Total rules applied 15665 place count 705 transition count 950
Performed 239 Post agglomeration using F-continuation condition.Transition count delta: 239
Deduced a syphon composed of 239 places in 1 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 7 with 478 rules applied. Total rules applied 16143 place count 466 transition count 711
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 24 rules applied. Total rules applied 16167 place count 466 transition count 687
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 16173 place count 463 transition count 728
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 16174 place count 463 transition count 727
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 9 with 20 rules applied. Total rules applied 16194 place count 463 transition count 707
Free-agglomeration rule applied 207 times.
Iterating global reduction 9 with 207 rules applied. Total rules applied 16401 place count 463 transition count 500
Reduce places removed 207 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 815 edges and 256 vertex of which 249 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 221 rules applied. Total rules applied 16622 place count 249 transition count 487
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 16629 place count 249 transition count 480
Drop transitions (Redundant composition of simpler transitions.) removed 162 transitions
Redundant transition composition rules discarded 162 transitions
Iterating global reduction 11 with 162 rules applied. Total rules applied 16791 place count 249 transition count 318
Reduce places removed 8 places and 0 transitions.
Graph (complete) has 638 edges and 241 vertex of which 219 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 0 output transitions
Iterating post reduction 11 with 9 rules applied. Total rules applied 16800 place count 219 transition count 318
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 12 with 22 rules applied. Total rules applied 16822 place count 219 transition count 296
Partial Free-agglomeration rule applied 24 times.
Drop transitions (Partial Free agglomeration) removed 24 transitions
Iterating global reduction 13 with 24 rules applied. Total rules applied 16846 place count 219 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 16847 place count 219 transition count 295
Applied a total of 16847 rules in 690 ms. Remains 219 /9140 variables (removed 8921) and now considering 295/14577 (removed 14282) transitions.
Running 286 sub problems to find dead transitions.
// Phase 1: matrix 295 rows 219 cols
[2025-06-02 05:18:01] [INFO ] Computed 58 invariants in 7 ms
[2025-06-02 05:18:01] [INFO ] State equation strengthened by 186 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/219 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Problem TDEAD277 is UNSAT
At refinement iteration 3 (OVERLAPS) 295/514 variables, 219/277 constraints. Problems are: Problem set: 1 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 186/463 constraints. Problems are: Problem set: 1 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/463 constraints. Problems are: Problem set: 1 solved, 285 unsolved
At refinement iteration 6 (OVERLAPS) 0/514 variables, 0/463 constraints. Problems are: Problem set: 1 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 463 constraints, problems are : Problem set: 1 solved, 285 unsolved in 12825 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 219/219 constraints, ReadFeed: 186/186 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/219 variables, 58/58 constraints. Problems are: Problem set: 1 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 295/514 variables, 219/277 constraints. Problems are: Problem set: 1 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 186/463 constraints. Problems are: Problem set: 1 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 285/748 constraints. Problems are: Problem set: 1 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/748 constraints. Problems are: Problem set: 1 solved, 285 unsolved
[2025-06-02 05:18:23] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 5 ms to minimize.
[2025-06-02 05:18:24] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2025-06-02 05:18:24] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 3 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/514 variables, 3/751 constraints. Problems are: Problem set: 1 solved, 285 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 0/751 constraints. Problems are: Problem set: 1 solved, 285 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/514 variables, and 751 constraints, problems are : Problem set: 1 solved, 285 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 219/219 constraints, ReadFeed: 186/186 constraints, PredecessorRefiner: 285/286 constraints, Known Traps: 3/3 constraints]
After SMT, in 33035ms problems are : Problem set: 1 solved, 285 unsolved
Search for dead transitions found 1 dead transitions in 33051ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 219/9140 places, 294/14577 transitions.
Applied a total of 0 rules in 6 ms. Remains 219 /219 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33772 ms. Remains : 219/9140 places, 294/14577 transitions.
// Phase 1: matrix 294 rows 219 cols
[2025-06-02 05:18:34] [INFO ] Computed 58 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[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]
RANDOM walk for 1000000 steps (2 resets) in 3240 ms. (308 steps per ms)
FORMULA NoC3x3-PT-8B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 938 ms. (1064 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 )
[2025-06-02 05:18:39] [INFO ] Flatten gal took : 77 ms
[2025-06-02 05:18:39] [INFO ] Flatten gal took : 32 ms
[2025-06-02 05:18:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14449361112579127296.gal : 12 ms
[2025-06-02 05:18:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17014602849799537032.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14449361112579127296.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17014602849799537032.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 105175 ms.

BK_STOP 1748841519586

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-8B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is NoC3x3-PT-8B, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r153-tall-174876824700035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-8B.tgz
mv NoC3x3-PT-8B execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.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 ;