MCC'2025- Execution of r097-smll-174860111800028

About the Execution of 2024-gold for FamilyReunion-PT-L00100M0010C005P005G002

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15685.350	354489.00	423217.00	1487.80	101 3 101 101 101 101 101 101 101 1 1 1 1 1 1 101	normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 36M
-rw-r--r-- 1 mcc users 345K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.1M May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.3M May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.3M 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 166K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 723K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 451K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 400K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.3M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.4M May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.7M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 28K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 84K 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 17M 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-L00100M0010C005P005G002-UpperBounds-00
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-01
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-02
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-03
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-04
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-05
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-06
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-07
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-08
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-09
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-10
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-11
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-12
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-13
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-14
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748674796785

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-L00100M0010C005P005G002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 06:59:59] [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:59:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 07:00:01] [INFO ] Load time of PNML (sax parser for PT used): 1798 ms
[2025-05-31 07:00:01] [INFO ] Transformed 40605 places.
[2025-05-31 07:00:01] [INFO ] Transformed 36871 transitions.
[2025-05-31 07:00:01] [INFO ] Parsed PT model containing 40605 places and 36871 transitions and 112728 arcs in 2333 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 72 ms.
Reduce places removed 31 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 36871 rows 40574 cols
[2025-05-31 07:00:14] [INFO ] Computed 8805 invariants in 11780 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:[+inf, 527, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 1, 2, 13, 1, 1, 1, +inf]
RANDOM walk for 10000 steps (2 resets) in 1050 ms. (9 steps per ms)
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 150015 steps (30 resets) in 1010 ms. (148 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[18, 0, 0, 99, 39, 3, 27, 45, 18, 0, 0, 1, 0, 0, 1] Max Struct:[+inf, 527, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 1, 2, 13, 1, 1, +inf]
[2025-05-31 07:00:17] [INFO ] Invariant cache hit.
[2025-05-31 07:00:22] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:826)
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 07:00:27] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:826)
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 07:00:32] [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 2
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:826)
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 07:00:37] [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 3
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:826)
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 07:00:42] [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: Stream closed... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:826)
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 07:00:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
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:826)
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 07:00:52] [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:826)
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 07:00:57] [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 7
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:826)
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 07:01:02] [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: Stream closed... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:826)
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 07:01:07] [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 9
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:826)
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 07:01:12] [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:826)
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 07:01:17] [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 11
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:826)
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 07:01:22] [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 12
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:826)
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 07:01:27] [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 13
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:826)
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 07:01:32] [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 14
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:826)
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)
Current structural bounds on expressions (after SMT) : Max Seen:[18, 0, 0, 99, 39, 3, 27, 45, 18, 0, 0, 1, 0, 0, 1] Max Struct:[+inf, 527, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 1, 2, 13, 1, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[18, 0, 0, 99, 39, 3, 27, 45, 18, 0, 0, 1, 0, 0, 1] Max Struct:[+inf, 527, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 1, 2, 13, 1, 1, +inf]
Support contains 2647 out of 40574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40574/40574 places, 36871/36871 transitions.
Graph (complete) has 65258 edges and 40574 vertex of which 39638 are kept as prefixes of interest. Removing 936 places using SCC suffix rule.90 ms
Discarding 936 places :
Also discarding 509 output transitions
Drop transitions (Output transitions of discarded places.) removed 509 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 300 transitions
Reduce isomorphic transitions removed 301 transitions.
Discarding 5555 places :
Implicit places reduction removed 5555 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9482 transitions
Trivial Post-agglo rules discarded 9482 transitions
Performed 9482 trivial Post agglomeration. Transition count delta: 9482
Iterating post reduction 0 with 15338 rules applied. Total rules applied 15339 place count 34083 transition count 26579
Reduce places removed 9482 places and 0 transitions.
Performed 3438 Post agglomeration using F-continuation condition.Transition count delta: 3438
Iterating post reduction 1 with 12920 rules applied. Total rules applied 28259 place count 24601 transition count 23141
Reduce places removed 3438 places and 0 transitions.
Iterating post reduction 2 with 3438 rules applied. Total rules applied 31697 place count 21163 transition count 23141
Performed 2928 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2928 Pre rules applied. Total rules applied 31697 place count 21163 transition count 20213
Deduced a syphon composed of 2928 places in 20 ms
Ensure Unique test removed 1919 places
Reduce places removed 4847 places and 0 transitions.
Iterating global reduction 3 with 7775 rules applied. Total rules applied 39472 place count 16316 transition count 20213
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 3 with 707 rules applied. Total rules applied 40179 place count 16215 transition count 19607
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 4 with 606 rules applied. Total rules applied 40785 place count 15609 transition count 19607
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 101 Pre rules applied. Total rules applied 40785 place count 15609 transition count 19506
Deduced a syphon composed of 101 places in 45 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 40987 place count 15508 transition count 19506
Performed 607 Post agglomeration using F-continuation condition.Transition count delta: 607
Deduced a syphon composed of 607 places in 14 ms
Reduce places removed 607 places and 0 transitions.
Iterating global reduction 5 with 1214 rules applied. Total rules applied 42201 place count 14901 transition count 18899
Free-agglomeration rule applied 600 times.
Iterating global reduction 5 with 600 rules applied. Total rules applied 42801 place count 14901 transition count 18299
Reduce places removed 600 places and 0 transitions.
Ensure Unique test removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Iterating post reduction 5 with 1000 rules applied. Total rules applied 43801 place count 14301 transition count 17899
Free-agglomeration rule (complex) applied 3941 times.
Iterating global reduction 6 with 3941 rules applied. Total rules applied 47742 place count 14301 transition count 15448
Ensure Unique test removed 201 places
Reduce places removed 4142 places and 0 transitions.
Iterating post reduction 6 with 4142 rules applied. Total rules applied 51884 place count 10159 transition count 15448
Discarding 3344 places :
Symmetric choice reduction at 7 with 3344 rule applications. Total rules 55228 place count 6815 transition count 10512
Ensure Unique test removed 101 places
Iterating global reduction 7 with 3445 rules applied. Total rules applied 58673 place count 6714 transition count 10512
Ensure Unique test removed 1312 transitions
Reduce isomorphic transitions removed 1312 transitions.
Iterating post reduction 7 with 1312 rules applied. Total rules applied 59985 place count 6714 transition count 9200
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 101 Pre rules applied. Total rules applied 59985 place count 6714 transition count 9099
Deduced a syphon composed of 101 places in 8 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 8 with 202 rules applied. Total rules applied 60187 place count 6613 transition count 9099
Applied a total of 60187 rules in 13584 ms. Remains 6613 /40574 variables (removed 33961) and now considering 9099/36871 (removed 27772) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13606 ms. Remains : 6613/40574 places, 9099/36871 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 9099 rows 6613 cols
[2025-05-31 07:02:17] [INFO ] Computed 616 invariants in 320 ms
Current structural bounds on expressions (after invariants) : Max Seen:[18, 0, 0, 99, 39, 3, 27, 45, 18, 0, 0, 1, 0, 0, 1] Max Struct:[10201, 103, 10302, 1016587, 10201, 10201, 112211, 112211, +inf, 1, 2, 13, 1, 1, 30603]
RANDOM walk for 352154 steps (227 resets) in 30001 ms. (11 steps per ms)
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 9104433 steps (44 resets) in 53887 ms. (168 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[101, 3, 101, 101, 101, 101, 101, 101, 101, 1, 1, 41] Max Struct:[10201, 103, 10302, 1016587, 10201, 10201, 112211, 112211, +inf, 2, 13, 30603]
[2025-05-31 07:03:41] [INFO ] Invariant cache hit.
[2025-05-31 07:03:43] [INFO ] [Real]Absence check using 4 positive place invariants in 229 ms returned unsat
[2025-05-31 07:03:44] [INFO ] [Real]Absence check using 4 positive place invariants in 217 ms returned sat
[2025-05-31 07:03:44] [INFO ] [Real]Absence check using 4 positive and 612 generalized place invariants in 255 ms returned unsat
[2025-05-31 07:03:46] [INFO ] [Real]Absence check using 4 positive place invariants in 213 ms returned sat
[2025-05-31 07:03:46] [INFO ] [Real]Absence check using 4 positive and 612 generalized place invariants in 327 ms returned unsat
[2025-05-31 07:03:47] [INFO ] [Real]Absence check using 4 positive place invariants in 214 ms returned sat
[2025-05-31 07:03:47] [INFO ] [Real]Absence check using 4 positive and 612 generalized place invariants in 107 ms returned unsat
[2025-05-31 07:03:49] [INFO ] [Real]Absence check using 4 positive place invariants in 242 ms returned unsat
[2025-05-31 07:03:50] [INFO ] [Real]Absence check using 4 positive place invariants in 214 ms returned unsat
[2025-05-31 07:03:52] [INFO ] [Real]Absence check using 4 positive place invariants in 243 ms returned unsat
[2025-05-31 07:03:53] [INFO ] [Real]Absence check using 4 positive place invariants in 215 ms returned unsat
[2025-05-31 07:03:54] [INFO ] [Real]Absence check using 4 positive place invariants in 209 ms returned sat
[2025-05-31 07:03:55] [INFO ] [Real]Absence check using 4 positive and 612 generalized place invariants in 326 ms returned sat
[2025-05-31 07:04:15] [INFO ] [Real]Absence check using state equation in 20283 ms returned unsat
[2025-05-31 07:04:16] [INFO ] [Real]Absence check using 4 positive place invariants in 222 ms returned sat
[2025-05-31 07:04:17] [INFO ] [Real]Absence check using 4 positive and 612 generalized place invariants in 316 ms returned sat
[2025-05-31 07:04:28] [INFO ] [Real]Absence check using state equation in 10908 ms returned unsat
[2025-05-31 07:04:29] [INFO ] [Real]Absence check using 4 positive place invariants in 202 ms returned sat
[2025-05-31 07:04:29] [INFO ] [Real]Absence check using 4 positive and 612 generalized place invariants in 312 ms returned sat
[2025-05-31 07:04:38] [INFO ] [Real]Absence check using state equation in 9101 ms returned unsat
[2025-05-31 07:04:40] [INFO ] [Real]Absence check using 4 positive place invariants in 202 ms returned sat
[2025-05-31 07:04:40] [INFO ] [Real]Absence check using 4 positive and 612 generalized place invariants in 298 ms returned sat
[2025-05-31 07:04:53] [INFO ] [Real]Absence check using state equation in 12646 ms returned sat
[2025-05-31 07:04:55] [INFO ] Computed and/alt/rep : 6777/8918/6777 causal constraints (skipped 2221 transitions) in 1192 ms.
[2025-05-31 07:05:15] [INFO ] Added : 85 causal constraints over 17 iterations in 20784 ms.(timeout) Result :sat
Minimization took 7913 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[101, 3, 101, 101, 101, 101, 101, 101, 101, 1, 1, 41] Max Struct:[101, 3, 101, 101, 101, 101, 101, 101, 101, 1, 1, 30603]
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-08 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-07 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-06 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-05 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-04 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-03 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-02 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-00 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[41] Max Struct:[30603]
Support contains 1 out of 6613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6613/6613 places, 9099/9099 transitions.
Graph (complete) has 15384 edges and 6613 vertex of which 6078 are kept as prefixes of interest. Removing 535 places using SCC suffix rule.6 ms
Discarding 535 places :
Also discarding 518 output transitions
Drop transitions (Output transitions of discarded places.) removed 518 transitions
Drop transitions (Empty/Sink Transition effects.) removed 598 transitions
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 699 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3335 transitions
Trivial Post-agglo rules discarded 3335 transitions
Performed 3335 trivial Post agglomeration. Transition count delta: 3335
Iterating post reduction 0 with 4034 rules applied. Total rules applied 4035 place count 6078 transition count 4547
Reduce places removed 3335 places and 0 transitions.
Iterating post reduction 1 with 3335 rules applied. Total rules applied 7370 place count 2743 transition count 4547
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 7370 place count 2743 transition count 4445
Deduced a syphon composed of 102 places in 3 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 7574 place count 2641 transition count 4445
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 7584 place count 2631 transition count 3435
Iterating global reduction 2 with 10 rules applied. Total rules applied 7594 place count 2631 transition count 3435
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 2 with 202 rules applied. Total rules applied 7796 place count 2530 transition count 3334
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 3 with 101 rules applied. Total rules applied 7897 place count 2429 transition count 3334
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 101 Pre rules applied. Total rules applied 7897 place count 2429 transition count 3233
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8099 place count 2328 transition count 3233
Discarding 1010 places :
Symmetric choice reduction at 4 with 1010 rule applications. Total rules 9109 place count 1318 transition count 2223
Iterating global reduction 4 with 1010 rules applied. Total rules applied 10119 place count 1318 transition count 2223
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 4 with 1313 rules applied. Total rules applied 11432 place count 1217 transition count 1011
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 5 with 202 rules applied. Total rules applied 11634 place count 1015 transition count 1011
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 6 with 208 rules applied. Total rules applied 11842 place count 910 transition count 908
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 11844 place count 910 transition count 906
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 11845 place count 909 transition count 906
Free-agglomeration rule applied 100 times.
Iterating global reduction 8 with 100 rules applied. Total rules applied 11945 place count 909 transition count 806
Ensure Unique test removed 100 places
Reduce places removed 200 places and 0 transitions.
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 8 with 400 rules applied. Total rules applied 12345 place count 709 transition count 606
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 9 with 100 rules applied. Total rules applied 12445 place count 609 transition count 606
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 10 with 101 rules applied. Total rules applied 12546 place count 508 transition count 505
Applied a total of 12546 rules in 1133 ms. Remains 508 /6613 variables (removed 6105) and now considering 505/9099 (removed 8594) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1133 ms. Remains : 508/6613 places, 505/9099 transitions.
// Phase 1: matrix 505 rows 508 cols
[2025-05-31 07:05:25] [INFO ] Computed 103 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[41] Max Struct:[30603]
RANDOM walk for 1000000 steps (3288 resets) in 19599 ms. (51 steps per ms)
BEST_FIRST walk for 1000001 steps (29 resets) in 2987 ms. (334 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[61] Max Struct:[30603]
[2025-05-31 07:05:47] [INFO ] Invariant cache hit.
[2025-05-31 07:05:47] [INFO ] [Real]Absence check using 0 positive and 103 generalized place invariants in 38 ms returned sat
[2025-05-31 07:05:48] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2025-05-31 07:05:48] [INFO ] Computed and/alt/rep : 101/101/101 causal constraints (skipped 303 transitions) in 84 ms.
[2025-05-31 07:05:48] [INFO ] Added : 62 causal constraints over 13 iterations in 600 ms. Result :sat
Minimization took 204 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[61] Max Struct:[30603]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[101] Max Struct:[30603]
Support contains 1 out of 508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 508/508 places, 505/505 transitions.
Applied a total of 0 rules in 15 ms. Remains 508 /508 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 508/508 places, 505/505 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 508/508 places, 505/505 transitions.
Applied a total of 0 rules in 15 ms. Remains 508 /508 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2025-05-31 07:05:49] [INFO ] Invariant cache hit.
[2025-05-31 07:05:50] [INFO ] Implicit Places using invariants in 603 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 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, 405, 406]
Discarding 103 places :
Implicit Place search using SMT only with invariants took 607 ms to find 103 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 405/508 places, 505/505 transitions.
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 101 Pre rules applied. Total rules applied 0 place count 405 transition count 404
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 0 with 202 rules applied. Total rules applied 202 place count 304 transition count 404
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 302 place count 204 transition count 304
Iterating global reduction 0 with 100 rules applied. Total rules applied 402 place count 204 transition count 304
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 502 place count 104 transition count 204
Iterating global reduction 0 with 100 rules applied. Total rules applied 602 place count 104 transition count 204
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 702 place count 4 transition count 4
Iterating global reduction 0 with 100 rules applied. Total rules applied 802 place count 4 transition count 4
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 803 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 804 place count 3 transition count 3
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 805 place count 3 transition count 3
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 806 place count 2 transition count 3
Applied a total of 806 rules in 20 ms. Remains 2 /405 variables (removed 403) and now considering 3/505 (removed 502) transitions.
// Phase 1: matrix 3 rows 2 cols
[2025-05-31 07:05:50] [INFO ] Computed 0 invariants in 0 ms
[2025-05-31 07:05:50] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-05-31 07:05:50] [INFO ] Invariant cache hit.
[2025-05-31 07:05:50] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2/508 places, 3/505 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 688 ms. Remains : 2/508 places, 3/505 transitions.
[2025-05-31 07:05:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[101] Max Struct:[30603]
RANDOM walk for 1000008 steps (4878 resets) in 125 ms. (7936 steps per ms)
BEST_FIRST walk for 1000001 steps (1984 resets) in 187 ms. (5319 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[101] Max Struct:[30603]
[2025-05-31 07:05:50] [INFO ] Invariant cache hit.
[2025-05-31 07:05:50] [INFO ] [Real]Absence check using state equation in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[101] Max Struct:[101]
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-UpperBounds-15 101 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 )
[2025-05-31 07:05:51] [INFO ] Flatten gal took : 28 ms
[2025-05-31 07:05:51] [INFO ] Flatten gal took : 3 ms
[2025-05-31 07:05:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7309002530112826450.gal : 6 ms
[2025-05-31 07:05:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15373055270979292067.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/ReachabilityCardinality7309002530112826450.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15373055270979292067.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 351599 ms.

BK_STOP 1748675151274

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

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