Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r191-oct2-177969025600036.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 MedleyB-PT-B01, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r191-oct2-177969025600036
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 6.9K Mar 7 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 7 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 7 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 7 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 11:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 11:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 11:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Mar 7 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 7 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 7 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 231K Mar 3 18:30 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 MedleyB-PT-B01-UpperBounds-00
FORMULA_NAME MedleyB-PT-B01-UpperBounds-01
FORMULA_NAME MedleyB-PT-B01-UpperBounds-02
FORMULA_NAME MedleyB-PT-B01-UpperBounds-03
FORMULA_NAME MedleyB-PT-B01-UpperBounds-04
FORMULA_NAME MedleyB-PT-B01-UpperBounds-05
FORMULA_NAME MedleyB-PT-B01-UpperBounds-06
FORMULA_NAME MedleyB-PT-B01-UpperBounds-07
FORMULA_NAME MedleyB-PT-B01-UpperBounds-08
FORMULA_NAME MedleyB-PT-B01-UpperBounds-09
FORMULA_NAME MedleyB-PT-B01-UpperBounds-10
FORMULA_NAME MedleyB-PT-B01-UpperBounds-11
FORMULA_NAME MedleyB-PT-B01-UpperBounds-12
FORMULA_NAME MedleyB-PT-B01-UpperBounds-13
FORMULA_NAME MedleyB-PT-B01-UpperBounds-14
FORMULA_NAME MedleyB-PT-B01-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779942897019

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-28 04:34:58] [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-05-28 04:34:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 04:34:59] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2026-05-28 04:34:59] [INFO ] Transformed 925 places.
[2026-05-28 04:34:59] [INFO ] Transformed 1037 transitions.
[2026-05-28 04:34:59] [INFO ] Found NUPN structural information;
[2026-05-28 04:34:59] [INFO ] Parsed PT model containing 925 places and 1037 transitions and 2433 arcs in 341 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 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 1037 rows 925 cols
[2026-05-28 04:34:59] [INFO ] Computed 4 invariants in 32 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 (164 resets) in 42 ms. (232 steps per ms)
FORMULA MedleyB-PT-B01-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70005 steps (249 resets) in 74 ms. (933 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]
[2026-05-28 04:34:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:59] [INFO ] [Real]Absence check using 4 positive place invariants in 18 ms returned sat
[2026-05-28 04:35:00] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2026-05-28 04:35:00] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 50 ms.
[2026-05-28 04:35:00] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 16 ms returned sat
[2026-05-28 04:35:00] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:01] [INFO ] Deduced a trap composed of 396 places in 852 ms of which 306 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:02] [INFO ] Deduced a trap composed of 396 places in 397 ms of which 32 ms to minimize.
[2026-05-28 04:35:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1469 ms
[2026-05-28 04:35:02] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 78 ms.
[2026-05-28 04:35:05] [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: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-05-28 04:35:05] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned sat
[2026-05-28 04:35:06] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2026-05-28 04:35:06] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 63 ms.
[2026-05-28 04:35:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 26 ms returned sat
[2026-05-28 04:35:08] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2026-05-28 04:35:08] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 52 ms.
[2026-05-28 04:35:09] [INFO ] Added : 68 causal constraints over 14 iterations in 1236 ms. Result :sat
Minimization took 451 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:10] [INFO ] [Real]Absence check using 4 positive place invariants in 14 ms returned sat
[2026-05-28 04:35:10] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:10] [INFO ] Deduced a trap composed of 395 places in 274 ms of which 16 ms to minimize.
[2026-05-28 04:35:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 20 ms returned sat
[2026-05-28 04:35:11] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:12] [INFO ] Deduced a trap composed of 395 places in 363 ms of which 17 ms to minimize.
[2026-05-28 04:35:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 452 ms
[2026-05-28 04:35:12] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 64 ms.
[2026-05-28 04:35:16] [INFO ] Added : 315 causal constraints over 63 iterations in 3872 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:16] [INFO ] [Real]Absence check using 4 positive place invariants in 13 ms returned sat
[2026-05-28 04:35:16] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:17] [INFO ] Deduced a trap composed of 396 places in 240 ms of which 16 ms to minimize.
[2026-05-28 04:35:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 27 ms returned sat
[2026-05-28 04:35:17] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2026-05-28 04:35:17] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 50 ms.
[2026-05-28 04:35:22] [INFO ] Added : 335 causal constraints over 67 iterations in 4468 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:22] [INFO ] [Real]Absence check using 4 positive place invariants in 13 ms returned sat
[2026-05-28 04:35:22] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:23] [INFO ] Deduced a trap composed of 396 places in 273 ms of which 17 ms to minimize.
[2026-05-28 04:35:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 28 ms returned sat
[2026-05-28 04:35:23] [INFO ] [Nat]Absence check using state equation in 604 ms returned sat
[2026-05-28 04:35:24] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 105 ms.
[2026-05-28 04:35:28] [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: Broken pipe ... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
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-05-28 04:35:28] [INFO ] [Real]Absence check using 4 positive place invariants in 12 ms returned sat
[2026-05-28 04:35:28] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:29] [INFO ] Deduced a trap composed of 396 places in 283 ms of which 30 ms to minimize.
[2026-05-28 04:35:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 17 ms returned sat
[2026-05-28 04:35:29] [INFO ] [Nat]Absence check using state equation in 536 ms returned sat
[2026-05-28 04:35:30] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 60 ms.
[2026-05-28 04:35:34] [INFO ] Added : 285 causal constraints over 57 iterations in 4152 ms. Result :unknown
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, 1, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 925 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 925/925 places, 1037/1037 transitions.
Graph (trivial) has 907 edges and 925 vertex of which 60 / 925 are part of one of the 9 SCC in 4 ms
Free SCC test removed 51 places
Drop transitions (Empty/Sink Transition effects.) removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Graph (complete) has 1173 edges and 874 vertex of which 868 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 686 transitions
Trivial Post-agglo rules discarded 686 transitions
Performed 686 trivial Post agglomeration. Transition count delta: 686
Iterating post reduction 0 with 689 rules applied. Total rules applied 691 place count 868 transition count 279
Reduce places removed 686 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 709 rules applied. Total rules applied 1400 place count 182 transition count 256
Reduce places removed 9 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 13 rules applied. Total rules applied 1413 place count 173 transition count 252
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1417 place count 169 transition count 252
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 30 Pre rules applied. Total rules applied 1417 place count 169 transition count 222
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 1477 place count 139 transition count 222
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 1514 place count 102 transition count 185
Iterating global reduction 4 with 37 rules applied. Total rules applied 1551 place count 102 transition count 185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1551 place count 102 transition count 184
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 1553 place count 101 transition count 184
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 1573 place count 81 transition count 127
Iterating global reduction 4 with 20 rules applied. Total rules applied 1593 place count 81 transition count 127
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1602 place count 81 transition count 118
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1607 place count 76 transition count 113
Iterating global reduction 5 with 5 rules applied. Total rules applied 1612 place count 76 transition count 113
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1616 place count 72 transition count 109
Iterating global reduction 5 with 4 rules applied. Total rules applied 1620 place count 72 transition count 109
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1624 place count 72 transition count 105
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1642 place count 63 transition count 96
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1643 place count 63 transition count 95
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1646 place count 60 transition count 92
Iterating global reduction 7 with 3 rules applied. Total rules applied 1649 place count 60 transition count 92
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1651 place count 58 transition count 90
Iterating global reduction 7 with 2 rules applied. Total rules applied 1653 place count 58 transition count 90
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1655 place count 56 transition count 88
Iterating global reduction 7 with 2 rules applied. Total rules applied 1657 place count 56 transition count 88
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1663 place count 53 transition count 101
Free-agglomeration rule applied 19 times with reduction of 3 identical transitions.
Iterating global reduction 7 with 19 rules applied. Total rules applied 1682 place count 53 transition count 79
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 1711 place count 34 transition count 69
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1714 place count 31 transition count 66
Iterating global reduction 8 with 3 rules applied. Total rules applied 1717 place count 31 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1718 place count 31 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 9 with 15 rules applied. Total rules applied 1733 place count 31 transition count 50
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1736 place count 31 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1738 place count 31 transition count 48
Applied a total of 1738 rules in 122 ms. Remains 31 /925 variables (removed 894) and now considering 48/1037 (removed 989) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 31/925 places, 48/1037 transitions.
// Phase 1: matrix 48 rows 31 cols
[2026-05-28 04:35:35] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA MedleyB-PT-B01-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 753 ms. (1326 steps per ms)
FORMULA MedleyB-PT-B01-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 246 ms. (4048 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-05-28 04:35:36] [INFO ] Flatten gal took : 33 ms
[2026-05-28 04:35:36] [INFO ] Flatten gal took : 6 ms
[2026-05-28 04:35:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14101371221464732272.gal : 17 ms
[2026-05-28 04:35:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7818449283896114556.prop : 1 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/ReachabilityCardinality14101371221464732272.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7818449283896114556.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 38050 ms.

BK_STOP 1779942936765

--------------------
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="MedleyB-PT-B01"
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 MedleyB-PT-B01, 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 r191-oct2-177969025600036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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