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-178021502100031.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-bP05C05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-smll-178021502100031
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 984K
-rw-r--r-- 1 mcc users 6.7K May 27 09:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 27 09:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 27 09:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 27 09:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 27 10:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 16K May 27 10:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 8.5K May 27 09:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 27 09:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 27 09:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 27 09:38 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 610K 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-bP05C05-UpperBounds-00
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-UpperBounds-01
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-UpperBounds-02
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-UpperBounds-03
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-UpperBounds-04
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-UpperBounds-05
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-UpperBounds-06
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-UpperBounds-07
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-UpperBounds-08
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-UpperBounds-09
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-UpperBounds-10
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-UpperBounds-11
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-UpperBounds-12
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-UpperBounds-13
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-UpperBounds-14
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1780320775451

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP05C05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-06-01 13:32: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-06-01 13:32:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-01 13:32:58] [INFO ] Load time of PNML (sax parser for PT used): 348 ms
[2026-06-01 13:32:58] [INFO ] Transformed 259 places.
[2026-06-01 13:32:58] [INFO ] Transformed 1015 transitions.
[2026-06-01 13:32:58] [INFO ] Found NUPN structural information;
[2026-06-01 13:32:58] [INFO ] Parsed PT model containing 259 places and 1015 transitions and 11939 arcs in 585 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 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 1015 rows 259 cols
[2026-06-01 13:32:58] [INFO ] Computed 18 invariants in 69 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 529 ms. (18 steps per ms)
FORMULA ErlangenMainframeV2-PT-bP05C05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP05C05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP05C05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP05C05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP05C05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP05C05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP05C05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP05C05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP05C05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70002 steps (14 resets) in 875 ms. (79 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2026-06-01 13:33:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:33:00] [INFO ] [Real]Absence check using 12 positive place invariants in 27 ms returned sat
[2026-06-01 13:33:00] [INFO ] [Real]Absence check using 12 positive and 6 generalized place invariants in 5 ms returned sat
[2026-06-01 13:33:01] [INFO ] [Real]Absence check using state equation in 742 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:33:03] [INFO ] Deduced a trap composed of 23 places in 1291 ms of which 77 ms to minimize.
[2026-06-01 13:33:03] [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:03] [INFO ] [Nat]Absence check using 12 positive place invariants in 16 ms returned sat
[2026-06-01 13:33:03] [INFO ] [Nat]Absence check using 12 positive and 6 generalized place invariants in 3 ms returned sat
[2026-06-01 13:33:03] [INFO ] [Nat]Absence check using state equation in 569 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:33:05] [INFO ] Deduced a trap composed of 23 places in 1144 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:33:06] [INFO ] Deduced a trap composed of 25 places in 1020 ms of which 95 ms to minimize.
[2026-06-01 13:33:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2349 ms
[2026-06-01 13:33:07] [INFO ] Computed and/alt/rep : 255/617/255 causal constraints (skipped 759 transitions) in 1009 ms.
Maximisation of solution failed !
Minimization took 2 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:33:08] [INFO ] [Real]Absence check using 12 positive place invariants in 14 ms returned sat
[2026-06-01 13:33:08] [INFO ] [Real]Absence check using 12 positive and 6 generalized place invariants in 4 ms returned sat
[2026-06-01 13:33:08] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:33:10] [INFO ] Deduced a trap composed of 26 places in 910 ms of which 78 ms to minimize.
[2026-06-01 13:33:10] [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:10] [INFO ] [Nat]Absence check using 12 positive place invariants in 15 ms returned sat
[2026-06-01 13:33:10] [INFO ] [Nat]Absence check using 12 positive and 6 generalized place invariants in 4 ms returned sat
[2026-06-01 13:33:10] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:33:11] [INFO ] Deduced a trap composed of 26 places in 562 ms of which 50 ms to minimize.
[2026-06-01 13:33:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 676 ms
[2026-06-01 13:33:11] [INFO ] Computed and/alt/rep : 255/617/255 causal constraints (skipped 759 transitions) in 353 ms.
[2026-06-01 13:33:14] [INFO ] Added : 193 causal constraints over 39 iterations in 3072 ms. Result :sat
Minimization took 692 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:33:15] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2026-06-01 13:33:15] [INFO ] [Real]Absence check using 12 positive and 6 generalized place invariants in 3 ms returned sat
[2026-06-01 13:33:15] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:33:16] [INFO ] Deduced a trap composed of 21 places in 789 ms of which 46 ms to minimize.
[2026-06-01 13:33:16] [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:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 16 ms returned sat
[2026-06-01 13:33:16] [INFO ] [Nat]Absence check using 12 positive and 6 generalized place invariants in 3 ms returned sat
[2026-06-01 13:33:17] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:33:17] [INFO ] Deduced a trap composed of 22 places in 758 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:33:18] [INFO ] Deduced a trap composed of 33 places in 757 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:33:19] [INFO ] Deduced a trap composed of 34 places in 584 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:33:19] [INFO ] Deduced a trap composed of 34 places in 546 ms of which 31 ms to minimize.
[2026-06-01 13:33:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2814 ms
[2026-06-01 13:33:20] [INFO ] Computed and/alt/rep : 255/617/255 causal constraints (skipped 759 transitions) in 254 ms.
[2026-06-01 13:33:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.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:21] [INFO ] [Real]Absence check using 12 positive place invariants in 17 ms returned sat
[2026-06-01 13:33:21] [INFO ] [Real]Absence check using 12 positive and 6 generalized place invariants in 4 ms returned sat
[2026-06-01 13:33:22] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:33:23] [INFO ] Deduced a trap composed of 23 places in 1112 ms of which 96 ms to minimize.
[2026-06-01 13:33:23] [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:23] [INFO ] [Nat]Absence check using 12 positive place invariants in 17 ms returned sat
[2026-06-01 13:33:23] [INFO ] [Nat]Absence check using 12 positive and 6 generalized place invariants in 4 ms returned sat
[2026-06-01 13:33:24] [INFO ] [Nat]Absence check using state equation in 506 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 23 places in 819 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:33:25] [INFO ] Deduced a trap composed of 25 places in 733 ms of which 64 ms to minimize.
[2026-06-01 13:33:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1670 ms
[2026-06-01 13:33:26] [INFO ] Computed and/alt/rep : 255/617/255 causal constraints (skipped 759 transitions) in 282 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:33:28] [INFO ] [Real]Absence check using 12 positive place invariants in 15 ms returned sat
[2026-06-01 13:33:28] [INFO ] [Real]Absence check using 12 positive and 6 generalized place invariants in 3 ms returned sat
[2026-06-01 13:33:29] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2026-06-01 13:33:29] [INFO ] Computed and/alt/rep : 255/617/255 causal constraints (skipped 759 transitions) in 799 ms.
[2026-06-01 13:33:30] [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:30] [INFO ] [Nat]Absence check using 12 positive place invariants in 12 ms returned sat
[2026-06-01 13:33:30] [INFO ] [Nat]Absence check using 12 positive and 6 generalized place invariants in 2 ms returned sat
[2026-06-01 13:33:30] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2026-06-01 13:33:31] [INFO ] Computed and/alt/rep : 255/617/255 causal constraints (skipped 759 transitions) in 434 ms.
[2026-06-01 13:33:34] [INFO ] Added : 195 causal constraints over 39 iterations in 3388 ms. Result :sat
Minimization took 607 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:33:34] [INFO ] [Real]Absence check using 12 positive place invariants in 17 ms returned sat
[2026-06-01 13:33:34] [INFO ] [Real]Absence check using 12 positive and 6 generalized place invariants in 4 ms returned sat
[2026-06-01 13:33:35] [INFO ] [Real]Absence check using state equation in 528 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:33:36] [INFO ] Deduced a trap composed of 49 places in 859 ms of which 75 ms to minimize.
[2026-06-01 13:33:36] [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:36] [INFO ] [Nat]Absence check using 12 positive place invariants in 17 ms returned sat
[2026-06-01 13:33:36] [INFO ] [Nat]Absence check using 12 positive and 6 generalized place invariants in 3 ms returned sat
[2026-06-01 13:33:37] [INFO ] [Nat]Absence check using state equation in 497 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:33:38] [INFO ] Deduced a trap composed of 49 places in 972 ms of which 92 ms to minimize.
[2026-06-01 13:33:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1067 ms
[2026-06-01 13:33:38] [INFO ] Computed and/alt/rep : 255/617/255 causal constraints (skipped 759 transitions) in 368 ms.
[2026-06-01 13:33:41] [INFO ] Added : 180 causal constraints over 36 iterations in 3306 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:33:41] [INFO ] [Real]Absence check using 12 positive place invariants in 17 ms returned sat
[2026-06-01 13:33:41] [INFO ] [Real]Absence check using 12 positive and 6 generalized place invariants in 5 ms returned sat
[2026-06-01 13:33:42] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2026-06-01 13:33:42] [INFO ] Computed and/alt/rep : 255/617/255 causal constraints (skipped 759 transitions) in 380 ms.
[2026-06-01 13:33:42] [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:42] [INFO ] [Nat]Absence check using 12 positive place invariants in 18 ms returned sat
[2026-06-01 13:33:42] [INFO ] [Nat]Absence check using 12 positive and 6 generalized place invariants in 4 ms returned sat
[2026-06-01 13:33:43] [INFO ] [Nat]Absence check using state equation in 339 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:33:43] [INFO ] Deduced a trap composed of 27 places in 555 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:33:44] [INFO ] Deduced a trap composed of 35 places in 855 ms of which 63 ms to minimize.
[2026-06-01 13:33:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1504 ms
[2026-06-01 13:33:45] [INFO ] Computed and/alt/rep : 255/617/255 causal constraints (skipped 759 transitions) in 384 ms.
[2026-06-01 13:33:47] [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 6
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, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 1, 1, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 1015/1015 transitions.
Graph (trivial) has 226 edges and 259 vertex of which 12 / 259 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 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 252 transition count 900
Reduce places removed 102 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 114 rules applied. Total rules applied 217 place count 150 transition count 888
Reduce places removed 3 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 224 place count 147 transition count 884
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 228 place count 143 transition count 884
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 228 place count 143 transition count 880
Deduced a syphon composed of 4 places in 3 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 237 place count 138 transition count 880
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 265 place count 110 transition count 852
Iterating global reduction 4 with 28 rules applied. Total rules applied 293 place count 110 transition count 852
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 293 place count 110 transition count 847
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 303 place count 105 transition count 847
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 314 place count 94 transition count 602
Ensure Unique test removed 1 places
Iterating global reduction 4 with 12 rules applied. Total rules applied 326 place count 93 transition count 602
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 331 place count 88 transition count 164
Iterating global reduction 4 with 5 rules applied. Total rules applied 336 place count 88 transition count 164
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 337 place count 87 transition count 162
Iterating global reduction 4 with 1 rules applied. Total rules applied 338 place count 87 transition count 162
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 396 place count 58 transition count 133
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 410 place count 51 transition count 152
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 420 place count 51 transition count 142
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 422 place count 49 transition count 137
Iterating global reduction 5 with 2 rules applied. Total rules applied 424 place count 49 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 428 place count 49 transition count 133
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 430 place count 48 transition count 137
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 444 place count 48 transition count 123
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 446 place count 47 transition count 127
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 454 place count 47 transition count 119
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 471 place count 39 transition count 110
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 473 place count 39 transition count 108
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 474 place count 39 transition count 114
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 477 place count 38 transition count 112
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 483 place count 38 transition count 106
Applied a total of 483 rules in 476 ms. Remains 38 /259 variables (removed 221) and now considering 106/1015 (removed 909) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 492 ms. Remains : 38/259 places, 106/1015 transitions.
[2026-06-01 13:33:48] [INFO ] Flow matrix only has 103 transitions (discarded 3 similar events)
// Phase 1: matrix 103 rows 38 cols
[2026-06-01 13:33:48] [INFO ] Computed 16 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 1, 1, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA ErlangenMainframeV2-PT-bP05C05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP05C05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 3205 ms. (311 steps per ms)
FORMULA ErlangenMainframeV2-PT-bP05C05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP05C05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP05C05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP05C05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP05C05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 810 ms. (1233 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:52] [INFO ] Flatten gal took : 87 ms
[2026-06-01 13:33:52] [INFO ] Flatten gal took : 35 ms
[2026-06-01 13:33:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3344883480499835552.gal : 23 ms
[2026-06-01 13:33:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality43333979501189544.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/ReachabilityCardinality3344883480499835552.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality43333979501189544.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 54892 ms.

BK_STOP 1780320833017

--------------------
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-bP05C05"
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-bP05C05, 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-178021502100031"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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