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.r143-smll-177955812400013.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 FamilyReunion-PT-L00010M0001C001P001G001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-smll-177955812400013
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 29K Mar 6 05:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 224K Mar 6 05:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 33K Mar 6 05:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 133K Mar 6 05:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.9K Mar 15 09:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Mar 15 09:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Mar 15 09:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 15 09:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 45K Mar 6 05:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 346K Mar 6 05:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 76K Mar 6 05:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 311K Mar 6 05:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Mar 15 09:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.1K Mar 15 09:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 552K 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 FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-00
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-01
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-02
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-03
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-04
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-05
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-06
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-07
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-08
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-09
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-10
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-11
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-12
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-13
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-14
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779624115514

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00010M0001C001P001G001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-24 12:01: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-24 12:01:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 12:01:58] [INFO ] Load time of PNML (sax parser for PT used): 222 ms
[2026-05-24 12:01:58] [INFO ] Transformed 1475 places.
[2026-05-24 12:01:58] [INFO ] Transformed 1234 transitions.
[2026-05-24 12:01:58] [INFO ] Parsed PT model containing 1475 places and 1234 transitions and 3799 arcs in 405 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Reduce places removed 10 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
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:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 1234 rows 1465 cols
[2026-05-24 12:01:58] [INFO ] Computed 332 invariants in 172 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:[469, 148082, 161542, 74041, 161536, 161536, 938, +inf, 1, 1, 1, 1, 1, 2, 2, 1]
RANDOM walk for 10000 steps (15 resets) in 122 ms. (81 steps per ms)
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100009 steps (20 resets) in 222 ms. (448 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11, 3, 4, 3, 2, 2, 11, 5, 1, 1] Max Struct:[469, 148082, 161542, 74041, 161536, 161536, 938, +inf, 2, 2]
[2026-05-24 12:01:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:02:00] [INFO ] [Real]Absence check using 30 positive place invariants in 59 ms returned sat
[2026-05-24 12:02:00] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 17 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:02:00] [INFO ] [Real]Absence check using 30 positive place invariants in 42 ms returned sat
[2026-05-24 12:02:00] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 149 ms returned sat
[2026-05-24 12:02:01] [INFO ] [Real]Absence check using state equation in 953 ms returned sat
[2026-05-24 12:02:02] [INFO ] Computed and/alt/rep : 1133/1650/1133 causal constraints (skipped 90 transitions) in 132 ms.
[2026-05-24 12:02:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:02:05] [INFO ] [Nat]Absence check using 30 positive place invariants in 77 ms returned sat
[2026-05-24 12:02:05] [INFO ] [Nat]Absence check using 30 positive and 302 generalized place invariants in 216 ms returned sat
[2026-05-24 12:02:06] [INFO ] [Nat]Absence check using state equation in 1223 ms returned sat
[2026-05-24 12:02:07] [INFO ] Computed and/alt/rep : 1133/1650/1133 causal constraints (skipped 90 transitions) in 152 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:02:10] [INFO ] [Real]Absence check using 30 positive place invariants in 62 ms returned sat
[2026-05-24 12:02:10] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 212 ms returned sat
[2026-05-24 12:02:11] [INFO ] [Real]Absence check using state equation in 1199 ms returned sat
[2026-05-24 12:02:12] [INFO ] Computed and/alt/rep : 1133/1650/1133 causal constraints (skipped 90 transitions) in 143 ms.
[2026-05-24 12:02:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:02:15] [INFO ] [Nat]Absence check using 30 positive place invariants in 59 ms returned sat
[2026-05-24 12:02:15] [INFO ] [Nat]Absence check using 30 positive and 302 generalized place invariants in 206 ms returned sat
[2026-05-24 12:02:16] [INFO ] [Nat]Absence check using state equation in 1129 ms returned sat
[2026-05-24 12:02:17] [INFO ] Computed and/alt/rep : 1133/1650/1133 causal constraints (skipped 90 transitions) in 135 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:02:20] [INFO ] [Real]Absence check using 30 positive place invariants in 57 ms returned sat
[2026-05-24 12:02:20] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 218 ms returned sat
[2026-05-24 12:02:21] [INFO ] [Real]Absence check using state equation in 1261 ms returned sat
[2026-05-24 12:02:22] [INFO ] Computed and/alt/rep : 1133/1650/1133 causal constraints (skipped 90 transitions) in 122 ms.
[2026-05-24 12:02:25] [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:2252)
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-24 12:02:25] [INFO ] [Real]Absence check using 30 positive place invariants in 59 ms returned sat
[2026-05-24 12:02:25] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 214 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:02:26] [INFO ] [Real]Absence check using 30 positive place invariants in 59 ms returned sat
[2026-05-24 12:02:26] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 234 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:02:26] [INFO ] [Real]Absence check using 30 positive place invariants in 49 ms returned sat
[2026-05-24 12:02:26] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 14 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:02:27] [INFO ] [Real]Absence check using 30 positive place invariants in 46 ms returned sat
[2026-05-24 12:02:27] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 186 ms returned sat
[2026-05-24 12:02:28] [INFO ] [Real]Absence check using state equation in 1127 ms returned sat
[2026-05-24 12:02:28] [INFO ] Computed and/alt/rep : 1133/1650/1133 causal constraints (skipped 90 transitions) in 125 ms.
[2026-05-24 12:02:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:02:32] [INFO ] [Nat]Absence check using 30 positive place invariants in 43 ms returned sat
[2026-05-24 12:02:32] [INFO ] [Nat]Absence check using 30 positive and 302 generalized place invariants in 159 ms returned sat
[2026-05-24 12:02:33] [INFO ] [Nat]Absence check using state equation in 953 ms returned sat
[2026-05-24 12:02:33] [INFO ] Computed and/alt/rep : 1133/1650/1133 causal constraints (skipped 90 transitions) in 97 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:02:37] [INFO ] [Real]Absence check using 30 positive place invariants in 58 ms returned sat
[2026-05-24 12:02:37] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 211 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:02:37] [INFO ] [Real]Absence check using 30 positive place invariants in 52 ms returned sat
[2026-05-24 12:02:38] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 136 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[11, 3, 4, 3, 2, 2, 11, 5, 1, 1] Max Struct:[11, 148082, 161542, 74041, 2, 2, 11, +inf, 1, 1]
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-06 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-00 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 4, 3, 5] Max Struct:[148082, 161542, 74041, +inf]
Support contains 57 out of 1465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1465/1465 places, 1234/1234 transitions.
Graph (complete) has 2215 edges and 1465 vertex of which 1240 are kept as prefixes of interest. Removing 225 places using SCC suffix rule.8 ms
Discarding 225 places :
Also discarding 198 output transitions
Drop transitions (Output transitions of discarded places.) removed 198 transitions
Discarding 132 places :
Implicit places reduction removed 132 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 550 rules applied. Total rules applied 551 place count 1108 transition count 618
Reduce places removed 418 places and 0 transitions.
Iterating post reduction 1 with 418 rules applied. Total rules applied 969 place count 690 transition count 618
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 121 Pre rules applied. Total rules applied 969 place count 690 transition count 497
Deduced a syphon composed of 121 places in 3 ms
Ensure Unique test removed 44 places
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 1255 place count 525 transition count 497
Discarding 11 places :
Implicit places reduction removed 11 places
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 22 rules applied. Total rules applied 1277 place count 514 transition count 486
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 1288 place count 503 transition count 486
Discarding 66 places :
Symmetric choice reduction at 4 with 66 rule applications. Total rules 1354 place count 437 transition count 420
Iterating global reduction 4 with 66 rules applied. Total rules applied 1420 place count 437 transition count 420
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 4 with 110 rules applied. Total rules applied 1530 place count 415 transition count 332
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 5 with 77 rules applied. Total rules applied 1607 place count 338 transition count 332
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1607 place count 338 transition count 321
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1629 place count 327 transition count 321
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1631 place count 325 transition count 299
Iterating global reduction 6 with 2 rules applied. Total rules applied 1633 place count 325 transition count 299
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 6 with 33 rules applied. Total rules applied 1666 place count 303 transition count 288
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1677 place count 292 transition count 288
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 22 Pre rules applied. Total rules applied 1677 place count 292 transition count 266
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 8 with 44 rules applied. Total rules applied 1721 place count 270 transition count 266
Discarding 22 places :
Symmetric choice reduction at 8 with 22 rule applications. Total rules 1743 place count 248 transition count 244
Iterating global reduction 8 with 22 rules applied. Total rules applied 1765 place count 248 transition count 244
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 8 with 44 rules applied. Total rules applied 1809 place count 237 transition count 211
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 1831 place count 215 transition count 211
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 10 with 77 rules applied. Total rules applied 1908 place count 171 transition count 178
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 10 with 22 rules applied. Total rules applied 1930 place count 160 transition count 167
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 10 with 11 rules applied. Total rules applied 1941 place count 160 transition count 156
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 1952 place count 149 transition count 156
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 11 with 11 rules applied. Total rules applied 1963 place count 138 transition count 145
Applied a total of 1963 rules in 362 ms. Remains 138 /1465 variables (removed 1327) and now considering 145/1234 (removed 1089) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 378 ms. Remains : 138/1465 places, 145/1234 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 145 rows 138 cols
[2026-05-24 12:02:38] [INFO ] Computed 25 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 4, 3, 5] Max Struct:[148082, 161542, 74041, +inf]
RANDOM walk for 1000000 steps (10908 resets) in 3283 ms. (304 steps per ms)
BEST_FIRST walk for 4000004 steps (3070 resets) in 3986 ms. (1003 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11, 11, 11, 11] Max Struct:[148082, 161542, 74041, +inf]
[2026-05-24 12:02:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:02:45] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 9 ms returned sat
[2026-05-24 12:02:46] [INFO ] [Real]Absence check using state equation in 72 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:02:46] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 9 ms returned sat
[2026-05-24 12:02:46] [INFO ] [Real]Absence check using state equation in 68 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:02:46] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 10 ms returned sat
[2026-05-24 12:02:46] [INFO ] [Real]Absence check using state equation in 71 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:02:46] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 9 ms returned sat
[2026-05-24 12:02:46] [INFO ] [Real]Absence check using state equation in 61 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[11, 11, 11, 11] Max Struct:[11, 11, 11, 11]
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-07 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-03 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-02 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-01 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 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-24 12:02:46] [INFO ] Flatten gal took : 69 ms
[2026-05-24 12:02:46] [INFO ] Flatten gal took : 21 ms
[2026-05-24 12:02:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2497401212956657619.gal : 16 ms
[2026-05-24 12:02:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13863877667323037719.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/ReachabilityCardinality2497401212956657619.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13863877667323037719.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 48714 ms.

BK_STOP 1779624166862

--------------------
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="FamilyReunion-PT-L00010M0001C001P001G001"
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 FamilyReunion-PT-L00010M0001C001P001G001, 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 r143-smll-177955812400013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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