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.r041-smll-174853822500006.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 BusinessProcesses-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-smll-174853822500006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K 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:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 85K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748546992459

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 19:29:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 19:29:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:29:55] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2025-05-29 19:29:55] [INFO ] Transformed 376 places.
[2025-05-29 19:29:55] [INFO ] Transformed 297 transitions.
[2025-05-29 19:29:55] [INFO ] Found NUPN structural information;
[2025-05-29 19:29:55] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 459 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 1 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]
// Phase 1: matrix 296 rows 375 cols
[2025-05-29 19:29:55] [INFO ] Computed 81 invariants in 45 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 (106 resets) in 87 ms. (113 steps per ms)
FORMULA BusinessProcesses-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (55 resets) in 99 ms. (300 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-29 19:29:55] [INFO ] Invariant cache hit.
[2025-05-29 19:29:56] [INFO ] [Real]Absence check using 42 positive place invariants in 43 ms returned sat
[2025-05-29 19:29:56] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 164 ms returned sat
[2025-05-29 19:29:57] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2025-05-29 19:29:57] [INFO ] Deduced a trap composed of 23 places in 354 ms of which 25 ms to minimize.
[2025-05-29 19:29:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:29:57] [INFO ] [Nat]Absence check using 42 positive place invariants in 36 ms returned sat
[2025-05-29 19:29:57] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 54 ms returned sat
[2025-05-29 19:29:58] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2025-05-29 19:29:58] [INFO ] Deduced a trap composed of 23 places in 266 ms of which 6 ms to minimize.
[2025-05-29 19:29:58] [INFO ] Deduced a trap composed of 84 places in 228 ms of which 6 ms to minimize.
[2025-05-29 19:29:59] [INFO ] Deduced a trap composed of 79 places in 233 ms of which 5 ms to minimize.
[2025-05-29 19:29:59] [INFO ] Deduced a trap composed of 78 places in 214 ms of which 6 ms to minimize.
[2025-05-29 19:29:59] [INFO ] Deduced a trap composed of 78 places in 207 ms of which 6 ms to minimize.
[2025-05-29 19:29:59] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 5 ms to minimize.
[2025-05-29 19:30:00] [INFO ] Deduced a trap composed of 79 places in 251 ms of which 4 ms to minimize.
[2025-05-29 19:30:00] [INFO ] Deduced a trap composed of 82 places in 187 ms of which 3 ms to minimize.
[2025-05-29 19:30:00] [INFO ] Deduced a trap composed of 85 places in 193 ms of which 3 ms to minimize.
[2025-05-29 19:30:00] [INFO ] Deduced a trap composed of 83 places in 163 ms of which 4 ms to minimize.
[2025-05-29 19:30:00] [INFO ] Deduced a trap composed of 74 places in 176 ms of which 3 ms to minimize.
[2025-05-29 19:30:01] [INFO ] Deduced a trap composed of 82 places in 188 ms of which 4 ms to minimize.
[2025-05-29 19:30:01] [INFO ] Deduced a trap composed of 83 places in 265 ms of which 4 ms to minimize.
[2025-05-29 19:30:01] [INFO ] Deduced a trap composed of 83 places in 188 ms of which 3 ms to minimize.
[2025-05-29 19:30:01] [INFO ] Deduced a trap composed of 77 places in 233 ms of which 4 ms to minimize.
[2025-05-29 19:30:02] [INFO ] Deduced a trap composed of 16 places in 259 ms of which 5 ms to minimize.
[2025-05-29 19:30:02] [INFO ] Deduced a trap composed of 75 places in 217 ms of which 5 ms to minimize.
[2025-05-29 19:30:02] [INFO ] Deduced a trap composed of 76 places in 215 ms of which 4 ms to minimize.
[2025-05-29 19:30: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 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-05-29 19:30:02] [INFO ] [Real]Absence check using 42 positive place invariants in 22 ms returned sat
[2025-05-29 19:30:02] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 20 ms returned sat
[2025-05-29 19:30:03] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2025-05-29 19:30:03] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 4 ms to minimize.
[2025-05-29 19:30:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:30:03] [INFO ] [Nat]Absence check using 42 positive place invariants in 34 ms returned sat
[2025-05-29 19:30:03] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 29 ms returned sat
[2025-05-29 19:30:03] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2025-05-29 19:30:04] [INFO ] Deduced a trap composed of 16 places in 254 ms of which 5 ms to minimize.
[2025-05-29 19:30:04] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 8 ms to minimize.
[2025-05-29 19:30:04] [INFO ] Deduced a trap composed of 14 places in 247 ms of which 6 ms to minimize.
[2025-05-29 19:30:04] [INFO ] Deduced a trap composed of 17 places in 233 ms of which 5 ms to minimize.
[2025-05-29 19:30:05] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 4 ms to minimize.
[2025-05-29 19:30:05] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 4 ms to minimize.
[2025-05-29 19:30:05] [INFO ] Deduced a trap composed of 83 places in 151 ms of which 3 ms to minimize.
[2025-05-29 19:30:05] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 3 ms to minimize.
[2025-05-29 19:30:05] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 3 ms to minimize.
[2025-05-29 19:30:05] [INFO ] Deduced a trap composed of 76 places in 171 ms of which 4 ms to minimize.
[2025-05-29 19:30:06] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 5 ms to minimize.
[2025-05-29 19:30:06] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 3 ms to minimize.
[2025-05-29 19:30:06] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 3 ms to minimize.
[2025-05-29 19:30:06] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 3 ms to minimize.
[2025-05-29 19:30:06] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 5 ms to minimize.
[2025-05-29 19:30:07] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 3 ms to minimize.
[2025-05-29 19:30:07] [INFO ] Deduced a trap composed of 78 places in 163 ms of which 4 ms to minimize.
[2025-05-29 19:30:07] [INFO ] Deduced a trap composed of 77 places in 186 ms of which 12 ms to minimize.
[2025-05-29 19:30:07] [INFO ] Deduced a trap composed of 78 places in 186 ms of which 5 ms to minimize.
[2025-05-29 19:30:07] [INFO ] Deduced a trap composed of 78 places in 178 ms of which 4 ms to minimize.
[2025-05-29 19:30:08] [INFO ] Deduced a trap composed of 81 places in 185 ms of which 4 ms to minimize.
[2025-05-29 19:30:08] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 4264 ms
[2025-05-29 19:30:08] [INFO ] Computed and/alt/rep : 272/351/272 causal constraints (skipped 23 transitions) in 42 ms.
[2025-05-29 19:30: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: Broken pipe ... 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: Broken pipe ...
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-05-29 19:30:08] [INFO ] [Real]Absence check using 42 positive place invariants in 27 ms returned sat
[2025-05-29 19:30:08] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 22 ms returned sat
[2025-05-29 19:30:08] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2025-05-29 19:30:09] [INFO ] Deduced a trap composed of 18 places in 302 ms of which 5 ms to minimize.
[2025-05-29 19:30:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:30:09] [INFO ] [Nat]Absence check using 42 positive place invariants in 34 ms returned sat
[2025-05-29 19:30:09] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 27 ms returned sat
[2025-05-29 19:30:09] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2025-05-29 19:30:09] [INFO ] Deduced a trap composed of 18 places in 257 ms of which 6 ms to minimize.
[2025-05-29 19:30:10] [INFO ] Deduced a trap composed of 17 places in 272 ms of which 5 ms to minimize.
[2025-05-29 19:30:10] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 3 ms to minimize.
[2025-05-29 19:30:10] [INFO ] Deduced a trap composed of 8 places in 280 ms of which 5 ms to minimize.
[2025-05-29 19:30:10] [INFO ] Deduced a trap composed of 13 places in 296 ms of which 5 ms to minimize.
[2025-05-29 19:30:11] [INFO ] Deduced a trap composed of 18 places in 297 ms of which 5 ms to minimize.
[2025-05-29 19:30:11] [INFO ] Deduced a trap composed of 23 places in 260 ms of which 5 ms to minimize.
[2025-05-29 19:30:11] [INFO ] Deduced a trap composed of 14 places in 273 ms of which 5 ms to minimize.
[2025-05-29 19:30:12] [INFO ] Deduced a trap composed of 15 places in 268 ms of which 6 ms to minimize.
[2025-05-29 19:30:12] [INFO ] Deduced a trap composed of 17 places in 277 ms of which 5 ms to minimize.
[2025-05-29 19:30:12] [INFO ] Deduced a trap composed of 20 places in 263 ms of which 5 ms to minimize.
[2025-05-29 19:30:12] [INFO ] Deduced a trap composed of 83 places in 253 ms of which 5 ms to minimize.
[2025-05-29 19:30:13] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 4 ms to minimize.
[2025-05-29 19:30:13] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 8 ms to minimize.
[2025-05-29 19:30:13] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2025-05-29 19:30:13] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 2 ms to minimize.
[2025-05-29 19:30:13] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2025-05-29 19:30:13] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2025-05-29 19:30:13] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2025-05-29 19:30:13] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 3 ms to minimize.
[2025-05-29 19:30:13] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2025-05-29 19:30:14] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 3 ms to minimize.
[2025-05-29 19:30:14] [INFO ] Deduced a trap composed of 9 places in 347 ms of which 6 ms to minimize.
[2025-05-29 19:30:14] [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)
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 375 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 375/375 places, 296/296 transitions.
Graph (trivial) has 195 edges and 375 vertex of which 7 / 375 are part of one of the 1 SCC in 8 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 684 edges and 369 vertex of which 366 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 366 transition count 219
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 137 place count 299 transition count 219
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 137 place count 299 transition count 155
Deduced a syphon composed of 64 places in 2 ms
Ensure Unique test removed 10 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 275 place count 225 transition count 155
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 316 place count 184 transition count 114
Iterating global reduction 2 with 41 rules applied. Total rules applied 357 place count 184 transition count 114
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 497 place count 110 transition count 48
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 498 place count 110 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 499 place count 109 transition count 47
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 500 place count 109 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 501 place count 108 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 502 place count 107 transition count 46
Applied a total of 502 rules in 268 ms. Remains 107 /375 variables (removed 268) and now considering 46/296 (removed 250) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 293 ms. Remains : 107/375 places, 46/296 transitions.
// Phase 1: matrix 46 rows 107 cols
[2025-05-29 19:30:14] [INFO ] Computed 61 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (21739 resets) in 3236 ms. (308 steps per ms)
FORMULA BusinessProcesses-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (5337 resets) in 1611 ms. (620 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-05-29 19:30:19] [INFO ] Flatten gal took : 78 ms
[2025-05-29 19:30:19] [INFO ] Flatten gal took : 28 ms
[2025-05-29 19:30:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15890597497928242818.gal : 14 ms
[2025-05-29 19:30:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4634418592005075884.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/ReachabilityCardinality15890597497928242818.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4634418592005075884.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 25049 ms.

BK_STOP 1748547020134

--------------------
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="BusinessProcesses-PT-06"
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 BusinessProcesses-PT-06, 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 r041-smll-174853822500006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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