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.r209-tall-174894546800113.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 ShieldPPPt-PT-030B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r209-tall-174894546800113
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 952K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 4.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 33K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K 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 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 569K 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 ShieldPPPt-PT-030B-UpperBounds-00
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-01
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-02
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-03
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-04
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-05
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-06
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-07
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-08
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-09
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-10
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-11
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-12
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-13
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-14
FORMULA_NAME ShieldPPPt-PT-030B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749020655249

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-04 07:04:16] [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-04 07:04:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 07:04:16] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2025-06-04 07:04:16] [INFO ] Transformed 2343 places.
[2025-06-04 07:04:16] [INFO ] Transformed 2133 transitions.
[2025-06-04 07:04:16] [INFO ] Found NUPN structural information;
[2025-06-04 07:04:16] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 377 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 2133 rows 2343 cols
[2025-06-04 07:04:17] [INFO ] Computed 331 invariants in 46 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 91 ms. (108 steps per ms)
FORMULA ShieldPPPt-PT-030B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70007 steps (14 resets) in 100 ms. (693 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-06-04 07:04:17] [INFO ] Invariant cache hit.
[2025-06-04 07:04:17] [INFO ] [Real]Absence check using 331 positive place invariants in 140 ms returned sat
[2025-06-04 07:04:18] [INFO ] [Real]Absence check using state equation in 780 ms returned sat
[2025-06-04 07:04:19] [INFO ] Deduced a trap composed of 23 places in 783 ms of which 87 ms to minimize.
[2025-06-04 07:04:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:04:20] [INFO ] [Nat]Absence check using 331 positive place invariants in 122 ms returned sat
[2025-06-04 07:04:20] [INFO ] [Nat]Absence check using state equation in 745 ms returned sat
[2025-06-04 07:04:21] [INFO ] Deduced a trap composed of 23 places in 585 ms of which 15 ms to minimize.
[2025-06-04 07:04:22] [INFO ] Deduced a trap composed of 30 places in 555 ms of which 11 ms to minimize.
[2025-06-04 07:04:22] [INFO ] Deduced a trap composed of 21 places in 580 ms of which 10 ms to minimize.
[2025-06-04 07:04:23] [INFO ] Deduced a trap composed of 34 places in 565 ms of which 10 ms to minimize.
[2025-06-04 07:04:24] [INFO ] Deduced a trap composed of 17 places in 542 ms of which 9 ms to minimize.
[2025-06-04 07:04:24] [INFO ] Deduced a trap composed of 20 places in 522 ms of which 9 ms to minimize.
[2025-06-04 07:04:25] [INFO ] Deduced a trap composed of 24 places in 1093 ms of which 16 ms to minimize.
[2025-06-04 07:04:25] [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-04 07:04:26] [INFO ] [Real]Absence check using 331 positive place invariants in 114 ms returned sat
[2025-06-04 07:04:27] [INFO ] [Real]Absence check using state equation in 771 ms returned sat
[2025-06-04 07:04:27] [INFO ] Deduced a trap composed of 21 places in 617 ms of which 10 ms to minimize.
[2025-06-04 07:04:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:04:28] [INFO ] [Nat]Absence check using 331 positive place invariants in 122 ms returned sat
[2025-06-04 07:04:29] [INFO ] [Nat]Absence check using state equation in 766 ms returned sat
[2025-06-04 07:04:29] [INFO ] Deduced a trap composed of 21 places in 630 ms of which 11 ms to minimize.
[2025-06-04 07:04:30] [INFO ] Deduced a trap composed of 23 places in 621 ms of which 11 ms to minimize.
[2025-06-04 07:04:31] [INFO ] Deduced a trap composed of 23 places in 611 ms of which 11 ms to minimize.
[2025-06-04 07:04:31] [INFO ] Deduced a trap composed of 25 places in 605 ms of which 10 ms to minimize.
[2025-06-04 07:04:32] [INFO ] Deduced a trap composed of 19 places in 596 ms of which 10 ms to minimize.
[2025-06-04 07:04:33] [INFO ] Deduced a trap composed of 20 places in 622 ms of which 10 ms to minimize.
[2025-06-04 07:04:33] [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-04 07:04:33] [INFO ] [Real]Absence check using 331 positive place invariants in 116 ms returned sat
[2025-06-04 07:04:34] [INFO ] [Real]Absence check using state equation in 750 ms returned sat
[2025-06-04 07:04:35] [INFO ] Deduced a trap composed of 21 places in 608 ms of which 10 ms to minimize.
[2025-06-04 07:04:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:04:35] [INFO ] [Nat]Absence check using 331 positive place invariants in 121 ms returned sat
[2025-06-04 07:04:36] [INFO ] [Nat]Absence check using state equation in 764 ms returned sat
[2025-06-04 07:04:37] [INFO ] Deduced a trap composed of 21 places in 614 ms of which 10 ms to minimize.
[2025-06-04 07:04:37] [INFO ] Deduced a trap composed of 26 places in 604 ms of which 10 ms to minimize.
[2025-06-04 07:04:38] [INFO ] Deduced a trap composed of 29 places in 594 ms of which 10 ms to minimize.
[2025-06-04 07:04:39] [INFO ] Deduced a trap composed of 23 places in 597 ms of which 10 ms to minimize.
[2025-06-04 07:04:39] [INFO ] Deduced a trap composed of 22 places in 573 ms of which 9 ms to minimize.
[2025-06-04 07:04:40] [INFO ] Deduced a trap composed of 18 places in 589 ms of which 10 ms to minimize.
[2025-06-04 07:04:40] [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-04 07:04:40] [INFO ] [Real]Absence check using 331 positive place invariants in 125 ms returned sat
[2025-06-04 07:04:41] [INFO ] [Real]Absence check using state equation in 772 ms returned sat
[2025-06-04 07:04:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:04:42] [INFO ] [Nat]Absence check using 331 positive place invariants in 120 ms returned sat
[2025-06-04 07:04:42] [INFO ] [Nat]Absence check using state equation in 788 ms returned sat
[2025-06-04 07:04:43] [INFO ] Deduced a trap composed of 40 places in 616 ms of which 9 ms to minimize.
[2025-06-04 07:04:44] [INFO ] Deduced a trap composed of 24 places in 617 ms of which 10 ms to minimize.
[2025-06-04 07:04:44] [INFO ] Deduced a trap composed of 46 places in 596 ms of which 10 ms to minimize.
[2025-06-04 07:04:45] [INFO ] Deduced a trap composed of 26 places in 557 ms of which 9 ms to minimize.
[2025-06-04 07:04:46] [INFO ] Deduced a trap composed of 19 places in 587 ms of which 10 ms to minimize.
[2025-06-04 07:04:46] [INFO ] Deduced a trap composed of 26 places in 561 ms of which 9 ms to minimize.
[2025-06-04 07:04:46] [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-04 07:04:47] [INFO ] [Real]Absence check using 331 positive place invariants in 120 ms returned sat
[2025-06-04 07:04:48] [INFO ] [Real]Absence check using state equation in 764 ms returned sat
[2025-06-04 07:04:48] [INFO ] Deduced a trap composed of 23 places in 636 ms of which 11 ms to minimize.
[2025-06-04 07:04:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:04:49] [INFO ] [Nat]Absence check using 331 positive place invariants in 132 ms returned sat
[2025-06-04 07:04:50] [INFO ] [Nat]Absence check using state equation in 791 ms returned sat
[2025-06-04 07:04:50] [INFO ] Deduced a trap composed of 23 places in 631 ms of which 10 ms to minimize.
[2025-06-04 07:04:51] [INFO ] Deduced a trap composed of 16 places in 626 ms of which 10 ms to minimize.
[2025-06-04 07:04:52] [INFO ] Deduced a trap composed of 21 places in 611 ms of which 10 ms to minimize.
[2025-06-04 07:04:52] [INFO ] Deduced a trap composed of 28 places in 613 ms of which 10 ms to minimize.
[2025-06-04 07:04:53] [INFO ] Deduced a trap composed of 27 places in 604 ms of which 15 ms to minimize.
[2025-06-04 07:04:54] [INFO ] Deduced a trap composed of 25 places in 601 ms of which 10 ms to minimize.
[2025-06-04 07:04:54] [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-04 07:04:54] [INFO ] [Real]Absence check using 331 positive place invariants in 119 ms returned sat
[2025-06-04 07:04:55] [INFO ] [Real]Absence check using state equation in 776 ms returned sat
[2025-06-04 07:04:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:04:56] [INFO ] [Nat]Absence check using 331 positive place invariants in 127 ms returned sat
[2025-06-04 07:04:56] [INFO ] [Nat]Absence check using state equation in 738 ms returned sat
[2025-06-04 07:04:57] [INFO ] Deduced a trap composed of 26 places in 650 ms of which 11 ms to minimize.
[2025-06-04 07:04:58] [INFO ] Deduced a trap composed of 27 places in 646 ms of which 11 ms to minimize.
[2025-06-04 07:04:58] [INFO ] Deduced a trap composed of 18 places in 635 ms of which 10 ms to minimize.
[2025-06-04 07:04:59] [INFO ] Deduced a trap composed of 19 places in 628 ms of which 10 ms to minimize.
[2025-06-04 07:05:00] [INFO ] Deduced a trap composed of 16 places in 618 ms of which 12 ms to minimize.
[2025-06-04 07:05:01] [INFO ] Deduced a trap composed of 19 places in 635 ms of which 11 ms to minimize.
[2025-06-04 07:05:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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-04 07:05:01] [INFO ] [Real]Absence check using 331 positive place invariants in 121 ms returned sat
[2025-06-04 07:05:02] [INFO ] [Real]Absence check using state equation in 754 ms returned sat
[2025-06-04 07:05:03] [INFO ] Deduced a trap composed of 31 places in 684 ms of which 11 ms to minimize.
[2025-06-04 07:05:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:05:03] [INFO ] [Nat]Absence check using 331 positive place invariants in 124 ms returned sat
[2025-06-04 07:05:04] [INFO ] [Nat]Absence check using state equation in 774 ms returned sat
[2025-06-04 07:05:05] [INFO ] Deduced a trap composed of 31 places in 672 ms of which 11 ms to minimize.
[2025-06-04 07:05:05] [INFO ] Deduced a trap composed of 27 places in 659 ms of which 10 ms to minimize.
[2025-06-04 07:05:06] [INFO ] Deduced a trap composed of 26 places in 681 ms of which 11 ms to minimize.
[2025-06-04 07:05:07] [INFO ] Deduced a trap composed of 19 places in 701 ms of which 11 ms to minimize.
[2025-06-04 07:05:08] [INFO ] Deduced a trap composed of 36 places in 651 ms of which 10 ms to minimize.
[2025-06-04 07:05:08] [INFO ] Deduced a trap composed of 39 places in 663 ms of which 10 ms to minimize.
[2025-06-04 07:05:08] [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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 2343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 568 transitions
Trivial Post-agglo rules discarded 568 transitions
Performed 568 trivial Post agglomeration. Transition count delta: 568
Iterating post reduction 0 with 568 rules applied. Total rules applied 568 place count 2343 transition count 1565
Reduce places removed 568 places and 0 transitions.
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 1 with 570 rules applied. Total rules applied 1138 place count 1775 transition count 1563
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 1143 place count 1774 transition count 1559
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1147 place count 1770 transition count 1559
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 119 Pre rules applied. Total rules applied 1147 place count 1770 transition count 1440
Deduced a syphon composed of 119 places in 3 ms
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 4 with 238 rules applied. Total rules applied 1385 place count 1651 transition count 1440
Discarding 209 places :
Symmetric choice reduction at 4 with 209 rule applications. Total rules 1594 place count 1442 transition count 1231
Iterating global reduction 4 with 209 rules applied. Total rules applied 1803 place count 1442 transition count 1231
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 87 Pre rules applied. Total rules applied 1803 place count 1442 transition count 1144
Deduced a syphon composed of 87 places in 5 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 1977 place count 1355 transition count 1144
Performed 508 Post agglomeration using F-continuation condition.Transition count delta: 508
Deduced a syphon composed of 508 places in 2 ms
Reduce places removed 508 places and 0 transitions.
Iterating global reduction 4 with 1016 rules applied. Total rules applied 2993 place count 847 transition count 636
Renaming transitions due to excessive name length > 1024 char.
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 3165 place count 761 transition count 636
Partial Free-agglomeration rule applied 89 times.
Drop transitions (Partial Free agglomeration) removed 89 transitions
Iterating global reduction 4 with 89 rules applied. Total rules applied 3254 place count 761 transition count 636
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3255 place count 760 transition count 635
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3256 place count 759 transition count 635
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3256 place count 759 transition count 633
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3260 place count 757 transition count 633
Applied a total of 3260 rules in 677 ms. Remains 757 /2343 variables (removed 1586) and now considering 633/2133 (removed 1500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 690 ms. Remains : 757/2343 places, 633/2133 transitions.
// Phase 1: matrix 633 rows 757 cols
[2025-06-04 07:05:09] [INFO ] Computed 330 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 5828 ms. (171 steps per ms)
FORMULA ShieldPPPt-PT-030B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000002 steps (4 resets) in 7786 ms. (256 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-04 07:05:23] [INFO ] Invariant cache hit.
[2025-06-04 07:05:23] [INFO ] [Real]Absence check using 330 positive place invariants in 42 ms returned sat
[2025-06-04 07:05:23] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2025-06-04 07:05:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-04 07:05:23] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 07:05:23] [INFO ] Computed and/alt/rep : 629/1465/629 causal constraints (skipped 0 transitions) in 35 ms.
[2025-06-04 07:05:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:05:23] [INFO ] [Nat]Absence check using 330 positive place invariants in 43 ms returned sat
[2025-06-04 07:05:23] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2025-06-04 07:05:23] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2025-06-04 07:05:24] [INFO ] Computed and/alt/rep : 629/1465/629 causal constraints (skipped 0 transitions) in 37 ms.
[2025-06-04 07:05:31] [INFO ] Added : 596 causal constraints over 120 iterations in 6994 ms. Result :sat
Minimization took 616 ms.
[2025-06-04 07:05:31] [INFO ] [Real]Absence check using 330 positive place invariants in 43 ms returned sat
[2025-06-04 07:05:31] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2025-06-04 07:05:31] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 07:05:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:05:32] [INFO ] [Nat]Absence check using 330 positive place invariants in 42 ms returned sat
[2025-06-04 07:05:32] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2025-06-04 07:05:32] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2025-06-04 07:05:32] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 2 ms to minimize.
[2025-06-04 07:05:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2025-06-04 07:05:32] [INFO ] Computed and/alt/rep : 629/1465/629 causal constraints (skipped 0 transitions) in 32 ms.
[2025-06-04 07:05:39] [INFO ] Added : 588 causal constraints over 118 iterations in 6825 ms. Result :sat
Minimization took 640 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 633/633 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 757 transition count 630
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 754 transition count 630
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 752 transition count 628
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 16 place count 749 transition count 628
Applied a total of 16 rules in 308 ms. Remains 749 /757 variables (removed 8) and now considering 628/633 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 308 ms. Remains : 749/757 places, 628/633 transitions.
// Phase 1: matrix 628 rows 749 cols
[2025-06-04 07:05:41] [INFO ] Computed 330 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 5811 ms. (172 steps per ms)
FORMULA ShieldPPPt-PT-030B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 3868 ms. (258 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-04 07:05:51] [INFO ] Invariant cache hit.
[2025-06-04 07:05:51] [INFO ] [Real]Absence check using 330 positive place invariants in 44 ms returned sat
[2025-06-04 07:05:51] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2025-06-04 07:05:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-04 07:05:51] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 07:05:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:05:51] [INFO ] [Nat]Absence check using 330 positive place invariants in 42 ms returned sat
[2025-06-04 07:05:51] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2025-06-04 07:05:51] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2025-06-04 07:05:51] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 2 ms to minimize.
[2025-06-04 07:05:51] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 3 ms to minimize.
[2025-06-04 07:05:52] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2025-06-04 07:05:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 333 ms
[2025-06-04 07:05:52] [INFO ] Computed and/alt/rep : 624/1477/624 causal constraints (skipped 0 transitions) in 31 ms.
[2025-06-04 07:05:58] [INFO ] Added : 591 causal constraints over 119 iterations in 6524 ms. Result :sat
Minimization took 727 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 749 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p388) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 749/749 places, 626/626 transitions.
Graph (complete) has 1922 edges and 749 vertex of which 746 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 2 places and 4 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 744 transition count 622
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 743 transition count 621
Applied a total of 5 rules in 124 ms. Remains 743 /749 variables (removed 6) and now considering 621/626 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 743/749 places, 621/626 transitions.
// Phase 1: matrix 621 rows 743 cols
[2025-06-04 07:05:59] [INFO ] Computed 328 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA ShieldPPPt-PT-030B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 5687 ms. (175 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 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-04 07:06:05] [INFO ] Flatten gal took : 86 ms
[2025-06-04 07:06:05] [INFO ] Flatten gal took : 45 ms
[2025-06-04 07:06:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4429431347050529968.gal : 23 ms
[2025-06-04 07:06:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4097112171819451537.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/ReachabilityCardinality4429431347050529968.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4097112171819451537.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
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 109554 ms.

BK_STOP 1749020766091

--------------------
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="ShieldPPPt-PT-030B"
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 ShieldPPPt-PT-030B, 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 r209-tall-174894546800113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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