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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 880K
-rw-r--r-- 1 mcc users 6.2K Apr 29 14:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 29 14:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 29 14:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 14:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:20 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-311-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652667152678

Running Version 202205111006
[2022-05-16 02:12:34] [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-16 02:12:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 02:12:35] [INFO ] Load time of PNML (sax parser for PT used): 398 ms
[2022-05-16 02:12:35] [INFO ] Transformed 2585 places.
[2022-05-16 02:12:35] [INFO ] Transformed 3095 transitions.
[2022-05-16 02:12:35] [INFO ] Found NUPN structural information;
[2022-05-16 02:12:35] [INFO ] Parsed PT model containing 2585 places and 3095 transitions in 593 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 3095 rows 2585 cols
[2022-05-16 02:12:35] [INFO ] Computed 4 place invariants in 89 ms
Incomplete random walk after 10000 steps, including 99 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :2
FORMULA CloudReconfiguration-PT-311-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :1
FORMULA CloudReconfiguration-PT-311-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :1
FORMULA CloudReconfiguration-PT-311-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 3095 rows 2585 cols
[2022-05-16 02:12:36] [INFO ] Computed 4 place invariants in 38 ms
[2022-05-16 02:12:37] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 73 ms returned sat
[2022-05-16 02:12:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:12:39] [INFO ] [Real]Absence check using state equation in 1857 ms returned sat
[2022-05-16 02:12:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:12:40] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-16 02:12:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:12:41] [INFO ] [Nat]Absence check using state equation in 1929 ms returned sat
[2022-05-16 02:12:42] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 306 ms.
[2022-05-16 02:12:44] [INFO ] Added : 30 causal constraints over 6 iterations in 2385 ms. Result :unknown
[2022-05-16 02:12:45] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 02:12:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:12:47] [INFO ] [Real]Absence check using state equation in 2123 ms returned sat
[2022-05-16 02:12:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:12:48] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 71 ms returned sat
[2022-05-16 02:12:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:12:50] [INFO ] [Nat]Absence check using state equation in 2129 ms returned sat
[2022-05-16 02:12:50] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 192 ms.
[2022-05-16 02:12:52] [INFO ] Added : 40 causal constraints over 8 iterations in 1950 ms. Result :unknown
[2022-05-16 02:12:53] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-16 02:12:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:12:55] [INFO ] [Real]Absence check using state equation in 2116 ms returned sat
[2022-05-16 02:12:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:12:56] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-16 02:12:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:12:58] [INFO ] [Nat]Absence check using state equation in 2453 ms returned sat
[2022-05-16 02:12:59] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 175 ms.
[2022-05-16 02:13: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 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-16 02:13:01] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-16 02:13:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:13:03] [INFO ] [Real]Absence check using state equation in 1958 ms returned sat
[2022-05-16 02:13:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:13:04] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-16 02:13:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:13:06] [INFO ] [Nat]Absence check using state equation in 1911 ms returned sat
[2022-05-16 02:13:06] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 282 ms.
[2022-05-16 02:13:08] [INFO ] Added : 40 causal constraints over 8 iterations in 2446 ms. Result :unknown
[2022-05-16 02:13:09] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-16 02:13:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:13:11] [INFO ] [Real]Absence check using state equation in 1857 ms returned sat
[2022-05-16 02:13:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:13:11] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 70 ms returned sat
[2022-05-16 02:13:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:13:13] [INFO ] [Nat]Absence check using state equation in 1879 ms returned sat
[2022-05-16 02:13:14] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 199 ms.
[2022-05-16 02:13:16] [INFO ] Added : 45 causal constraints over 9 iterations in 2482 ms. Result :unknown
[2022-05-16 02:13:17] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 02:13:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:13:19] [INFO ] [Real]Absence check using state equation in 2183 ms returned sat
[2022-05-16 02:13:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:13:20] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 70 ms returned sat
[2022-05-16 02:13:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:13:22] [INFO ] [Nat]Absence check using state equation in 2039 ms returned sat
[2022-05-16 02:13:22] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 280 ms.
[2022-05-16 02:13:24] [INFO ] Added : 50 causal constraints over 10 iterations in 2177 ms. Result :unknown
[2022-05-16 02:13:25] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 02:13:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:13:27] [INFO ] [Real]Absence check using state equation in 2051 ms returned sat
[2022-05-16 02:13:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:13:27] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 71 ms returned sat
[2022-05-16 02:13:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:13:29] [INFO ] [Nat]Absence check using state equation in 2050 ms returned sat
[2022-05-16 02:13:30] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 213 ms.
[2022-05-16 02:13:32] [INFO ] Added : 55 causal constraints over 11 iterations in 2268 ms. Result :unknown
[2022-05-16 02:13:33] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-16 02:13:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:13:35] [INFO ] [Real]Absence check using state equation in 2107 ms returned sat
[2022-05-16 02:13:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:13:36] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 70 ms returned sat
[2022-05-16 02:13:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:13:38] [INFO ] [Nat]Absence check using state equation in 2139 ms returned sat
[2022-05-16 02:13:38] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 205 ms.
[2022-05-16 02:13:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
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-16 02:13:41] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 02:13:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:13:43] [INFO ] [Real]Absence check using state equation in 1843 ms returned sat
[2022-05-16 02:13:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:13:43] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 02:13:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:13:45] [INFO ] [Nat]Absence check using state equation in 1878 ms returned sat
[2022-05-16 02:13:46] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 196 ms.
[2022-05-16 02:13:48] [INFO ] Added : 45 causal constraints over 9 iterations in 2491 ms. Result :unknown
[2022-05-16 02:13:49] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 65 ms returned sat
[2022-05-16 02:13:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:13:51] [INFO ] [Real]Absence check using state equation in 2072 ms returned sat
[2022-05-16 02:13:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:13:52] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-16 02:13:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:13:54] [INFO ] [Nat]Absence check using state equation in 2024 ms returned sat
[2022-05-16 02:13:54] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 285 ms.
[2022-05-16 02:13:56] [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-16 02:13:57] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-16 02:13:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:13:59] [INFO ] [Real]Absence check using state equation in 1950 ms returned sat
[2022-05-16 02:13:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:14:00] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 02:14:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:14:02] [INFO ] [Nat]Absence check using state equation in 1982 ms returned sat
[2022-05-16 02:14:02] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 202 ms.
[2022-05-16 02:14:04] [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 10
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-16 02:14:05] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-16 02:14:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:14:07] [INFO ] [Real]Absence check using state equation in 1874 ms returned sat
[2022-05-16 02:14:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:14:08] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-16 02:14:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:14:09] [INFO ] [Nat]Absence check using state equation in 1677 ms returned sat
[2022-05-16 02:14:10] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 222 ms.
[2022-05-16 02:14:12] [INFO ] Added : 50 causal constraints over 10 iterations in 2471 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-311-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 11 out of 2585 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2935 edges and 2585 vertex of which 881 / 2585 are part of one of the 63 SCC in 24 ms
Free SCC test removed 818 places
Drop transitions removed 998 transitions
Reduce isomorphic transitions removed 998 transitions.
Graph (complete) has 2377 edges and 1767 vertex of which 1753 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.12 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 1173 transitions
Trivial Post-agglo rules discarded 1173 transitions
Performed 1173 trivial Post agglomeration. Transition count delta: 1173
Iterating post reduction 0 with 1182 rules applied. Total rules applied 1184 place count 1753 transition count 906
Reduce places removed 1173 places and 0 transitions.
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 1 with 1312 rules applied. Total rules applied 2496 place count 580 transition count 767
Reduce places removed 63 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 72 rules applied. Total rules applied 2568 place count 517 transition count 758
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 2574 place count 514 transition count 755
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 2578 place count 512 transition count 753
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 5 with 7 rules applied. Total rules applied 2585 place count 511 transition count 747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2591 place count 505 transition count 747
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 2591 place count 505 transition count 725
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 2635 place count 483 transition count 725
Discarding 79 places :
Symmetric choice reduction at 7 with 79 rule applications. Total rules 2714 place count 404 transition count 646
Iterating global reduction 7 with 79 rules applied. Total rules applied 2793 place count 404 transition count 646
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 2795 place count 404 transition count 644
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2796 place count 403 transition count 644
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 9 Pre rules applied. Total rules applied 2796 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 9 with 18 rules applied. Total rules applied 2814 place count 394 transition count 635
Discarding 59 places :
Symmetric choice reduction at 9 with 59 rule applications. Total rules 2873 place count 335 transition count 576
Iterating global reduction 9 with 59 rules applied. Total rules applied 2932 place count 335 transition count 576
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 32 rules applied. Total rules applied 2964 place count 335 transition count 544
Reduce places removed 16 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 24 rules applied. Total rules applied 2988 place count 319 transition count 536
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 2992 place count 315 transition count 536
Discarding 19 places :
Symmetric choice reduction at 12 with 19 rule applications. Total rules 3011 place count 296 transition count 506
Iterating global reduction 12 with 19 rules applied. Total rules applied 3030 place count 296 transition count 506
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 3037 place count 296 transition count 499
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 3046 place count 287 transition count 481
Iterating global reduction 13 with 9 rules applied. Total rules applied 3055 place count 287 transition count 481
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 3058 place count 284 transition count 475
Iterating global reduction 13 with 3 rules applied. Total rules applied 3061 place count 284 transition count 475
Performed 150 Post agglomeration using F-continuation condition with reduction of 79 identical transitions.
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 13 with 300 rules applied. Total rules applied 3361 place count 134 transition count 246
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 3364 place count 134 transition count 243
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 3370 place count 131 transition count 240
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 3376 place count 131 transition count 234
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 15 with 6 rules applied. Total rules applied 3382 place count 128 transition count 231
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 3388 place count 128 transition count 225
Performed 32 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 16 with 64 rules applied. Total rules applied 3452 place count 96 transition count 259
Drop transitions removed 10 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 16 with 34 rules applied. Total rules applied 3486 place count 96 transition count 225
Discarding 21 places :
Symmetric choice reduction at 17 with 21 rule applications. Total rules 3507 place count 75 transition count 190
Iterating global reduction 17 with 21 rules applied. Total rules applied 3528 place count 75 transition count 190
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 17 with 12 rules applied. Total rules applied 3540 place count 75 transition count 178
Discarding 5 places :
Symmetric choice reduction at 18 with 5 rule applications. Total rules 3545 place count 70 transition count 168
Iterating global reduction 18 with 5 rules applied. Total rules applied 3550 place count 70 transition count 168
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 3554 place count 70 transition count 164
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 19 with 14 rules applied. Total rules applied 3568 place count 70 transition count 150
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 3569 place count 69 transition count 147
Iterating global reduction 19 with 1 rules applied. Total rules applied 3570 place count 69 transition count 147
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 3571 place count 68 transition count 146
Iterating global reduction 19 with 1 rules applied. Total rules applied 3572 place count 68 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 3573 place count 68 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 3575 place count 67 transition count 144
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 3576 place count 67 transition count 143
Free-agglomeration rule applied 6 times.
Iterating global reduction 20 with 6 rules applied. Total rules applied 3582 place count 67 transition count 137
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 20 with 9 rules applied. Total rules applied 3591 place count 61 transition count 134
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 3592 place count 61 transition count 133
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 21 with 2 rules applied. Total rules applied 3594 place count 61 transition count 133
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 3595 place count 61 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 21 with 1 rules applied. Total rules applied 3596 place count 60 transition count 131
Applied a total of 3596 rules in 416 ms. Remains 60 /2585 variables (removed 2525) and now considering 131/3095 (removed 2964) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/2585 places, 131/3095 transitions.
Normalized transition count is 123 out of 131 initially.
// Phase 1: matrix 123 rows 60 cols
[2022-05-16 02:14:13] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 14778 resets, run finished after 1558 ms. (steps per millisecond=641 ) properties (out of 11) seen :11
FORMULA CloudReconfiguration-PT-311-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 99777 ms.

BK_STOP 1652667254680

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

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