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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 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 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K 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 131K 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-10-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748547065705

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 19:31:07] [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:31:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:31:08] [INFO ] Load time of PNML (sax parser for PT used): 222 ms
[2025-05-29 19:31:08] [INFO ] Transformed 518 places.
[2025-05-29 19:31:08] [INFO ] Transformed 471 transitions.
[2025-05-29 19:31:08] [INFO ] Found NUPN structural information;
[2025-05-29 19:31:08] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 466 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 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 471 rows 518 cols
[2025-05-29 19:31:08] [INFO ] Computed 85 invariants in 64 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 (83 resets) in 84 ms. (117 steps per ms)
FORMULA BusinessProcesses-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70005 steps (95 resets) in 146 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-29 19:31:08] [INFO ] Invariant cache hit.
[2025-05-29 19:31:09] [INFO ] [Real]Absence check using 48 positive place invariants in 56 ms returned sat
[2025-05-29 19:31:09] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 23 ms returned sat
[2025-05-29 19:31:09] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2025-05-29 19:31:10] [INFO ] Deduced a trap composed of 12 places in 297 ms of which 40 ms to minimize.
[2025-05-29 19:31:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:31:10] [INFO ] [Nat]Absence check using 48 positive place invariants in 33 ms returned sat
[2025-05-29 19:31:10] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 18 ms returned sat
[2025-05-29 19:31:10] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2025-05-29 19:31:11] [INFO ] Deduced a trap composed of 12 places in 338 ms of which 7 ms to minimize.
[2025-05-29 19:31:11] [INFO ] Deduced a trap composed of 11 places in 247 ms of which 5 ms to minimize.
[2025-05-29 19:31:11] [INFO ] Deduced a trap composed of 25 places in 260 ms of which 6 ms to minimize.
[2025-05-29 19:31:12] [INFO ] Deduced a trap composed of 16 places in 359 ms of which 8 ms to minimize.
[2025-05-29 19:31:12] [INFO ] Deduced a trap composed of 23 places in 255 ms of which 6 ms to minimize.
[2025-05-29 19:31:13] [INFO ] Deduced a trap composed of 15 places in 327 ms of which 6 ms to minimize.
[2025-05-29 19:31:13] [INFO ] Deduced a trap composed of 16 places in 360 ms of which 6 ms to minimize.
[2025-05-29 19:31:13] [INFO ] Deduced a trap composed of 61 places in 353 ms of which 5 ms to minimize.
[2025-05-29 19:31:14] [INFO ] Deduced a trap composed of 23 places in 321 ms of which 6 ms to minimize.
[2025-05-29 19:31:14] [INFO ] Deduced a trap composed of 44 places in 254 ms of which 6 ms to minimize.
[2025-05-29 19:31:14] [INFO ] Deduced a trap composed of 71 places in 250 ms of which 5 ms to minimize.
[2025-05-29 19:31:15] [INFO ] Deduced a trap composed of 22 places in 247 ms of which 5 ms to minimize.
[2025-05-29 19:31:15] [INFO ] Deduced a trap composed of 24 places in 322 ms of which 6 ms to minimize.
[2025-05-29 19:31:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... 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: Broken pipe ...
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:31:15] [INFO ] [Real]Absence check using 48 positive place invariants in 52 ms returned sat
[2025-05-29 19:31:15] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 30 ms returned sat
[2025-05-29 19:31:16] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2025-05-29 19:31:16] [INFO ] Deduced a trap composed of 9 places in 479 ms of which 7 ms to minimize.
[2025-05-29 19:31:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:31:16] [INFO ] [Nat]Absence check using 48 positive place invariants in 47 ms returned sat
[2025-05-29 19:31:16] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 23 ms returned sat
[2025-05-29 19:31:17] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2025-05-29 19:31:17] [INFO ] Deduced a trap composed of 9 places in 418 ms of which 8 ms to minimize.
[2025-05-29 19:31:18] [INFO ] Deduced a trap composed of 109 places in 438 ms of which 7 ms to minimize.
[2025-05-29 19:31:18] [INFO ] Deduced a trap composed of 11 places in 424 ms of which 7 ms to minimize.
[2025-05-29 19:31:19] [INFO ] Deduced a trap composed of 36 places in 432 ms of which 7 ms to minimize.
[2025-05-29 19:31:19] [INFO ] Deduced a trap composed of 16 places in 413 ms of which 7 ms to minimize.
[2025-05-29 19:31:20] [INFO ] Deduced a trap composed of 38 places in 396 ms of which 7 ms to minimize.
[2025-05-29 19:31:20] [INFO ] Deduced a trap composed of 15 places in 369 ms of which 7 ms to minimize.
[2025-05-29 19:31:20] [INFO ] Deduced a trap composed of 24 places in 347 ms of which 6 ms to minimize.
[2025-05-29 19:31:21] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 4 ms to minimize.
[2025-05-29 19:31:21] [INFO ] Deduced a trap composed of 26 places in 338 ms of which 7 ms to minimize.
[2025-05-29 19:31:21] [INFO ] Deduced a trap composed of 20 places in 354 ms of which 7 ms to minimize.
[2025-05-29 19:31:21] [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-05-29 19:31:22] [INFO ] [Real]Absence check using 48 positive place invariants in 46 ms returned sat
[2025-05-29 19:31:22] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 29 ms returned sat
[2025-05-29 19:31:22] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2025-05-29 19:31:22] [INFO ] Deduced a trap composed of 8 places in 314 ms of which 5 ms to minimize.
[2025-05-29 19:31:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:31:23] [INFO ] [Nat]Absence check using 48 positive place invariants in 48 ms returned sat
[2025-05-29 19:31:23] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 26 ms returned sat
[2025-05-29 19:31:23] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2025-05-29 19:31:23] [INFO ] Deduced a trap composed of 8 places in 279 ms of which 5 ms to minimize.
[2025-05-29 19:31:24] [INFO ] Deduced a trap composed of 19 places in 300 ms of which 6 ms to minimize.
[2025-05-29 19:31:24] [INFO ] Deduced a trap composed of 37 places in 329 ms of which 10 ms to minimize.
[2025-05-29 19:31:25] [INFO ] Deduced a trap composed of 21 places in 277 ms of which 6 ms to minimize.
[2025-05-29 19:31:25] [INFO ] Deduced a trap composed of 13 places in 283 ms of which 6 ms to minimize.
[2025-05-29 19:31:25] [INFO ] Deduced a trap composed of 29 places in 270 ms of which 5 ms to minimize.
[2025-05-29 19:31:25] [INFO ] Deduced a trap composed of 15 places in 257 ms of which 9 ms to minimize.
[2025-05-29 19:31:26] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 4 ms to minimize.
[2025-05-29 19:31:26] [INFO ] Deduced a trap composed of 16 places in 262 ms of which 5 ms to minimize.
[2025-05-29 19:31:26] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 5 ms to minimize.
[2025-05-29 19:31:27] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 5 ms to minimize.
[2025-05-29 19:31:27] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 3 ms to minimize.
[2025-05-29 19:31:27] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 4 ms to minimize.
[2025-05-29 19:31:27] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 3 ms to minimize.
[2025-05-29 19:31:27] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 3 ms to minimize.
[2025-05-29 19:31:27] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 3 ms to minimize.
[2025-05-29 19:31:28] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 3 ms to minimize.
[2025-05-29 19:31:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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-05-29 19:31:28] [INFO ] [Real]Absence check using 48 positive place invariants in 44 ms returned sat
[2025-05-29 19:31:28] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 26 ms returned sat
[2025-05-29 19:31:28] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2025-05-29 19:31:29] [INFO ] Deduced a trap composed of 16 places in 302 ms of which 5 ms to minimize.
[2025-05-29 19:31:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:31:29] [INFO ] [Nat]Absence check using 48 positive place invariants in 46 ms returned sat
[2025-05-29 19:31:29] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 24 ms returned sat
[2025-05-29 19:31:29] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2025-05-29 19:31:30] [INFO ] Deduced a trap composed of 16 places in 268 ms of which 5 ms to minimize.
[2025-05-29 19:31:30] [INFO ] Deduced a trap composed of 11 places in 271 ms of which 5 ms to minimize.
[2025-05-29 19:31:30] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 5 ms to minimize.
[2025-05-29 19:31:30] [INFO ] Deduced a trap composed of 8 places in 229 ms of which 4 ms to minimize.
[2025-05-29 19:31:31] [INFO ] Deduced a trap composed of 15 places in 208 ms of which 4 ms to minimize.
[2025-05-29 19:31:31] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 4 ms to minimize.
[2025-05-29 19:31:31] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 5 ms to minimize.
[2025-05-29 19:31:31] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 4 ms to minimize.
[2025-05-29 19:31:32] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 4 ms to minimize.
[2025-05-29 19:31:32] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 4 ms to minimize.
[2025-05-29 19:31:32] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 4 ms to minimize.
[2025-05-29 19:31:32] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 4 ms to minimize.
[2025-05-29 19:31:32] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 4 ms to minimize.
[2025-05-29 19:31:33] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 4 ms to minimize.
[2025-05-29 19:31:33] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 4 ms to minimize.
[2025-05-29 19:31:33] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3627 ms
[2025-05-29 19:31:33] [INFO ] Computed and/alt/rep : 442/759/442 causal constraints (skipped 28 transitions) in 71 ms.
[2025-05-29 19:31:34] [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.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:31:34] [INFO ] [Real]Absence check using 48 positive place invariants in 44 ms returned sat
[2025-05-29 19:31:34] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 26 ms returned sat
[2025-05-29 19:31:34] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2025-05-29 19:31:35] [INFO ] Deduced a trap composed of 12 places in 384 ms of which 5 ms to minimize.
[2025-05-29 19:31:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:31:35] [INFO ] [Nat]Absence check using 48 positive place invariants in 31 ms returned sat
[2025-05-29 19:31:35] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 17 ms returned sat
[2025-05-29 19:31:35] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2025-05-29 19:31:36] [INFO ] Deduced a trap composed of 12 places in 373 ms of which 7 ms to minimize.
[2025-05-29 19:31:36] [INFO ] Deduced a trap composed of 8 places in 414 ms of which 10 ms to minimize.
[2025-05-29 19:31:37] [INFO ] Deduced a trap composed of 38 places in 414 ms of which 7 ms to minimize.
[2025-05-29 19:31:37] [INFO ] Deduced a trap composed of 8 places in 410 ms of which 7 ms to minimize.
[2025-05-29 19:31:37] [INFO ] Deduced a trap composed of 44 places in 374 ms of which 7 ms to minimize.
[2025-05-29 19:31:38] [INFO ] Deduced a trap composed of 21 places in 407 ms of which 7 ms to minimize.
[2025-05-29 19:31:38] [INFO ] Deduced a trap composed of 17 places in 419 ms of which 7 ms to minimize.
[2025-05-29 19:31:39] [INFO ] Deduced a trap composed of 46 places in 419 ms of which 7 ms to minimize.
[2025-05-29 19:31:39] [INFO ] Deduced a trap composed of 30 places in 412 ms of which 7 ms to minimize.
[2025-05-29 19:31:40] [INFO ] Deduced a trap composed of 23 places in 392 ms of which 7 ms to minimize.
[2025-05-29 19:31:40] [INFO ] Deduced a trap composed of 113 places in 413 ms of which 7 ms to minimize.
[2025-05-29 19:31: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 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-05-29 19:31:40] [INFO ] [Real]Absence check using 48 positive place invariants in 44 ms returned sat
[2025-05-29 19:31:40] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 22 ms returned sat
[2025-05-29 19:31:41] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2025-05-29 19:31:41] [INFO ] Deduced a trap composed of 11 places in 391 ms of which 6 ms to minimize.
[2025-05-29 19:31:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:31:41] [INFO ] [Nat]Absence check using 48 positive place invariants in 46 ms returned sat
[2025-05-29 19:31:41] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 29 ms returned sat
[2025-05-29 19:31:42] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2025-05-29 19:31:42] [INFO ] Deduced a trap composed of 11 places in 461 ms of which 6 ms to minimize.
[2025-05-29 19:31:43] [INFO ] Deduced a trap composed of 16 places in 360 ms of which 6 ms to minimize.
[2025-05-29 19:31:43] [INFO ] Deduced a trap composed of 24 places in 353 ms of which 7 ms to minimize.
[2025-05-29 19:31:44] [INFO ] Deduced a trap composed of 32 places in 365 ms of which 6 ms to minimize.
[2025-05-29 19:31:44] [INFO ] Deduced a trap composed of 25 places in 360 ms of which 6 ms to minimize.
[2025-05-29 19:31:44] [INFO ] Deduced a trap composed of 26 places in 334 ms of which 6 ms to minimize.
[2025-05-29 19:31:45] [INFO ] Deduced a trap composed of 25 places in 344 ms of which 7 ms to minimize.
[2025-05-29 19:31:45] [INFO ] Deduced a trap composed of 122 places in 326 ms of which 6 ms to minimize.
[2025-05-29 19:31:45] [INFO ] Deduced a trap composed of 113 places in 339 ms of which 6 ms to minimize.
[2025-05-29 19:31:46] [INFO ] Deduced a trap composed of 113 places in 344 ms of which 6 ms to minimize.
[2025-05-29 19:31:46] [INFO ] Deduced a trap composed of 19 places in 342 ms of which 6 ms to minimize.
[2025-05-29 19:31:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:954)
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, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 471/471 transitions.
Graph (trivial) has 287 edges and 518 vertex of which 7 / 518 are part of one of the 1 SCC in 12 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 1063 edges and 512 vertex of which 510 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 110 place count 510 transition count 354
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 218 place count 402 transition count 354
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 218 place count 402 transition count 276
Deduced a syphon composed of 78 places in 4 ms
Ensure Unique test removed 11 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 167 rules applied. Total rules applied 385 place count 313 transition count 276
Discarding 66 places :
Symmetric choice reduction at 2 with 66 rule applications. Total rules 451 place count 247 transition count 210
Iterating global reduction 2 with 66 rules applied. Total rules applied 517 place count 247 transition count 210
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 517 place count 247 transition count 203
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 532 place count 239 transition count 203
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 161 rules applied. Total rules applied 693 place count 157 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 695 place count 156 transition count 127
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 697 place count 156 transition count 125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 699 place count 154 transition count 125
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 700 place count 154 transition count 125
Applied a total of 700 rules in 312 ms. Remains 154 /518 variables (removed 364) and now considering 125/471 (removed 346) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 338 ms. Remains : 154/518 places, 125/471 transitions.
// Phase 1: matrix 125 rows 154 cols
[2025-05-29 19:31:47] [INFO ] Computed 69 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (43881 resets) in 3846 ms. (259 steps per ms)
FORMULA BusinessProcesses-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (19576 resets) in 1761 ms. (567 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:31:53] [INFO ] Flatten gal took : 102 ms
[2025-05-29 19:31:53] [INFO ] Flatten gal took : 59 ms
[2025-05-29 19:31:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11111673829572054230.gal : 16 ms
[2025-05-29 19:31:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8218697380851494445.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/ReachabilityCardinality11111673829572054230.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8218697380851494445.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 45392 ms.

BK_STOP 1748547113282

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

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