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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 61K Mar 6 07:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 418K Mar 6 07:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 72K Mar 6 07:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 280K Mar 6 07:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 15K Mar 15 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 15 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 32K Mar 15 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 96K Mar 15 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 53K Mar 6 07:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 349K Mar 6 07:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 124K Mar 6 07:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 478K Mar 6 07:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.4K Mar 15 10:00 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 1.3M 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-L00020M0002C001P001G001-UpperBounds-00
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-01
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-02
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-03
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-04
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-05
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-06
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-07
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-08
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-09
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-10
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-11
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-12
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-13
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-14
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779624179707

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00020M0002C001P001G001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-24 12:03:01] [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:03:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 12:03:02] [INFO ] Load time of PNML (sax parser for PT used): 418 ms
[2026-05-24 12:03:02] [INFO ] Transformed 3271 places.
[2026-05-24 12:03:02] [INFO ] Transformed 2753 transitions.
[2026-05-24 12:03:02] [INFO ] Parsed PT model containing 3271 places and 2753 transitions and 8446 arcs in 639 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 20 ms.
Reduce places removed 11 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 2753 rows 3260 cols
[2026-05-24 12:03:03] [INFO ] Computed 748 invariants in 271 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:[361, 361, 722, 3516, 1500, 361, 724, 361, 15113, 1444, 1, 1, 2, 2, 6775, 1]
RANDOM walk for 10000 steps (8 resets) in 174 ms. (57 steps per ms)
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 140014 steps (28 resets) in 299 ms. (466 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5, 6, 2, 2, 7, 1, 5, 4, 6, 1, 1, 13, 0] Max Struct:[361, 361, 722, 3516, 1500, 361, 724, 361, 15113, 1444, 2, 2, 6775, 1]
[2026-05-24 12:03:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:03:05] [INFO ] [Real]Absence check using 61 positive place invariants in 176 ms returned sat
[2026-05-24 12:03:05] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 455 ms returned sat
[2026-05-24 12:03:08] [INFO ] [Real]Absence check using state equation in 2558 ms returned sat
[2026-05-24 12:03:09] [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:03:10] [INFO ] [Nat]Absence check using 61 positive place invariants in 161 ms returned sat
[2026-05-24 12:03:10] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 453 ms returned sat
[2026-05-24 12:03:12] [INFO ] [Nat]Absence check using state equation in 1909 ms returned sat
[2026-05-24 12:03:13] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 241 ms.
[2026-05-24 12:03:14] [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-24 12:03:14] [INFO ] [Real]Absence check using 61 positive place invariants in 90 ms returned sat
[2026-05-24 12:03:15] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 309 ms returned sat
[2026-05-24 12:03:17] [INFO ] [Real]Absence check using state equation in 2763 ms returned sat
[2026-05-24 12:03:18] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 433 ms.
[2026-05-24 12:03:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java: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:03:20] [INFO ] [Real]Absence check using 61 positive place invariants in 164 ms returned sat
[2026-05-24 12:03:20] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 466 ms returned sat
[2026-05-24 12:03:22] [INFO ] [Real]Absence check using state equation in 2263 ms returned sat
[2026-05-24 12:03:23] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 220 ms.
[2026-05-24 12:03:24] [INFO ] Added : 20 causal constraints over 4 iterations in 978 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:03:24] [INFO ] [Real]Absence check using 61 positive place invariants in 95 ms returned sat
[2026-05-24 12:03:25] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 182 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:03:25] [INFO ] [Real]Absence check using 61 positive place invariants in 93 ms returned sat
[2026-05-24 12:03:26] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 220 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:03:26] [INFO ] [Real]Absence check using 61 positive place invariants in 91 ms returned sat
[2026-05-24 12:03:27] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 336 ms returned sat
[2026-05-24 12:03:29] [INFO ] [Real]Absence check using state equation in 2521 ms returned sat
[2026-05-24 12:03:30] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 228 ms.
[2026-05-24 12:03: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:03:32] [INFO ] [Nat]Absence check using 61 positive place invariants in 145 ms returned sat
[2026-05-24 12:03:32] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 453 ms returned sat
[2026-05-24 12:03:35] [INFO ] [Nat]Absence check using state equation in 2611 ms returned sat
[2026-05-24 12:03:35] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 195 ms.
Maximisation of solution failed !
Minimization took 2 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:03:36] [INFO ] [Real]Absence check using 61 positive place invariants in 135 ms returned sat
[2026-05-24 12:03:37] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 421 ms returned sat
[2026-05-24 12:03:39] [INFO ] [Real]Absence check using state equation in 2398 ms returned sat
[2026-05-24 12:03:40] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 216 ms.
[2026-05-24 12:03:41] [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:03:42] [INFO ] [Nat]Absence check using 61 positive place invariants in 98 ms returned sat
[2026-05-24 12:03:42] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 309 ms returned sat
[2026-05-24 12:03:44] [INFO ] [Nat]Absence check using state equation in 2211 ms returned sat
[2026-05-24 12:03:45] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 190 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:03:46] [INFO ] [Real]Absence check using 61 positive place invariants in 94 ms returned sat
[2026-05-24 12:03:47] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 290 ms returned sat
[2026-05-24 12:03:48] [INFO ] [Real]Absence check using state equation in 1901 ms returned sat
[2026-05-24 12:03:49] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 294 ms.
[2026-05-24 12:03:51] [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:03:52] [INFO ] [Nat]Absence check using 61 positive place invariants in 130 ms returned sat
[2026-05-24 12:03:52] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 337 ms returned sat
[2026-05-24 12:03:54] [INFO ] [Nat]Absence check using state equation in 2280 ms returned sat
[2026-05-24 12:03:55] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 249 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:03:57] [INFO ] [Real]Absence check using 61 positive place invariants in 132 ms returned sat
[2026-05-24 12:03:57] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 431 ms returned sat
[2026-05-24 12:03:59] [INFO ] [Real]Absence check using state equation in 2217 ms returned sat
[2026-05-24 12:04:00] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 260 ms.
[2026-05-24 12:04:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 8
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: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:04:02] [INFO ] [Real]Absence check using 61 positive place invariants in 114 ms returned sat
[2026-05-24 12:04:02] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 403 ms returned sat
[2026-05-24 12:04:05] [INFO ] [Real]Absence check using state equation in 2813 ms returned sat
[2026-05-24 12:04:05] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 223 ms.
[2026-05-24 12:04:06] [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 9
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:04:07] [INFO ] [Real]Absence check using 61 positive place invariants in 101 ms returned sat
[2026-05-24 12:04:07] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 301 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:04:08] [INFO ] [Real]Absence check using 61 positive place invariants in 92 ms returned sat
[2026-05-24 12:04:08] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 6 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:04:09] [INFO ] [Real]Absence check using 61 positive place invariants in 134 ms returned sat
[2026-05-24 12:04:09] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 467 ms returned sat
[2026-05-24 12:04:12] [INFO ] [Real]Absence check using state equation in 2693 ms returned sat
[2026-05-24 12:04:12] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 193 ms.
[2026-05-24 12:04:13] [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:04:14] [INFO ] [Nat]Absence check using 61 positive place invariants in 105 ms returned sat
[2026-05-24 12:04:14] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 391 ms returned sat
[2026-05-24 12:04:16] [INFO ] [Nat]Absence check using state equation in 2481 ms returned sat
[2026-05-24 12:04:17] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 275 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:04:19] [INFO ] [Real]Absence check using 61 positive place invariants in 93 ms returned sat
[2026-05-24 12:04:19] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 305 ms returned sat
[2026-05-24 12:04:21] [INFO ] [Real]Absence check using state equation in 2115 ms returned sat
[2026-05-24 12:04:22] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 298 ms.
[2026-05-24 12:04:23] [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 13
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)
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5, 6, 2, 2, 7, 1, 5, 4, 6, 1, 1, 13, 0] Max Struct:[361, 361, 722, 2, 2, 361, 724, 361, 15113, 1444, 1, 1, 6775, 1]
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5, 7, 7, 1, 5, 4, 6, 13, 0] Max Struct:[361, 361, 722, 361, 724, 361, 15113, 1444, 6775, 1]
Support contains 151 out of 3260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3260/3260 places, 2753/2753 transitions.
Graph (complete) has 4960 edges and 3260 vertex of which 3061 are kept as prefixes of interest. Removing 199 places using SCC suffix rule.16 ms
Discarding 199 places :
Also discarding 104 output transitions
Drop transitions (Output transitions of discarded places.) removed 104 transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Discarding 378 places :
Implicit places reduction removed 378 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1176 transitions
Trivial Post-agglo rules discarded 1176 transitions
Performed 1176 trivial Post agglomeration. Transition count delta: 1176
Iterating post reduction 0 with 1594 rules applied. Total rules applied 1595 place count 2683 transition count 1433
Reduce places removed 1176 places and 0 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 1 with 1218 rules applied. Total rules applied 2813 place count 1507 transition count 1391
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 2855 place count 1465 transition count 1391
Performed 209 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 209 Pre rules applied. Total rules applied 2855 place count 1465 transition count 1182
Deduced a syphon composed of 209 places in 6 ms
Ensure Unique test removed 84 places
Reduce places removed 293 places and 0 transitions.
Iterating global reduction 3 with 502 rules applied. Total rules applied 3357 place count 1172 transition count 1182
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 3 with 42 rules applied. Total rules applied 3399 place count 1151 transition count 1161
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 3420 place count 1130 transition count 1161
Discarding 211 places :
Symmetric choice reduction at 5 with 211 rule applications. Total rules 3631 place count 919 transition count 950
Iterating global reduction 5 with 211 rules applied. Total rules applied 3842 place count 919 transition count 950
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 5 with 149 rules applied. Total rules applied 3991 place count 877 transition count 843
Reduce places removed 84 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 6 with 105 rules applied. Total rules applied 4096 place count 793 transition count 822
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 4117 place count 772 transition count 822
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 42 Pre rules applied. Total rules applied 4117 place count 772 transition count 780
Deduced a syphon composed of 42 places in 3 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 8 with 84 rules applied. Total rules applied 4201 place count 730 transition count 780
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 4204 place count 727 transition count 717
Iterating global reduction 8 with 3 rules applied. Total rules applied 4207 place count 727 transition count 717
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 8 with 84 rules applied. Total rules applied 4291 place count 685 transition count 675
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 4312 place count 664 transition count 675
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 21 Pre rules applied. Total rules applied 4312 place count 664 transition count 654
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 10 with 42 rules applied. Total rules applied 4354 place count 643 transition count 654
Discarding 42 places :
Symmetric choice reduction at 10 with 42 rule applications. Total rules 4396 place count 601 transition count 612
Iterating global reduction 10 with 42 rules applied. Total rules applied 4438 place count 601 transition count 612
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 10 with 105 rules applied. Total rules applied 4543 place count 580 transition count 528
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 11 with 42 rules applied. Total rules applied 4585 place count 538 transition count 528
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 12 with 126 rules applied. Total rules applied 4711 place count 475 transition count 465
Free-agglomeration rule (complex) applied 42 times.
Iterating global reduction 12 with 42 rules applied. Total rules applied 4753 place count 475 transition count 423
Ensure Unique test removed 21 places
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 12 with 63 rules applied. Total rules applied 4816 place count 412 transition count 423
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 13 with 21 rules applied. Total rules applied 4837 place count 391 transition count 402
Applied a total of 4837 rules in 920 ms. Remains 391 /3260 variables (removed 2869) and now considering 402/2753 (removed 2351) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 937 ms. Remains : 391/3260 places, 402/2753 transitions.
// Phase 1: matrix 402 rows 391 cols
[2026-05-24 12:04:25] [INFO ] Computed 69 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5, 5, 7, 7, 1, 5, 4, 6, 13, 0] Max Struct:[361, 361, 722, 361, 724, 361, 15113, 1444, 6775, 1]
RANDOM walk for 1000000 steps (4345 resets) in 7544 ms. (132 steps per ms)
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 9000009 steps (1812 resets) in 13738 ms. (655 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[21, 21, 21, 21, 2, 21, 17, 18, 18] Max Struct:[361, 361, 722, 361, 724, 361, 15113, 1444, 6775]
[2026-05-24 12:04:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:04:46] [INFO ] [Real]Absence check using 0 positive and 69 generalized place invariants in 27 ms returned sat
[2026-05-24 12:04:46] [INFO ] [Real]Absence check using state equation in 90 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:04:46] [INFO ] [Real]Absence check using 0 positive and 69 generalized place invariants in 28 ms returned sat
[2026-05-24 12:04:47] [INFO ] [Real]Absence check using state equation in 91 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:04:47] [INFO ] [Real]Absence check using 0 positive and 69 generalized place invariants in 26 ms returned sat
[2026-05-24 12:04:47] [INFO ] [Real]Absence check using state equation in 113 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:04:47] [INFO ] [Real]Absence check using 0 positive and 69 generalized place invariants in 39 ms returned sat
[2026-05-24 12:04:47] [INFO ] [Real]Absence check using state equation in 129 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:04:47] [INFO ] [Real]Absence check using 0 positive and 69 generalized place invariants in 30 ms returned sat
[2026-05-24 12:04:47] [INFO ] [Real]Absence check using state equation in 117 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:04:47] [INFO ] [Real]Absence check using 0 positive and 69 generalized place invariants in 27 ms returned sat
[2026-05-24 12:04:47] [INFO ] [Real]Absence check using state equation in 90 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:04:48] [INFO ] [Real]Absence check using 0 positive and 69 generalized place invariants in 27 ms returned sat
[2026-05-24 12:04:48] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2026-05-24 12:04:48] [INFO ] Computed and/alt/rep : 254/363/254 causal constraints (skipped 127 transitions) in 28 ms.
[2026-05-24 12:04:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:04:48] [INFO ] [Nat]Absence check using 0 positive and 69 generalized place invariants in 31 ms returned sat
[2026-05-24 12:04:48] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2026-05-24 12:04:48] [INFO ] Computed and/alt/rep : 254/363/254 causal constraints (skipped 127 transitions) in 24 ms.
[2026-05-24 12:04:49] [INFO ] Added : 87 causal constraints over 18 iterations in 537 ms. Result :sat
Minimization took 220 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:04:49] [INFO ] [Real]Absence check using 0 positive and 69 generalized place invariants in 34 ms returned sat
[2026-05-24 12:04:50] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2026-05-24 12:04:50] [INFO ] Computed and/alt/rep : 254/363/254 causal constraints (skipped 127 transitions) in 36 ms.
[2026-05-24 12:04:50] [INFO ] Added : 83 causal constraints over 17 iterations in 783 ms. Result :sat
Minimization took 343 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:04:51] [INFO ] [Real]Absence check using 0 positive and 69 generalized place invariants in 44 ms returned sat
[2026-05-24 12:04:51] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2026-05-24 12:04:51] [INFO ] Computed and/alt/rep : 254/363/254 causal constraints (skipped 127 transitions) in 46 ms.
[2026-05-24 12:04:53] [INFO ] Added : 90 causal constraints over 18 iterations in 1385 ms. Result :sat
Minimization took 562 ms.
[2026-05-24 12:04:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:04:54] [INFO ] [Nat]Absence check using 0 positive and 69 generalized place invariants in 47 ms returned sat
[2026-05-24 12:04:54] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2026-05-24 12:04:54] [INFO ] Computed and/alt/rep : 254/363/254 causal constraints (skipped 127 transitions) in 41 ms.
[2026-05-24 12:04:55] [INFO ] Added : 90 causal constraints over 18 iterations in 895 ms. Result :sat
Minimization took 416 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[21, 21, 21, 21, 2, 21, 17, 18, 18] Max Struct:[21, 21, 21, 21, 2, 21, 15113, 1444, 6775]
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-07 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-05 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-02 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-01 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-00 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[21, 21, 21] Max Struct:[15113, 1444, 6775]
Support contains 3 out of 391 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 391/391 places, 402/402 transitions.
Graph (complete) has 786 edges and 391 vertex of which 173 are kept as prefixes of interest. Removing 218 places using SCC suffix rule.1 ms
Discarding 218 places :
Also discarding 212 output transitions
Drop transitions (Output transitions of discarded places.) removed 212 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 173 transition count 169
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 152 transition count 169
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 43 place count 152 transition count 148
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 85 place count 131 transition count 148
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 127 place count 110 transition count 127
Applied a total of 127 rules in 17 ms. Remains 110 /391 variables (removed 281) and now considering 127/402 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 110/391 places, 127/402 transitions.
// Phase 1: matrix 127 rows 110 cols
[2026-05-24 12:04:55] [INFO ] Computed 23 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[21, 21, 21] Max Struct:[15113, 1444, 6775]
RANDOM walk for 1000000 steps (13067 resets) in 3171 ms. (315 steps per ms)
BEST_FIRST walk for 3000003 steps (1931 resets) in 2334 ms. (1284 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[21, 21, 21] Max Struct:[15113, 1444, 6775]
[2026-05-24 12:05:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:05:01] [INFO ] [Real]Absence check using 0 positive and 23 generalized place invariants in 7 ms returned sat
[2026-05-24 12:05:01] [INFO ] [Real]Absence check using state equation in 53 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:05:01] [INFO ] [Real]Absence check using 0 positive and 23 generalized place invariants in 11 ms returned sat
[2026-05-24 12:05:01] [INFO ] [Real]Absence check using state equation in 49 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:05:01] [INFO ] [Real]Absence check using 0 positive and 23 generalized place invariants in 11 ms returned sat
[2026-05-24 12:05:01] [INFO ] [Real]Absence check using state equation in 86 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[21, 21, 21] Max Struct:[21, 21, 21]
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-14 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-09 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-08 21 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 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-24 12:05:02] [INFO ] Flatten gal took : 99 ms
[2026-05-24 12:05:02] [INFO ] Flatten gal took : 36 ms
[2026-05-24 12:05:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17737081528257407338.gal : 22 ms
[2026-05-24 12:05:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5671797045997057138.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/ReachabilityCardinality17737081528257407338.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5671797045997057138.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:188)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:343)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:420)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
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 120261 ms.

BK_STOP 1779624302346

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

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