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.r237-smll-174903502600013.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 StigmergyCommit-PT-08a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r237-smll-174903502600013
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 17M May 29 14:33 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 StigmergyCommit-PT-08a-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749106642990

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-05 06:57:24] [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-06-05 06:57:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:57:26] [INFO ] Load time of PNML (sax parser for PT used): 1638 ms
[2025-06-05 06:57:26] [INFO ] Transformed 328 places.
[2025-06-05 06:57:27] [INFO ] Transformed 18744 transitions.
[2025-06-05 06:57:27] [INFO ] Found NUPN structural information;
[2025-06-05 06:57:27] [INFO ] Parsed PT model containing 328 places and 18744 transitions and 330279 arcs in 2176 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Ensure Unique test removed 17295 transitions
Reduce redundant transitions removed 17295 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-05 06:57:27] [INFO ] Flow matrix only has 1422 transitions (discarded 27 similar events)
// Phase 1: matrix 1422 rows 328 cols
[2025-06-05 06:57:27] [INFO ] Computed 10 invariants in 76 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 694 ms. (14 steps per ms)
FORMULA StigmergyCommit-PT-08a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90008 steps (18 resets) in 127 ms. (703 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-05 06:57:28] [INFO ] Flow matrix only has 1422 transitions (discarded 27 similar events)
[2025-06-05 06:57:28] [INFO ] Invariant cache hit.
[2025-06-05 06:57:28] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2025-06-05 06:57:29] [INFO ] [Real]Absence check using state equation in 751 ms returned sat
[2025-06-05 06:57:29] [INFO ] State equation strengthened by 1147 read => feed constraints.
[2025-06-05 06:57:30] [INFO ] [Real]Added 1147 Read/Feed constraints in 446 ms returned sat
[2025-06-05 06:57:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:57:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-06-05 06:57:31] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2025-06-05 06:57:31] [INFO ] [Nat]Added 1147 Read/Feed constraints in 403 ms returned sat
[2025-06-05 06:57:32] [INFO ] Deduced a trap composed of 16 places in 1010 ms of which 60 ms to minimize.
[2025-06-05 06:57:33] [INFO ] Deduced a trap composed of 18 places in 908 ms of which 7 ms to minimize.
[2025-06-05 06:57:34] [INFO ] Deduced a trap composed of 17 places in 844 ms of which 6 ms to minimize.
[2025-06-05 06:57:35] [INFO ] Deduced a trap composed of 18 places in 740 ms of which 6 ms to minimize.
[2025-06-05 06:57:35] [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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
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-06-05 06:57:35] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2025-06-05 06:57:36] [INFO ] [Real]Absence check using state equation in 667 ms returned sat
[2025-06-05 06:57:36] [INFO ] [Real]Added 1147 Read/Feed constraints in 349 ms returned sat
[2025-06-05 06:57:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:57:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2025-06-05 06:57:37] [INFO ] [Nat]Absence check using state equation in 600 ms returned sat
[2025-06-05 06:57:37] [INFO ] [Nat]Added 1147 Read/Feed constraints in 392 ms returned sat
[2025-06-05 06:57:38] [INFO ] Deduced a trap composed of 17 places in 951 ms of which 6 ms to minimize.
[2025-06-05 06:57:39] [INFO ] Deduced a trap composed of 16 places in 805 ms of which 6 ms to minimize.
[2025-06-05 06:57:40] [INFO ] Deduced a trap composed of 17 places in 746 ms of which 4 ms to minimize.
[2025-06-05 06:57:41] [INFO ] Deduced a trap composed of 17 places in 663 ms of which 4 ms to minimize.
[2025-06-05 06:57:42] [INFO ] Deduced a trap composed of 16 places in 664 ms of which 4 ms to minimize.
[2025-06-05 06:57:42] [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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
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-06-05 06:57:42] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-05 06:57:43] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2025-06-05 06:57:43] [INFO ] [Real]Added 1147 Read/Feed constraints in 262 ms returned sat
[2025-06-05 06:57:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:57:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-06-05 06:57:43] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2025-06-05 06:57:44] [INFO ] [Nat]Added 1147 Read/Feed constraints in 454 ms returned sat
[2025-06-05 06:57:45] [INFO ] Deduced a trap composed of 18 places in 981 ms of which 5 ms to minimize.
[2025-06-05 06:57:46] [INFO ] Deduced a trap composed of 19 places in 797 ms of which 5 ms to minimize.
[2025-06-05 06:57:47] [INFO ] Deduced a trap composed of 16 places in 781 ms of which 4 ms to minimize.
[2025-06-05 06:57:48] [INFO ] Deduced a trap composed of 16 places in 783 ms of which 5 ms to minimize.
[2025-06-05 06:57:48] [INFO ] Deduced a trap composed of 18 places in 685 ms of which 5 ms to minimize.
[2025-06-05 06:57:48] [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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
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-06-05 06:57:48] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-05 06:57:49] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2025-06-05 06:57:50] [INFO ] [Real]Added 1147 Read/Feed constraints in 464 ms returned sat
[2025-06-05 06:57:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:57:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2025-06-05 06:57:50] [INFO ] [Nat]Absence check using state equation in 572 ms returned sat
[2025-06-05 06:57:51] [INFO ] [Nat]Added 1147 Read/Feed constraints in 375 ms returned sat
[2025-06-05 06:57:52] [INFO ] Deduced a trap composed of 18 places in 946 ms of which 5 ms to minimize.
[2025-06-05 06:57:53] [INFO ] Deduced a trap composed of 19 places in 941 ms of which 5 ms to minimize.
[2025-06-05 06:57:54] [INFO ] Deduced a trap composed of 19 places in 763 ms of which 5 ms to minimize.
[2025-06-05 06:57:55] [INFO ] Deduced a trap composed of 17 places in 783 ms of which 5 ms to minimize.
[2025-06-05 06:57:55] [INFO ] Deduced a trap composed of 17 places in 610 ms of which 4 ms to minimize.
[2025-06-05 06:57: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: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
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-06-05 06:57:55] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-06-05 06:57:56] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2025-06-05 06:57:56] [INFO ] [Real]Added 1147 Read/Feed constraints in 216 ms returned sat
[2025-06-05 06:57:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:57:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-06-05 06:57:57] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2025-06-05 06:57:57] [INFO ] [Nat]Added 1147 Read/Feed constraints in 249 ms returned sat
[2025-06-05 06:57:58] [INFO ] Deduced a trap composed of 18 places in 764 ms of which 5 ms to minimize.
[2025-06-05 06:57:59] [INFO ] Deduced a trap composed of 17 places in 767 ms of which 5 ms to minimize.
[2025-06-05 06:58:00] [INFO ] Deduced a trap composed of 17 places in 730 ms of which 5 ms to minimize.
[2025-06-05 06:58:01] [INFO ] Deduced a trap composed of 16 places in 751 ms of which 5 ms to minimize.
[2025-06-05 06:58:01] [INFO ] Deduced a trap composed of 17 places in 631 ms of which 4 ms to minimize.
[2025-06-05 06:58:02] [INFO ] Deduced a trap composed of 2 places in 995 ms of which 5 ms to minimize.
[2025-06-05 06:58:02] [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 4
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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
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-06-05 06:58:02] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-05 06:58:03] [INFO ] [Real]Absence check using state equation in 611 ms returned sat
[2025-06-05 06:58:04] [INFO ] [Real]Added 1147 Read/Feed constraints in 394 ms returned sat
[2025-06-05 06:58:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:58:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2025-06-05 06:58:04] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2025-06-05 06:58:05] [INFO ] [Nat]Added 1147 Read/Feed constraints in 442 ms returned sat
[2025-06-05 06:58:06] [INFO ] Deduced a trap composed of 16 places in 948 ms of which 5 ms to minimize.
[2025-06-05 06:58:07] [INFO ] Deduced a trap composed of 19 places in 773 ms of which 4 ms to minimize.
[2025-06-05 06:58:07] [INFO ] Deduced a trap composed of 16 places in 672 ms of which 4 ms to minimize.
[2025-06-05 06:58:08] [INFO ] Deduced a trap composed of 16 places in 560 ms of which 5 ms to minimize.
[2025-06-05 06:58:09] [INFO ] Deduced a trap composed of 16 places in 501 ms of which 4 ms to minimize.
[2025-06-05 06:58:09] [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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
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-06-05 06:58:09] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-05 06:58:09] [INFO ] [Real]Absence check using state equation in 569 ms returned sat
[2025-06-05 06:58:10] [INFO ] [Real]Added 1147 Read/Feed constraints in 436 ms returned sat
[2025-06-05 06:58:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:58:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2025-06-05 06:58:11] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2025-06-05 06:58:11] [INFO ] [Nat]Added 1147 Read/Feed constraints in 383 ms returned sat
[2025-06-05 06:58:12] [INFO ] Deduced a trap composed of 16 places in 656 ms of which 6 ms to minimize.
[2025-06-05 06:58:13] [INFO ] Deduced a trap composed of 18 places in 829 ms of which 5 ms to minimize.
[2025-06-05 06:58:14] [INFO ] Deduced a trap composed of 16 places in 710 ms of which 4 ms to minimize.
[2025-06-05 06:58:14] [INFO ] Deduced a trap composed of 17 places in 586 ms of which 4 ms to minimize.
[2025-06-05 06:58:15] [INFO ] Deduced a trap composed of 17 places in 455 ms of which 6 ms to minimize.
[2025-06-05 06:58:15] [INFO ] Deduced a trap composed of 16 places in 442 ms of which 4 ms to minimize.
[2025-06-05 06:58:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
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-06-05 06:58:15] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-05 06:58:16] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2025-06-05 06:58:16] [INFO ] [Real]Added 1147 Read/Feed constraints in 391 ms returned sat
[2025-06-05 06:58:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:58:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-05 06:58:17] [INFO ] [Nat]Absence check using state equation in 544 ms returned sat
[2025-06-05 06:58:18] [INFO ] [Nat]Added 1147 Read/Feed constraints in 398 ms returned sat
[2025-06-05 06:58:18] [INFO ] Deduced a trap composed of 17 places in 630 ms of which 5 ms to minimize.
[2025-06-05 06:58:19] [INFO ] Deduced a trap composed of 17 places in 949 ms of which 5 ms to minimize.
[2025-06-05 06:58:20] [INFO ] Deduced a trap composed of 16 places in 828 ms of which 5 ms to minimize.
[2025-06-05 06:58:21] [INFO ] Deduced a trap composed of 18 places in 611 ms of which 6 ms to minimize.
[2025-06-05 06:58:22] [INFO ] Deduced a trap composed of 17 places in 593 ms of which 5 ms to minimize.
[2025-06-05 06:58: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 7
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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
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-06-05 06:58:22] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-06-05 06:58:22] [INFO ] [Real]Absence check using state equation in 542 ms returned sat
[2025-06-05 06:58:23] [INFO ] [Real]Added 1147 Read/Feed constraints in 483 ms returned sat
[2025-06-05 06:58:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:58:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-05 06:58:24] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2025-06-05 06:58:24] [INFO ] [Nat]Added 1147 Read/Feed constraints in 504 ms returned sat
[2025-06-05 06:58:25] [INFO ] Deduced a trap composed of 17 places in 790 ms of which 5 ms to minimize.
[2025-06-05 06:58:26] [INFO ] Deduced a trap composed of 17 places in 811 ms of which 5 ms to minimize.
[2025-06-05 06:58:27] [INFO ] Deduced a trap composed of 17 places in 883 ms of which 5 ms to minimize.
[2025-06-05 06:58:28] [INFO ] Deduced a trap composed of 17 places in 735 ms of which 5 ms to minimize.
[2025-06-05 06:58:28] [INFO ] Deduced a trap composed of 17 places in 613 ms of which 4 ms to minimize.
[2025-06-05 06:58:28] [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 8
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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
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:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 1449/1449 transitions.
Graph (complete) has 759 edges and 328 vertex of which 319 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.25 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 319 transition count 1357
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 100 rules applied. Total rules applied 184 place count 264 transition count 1312
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 193 place count 255 transition count 1312
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 193 place count 255 transition count 1251
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 315 place count 194 transition count 1251
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 358 place count 151 transition count 1208
Iterating global reduction 3 with 43 rules applied. Total rules applied 401 place count 151 transition count 1208
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 442 place count 110 transition count 1167
Iterating global reduction 3 with 41 rules applied. Total rules applied 483 place count 110 transition count 1167
Ensure Unique test removed 517 transitions
Reduce isomorphic transitions removed 517 transitions.
Iterating post reduction 3 with 517 rules applied. Total rules applied 1000 place count 110 transition count 650
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1007 place count 103 transition count 643
Iterating global reduction 4 with 7 rules applied. Total rules applied 1014 place count 103 transition count 643
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1019 place count 98 transition count 638
Iterating global reduction 4 with 5 rules applied. Total rules applied 1024 place count 98 transition count 638
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1028 place count 98 transition count 634
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 1058 place count 83 transition count 619
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1070 place count 83 transition count 607
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1078 place count 75 transition count 599
Iterating global reduction 6 with 8 rules applied. Total rules applied 1086 place count 75 transition count 599
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1094 place count 67 transition count 591
Iterating global reduction 6 with 8 rules applied. Total rules applied 1102 place count 67 transition count 591
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1110 place count 59 transition count 583
Iterating global reduction 6 with 8 rules applied. Total rules applied 1118 place count 59 transition count 583
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 1121 place count 59 transition count 580
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1122 place count 59 transition count 579
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1123 place count 58 transition count 579
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 1129 place count 58 transition count 579
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1132 place count 58 transition count 576
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1133 place count 57 transition count 575
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 7 with 8 rules applied. Total rules applied 1141 place count 56 transition count 568
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1148 place count 49 transition count 568
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 1148 place count 49 transition count 565
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 1154 place count 46 transition count 565
Performed 12 Post agglomeration using F-continuation condition with reduction of 500 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 1178 place count 34 transition count 53
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 1189 place count 34 transition count 42
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 10 with 15 rules applied. Total rules applied 1204 place count 25 transition count 36
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1210 place count 25 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 1213 place count 25 transition count 27
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 11 with 3 rules applied. Total rules applied 1216 place count 22 transition count 24
Applied a total of 1216 rules in 851 ms. Remains 22 /328 variables (removed 306) and now considering 24/1449 (removed 1425) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 867 ms. Remains : 22/328 places, 24/1449 transitions.
// Phase 1: matrix 24 rows 22 cols
[2025-06-05 06:58:29] [INFO ] Computed 6 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 917 ms. (1089 steps per ms)
FORMULA StigmergyCommit-PT-08a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 453 ms. (2202 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-06-05 06:58:31] [INFO ] Flatten gal took : 33 ms
[2025-06-05 06:58:31] [INFO ] Flatten gal took : 7 ms
[2025-06-05 06:58:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3274838317865967942.gal : 7 ms
[2025-06-05 06:58:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1803546219520441075.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3274838317865967942.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1803546219520441075.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 66580 ms.

BK_STOP 1749106711449

--------------------
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="StigmergyCommit-PT-08a"
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 StigmergyCommit-PT-08a, 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 r237-smll-174903502600013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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