Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r351-smll-178021502100032.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is ErlangenMainframeV2-PT-bP06C06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-smll-178021502100032
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 7.2K May 27 09:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 27 09:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 27 09:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 27 09:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 27 10:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 27 10:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 10:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 7.5K May 27 09:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K May 27 09:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 27 09:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K May 27 09:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 1.9M May 26 18:17 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 ErlangenMainframeV2-PT-bP06C06-UpperBounds-00
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-UpperBounds-01
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-UpperBounds-02
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-UpperBounds-03
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-UpperBounds-04
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-UpperBounds-05
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-UpperBounds-06
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-UpperBounds-07
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-UpperBounds-08
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-UpperBounds-09
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-UpperBounds-10
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-UpperBounds-11
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-UpperBounds-12
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-UpperBounds-13
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-UpperBounds-14
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1780320780498

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP06C06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-06-01 13:33:02] [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]
[2026-06-01 13:33:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-01 13:33:03] [INFO ] Load time of PNML (sax parser for PT used): 455 ms
[2026-06-01 13:33:03] [INFO ] Transformed 279 places.
[2026-06-01 13:33:03] [INFO ] Transformed 2491 transitions.
[2026-06-01 13:33:03] [INFO ] Found NUPN structural information;
[2026-06-01 13:33:03] [INFO ] Parsed PT model containing 279 places and 2491 transitions and 38716 arcs in 697 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 2491 rows 279 cols
[2026-06-01 13:33:03] [INFO ] Computed 20 invariants in 138 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 (2 resets) in 932 ms. (10 steps per ms)
FORMULA ErlangenMainframeV2-PT-bP06C06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP06C06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP06C06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP06C06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP06C06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP06C06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP06C06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP06C06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP06C06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP06C06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP06C06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP06C06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (8 resets) in 723 ms. (55 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-06-01 13:33:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:33:06] [INFO ] [Real]Absence check using 13 positive place invariants in 26 ms returned sat
[2026-06-01 13:33:06] [INFO ] [Real]Absence check using 13 positive and 7 generalized place invariants in 4 ms returned sat
[2026-06-01 13:33:07] [INFO ] [Real]Absence check using state equation in 1524 ms returned sat
[2026-06-01 13:33:11] [INFO ] Computed and/alt/rep : 268/640/268 causal constraints (skipped 2222 transitions) in 3538 ms.
[2026-06-01 13:33:11] [INFO ] Added : 0 causal constraints over 0 iterations in 3548 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:33:12] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2026-06-01 13:33:12] [INFO ] [Real]Absence check using 13 positive and 7 generalized place invariants in 6 ms returned sat
[2026-06-01 13:33:13] [INFO ] [Real]Absence check using state equation in 1052 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:33:15] [INFO ] Deduced a trap composed of 35 places in 2126 ms of which 219 ms to minimize.
[2026-06-01 13:33:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:33:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2026-06-01 13:33:15] [INFO ] [Nat]Absence check using 13 positive and 7 generalized place invariants in 5 ms returned sat
[2026-06-01 13:33:16] [INFO ] [Nat]Absence check using state equation in 1079 ms returned sat
[2026-06-01 13:33:19] [INFO ] Computed and/alt/rep : 268/640/268 causal constraints (skipped 2222 transitions) in 3000 ms.
[2026-06-01 13:33:20] [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:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:33:20] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2026-06-01 13:33:20] [INFO ] [Real]Absence check using 13 positive and 7 generalized place invariants in 4 ms returned sat
[2026-06-01 13:33:22] [INFO ] [Real]Absence check using state equation in 1464 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:33:24] [INFO ] Deduced a trap composed of 49 places in 2535 ms of which 197 ms to minimize.
[2026-06-01 13:33:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:33:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2026-06-01 13:33:25] [INFO ] [Nat]Absence check using 13 positive and 7 generalized place invariants in 4 ms returned sat
[2026-06-01 13:33:26] [INFO ] [Nat]Absence check using state equation in 1156 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:33:29] [INFO ] Deduced a trap composed of 49 places in 2732 ms of which 235 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:33:31] [INFO ] Deduced a trap composed of 49 places in 2245 ms of which 190 ms to minimize.
[2026-06-01 13:33:31] [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 2
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:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:33:31] [INFO ] [Real]Absence check using 13 positive place invariants in 20 ms returned sat
[2026-06-01 13:33:31] [INFO ] [Real]Absence check using 13 positive and 7 generalized place invariants in 3 ms returned sat
[2026-06-01 13:33:32] [INFO ] [Real]Absence check using state equation in 978 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:33:35] [INFO ] Deduced a trap composed of 30 places in 3002 ms of which 233 ms to minimize.
[2026-06-01 13:33:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:33:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2026-06-01 13:33:35] [INFO ] [Nat]Absence check using 13 positive and 7 generalized place invariants in 4 ms returned sat
[2026-06-01 13:33:37] [INFO ] [Nat]Absence check using state equation in 1109 ms returned sat
[2026-06-01 13:33:40] [INFO ] Computed and/alt/rep : 268/640/268 causal constraints (skipped 2222 transitions) in 2905 ms.
[2026-06-01 13:33:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 2491/2491 transitions.
Graph (trivial) has 243 edges and 279 vertex of which 12 / 279 are part of one of the 5 SCC in 7 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 272 transition count 2367
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 123 rules applied. Total rules applied 235 place count 161 transition count 2355
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 239 place count 158 transition count 2354
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 240 place count 157 transition count 2354
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 240 place count 157 transition count 2350
Deduced a syphon composed of 4 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 9 rules applied. Total rules applied 249 place count 152 transition count 2350
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 280 place count 121 transition count 2319
Iterating global reduction 4 with 31 rules applied. Total rules applied 311 place count 121 transition count 2319
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 311 place count 121 transition count 2314
Deduced a syphon composed of 5 places in 8 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 321 place count 116 transition count 2314
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 336 place count 101 transition count 1565
Ensure Unique test removed 4 places
Iterating global reduction 4 with 19 rules applied. Total rules applied 355 place count 97 transition count 1565
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 364 place count 88 transition count 119
Iterating global reduction 4 with 9 rules applied. Total rules applied 373 place count 88 transition count 119
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 376 place count 85 transition count 113
Iterating global reduction 4 with 3 rules applied. Total rules applied 379 place count 85 transition count 113
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 439 place count 55 transition count 83
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 457 place count 46 transition count 104
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 467 place count 46 transition count 94
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 469 place count 44 transition count 89
Iterating global reduction 5 with 2 rules applied. Total rules applied 471 place count 44 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 475 place count 44 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 477 place count 43 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 6 with 20 rules applied. Total rules applied 497 place count 43 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 499 place count 42 transition count 73
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 508 place count 42 transition count 64
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 529 place count 33 transition count 52
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 531 place count 33 transition count 50
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 532 place count 33 transition count 56
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 535 place count 32 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 541 place count 32 transition count 48
Applied a total of 541 rules in 768 ms. Remains 32 /279 variables (removed 247) and now considering 48/2491 (removed 2443) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 783 ms. Remains : 32/279 places, 48/2491 transitions.
[2026-06-01 13:33:41] [INFO ] Flow matrix only has 44 transitions (discarded 4 similar events)
// Phase 1: matrix 44 rows 32 cols
[2026-06-01 13:33:41] [INFO ] Computed 15 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA ErlangenMainframeV2-PT-bP06C06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 2562 ms. (390 steps per ms)
FORMULA ErlangenMainframeV2-PT-bP06C06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP06C06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP06C06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 715 ms. (1396 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 )
[2026-06-01 13:33:45] [INFO ] Flatten gal took : 75 ms
[2026-06-01 13:33:45] [INFO ] Flatten gal took : 25 ms
[2026-06-01 13:33:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3467390002839877291.gal : 16 ms
[2026-06-01 13:33:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6683575590578758856.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3467390002839877291.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6683575590578758856.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 42594 ms.

BK_STOP 1780320825631

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="ErlangenMainframeV2-PT-bP06C06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is ErlangenMainframeV2-PT-bP06C06, 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 r351-smll-178021502100032"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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