Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r097-smll-174860111800027.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is FamilyReunion-PT-L00050M0005C002P002G001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r097-smll-174860111800027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 167K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 327K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 58K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 252K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 113K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 324K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 96K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 585K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 778K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.8M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 23K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 24 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 4.7M May 29 14:32 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-L00050M0005C002P002G001-UpperBounds-00
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-01
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-02
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-03
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-04
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-05
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-06
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-07
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-08
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-09
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-10
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-11
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-12
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-13
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-14
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748674691707

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00050M0005C002P002G001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 06:58:14] [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]
[2025-05-31 06:58:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 06:58:15] [INFO ] Load time of PNML (sax parser for PT used): 902 ms
[2025-05-31 06:58:15] [INFO ] Transformed 12194 places.
[2025-05-31 06:58:15] [INFO ] Transformed 10560 transitions.
[2025-05-31 06:58:15] [INFO ] Parsed PT model containing 12194 places and 10560 transitions and 32238 arcs in 1248 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 34 ms.
Reduce places removed 17 places and 0 transitions.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[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]
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] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 10560 rows 12177 cols
[2025-05-31 06:58:16] [INFO ] Computed 2768 invariants in 830 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] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 1, 1, 1, 1, 1, +inf, 2, 2]
RANDOM walk for 10000 steps (3 resets) in 341 ms. (29 steps per ms)
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130013 steps (26 resets) in 520 ms. (249 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 51, 8, 9, 11, 20, 10, 0, 0, 0, 9, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 1, 1, 1, +inf, 2, 2]
[2025-05-31 06:58:17] [INFO ] Invariant cache hit.
[2025-05-31 06:58:21] [INFO ] [Real]Absence check using 149 positive place invariants in 572 ms returned sat
[2025-05-31 06:58:22] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 06:58:22] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1619 ms returned unknown
[2025-05-31 06:58:28] [INFO ] [Real]Absence check using 149 positive place invariants in 542 ms returned sat
[2025-05-31 06:58:30] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1591 ms returned sat
[2025-05-31 06:58:30] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 06:58:36] [INFO ] [Real]Absence check using 149 positive place invariants in 660 ms returned sat
[2025-05-31 06:58:37] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1766 ms returned sat
[2025-05-31 06:58:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 06:58:43] [INFO ] [Real]Absence check using 149 positive place invariants in 612 ms returned sat
[2025-05-31 06:58:45] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1785 ms returned sat
[2025-05-31 06:58:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 06:58:48] [INFO ] [Real]Absence check using 149 positive place invariants in 603 ms returned sat
[2025-05-31 06:58:50] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1635 ms returned sat
[2025-05-31 06:58:50] [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 7
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 06:58:53] [INFO ] [Real]Absence check using 149 positive place invariants in 549 ms returned sat
[2025-05-31 06:58:54] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1468 ms returned sat
[2025-05-31 06:58:55] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 06:58:58] [INFO ] [Real]Absence check using 149 positive place invariants in 545 ms returned sat
[2025-05-31 06:58:59] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1469 ms returned sat
[2025-05-31 06:59:00] [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 9
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 06:59:03] [INFO ] [Real]Absence check using 149 positive place invariants in 532 ms returned sat
[2025-05-31 06:59:05] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1618 ms returned sat
[2025-05-31 06:59:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 06:59:08] [INFO ] [Real]Absence check using 149 positive place invariants in 640 ms returned sat
[2025-05-31 06:59:09] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1046 ms returned unsat
[2025-05-31 06:59:12] [INFO ] [Real]Absence check using 149 positive place invariants in 536 ms returned sat
[2025-05-31 06:59:13] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 397 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[10, 51, 8, 9, 11, 20, 10, 0, 0, 0, 9, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 1, 1, 1, +inf, 1, 1]
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 51, 8, 9, 11, 20, 10, 0, 0, 0, 9] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 1, 1, 1, +inf]
Support contains 622 out of 12177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12177/12177 places, 10560/10560 transitions.
Graph (complete) has 18927 edges and 12177 vertex of which 11188 are kept as prefixes of interest. Removing 989 places using SCC suffix rule.32 ms
Discarding 989 places :
Also discarding 918 output transitions
Drop transitions (Output transitions of discarded places.) removed 918 transitions
Discarding 1834 places :
Implicit places reduction removed 1834 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4579 transitions
Trivial Post-agglo rules discarded 4579 transitions
Performed 4579 trivial Post agglomeration. Transition count delta: 4579
Iterating post reduction 0 with 6413 rules applied. Total rules applied 6414 place count 9354 transition count 5063
Reduce places removed 4579 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 4582 rules applied. Total rules applied 10996 place count 4775 transition count 5060
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 10999 place count 4772 transition count 5060
Performed 716 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 716 Pre rules applied. Total rules applied 10999 place count 4772 transition count 4344
Deduced a syphon composed of 716 places in 18 ms
Ensure Unique test removed 257 places
Reduce places removed 973 places and 0 transitions.
Iterating global reduction 3 with 1689 rules applied. Total rules applied 12688 place count 3799 transition count 4344
Discarding 51 places :
Implicit places reduction removed 51 places
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 3 with 102 rules applied. Total rules applied 12790 place count 3748 transition count 4293
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 4 with 51 rules applied. Total rules applied 12841 place count 3697 transition count 4293
Discarding 663 places :
Symmetric choice reduction at 5 with 663 rule applications. Total rules 13504 place count 3034 transition count 3630
Iterating global reduction 5 with 663 rules applied. Total rules applied 14167 place count 3034 transition count 3630
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 255 transitions
Trivial Post-agglo rules discarded 255 transitions
Performed 255 trivial Post agglomeration. Transition count delta: 255
Iterating post reduction 5 with 459 rules applied. Total rules applied 14626 place count 2932 transition count 3273
Reduce places removed 255 places and 0 transitions.
Iterating post reduction 6 with 255 rules applied. Total rules applied 14881 place count 2677 transition count 3273
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 51 Pre rules applied. Total rules applied 14881 place count 2677 transition count 3222
Deduced a syphon composed of 51 places in 6 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 14983 place count 2626 transition count 3222
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 14985 place count 2624 transition count 3120
Iterating global reduction 7 with 2 rules applied. Total rules applied 14987 place count 2624 transition count 3120
Discarding 102 places :
Symmetric choice reduction at 7 with 102 rule applications. Total rules 15089 place count 2522 transition count 3018
Iterating global reduction 7 with 102 rules applied. Total rules applied 15191 place count 2522 transition count 3018
Performed 204 Post agglomeration using F-continuation condition.Transition count delta: 204
Deduced a syphon composed of 204 places in 4 ms
Ensure Unique test removed 51 places
Reduce places removed 255 places and 0 transitions.
Iterating global reduction 7 with 459 rules applied. Total rules applied 15650 place count 2267 transition count 2814
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 3 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 15752 place count 2216 transition count 2763
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: -459
Deduced a syphon composed of 51 places in 3 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 15854 place count 2165 transition count 3222
Free-agglomeration rule (complex) applied 513 times.
Iterating global reduction 7 with 513 rules applied. Total rules applied 16367 place count 2165 transition count 2709
Ensure Unique test removed 102 places
Reduce places removed 615 places and 0 transitions.
Iterating post reduction 7 with 615 rules applied. Total rules applied 16982 place count 1550 transition count 2709
Applied a total of 16982 rules in 2910 ms. Remains 1550 /12177 variables (removed 10627) and now considering 2709/10560 (removed 7851) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2928 ms. Remains : 1550/12177 places, 2709/10560 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 2709 rows 1550 cols
[2025-05-31 06:59:18] [INFO ] Computed 157 invariants in 77 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 51, 8, 9, 11, 20, 10, 0, 0, 0, 9] Max Struct:[15606, 153, 2601, 7803, 2601, +inf, 2601, 1, 1, 1, +inf]
RANDOM walk for 1000000 steps (1377 resets) in 23395 ms. (42 steps per ms)
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 7439269 steps (155 resets) in 28108 ms. (264 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[51, 51, 51, 51, 51, 51, 51, 17] Max Struct:[15606, 153, 2601, 7803, 2601, +inf, 2601, +inf]
[2025-05-31 07:00:09] [INFO ] Invariant cache hit.
[2025-05-31 07:00:09] [INFO ] [Real]Absence check using 3 positive place invariants in 28 ms returned unsat
[2025-05-31 07:00:10] [INFO ] [Real]Absence check using 3 positive place invariants in 42 ms returned unsat
[2025-05-31 07:00:10] [INFO ] [Real]Absence check using 3 positive place invariants in 43 ms returned unsat
[2025-05-31 07:00:11] [INFO ] [Real]Absence check using 3 positive place invariants in 27 ms returned unsat
[2025-05-31 07:00:11] [INFO ] [Real]Absence check using 3 positive place invariants in 27 ms returned unsat
[2025-05-31 07:00:11] [INFO ] [Real]Absence check using 3 positive place invariants in 45 ms returned sat
[2025-05-31 07:00:11] [INFO ] [Real]Absence check using 3 positive and 154 generalized place invariants in 82 ms returned sat
[2025-05-31 07:00:13] [INFO ] [Real]Absence check using state equation in 1249 ms returned unsat
[2025-05-31 07:00:13] [INFO ] [Real]Absence check using 3 positive place invariants in 41 ms returned unsat
[2025-05-31 07:00:13] [INFO ] [Real]Absence check using 3 positive place invariants in 39 ms returned sat
[2025-05-31 07:00:13] [INFO ] [Real]Absence check using 3 positive and 154 generalized place invariants in 68 ms returned sat
[2025-05-31 07:00:15] [INFO ] [Real]Absence check using state equation in 1424 ms returned sat
[2025-05-31 07:00:16] [INFO ] Computed and/alt/rep : 1839/5613/1839 causal constraints (skipped 564 transitions) in 488 ms.
[2025-05-31 07:00:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:00:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 47 ms returned sat
[2025-05-31 07:00:17] [INFO ] [Nat]Absence check using 3 positive and 154 generalized place invariants in 78 ms returned sat
[2025-05-31 07:00:18] [INFO ] [Nat]Absence check using state equation in 1266 ms returned sat
[2025-05-31 07:00:19] [INFO ] Computed and/alt/rep : 1839/5613/1839 causal constraints (skipped 564 transitions) in 346 ms.
[2025-05-31 07:00:33] [INFO ] Added : 271 causal constraints over 55 iterations in 15075 ms. Result :sat
Minimization took 4504 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[51, 51, 51, 51, 51, 51, 51, 17] Max Struct:[51, 51, 51, 51, 51, 51, 51, +inf]
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-07 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-05 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-04 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-03 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-02 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-01 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-00 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[17] Max Struct:[+inf]
Support contains 1 out of 1550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1550/1550 places, 2709/2709 transitions.
Graph (complete) has 4951 edges and 1550 vertex of which 566 are kept as prefixes of interest. Removing 984 places using SCC suffix rule.1 ms
Discarding 984 places :
Also discarding 1686 output transitions
Drop transitions (Output transitions of discarded places.) removed 1686 transitions
Drop transitions (Empty/Sink Transition effects.) removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 309 rules applied. Total rules applied 310 place count 566 transition count 714
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 364 place count 512 transition count 714
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 364 place count 512 transition count 663
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 466 place count 461 transition count 663
Discarding 254 places :
Symmetric choice reduction at 2 with 254 rule applications. Total rules 720 place count 207 transition count 409
Iterating global reduction 2 with 254 rules applied. Total rules applied 974 place count 207 transition count 409
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Iterating post reduction 2 with 204 rules applied. Total rules applied 1178 place count 207 transition count 205
Partial Free-agglomeration rule applied 51 times.
Drop transitions (Partial Free agglomeration) removed 51 transitions
Iterating global reduction 3 with 51 rules applied. Total rules applied 1229 place count 207 transition count 205
Applied a total of 1229 rules in 55 ms. Remains 207 /1550 variables (removed 1343) and now considering 205/2709 (removed 2504) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 207/1550 places, 205/2709 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 205 rows 207 cols
[2025-05-31 07:00:38] [INFO ] Computed 52 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[17] Max Struct:[51]
RANDOM walk for 1000000 steps (9613 resets) in 6896 ms. (144 steps per ms)
BEST_FIRST walk for 1000001 steps (211 resets) in 2178 ms. (458 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[38] Max Struct:[51]
[2025-05-31 07:00:47] [INFO ] Invariant cache hit.
[2025-05-31 07:00:47] [INFO ] [Real]Absence check using 2 positive place invariants in 31 ms returned sat
[2025-05-31 07:00:47] [INFO ] [Real]Absence check using 2 positive and 50 generalized place invariants in 30 ms returned sat
[2025-05-31 07:00:48] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2025-05-31 07:00:48] [INFO ] Computed and/alt/rep : 51/153/51 causal constraints (skipped 52 transitions) in 34 ms.
[2025-05-31 07:00:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 07:00:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-05-31 07:00:48] [INFO ] [Nat]Absence check using 2 positive and 50 generalized place invariants in 13 ms returned sat
[2025-05-31 07:00:48] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2025-05-31 07:00:48] [INFO ] Computed and/alt/rep : 51/153/51 causal constraints (skipped 52 transitions) in 32 ms.
[2025-05-31 07:00:48] [INFO ] Added : 51 causal constraints over 11 iterations in 414 ms. Result :sat
Minimization took 176 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[38] Max Struct:[51]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[51] Max Struct:[51]
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 205/205 transitions.
Applied a total of 0 rules in 6 ms. Remains 207 /207 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 207/207 places, 205/205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 205/205 transitions.
Applied a total of 0 rules in 5 ms. Remains 207 /207 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2025-05-31 07:00:49] [INFO ] Invariant cache hit.
[2025-05-31 07:00:49] [INFO ] Implicit Places using invariants in 592 ms returned [51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101]
Discarding 51 places :
Implicit Place search using SMT only with invariants took 594 ms to find 51 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 156/207 places, 205/205 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 156 transition count 154
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 105 transition count 154
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 153 place count 54 transition count 103
Iterating global reduction 2 with 51 rules applied. Total rules applied 204 place count 54 transition count 103
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 254 place count 4 transition count 3
Iterating global reduction 2 with 50 rules applied. Total rules applied 304 place count 4 transition count 3
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 305 place count 4 transition count 3
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 306 place count 3 transition count 3
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 307 place count 3 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 308 place count 2 transition count 2
Applied a total of 308 rules in 5 ms. Remains 2 /156 variables (removed 154) and now considering 2/205 (removed 203) transitions.
// Phase 1: matrix 2 rows 2 cols
[2025-05-31 07:00:49] [INFO ] Computed 0 invariants in 1 ms
[2025-05-31 07:00:49] [INFO ] Implicit Places using invariants in 15 ms returned []
[2025-05-31 07:00:49] [INFO ] Invariant cache hit.
[2025-05-31 07:00:49] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2/207 places, 2/205 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 641 ms. Remains : 2/207 places, 2/205 transitions.
[2025-05-31 07:00:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[51] Max Struct:[51]
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-13 51 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000012 steps (24707 resets) in 154 ms. (6451 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 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 )
[2025-05-31 07:00:50] [INFO ] Flatten gal took : 214 ms
[2025-05-31 07:00:50] [INFO ] Flatten gal took : 2 ms
[2025-05-31 07:00:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7843607090653653309.gal : 4 ms
[2025-05-31 07:00:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10256727297066908994.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7843607090653653309.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10256727297066908994.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 156173 ms.

BK_STOP 1748674850457

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-L00050M0005C002P002G001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is FamilyReunion-PT-L00050M0005C002P002G001, 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 r097-smll-174860111800027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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