Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r109-tall-171624207800081.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool gold2023
Input is CloudReconfiguration-PT-303, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624207800081
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 19:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Apr 11 19:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 19:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 19:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 660K May 18 16:42 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

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

=== Now, execution of the tool begins

BK_START 1716305931871

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-303
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-21 15:38:53] [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]
[2024-05-21 15:38:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:38:53] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2024-05-21 15:38:53] [INFO ] Transformed 2584 places.
[2024-05-21 15:38:53] [INFO ] Transformed 3094 transitions.
[2024-05-21 15:38:53] [INFO ] Found NUPN structural information;
[2024-05-21 15:38:53] [INFO ] Parsed PT model containing 2584 places and 3094 transitions and 6459 arcs in 239 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 3094 rows 2584 cols
[2024-05-21 15:38:53] [INFO ] Computed 4 invariants in 64 ms
Incomplete random walk after 10000 steps, including 110 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :3
FORMULA CloudReconfiguration-PT-303-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :1
FORMULA CloudReconfiguration-PT-303-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :1
FORMULA CloudReconfiguration-PT-303-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
[2024-05-21 15:38:54] [INFO ] Invariant cache hit.
[2024-05-21 15:38:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2024-05-21 15:38:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:38:55] [INFO ] [Real]Absence check using state equation in 1192 ms returned sat
[2024-05-21 15:38:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:38:56] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 45 ms returned sat
[2024-05-21 15:38:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:38:57] [INFO ] [Nat]Absence check using state equation in 1181 ms returned sat
[2024-05-21 15:38:57] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 178 ms.
[2024-05-21 15:39:00] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-21 15:39:01] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2024-05-21 15:39:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:39:02] [INFO ] [Real]Absence check using state equation in 1201 ms returned sat
[2024-05-21 15:39:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:39:03] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2024-05-21 15:39:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:39:04] [INFO ] [Nat]Absence check using state equation in 1190 ms returned sat
[2024-05-21 15:39:04] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 160 ms.
[2024-05-21 15:39:07] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-21 15:39:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2024-05-21 15:39:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:39:09] [INFO ] [Real]Absence check using state equation in 1134 ms returned sat
[2024-05-21 15:39:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:39:09] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2024-05-21 15:39:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:39:10] [INFO ] [Nat]Absence check using state equation in 1085 ms returned sat
[2024-05-21 15:39:11] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 130 ms.
[2024-05-21 15:39:14] [INFO ] Added : 135 causal constraints over 27 iterations in 3500 ms. Result :unknown
[2024-05-21 15:39:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2024-05-21 15:39:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:39:15] [INFO ] [Real]Absence check using state equation in 1121 ms returned sat
[2024-05-21 15:39:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:39:16] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2024-05-21 15:39:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:39:17] [INFO ] [Nat]Absence check using state equation in 1102 ms returned sat
[2024-05-21 15:39:17] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 130 ms.
[2024-05-21 15:39:21] [INFO ] Added : 140 causal constraints over 28 iterations in 3475 ms. Result :unknown
[2024-05-21 15:39:21] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2024-05-21 15:39:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:39:22] [INFO ] [Real]Absence check using state equation in 1156 ms returned sat
[2024-05-21 15:39:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:39:23] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2024-05-21 15:39:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:39:24] [INFO ] [Nat]Absence check using state equation in 1216 ms returned sat
[2024-05-21 15:39:24] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 151 ms.
[2024-05-21 15:39:27] [INFO ] Added : 130 causal constraints over 26 iterations in 3347 ms. Result :unknown
[2024-05-21 15:39:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2024-05-21 15:39:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:39:29] [INFO ] [Real]Absence check using state equation in 1286 ms returned sat
[2024-05-21 15:39:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:39:29] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2024-05-21 15:39:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:39:31] [INFO ] [Nat]Absence check using state equation in 1205 ms returned sat
[2024-05-21 15:39:31] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 133 ms.
[2024-05-21 15:39:34] [INFO ] Added : 135 causal constraints over 27 iterations in 3368 ms. Result :unknown
[2024-05-21 15:39:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2024-05-21 15:39:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:39:36] [INFO ] [Real]Absence check using state equation in 1152 ms returned sat
[2024-05-21 15:39:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:39:36] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2024-05-21 15:39:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:39:37] [INFO ] [Nat]Absence check using state equation in 1147 ms returned sat
[2024-05-21 15:39:37] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 136 ms.
[2024-05-21 15:39:41] [INFO ] Added : 135 causal constraints over 27 iterations in 3462 ms. Result :unknown
[2024-05-21 15:39:41] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2024-05-21 15:39:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:39:42] [INFO ] [Real]Absence check using state equation in 1167 ms returned sat
[2024-05-21 15:39:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:39:43] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2024-05-21 15:39:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:39:44] [INFO ] [Nat]Absence check using state equation in 1178 ms returned sat
[2024-05-21 15:39:44] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 142 ms.
[2024-05-21 15:39:47] [INFO ] Added : 135 causal constraints over 27 iterations in 3427 ms. Result :unknown
[2024-05-21 15:39:48] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 37 ms returned sat
[2024-05-21 15:39:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:39:49] [INFO ] [Real]Absence check using state equation in 1205 ms returned sat
[2024-05-21 15:39:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:39:50] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2024-05-21 15:39:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:39:51] [INFO ] [Nat]Absence check using state equation in 1280 ms returned sat
[2024-05-21 15:39:51] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 141 ms.
[2024-05-21 15:39:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-21 15:39:55] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 37 ms returned sat
[2024-05-21 15:39:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:39:56] [INFO ] [Real]Absence check using state equation in 1089 ms returned sat
[2024-05-21 15:39:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:39:56] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2024-05-21 15:39:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:39:57] [INFO ] [Nat]Absence check using state equation in 1091 ms returned sat
[2024-05-21 15:39:57] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 128 ms.
[2024-05-21 15:40:01] [INFO ] Added : 129 causal constraints over 27 iterations in 3490 ms. Result :unknown
[2024-05-21 15:40:01] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 37 ms returned sat
[2024-05-21 15:40:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:40:02] [INFO ] [Real]Absence check using state equation in 1181 ms returned sat
[2024-05-21 15:40:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:40:03] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2024-05-21 15:40:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:40:04] [INFO ] [Nat]Absence check using state equation in 1158 ms returned sat
[2024-05-21 15:40:04] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 150 ms.
[2024-05-21 15:40:07] [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 10
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 11 out of 2584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Graph (trivial) has 2934 edges and 2584 vertex of which 873 / 2584 are part of one of the 63 SCC in 15 ms
Free SCC test removed 810 places
Drop transitions removed 988 transitions
Reduce isomorphic transitions removed 988 transitions.
Graph (complete) has 2384 edges and 1774 vertex of which 1760 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.5 ms
Discarding 14 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 1180 transitions
Trivial Post-agglo rules discarded 1180 transitions
Performed 1180 trivial Post agglomeration. Transition count delta: 1180
Iterating post reduction 0 with 1189 rules applied. Total rules applied 1191 place count 1760 transition count 908
Reduce places removed 1180 places and 0 transitions.
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 1 with 1311 rules applied. Total rules applied 2502 place count 580 transition count 777
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 67 rules applied. Total rules applied 2569 place count 522 transition count 768
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 2575 place count 519 transition count 765
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 2579 place count 517 transition count 763
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 5 with 6 rules applied. Total rules applied 2585 place count 516 transition count 758
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 2590 place count 511 transition count 758
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 2590 place count 511 transition count 736
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 2634 place count 489 transition count 736
Discarding 77 places :
Symmetric choice reduction at 7 with 77 rule applications. Total rules 2711 place count 412 transition count 659
Iterating global reduction 7 with 77 rules applied. Total rules applied 2788 place count 412 transition count 659
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2790 place count 412 transition count 657
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2791 place count 411 transition count 657
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 8 Pre rules applied. Total rules applied 2791 place count 411 transition count 649
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 9 with 16 rules applied. Total rules applied 2807 place count 403 transition count 649
Discarding 60 places :
Symmetric choice reduction at 9 with 60 rule applications. Total rules 2867 place count 343 transition count 589
Iterating global reduction 9 with 60 rules applied. Total rules applied 2927 place count 343 transition count 589
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 9 with 35 rules applied. Total rules applied 2962 place count 343 transition count 554
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 10 with 25 rules applied. Total rules applied 2987 place count 326 transition count 546
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 2991 place count 322 transition count 546
Discarding 20 places :
Symmetric choice reduction at 12 with 20 rule applications. Total rules 3011 place count 302 transition count 515
Iterating global reduction 12 with 20 rules applied. Total rules applied 3031 place count 302 transition count 515
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 3040 place count 302 transition count 506
Discarding 8 places :
Symmetric choice reduction at 13 with 8 rule applications. Total rules 3048 place count 294 transition count 490
Iterating global reduction 13 with 8 rules applied. Total rules applied 3056 place count 294 transition count 490
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 3059 place count 291 transition count 484
Iterating global reduction 13 with 3 rules applied. Total rules applied 3062 place count 291 transition count 484
Performed 153 Post agglomeration using F-continuation condition with reduction of 75 identical transitions.
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 13 with 306 rules applied. Total rules applied 3368 place count 138 transition count 256
Drop transitions removed 1 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 3375 place count 138 transition count 249
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 3379 place count 136 transition count 247
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 3383 place count 136 transition count 243
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 3387 place count 134 transition count 241
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 3391 place count 134 transition count 237
Performed 38 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 16 with 76 rules applied. Total rules applied 3467 place count 96 transition count 258
Drop transitions removed 11 transitions
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 16 with 44 rules applied. Total rules applied 3511 place count 96 transition count 214
Discarding 23 places :
Symmetric choice reduction at 17 with 23 rule applications. Total rules 3534 place count 73 transition count 175
Iterating global reduction 17 with 23 rules applied. Total rules applied 3557 place count 73 transition count 175
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 17 with 11 rules applied. Total rules applied 3568 place count 73 transition count 164
Discarding 5 places :
Symmetric choice reduction at 18 with 5 rule applications. Total rules 3573 place count 68 transition count 154
Iterating global reduction 18 with 5 rules applied. Total rules applied 3578 place count 68 transition count 154
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 18 with 5 rules applied. Total rules applied 3583 place count 68 transition count 149
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 19 with 17 rules applied. Total rules applied 3600 place count 68 transition count 132
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 3601 place count 67 transition count 129
Iterating global reduction 19 with 1 rules applied. Total rules applied 3602 place count 67 transition count 129
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 3603 place count 66 transition count 128
Iterating global reduction 19 with 1 rules applied. Total rules applied 3604 place count 66 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 3605 place count 66 transition count 127
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 3606 place count 66 transition count 126
Free-agglomeration rule applied 5 times.
Iterating global reduction 20 with 5 rules applied. Total rules applied 3611 place count 66 transition count 121
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 3617 place count 61 transition count 120
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 21 with 2 rules applied. Total rules applied 3619 place count 61 transition count 120
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 3620 place count 61 transition count 119
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 3621 place count 60 transition count 118
Iterating global reduction 21 with 1 rules applied. Total rules applied 3622 place count 60 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 21 with 1 rules applied. Total rules applied 3623 place count 59 transition count 117
Applied a total of 3623 rules in 312 ms. Remains 59 /2584 variables (removed 2525) and now considering 117/3094 (removed 2977) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 312 ms. Remains : 59/2584 places, 117/3094 transitions.
Normalized transition count is 111 out of 117 initially.
// Phase 1: matrix 111 rows 59 cols
[2024-05-21 15:40:08] [INFO ] Computed 4 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 25245 resets, run finished after 887 ms. (steps per millisecond=1127 ) properties (out of 11) seen :10
FORMULA CloudReconfiguration-PT-303-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 7634 resets, run finished after 277 ms. (steps per millisecond=3610 ) properties (out of 1) seen :0
[2024-05-21 15:40:09] [INFO ] Flow matrix only has 111 transitions (discarded 6 similar events)
// Phase 1: matrix 111 rows 59 cols
[2024-05-21 15:40:09] [INFO ] Computed 4 invariants in 6 ms
[2024-05-21 15:40:09] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 15:40:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:40:09] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-21 15:40:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:40:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 15:40:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:40:09] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-21 15:40:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:40:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-21 15:40:09] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 3 ms to minimize.
[2024-05-21 15:40:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
Current structural bounds on expressions (after SMT) : [0] Max seen :[0]
FORMULA CloudReconfiguration-PT-303-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 76339 ms.

BK_STOP 1716306010664

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="CloudReconfiguration-PT-303"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is CloudReconfiguration-PT-303, 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 r109-tall-171624207800081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-303.tgz
mv CloudReconfiguration-PT-303 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;