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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K 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 56K 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.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 185K 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-010B-UpperBounds-00
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-01
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-02
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-03
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-04
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-05
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-06
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-07
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-08
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-09
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-10
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-11
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-12
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-13
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-14
FORMULA_NAME ShieldPPPt-PT-010B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749020645083

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-010B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-04 07:04:06] [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:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 07:04:06] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2025-06-04 07:04:06] [INFO ] Transformed 783 places.
[2025-06-04 07:04:06] [INFO ] Transformed 713 transitions.
[2025-06-04 07:04:06] [INFO ] Found NUPN structural information;
[2025-06-04 07:04:06] [INFO ] Parsed PT model containing 783 places and 713 transitions and 1786 arcs in 228 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 713 rows 783 cols
[2025-06-04 07:04:06] [INFO ] Computed 111 invariants in 32 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 54 ms. (181 steps per ms)
FORMULA ShieldPPPt-PT-010B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (6 resets) in 66 ms. (447 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-06-04 07:04:06] [INFO ] Invariant cache hit.
[2025-06-04 07:04:07] [INFO ] [Real]Absence check using 111 positive place invariants in 52 ms returned sat
[2025-06-04 07:04:07] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2025-06-04 07:04:08] [INFO ] Deduced a trap composed of 12 places in 384 ms of which 39 ms to minimize.
[2025-06-04 07:04:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:04:08] [INFO ] [Nat]Absence check using 111 positive place invariants in 93 ms returned sat
[2025-06-04 07:04:08] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2025-06-04 07:04:09] [INFO ] Deduced a trap composed of 12 places in 310 ms of which 6 ms to minimize.
[2025-06-04 07:04:09] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 10 ms to minimize.
[2025-06-04 07:04:09] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 4 ms to minimize.
[2025-06-04 07:04:09] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 4 ms to minimize.
[2025-06-04 07:04:09] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 4 ms to minimize.
[2025-06-04 07:04:10] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 4 ms to minimize.
[2025-06-04 07:04:10] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 3 ms to minimize.
[2025-06-04 07:04:10] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 5 ms to minimize.
[2025-06-04 07:04:10] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 3 ms to minimize.
[2025-06-04 07:04:10] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 5 ms to minimize.
[2025-06-04 07:04:11] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 2 ms to minimize.
[2025-06-04 07:04:11] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 3 ms to minimize.
[2025-06-04 07:04:11] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 2 ms to minimize.
[2025-06-04 07:04:11] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 2 ms to minimize.
[2025-06-04 07:04:11] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 3 ms to minimize.
[2025-06-04 07:04:11] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2025-06-04 07:04:12] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 4 ms to minimize.
[2025-06-04 07:04:12] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2025-06-04 07:04:12] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
[2025-06-04 07:04:12] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3731 ms
[2025-06-04 07:04:12] [INFO ] Computed and/alt/rep : 712/1063/712 causal constraints (skipped 0 transitions) in 43 ms.
[2025-06-04 07:04:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
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:13] [INFO ] [Real]Absence check using 111 positive place invariants in 33 ms returned sat
[2025-06-04 07:04:13] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2025-06-04 07:04:13] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 3 ms to minimize.
[2025-06-04 07:04:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:04:14] [INFO ] [Nat]Absence check using 111 positive place invariants in 35 ms returned sat
[2025-06-04 07:04:14] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2025-06-04 07:04:14] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 3 ms to minimize.
[2025-06-04 07:04:14] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 4 ms to minimize.
[2025-06-04 07:04:14] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 3 ms to minimize.
[2025-06-04 07:04:14] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 3 ms to minimize.
[2025-06-04 07:04:15] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 3 ms to minimize.
[2025-06-04 07:04:15] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 3 ms to minimize.
[2025-06-04 07:04:15] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 3 ms to minimize.
[2025-06-04 07:04:15] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 3 ms to minimize.
[2025-06-04 07:04:15] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 3 ms to minimize.
[2025-06-04 07:04:15] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 2 ms to minimize.
[2025-06-04 07:04:16] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 3 ms to minimize.
[2025-06-04 07:04:16] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 3 ms to minimize.
[2025-06-04 07:04:16] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 6 ms to minimize.
[2025-06-04 07:04:16] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 3 ms to minimize.
[2025-06-04 07:04:16] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 3 ms to minimize.
[2025-06-04 07:04:16] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2025-06-04 07:04:16] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2025-06-04 07:04:16] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2025-06-04 07:04:17] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2025-06-04 07:04:17] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2025-06-04 07:04:17] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2025-06-04 07:04:17] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3055 ms
[2025-06-04 07:04:17] [INFO ] Computed and/alt/rep : 712/1063/712 causal constraints (skipped 0 transitions) in 37 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2025-06-04 07:04:19] [INFO ] [Real]Absence check using 111 positive place invariants in 35 ms returned sat
[2025-06-04 07:04:19] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2025-06-04 07:04:19] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 4 ms to minimize.
[2025-06-04 07:04:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:04:19] [INFO ] [Nat]Absence check using 111 positive place invariants in 34 ms returned sat
[2025-06-04 07:04:19] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2025-06-04 07:04:20] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 4 ms to minimize.
[2025-06-04 07:04:20] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 3 ms to minimize.
[2025-06-04 07:04:20] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 4 ms to minimize.
[2025-06-04 07:04:20] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 3 ms to minimize.
[2025-06-04 07:04:20] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 3 ms to minimize.
[2025-06-04 07:04:21] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 3 ms to minimize.
[2025-06-04 07:04:21] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 3 ms to minimize.
[2025-06-04 07:04:21] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 3 ms to minimize.
[2025-06-04 07:04:21] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 3 ms to minimize.
[2025-06-04 07:04:21] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 3 ms to minimize.
[2025-06-04 07:04:21] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 2 ms to minimize.
[2025-06-04 07:04:21] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 3 ms to minimize.
[2025-06-04 07:04:22] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 4 ms to minimize.
[2025-06-04 07:04:22] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 3 ms to minimize.
[2025-06-04 07:04:22] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 3 ms to minimize.
[2025-06-04 07:04:22] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2025-06-04 07:04:22] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2025-06-04 07:04:22] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 3 ms to minimize.
[2025-06-04 07:04:22] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2025-06-04 07:04:23] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2025-06-04 07:04:23] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3095 ms
[2025-06-04 07:04:23] [INFO ] Computed and/alt/rep : 712/1063/712 causal constraints (skipped 0 transitions) in 39 ms.
[2025-06-04 07:04:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
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] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 783 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 783/783 places, 713/713 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 783 transition count 521
Reduce places removed 192 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 194 rules applied. Total rules applied 386 place count 591 transition count 519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 387 place count 590 transition count 519
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 387 place count 590 transition count 479
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 467 place count 550 transition count 479
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 535 place count 482 transition count 411
Iterating global reduction 3 with 68 rules applied. Total rules applied 603 place count 482 transition count 411
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 603 place count 482 transition count 382
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 661 place count 453 transition count 382
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 0 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 3 with 340 rules applied. Total rules applied 1001 place count 283 transition count 212
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1059 place count 254 transition count 212
Partial Free-agglomeration rule applied 29 times.
Drop transitions (Partial Free agglomeration) removed 29 transitions
Iterating global reduction 3 with 29 rules applied. Total rules applied 1088 place count 254 transition count 212
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1089 place count 253 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1090 place count 252 transition count 211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1090 place count 252 transition count 209
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1094 place count 250 transition count 209
Applied a total of 1094 rules in 183 ms. Remains 250 /783 variables (removed 533) and now considering 209/713 (removed 504) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 250/783 places, 209/713 transitions.
// Phase 1: matrix 209 rows 250 cols
[2025-06-04 07:04:24] [INFO ] Computed 110 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 3323 ms. (300 steps per ms)
FORMULA ShieldPPPt-PT-010B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-010B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 1814 ms. (550 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:04:30] [INFO ] Flatten gal took : 82 ms
[2025-06-04 07:04:30] [INFO ] Flatten gal took : 29 ms
[2025-06-04 07:04:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3983498410721288574.gal : 14 ms
[2025-06-04 07:04:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality245309920710301108.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/ReachabilityCardinality3983498410721288574.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality245309920710301108.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 23910 ms.

BK_STOP 1749020670328

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

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