Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r042-smll-165252095500261.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CloudReconfiguration-PT-307, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-165252095500261
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 6.8K Apr 29 14:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 29 14:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 29 14:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 29 14:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K May 9 07:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 9 07:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 660K May 10 09:33 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652654182179

Running Version 202205111006
[2022-05-15 22:36:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 22:36:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 22:36:24] [INFO ] Load time of PNML (sax parser for PT used): 349 ms
[2022-05-15 22:36:24] [INFO ] Transformed 2584 places.
[2022-05-15 22:36:24] [INFO ] Transformed 3094 transitions.
[2022-05-15 22:36:24] [INFO ] Found NUPN structural information;
[2022-05-15 22:36:24] [INFO ] Parsed PT model containing 2584 places and 3094 transitions in 535 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 3094 rows 2584 cols
[2022-05-15 22:36:25] [INFO ] Computed 4 place invariants in 87 ms
Incomplete random walk after 10000 steps, including 83 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :3
FORMULA CloudReconfiguration-PT-307-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-307-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-307-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :1
FORMULA CloudReconfiguration-PT-307-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 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 22 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
// Phase 1: matrix 3094 rows 2584 cols
[2022-05-15 22:36:25] [INFO ] Computed 4 place invariants in 27 ms
[2022-05-15 22:36:26] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 73 ms returned sat
[2022-05-15 22:36:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:36:28] [INFO ] [Real]Absence check using state equation in 2014 ms returned sat
[2022-05-15 22:36:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:36:29] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-15 22:36:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:36:31] [INFO ] [Nat]Absence check using state equation in 2209 ms returned sat
[2022-05-15 22:36:32] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 293 ms.
[2022-05-15 22:36: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 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 22:36:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-15 22:36:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:36:36] [INFO ] [Real]Absence check using state equation in 1794 ms returned sat
[2022-05-15 22:36:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:36:37] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 107 ms returned sat
[2022-05-15 22:36:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:36:39] [INFO ] [Nat]Absence check using state equation in 2019 ms returned sat
[2022-05-15 22:36:39] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 247 ms.
[2022-05-15 22:36:41] [INFO ] Added : 45 causal constraints over 9 iterations in 2097 ms. Result :unknown
[2022-05-15 22:36:42] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-15 22:36:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:36:44] [INFO ] [Real]Absence check using state equation in 1913 ms returned sat
[2022-05-15 22:36:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:36:45] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 71 ms returned sat
[2022-05-15 22:36:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:36:47] [INFO ] [Nat]Absence check using state equation in 2110 ms returned sat
[2022-05-15 22:36:47] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 303 ms.
[2022-05-15 22:36:49] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 22:36:50] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 22:36:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:36:52] [INFO ] [Real]Absence check using state equation in 1761 ms returned sat
[2022-05-15 22:36:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:36:53] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 71 ms returned sat
[2022-05-15 22:36:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:36:55] [INFO ] [Nat]Absence check using state equation in 2075 ms returned sat
[2022-05-15 22:36:55] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 307 ms.
[2022-05-15 22:36:57] [INFO ] Added : 35 causal constraints over 7 iterations in 2041 ms. Result :unknown
[2022-05-15 22:36:58] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-15 22:36:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:37:00] [INFO ] [Real]Absence check using state equation in 2142 ms returned sat
[2022-05-15 22:37:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:37:01] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 70 ms returned sat
[2022-05-15 22:37:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:37:03] [INFO ] [Nat]Absence check using state equation in 2142 ms returned sat
[2022-05-15 22:37:04] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 293 ms.
[2022-05-15 22:37:05] [INFO ] Added : 35 causal constraints over 7 iterations in 1977 ms. Result :unknown
[2022-05-15 22:37:06] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-15 22:37:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:37:08] [INFO ] [Real]Absence check using state equation in 2072 ms returned sat
[2022-05-15 22:37:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:37:09] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 70 ms returned sat
[2022-05-15 22:37:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:37:11] [INFO ] [Nat]Absence check using state equation in 2097 ms returned sat
[2022-05-15 22:37:11] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 292 ms.
[2022-05-15 22:37:13] [INFO ] Added : 40 causal constraints over 8 iterations in 2080 ms. Result :unknown
[2022-05-15 22:37:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-15 22:37:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:37:16] [INFO ] [Real]Absence check using state equation in 1963 ms returned sat
[2022-05-15 22:37:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:37:17] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-15 22:37:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:37:19] [INFO ] [Nat]Absence check using state equation in 1803 ms returned sat
[2022-05-15 22:37:19] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 211 ms.
[2022-05-15 22:37:21] [INFO ] Added : 45 causal constraints over 9 iterations in 2336 ms. Result :unknown
[2022-05-15 22:37:22] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 22:37:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:37:24] [INFO ] [Real]Absence check using state equation in 1974 ms returned sat
[2022-05-15 22:37:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:37:25] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 71 ms returned sat
[2022-05-15 22:37:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:37:27] [INFO ] [Nat]Absence check using state equation in 1951 ms returned sat
[2022-05-15 22:37:27] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 219 ms.
[2022-05-15 22:37:29] [INFO ] Added : 45 causal constraints over 9 iterations in 2331 ms. Result :unknown
[2022-05-15 22:37:30] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 109 ms returned sat
[2022-05-15 22:37:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:37:32] [INFO ] [Real]Absence check using state equation in 1912 ms returned sat
[2022-05-15 22:37:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:37:33] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 88 ms returned sat
[2022-05-15 22:37:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:37:35] [INFO ] [Nat]Absence check using state equation in 2055 ms returned sat
[2022-05-15 22:37:35] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 199 ms.
[2022-05-15 22:37:37] [INFO ] Added : 55 causal constraints over 11 iterations in 2279 ms. Result :unknown
[2022-05-15 22:37:38] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 22:37:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:37:39] [INFO ] [Real]Absence check using state equation in 1847 ms returned sat
[2022-05-15 22:37:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:37:40] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 71 ms returned sat
[2022-05-15 22:37:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:37:42] [INFO ] [Nat]Absence check using state equation in 1921 ms returned sat
[2022-05-15 22:37:42] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 221 ms.
[2022-05-15 22:37:45] [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 9
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 22:37:45] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-15 22:37:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:37:47] [INFO ] [Real]Absence check using state equation in 1790 ms returned sat
[2022-05-15 22:37:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:37:48] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-15 22:37:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:37:50] [INFO ] [Nat]Absence check using state equation in 1801 ms returned sat
[2022-05-15 22:37:50] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 214 ms.
[2022-05-15 22:37:52] [INFO ] Added : 60 causal constraints over 12 iterations in 2530 ms. Result :unknown
[2022-05-15 22:37:53] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-15 22:37:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 22:37:55] [INFO ] [Real]Absence check using state equation in 1921 ms returned sat
[2022-05-15 22:37:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 22:37:56] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 71 ms returned sat
[2022-05-15 22:37:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 22:37:57] [INFO ] [Nat]Absence check using state equation in 1917 ms returned sat
[2022-05-15 22:37:58] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 194 ms.
[2022-05-15 22:38:00] [INFO ] Added : 60 causal constraints over 12 iterations in 2437 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CloudReconfiguration-PT-307-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 11 out of 2584 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Graph (trivial) has 2931 edges and 2584 vertex of which 852 / 2584 are part of one of the 62 SCC in 25 ms
Free SCC test removed 790 places
Drop transitions removed 966 transitions
Reduce isomorphic transitions removed 966 transitions.
Graph (complete) has 2406 edges and 1794 vertex of which 1780 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.11 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 1193 transitions
Trivial Post-agglo rules discarded 1193 transitions
Performed 1193 trivial Post agglomeration. Transition count delta: 1193
Iterating post reduction 0 with 1202 rules applied. Total rules applied 1204 place count 1780 transition count 917
Reduce places removed 1193 places and 0 transitions.
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 1 with 1333 rules applied. Total rules applied 2537 place count 587 transition count 777
Reduce places removed 64 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 73 rules applied. Total rules applied 2610 place count 523 transition count 768
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 12 rules applied. Total rules applied 2622 place count 520 transition count 759
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 with 12 rules applied. Total rules applied 2634 place count 514 transition count 753
Reduce places removed 3 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 5 with 12 rules applied. Total rules applied 2646 place count 511 transition count 744
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 11 rules applied. Total rules applied 2657 place count 502 transition count 742
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2658 place count 501 transition count 742
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 19 Pre rules applied. Total rules applied 2658 place count 501 transition count 723
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 38 rules applied. Total rules applied 2696 place count 482 transition count 723
Discarding 79 places :
Symmetric choice reduction at 8 with 79 rule applications. Total rules 2775 place count 403 transition count 644
Iterating global reduction 8 with 79 rules applied. Total rules applied 2854 place count 403 transition count 644
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 9 Pre rules applied. Total rules applied 2854 place count 403 transition count 635
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 2872 place count 394 transition count 635
Discarding 61 places :
Symmetric choice reduction at 8 with 61 rule applications. Total rules 2933 place count 333 transition count 574
Iterating global reduction 8 with 61 rules applied. Total rules applied 2994 place count 333 transition count 574
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 36 rules applied. Total rules applied 3030 place count 333 transition count 538
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 9 with 30 rules applied. Total rules applied 3060 place count 315 transition count 526
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 3066 place count 309 transition count 526
Discarding 19 places :
Symmetric choice reduction at 11 with 19 rule applications. Total rules 3085 place count 290 transition count 497
Iterating global reduction 11 with 19 rules applied. Total rules applied 3104 place count 290 transition count 497
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 3113 place count 290 transition count 488
Discarding 7 places :
Symmetric choice reduction at 12 with 7 rule applications. Total rules 3120 place count 283 transition count 474
Iterating global reduction 12 with 7 rules applied. Total rules applied 3127 place count 283 transition count 474
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 3130 place count 280 transition count 468
Iterating global reduction 12 with 3 rules applied. Total rules applied 3133 place count 280 transition count 468
Performed 150 Post agglomeration using F-continuation condition with reduction of 78 identical transitions.
Deduced a syphon composed of 150 places in 0 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 12 with 300 rules applied. Total rules applied 3433 place count 130 transition count 240
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 3436 place count 130 transition count 237
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 3442 place count 127 transition count 234
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3448 place count 127 transition count 228
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 3454 place count 124 transition count 225
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 3460 place count 124 transition count 219
Performed 31 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 15 with 62 rules applied. Total rules applied 3522 place count 93 transition count 262
Drop transitions removed 28 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 15 with 50 rules applied. Total rules applied 3572 place count 93 transition count 212
Discarding 21 places :
Symmetric choice reduction at 16 with 21 rule applications. Total rules 3593 place count 72 transition count 190
Iterating global reduction 16 with 21 rules applied. Total rules applied 3614 place count 72 transition count 190
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 16 with 14 rules applied. Total rules applied 3628 place count 72 transition count 176
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 3629 place count 71 transition count 174
Iterating global reduction 17 with 1 rules applied. Total rules applied 3630 place count 71 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 3631 place count 71 transition count 173
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 18 with 36 rules applied. Total rules applied 3667 place count 71 transition count 137
Discarding 3 places :
Symmetric choice reduction at 18 with 3 rule applications. Total rules 3670 place count 68 transition count 130
Iterating global reduction 18 with 3 rules applied. Total rules applied 3673 place count 68 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 3674 place count 68 transition count 129
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 3675 place count 67 transition count 128
Iterating global reduction 19 with 1 rules applied. Total rules applied 3676 place count 67 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 3677 place count 67 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 3678 place count 67 transition count 126
Free-agglomeration rule applied 3 times.
Iterating global reduction 20 with 3 rules applied. Total rules applied 3681 place count 67 transition count 123
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 3684 place count 64 transition count 123
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 21 with 2 rules applied. Total rules applied 3686 place count 64 transition count 123
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 3687 place count 64 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 22 with 1 rules applied. Total rules applied 3688 place count 63 transition count 121
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2181.t2182.t2183.t2184.t2185.t2186.t2187.t2188.t2189.t2969 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 57 edges and 61 vertex of which 26 / 61 are part of one of the 8 SCC in 0 ms
Free SCC test removed 18 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 22 with 6 rules applied. Total rules applied 3694 place count 43 transition count 116
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 31 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 49 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 23 with 53 rules applied. Total rules applied 3747 place count 40 transition count 66
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 3749 place count 39 transition count 65
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 25 with 10 rules applied. Total rules applied 3759 place count 34 transition count 60
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 25 with 6 rules applied. Total rules applied 3765 place count 34 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 26 with 4 rules applied. Total rules applied 3769 place count 32 transition count 54
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 26 with 7 rules applied. Total rules applied 3776 place count 32 transition count 47
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 27 with 3 rules applied. Total rules applied 3779 place count 32 transition count 44
Free-agglomeration rule applied 9 times.
Iterating global reduction 27 with 9 rules applied. Total rules applied 3788 place count 32 transition count 35
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 27 with 9 rules applied. Total rules applied 3797 place count 23 transition count 35
Applied a total of 3797 rules in 400 ms. Remains 23 /2584 variables (removed 2561) and now considering 35/3094 (removed 3059) transitions.
Finished structural reductions, in 1 iterations. Remains : 23/2584 places, 35/3094 transitions.
Normalized transition count is 33 out of 35 initially.
// Phase 1: matrix 33 rows 23 cols
[2022-05-15 22:38:01] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 38858 resets, run finished after 948 ms. (steps per millisecond=1054 ) properties (out of 11) seen :11
FORMULA CloudReconfiguration-PT-307-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-307-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-307-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-307-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-307-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-307-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-307-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-307-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-307-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-307-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-307-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 97588 ms.

BK_STOP 1652654282051

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-307"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is CloudReconfiguration-PT-307, 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 r042-smll-165252095500261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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