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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 6.2K Apr 29 14:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 29 14:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 14:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 29 14:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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-312-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652671161566

Running Version 202205111006
[2022-05-16 03:19:23] [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 03:19:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 03:19:24] [INFO ] Load time of PNML (sax parser for PT used): 498 ms
[2022-05-16 03:19:24] [INFO ] Transformed 2585 places.
[2022-05-16 03:19:24] [INFO ] Transformed 3095 transitions.
[2022-05-16 03:19:24] [INFO ] Found NUPN structural information;
[2022-05-16 03:19:24] [INFO ] Parsed PT model containing 2585 places and 3095 transitions in 761 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
// Phase 1: matrix 3095 rows 2585 cols
[2022-05-16 03:19:24] [INFO ] Computed 4 place invariants in 79 ms
Incomplete random walk after 10000 steps, including 72 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :2
FORMULA CloudReconfiguration-PT-312-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-312-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :1
FORMULA CloudReconfiguration-PT-312-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 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 19 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 19 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :0
// Phase 1: matrix 3095 rows 2585 cols
[2022-05-16 03:19:25] [INFO ] Computed 4 place invariants in 63 ms
[2022-05-16 03:19:26] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 72 ms returned sat
[2022-05-16 03:19:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 03:19:28] [INFO ] [Real]Absence check using state equation in 2383 ms returned sat
[2022-05-16 03:19:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 03:19:29] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 72 ms returned sat
[2022-05-16 03:19:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 03:19:31] [INFO ] [Nat]Absence check using state equation in 1839 ms returned sat
[2022-05-16 03:19:32] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 263 ms.
[2022-05-16 03:19:34] [INFO ] Added : 30 causal constraints over 6 iterations in 2379 ms. Result :unknown
[2022-05-16 03:19:35] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 97 ms returned sat
[2022-05-16 03:19:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 03:19:37] [INFO ] [Real]Absence check using state equation in 1970 ms returned sat
[2022-05-16 03:19:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 03:19:38] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 71 ms returned sat
[2022-05-16 03:19:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 03:19:40] [INFO ] [Nat]Absence check using state equation in 2150 ms returned sat
[2022-05-16 03:19:40] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 369 ms.
[2022-05-16 03:19:42] [INFO ] Added : 25 causal constraints over 5 iterations in 1892 ms. Result :unknown
[2022-05-16 03:19:43] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-16 03:19:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 03:19:45] [INFO ] [Real]Absence check using state equation in 1981 ms returned sat
[2022-05-16 03:19:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 03:19:46] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-16 03:19:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 03:19:47] [INFO ] [Nat]Absence check using state equation in 1775 ms returned sat
[2022-05-16 03:19:48] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 346 ms.
[2022-05-16 03:19:50] [INFO ] Added : 40 causal constraints over 8 iterations in 2456 ms. Result :unknown
[2022-05-16 03:19:51] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 63 ms returned sat
[2022-05-16 03:19:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 03:19:53] [INFO ] [Real]Absence check using state equation in 1974 ms returned sat
[2022-05-16 03:19:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 03:19:54] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-16 03:19:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 03:19:55] [INFO ] [Nat]Absence check using state equation in 1770 ms returned sat
[2022-05-16 03:19:56] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 341 ms.
[2022-05-16 03:19:58] [INFO ] Added : 45 causal constraints over 9 iterations in 2451 ms. Result :unknown
[2022-05-16 03:19:59] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 63 ms returned sat
[2022-05-16 03:19:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 03:20:01] [INFO ] [Real]Absence check using state equation in 1836 ms returned sat
[2022-05-16 03:20:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 03:20:01] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-16 03:20:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 03:20:03] [INFO ] [Nat]Absence check using state equation in 1740 ms returned sat
[2022-05-16 03:20:03] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 215 ms.
[2022-05-16 03:20:06] [INFO ] Added : 40 causal constraints over 8 iterations in 2677 ms. Result :unknown
[2022-05-16 03:20:07] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 64 ms returned sat
[2022-05-16 03:20:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 03:20:09] [INFO ] [Real]Absence check using state equation in 1796 ms returned sat
[2022-05-16 03:20:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 03:20:10] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 91 ms returned sat
[2022-05-16 03:20:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 03:20:12] [INFO ] [Nat]Absence check using state equation in 1983 ms returned sat
[2022-05-16 03:20:12] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 196 ms.
[2022-05-16 03:20:14] [INFO ] Added : 35 causal constraints over 7 iterations in 2047 ms. Result :unknown
[2022-05-16 03:20:15] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 99 ms returned sat
[2022-05-16 03:20:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 03:20:17] [INFO ] [Real]Absence check using state equation in 2090 ms returned sat
[2022-05-16 03:20:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 03:20:17] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 71 ms returned sat
[2022-05-16 03:20:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 03:20:19] [INFO ] [Nat]Absence check using state equation in 1964 ms returned sat
[2022-05-16 03:20:20] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 305 ms.
[2022-05-16 03:20:22] [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 6
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 03:20:23] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 62 ms returned sat
[2022-05-16 03:20:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 03:20:25] [INFO ] [Real]Absence check using state equation in 1773 ms returned sat
[2022-05-16 03:20:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 03:20:25] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 75 ms returned sat
[2022-05-16 03:20:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 03:20:27] [INFO ] [Nat]Absence check using state equation in 1790 ms returned sat
[2022-05-16 03:20:27] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 207 ms.
[2022-05-16 03:20:30] [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 03:20:31] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 64 ms returned sat
[2022-05-16 03:20:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 03:20:33] [INFO ] [Real]Absence check using state equation in 1998 ms returned sat
[2022-05-16 03:20:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 03:20:33] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 76 ms returned sat
[2022-05-16 03:20:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 03:20:35] [INFO ] [Nat]Absence check using state equation in 1808 ms returned sat
[2022-05-16 03:20:36] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 189 ms.
[2022-05-16 03:20:38] [INFO ] Added : 40 causal constraints over 8 iterations in 2527 ms. Result :unknown
[2022-05-16 03:20:39] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 65 ms returned sat
[2022-05-16 03:20:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 03:20:41] [INFO ] [Real]Absence check using state equation in 1759 ms returned sat
[2022-05-16 03:20:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 03:20:41] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-16 03:20:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 03:20:43] [INFO ] [Nat]Absence check using state equation in 2145 ms returned sat
[2022-05-16 03:20:44] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 191 ms.
[2022-05-16 03:20:46] [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 03:20:47] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 63 ms returned sat
[2022-05-16 03:20:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 03:20:48] [INFO ] [Real]Absence check using state equation in 1847 ms returned sat
[2022-05-16 03:20:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 03:20:49] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 103 ms returned sat
[2022-05-16 03:20:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 03:20:51] [INFO ] [Nat]Absence check using state equation in 2175 ms returned sat
[2022-05-16 03:20:52] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 316 ms.
[2022-05-16 03:20:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 03:20:55] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 99 ms returned sat
[2022-05-16 03:20:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 03:20:57] [INFO ] [Real]Absence check using state equation in 1957 ms returned sat
[2022-05-16 03:20:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 03:20:57] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-16 03:20:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 03:20:59] [INFO ] [Nat]Absence check using state equation in 1921 ms returned sat
[2022-05-16 03:20:59] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 193 ms.
[2022-05-16 03:21:02] [INFO ] Added : 40 causal constraints over 8 iterations in 2492 ms. Result :unknown
[2022-05-16 03:21:03] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 72 ms returned sat
[2022-05-16 03:21:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 03:21:04] [INFO ] [Real]Absence check using state equation in 1633 ms returned sat
[2022-05-16 03:21:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 03:21:05] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 90 ms returned sat
[2022-05-16 03:21:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 03:21:07] [INFO ] [Nat]Absence check using state equation in 1804 ms returned sat
[2022-05-16 03:21:07] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 310 ms.
[2022-05-16 03:21:09] [INFO ] Added : 35 causal constraints over 7 iterations in 2399 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 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, 0]
FORMULA CloudReconfiguration-PT-312-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 12 out of 2585 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2926 edges and 2585 vertex of which 841 / 2585 are part of one of the 60 SCC in 29 ms
Free SCC test removed 781 places
Drop transitions removed 955 transitions
Reduce isomorphic transitions removed 955 transitions.
Graph (complete) has 2420 edges and 1804 vertex of which 1790 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.23 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 1790 transition count 929
Reduce places removed 1193 places and 0 transitions.
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 1 with 1329 rules applied. Total rules applied 2533 place count 597 transition count 793
Reduce places removed 62 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 71 rules applied. Total rules applied 2604 place count 535 transition count 784
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 2616 place count 532 transition count 775
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 with 11 rules applied. Total rules applied 2627 place count 526 transition count 770
Reduce places removed 2 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 5 with 11 rules applied. Total rules applied 2638 place count 524 transition count 761
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 2649 place count 515 transition count 759
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2650 place count 514 transition count 759
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 22 Pre rules applied. Total rules applied 2650 place count 514 transition count 737
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 8 with 44 rules applied. Total rules applied 2694 place count 492 transition count 737
Discarding 81 places :
Symmetric choice reduction at 8 with 81 rule applications. Total rules 2775 place count 411 transition count 656
Iterating global reduction 8 with 81 rules applied. Total rules applied 2856 place count 411 transition count 656
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2857 place count 411 transition count 655
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 9 Pre rules applied. Total rules applied 2857 place count 411 transition count 646
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 2875 place count 402 transition count 646
Discarding 60 places :
Symmetric choice reduction at 9 with 60 rule applications. Total rules 2935 place count 342 transition count 586
Iterating global reduction 9 with 60 rules applied. Total rules applied 2995 place count 342 transition count 586
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 9 with 35 rules applied. Total rules applied 3030 place count 342 transition count 551
Reduce places removed 17 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 10 with 29 rules applied. Total rules applied 3059 place count 325 transition count 539
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 3065 place count 319 transition count 539
Discarding 20 places :
Symmetric choice reduction at 12 with 20 rule applications. Total rules 3085 place count 299 transition count 508
Iterating global reduction 12 with 20 rules applied. Total rules applied 3105 place count 299 transition count 508
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 3113 place count 299 transition count 500
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 3122 place count 290 transition count 482
Iterating global reduction 13 with 9 rules applied. Total rules applied 3131 place count 290 transition count 482
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 3134 place count 287 transition count 476
Iterating global reduction 13 with 3 rules applied. Total rules applied 3137 place count 287 transition count 476
Performed 148 Post agglomeration using F-continuation condition with reduction of 77 identical transitions.
Deduced a syphon composed of 148 places in 1 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 13 with 296 rules applied. Total rules applied 3433 place count 139 transition count 251
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 3435 place count 139 transition count 249
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 14 with 6 rules applied. Total rules applied 3441 place count 136 transition count 246
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 3447 place count 136 transition count 240
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 3453 place count 133 transition count 237
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 3459 place count 133 transition count 231
Performed 36 Post agglomeration using F-continuation condition with reduction of 19 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 16 with 72 rules applied. Total rules applied 3531 place count 97 transition count 262
Drop transitions removed 20 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 16 with 45 rules applied. Total rules applied 3576 place count 97 transition count 217
Discarding 21 places :
Symmetric choice reduction at 17 with 21 rule applications. Total rules 3597 place count 76 transition count 189
Iterating global reduction 17 with 21 rules applied. Total rules applied 3618 place count 76 transition count 189
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 17 with 10 rules applied. Total rules applied 3628 place count 76 transition count 179
Discarding 3 places :
Symmetric choice reduction at 18 with 3 rule applications. Total rules 3631 place count 73 transition count 173
Iterating global reduction 18 with 3 rules applied. Total rules applied 3634 place count 73 transition count 173
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 3636 place count 73 transition count 171
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 3657 place count 73 transition count 150
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 3658 place count 72 transition count 147
Iterating global reduction 19 with 1 rules applied. Total rules applied 3659 place count 72 transition count 147
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 3660 place count 71 transition count 146
Iterating global reduction 19 with 1 rules applied. Total rules applied 3661 place count 71 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 3662 place count 71 transition count 145
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 3663 place count 71 transition count 144
Free-agglomeration rule applied 5 times.
Iterating global reduction 20 with 5 rules applied. Total rules applied 3668 place count 71 transition count 139
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 20 with 5 rules applied. Total rules applied 3673 place count 66 transition count 139
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 3674 place count 66 transition count 138
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 3675 place count 66 transition count 138
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 3676 place count 66 transition count 138
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 3677 place count 66 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 22 with 1 rules applied. Total rules applied 3678 place count 65 transition count 136
Applied a total of 3678 rules in 613 ms. Remains 65 /2585 variables (removed 2520) and now considering 136/3095 (removed 2959) transitions.
Finished structural reductions, in 1 iterations. Remains : 65/2585 places, 136/3095 transitions.
Normalized transition count is 131 out of 136 initially.
// Phase 1: matrix 131 rows 65 cols
[2022-05-16 03:21:10] [INFO ] Computed 4 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 13156 resets, run finished after 1276 ms. (steps per millisecond=783 ) properties (out of 12) seen :12
FORMULA CloudReconfiguration-PT-312-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-312-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-312-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-312-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-312-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-312-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-312-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-312-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-312-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-312-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-312-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-312-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 108275 ms.

BK_STOP 1652671271952

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

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