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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 5.8K Apr 29 14:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 29 14:34 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 3.7K May 9 07:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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-313-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-313-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-313-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-313-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-313-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-313-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-313-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-313-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-313-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-313-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-313-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-313-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-313-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-313-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-313-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-313-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652673045867

Running Version 202205111006
[2022-05-16 03:50:47] [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:50:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 03:50:48] [INFO ] Load time of PNML (sax parser for PT used): 454 ms
[2022-05-16 03:50:48] [INFO ] Transformed 2585 places.
[2022-05-16 03:50:48] [INFO ] Transformed 3095 transitions.
[2022-05-16 03:50:48] [INFO ] Found NUPN structural information;
[2022-05-16 03:50:48] [INFO ] Parsed PT model containing 2585 places and 3095 transitions in 725 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
// Phase 1: matrix 3095 rows 2585 cols
[2022-05-16 03:50:48] [INFO ] Computed 4 place invariants in 78 ms
Incomplete random walk after 10000 steps, including 70 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 16) seen :4
FORMULA CloudReconfiguration-PT-313-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-313-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-313-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-313-UpperBounds-02 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :1
FORMULA CloudReconfiguration-PT-313-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
// Phase 1: matrix 3095 rows 2585 cols
[2022-05-16 03:50:49] [INFO ] Computed 4 place invariants in 24 ms
[2022-05-16 03:50:50] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 97 ms returned sat
[2022-05-16 03:50:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 03:50:52] [INFO ] [Real]Absence check using state equation in 2046 ms returned sat
[2022-05-16 03:50:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 03:50:53] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 123 ms returned sat
[2022-05-16 03:50:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 03:50:55] [INFO ] [Nat]Absence check using state equation in 2077 ms returned sat
[2022-05-16 03:50:56] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 334 ms.
[2022-05-16 03:50:57] [INFO ] Added : 20 causal constraints over 4 iterations in 1757 ms. Result :unknown
[2022-05-16 03:50:58] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-16 03:50:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 03:51:00] [INFO ] [Real]Absence check using state equation in 1702 ms returned sat
[2022-05-16 03:51:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 03:51:01] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-16 03:51:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 03:51:03] [INFO ] [Nat]Absence check using state equation in 1945 ms returned sat
[2022-05-16 03:51:03] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 372 ms.
[2022-05-16 03:51:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:51:06] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 03:51:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 03:51:08] [INFO ] [Real]Absence check using state equation in 2048 ms returned sat
[2022-05-16 03:51:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 03:51:09] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 112 ms returned sat
[2022-05-16 03:51:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 03:51:11] [INFO ] [Nat]Absence check using state equation in 2016 ms returned sat
[2022-05-16 03:51:11] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 191 ms.
[2022-05-16 03:51:13] [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 03:51:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 03:51:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 03:51:16] [INFO ] [Real]Absence check using state equation in 2372 ms returned sat
[2022-05-16 03:51:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 03:51:17] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-16 03:51:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 03:51:19] [INFO ] [Nat]Absence check using state equation in 2107 ms returned sat
[2022-05-16 03:51:20] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 312 ms.
[2022-05-16 03:51:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:51:22] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-16 03:51:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 03:51:24] [INFO ] [Real]Absence check using state equation in 2064 ms returned sat
[2022-05-16 03:51:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 03:51:25] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-16 03:51:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 03:51:27] [INFO ] [Nat]Absence check using state equation in 1865 ms returned sat
[2022-05-16 03:51:28] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 220 ms.
[2022-05-16 03:51:29] [INFO ] Added : 45 causal constraints over 9 iterations in 2156 ms. Result :unknown
[2022-05-16 03:51:30] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 73 ms returned sat
[2022-05-16 03:51:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 03:51:32] [INFO ] [Real]Absence check using state equation in 2178 ms returned sat
[2022-05-16 03:51:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 03:51:33] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 03:51:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 03:51:35] [INFO ] [Nat]Absence check using state equation in 2012 ms returned sat
[2022-05-16 03:51:36] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 295 ms.
[2022-05-16 03:51:38] [INFO ] Added : 45 causal constraints over 9 iterations in 2338 ms. Result :unknown
[2022-05-16 03:51:38] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-16 03:51:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 03:51:41] [INFO ] [Real]Absence check using state equation in 2234 ms returned sat
[2022-05-16 03:51:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 03:51:42] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 107 ms returned sat
[2022-05-16 03:51:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 03:51:44] [INFO ] [Nat]Absence check using state equation in 2153 ms returned sat
[2022-05-16 03:51:44] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 226 ms.
[2022-05-16 03:51: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 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:51:47] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 77 ms returned sat
[2022-05-16 03:51:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 03:51:49] [INFO ] [Real]Absence check using state equation in 2173 ms returned sat
[2022-05-16 03:51:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 03:51:50] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-16 03:51:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 03:51:52] [INFO ] [Nat]Absence check using state equation in 1787 ms returned sat
[2022-05-16 03:51:52] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 207 ms.
[2022-05-16 03:51:54] [INFO ] Added : 40 causal constraints over 8 iterations in 2341 ms. Result :unknown
[2022-05-16 03:51:55] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-16 03:51:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 03:51:57] [INFO ] [Real]Absence check using state equation in 2243 ms returned sat
[2022-05-16 03:51:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 03:51:58] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 117 ms returned sat
[2022-05-16 03:51:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 03:52:00] [INFO ] [Nat]Absence check using state equation in 2274 ms returned sat
[2022-05-16 03:52:01] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 246 ms.
[2022-05-16 03:52:02] [INFO ] Added : 25 causal constraints over 5 iterations in 1931 ms. Result :unknown
[2022-05-16 03:52:03] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 94 ms returned sat
[2022-05-16 03:52:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 03:52:05] [INFO ] [Real]Absence check using state equation in 2045 ms returned sat
[2022-05-16 03:52:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 03:52:06] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-16 03:52:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 03:52:08] [INFO ] [Nat]Absence check using state equation in 1955 ms returned sat
[2022-05-16 03:52:09] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 297 ms.
[2022-05-16 03:52:11] [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:52:11] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-16 03:52:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 03:52:13] [INFO ] [Real]Absence check using state equation in 1997 ms returned sat
[2022-05-16 03:52:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 03:52:14] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-16 03:52:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 03:52:17] [INFO ] [Nat]Absence check using state equation in 2130 ms returned sat
[2022-05-16 03:52:17] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 348 ms.
[2022-05-16 03:52:19] [INFO ] Added : 25 causal constraints over 5 iterations in 1887 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 11 out of 2585 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2932 edges and 2585 vertex of which 855 / 2585 are part of one of the 62 SCC in 100 ms
Free SCC test removed 793 places
Drop transitions removed 969 transitions
Reduce isomorphic transitions removed 969 transitions.
Graph (complete) has 2406 edges and 1792 vertex of which 1778 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.18 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 1778 transition count 915
Reduce places removed 1193 places and 0 transitions.
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 1 with 1333 rules applied. Total rules applied 2537 place count 585 transition count 775
Reduce places removed 65 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 74 rules applied. Total rules applied 2611 place count 520 transition count 766
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 2623 place count 517 transition count 757
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 2634 place count 511 transition count 752
Reduce places removed 2 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 5 with 9 rules applied. Total rules applied 2643 place count 509 transition count 745
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2650 place count 502 transition count 745
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 20 Pre rules applied. Total rules applied 2650 place count 502 transition count 725
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 2690 place count 482 transition count 725
Discarding 78 places :
Symmetric choice reduction at 7 with 78 rule applications. Total rules 2768 place count 404 transition count 647
Iterating global reduction 7 with 78 rules applied. Total rules applied 2846 place count 404 transition count 647
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 2848 place count 404 transition count 645
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 9 Pre rules applied. Total rules applied 2848 place count 404 transition count 636
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 2866 place count 395 transition count 636
Discarding 59 places :
Symmetric choice reduction at 8 with 59 rule applications. Total rules 2925 place count 336 transition count 577
Iterating global reduction 8 with 59 rules applied. Total rules applied 2984 place count 336 transition count 577
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 8 with 35 rules applied. Total rules applied 3019 place count 336 transition count 542
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 9 with 27 rules applied. Total rules applied 3046 place count 319 transition count 532
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 10 with 6 rules applied. Total rules applied 3052 place count 314 transition count 531
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 3054 place count 313 transition count 530
Discarding 20 places :
Symmetric choice reduction at 12 with 20 rule applications. Total rules 3074 place count 293 transition count 499
Iterating global reduction 12 with 20 rules applied. Total rules applied 3094 place count 293 transition count 499
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 3103 place count 293 transition count 490
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 3109 place count 287 transition count 478
Iterating global reduction 13 with 6 rules applied. Total rules applied 3115 place count 287 transition count 478
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 3118 place count 284 transition count 472
Iterating global reduction 13 with 3 rules applied. Total rules applied 3121 place count 284 transition count 472
Performed 147 Post agglomeration using F-continuation condition with reduction of 76 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 13 with 294 rules applied. Total rules applied 3415 place count 137 transition count 249
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 3417 place count 137 transition count 247
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 3423 place count 134 transition count 244
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 3429 place count 134 transition count 238
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 15 with 2 rules applied. Total rules applied 3431 place count 133 transition count 237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 3433 place count 133 transition count 235
Performed 37 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 16 with 74 rules applied. Total rules applied 3507 place count 96 transition count 268
Drop transitions removed 21 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 16 with 50 rules applied. Total rules applied 3557 place count 96 transition count 218
Discarding 22 places :
Symmetric choice reduction at 17 with 22 rule applications. Total rules 3579 place count 74 transition count 189
Iterating global reduction 17 with 22 rules applied. Total rules applied 3601 place count 74 transition count 189
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 17 with 12 rules applied. Total rules applied 3613 place count 74 transition count 177
Discarding 4 places :
Symmetric choice reduction at 18 with 4 rule applications. Total rules 3617 place count 70 transition count 169
Iterating global reduction 18 with 4 rules applied. Total rules applied 3621 place count 70 transition count 169
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 3625 place count 70 transition count 165
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 3646 place count 70 transition count 144
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 3647 place count 69 transition count 141
Iterating global reduction 19 with 1 rules applied. Total rules applied 3648 place count 69 transition count 141
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 3649 place count 68 transition count 140
Iterating global reduction 19 with 1 rules applied. Total rules applied 3650 place count 68 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 3651 place count 68 transition count 139
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 3652 place count 68 transition count 138
Free-agglomeration rule applied 4 times.
Iterating global reduction 20 with 4 rules applied. Total rules applied 3656 place count 68 transition count 134
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 3660 place count 64 transition count 134
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 21 with 2 rules applied. Total rules applied 3662 place count 64 transition count 132
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 21 with 4 rules applied. Total rules applied 3666 place count 64 transition count 132
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 21 with 2 rules applied. Total rules applied 3668 place count 64 transition count 130
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 3669 place count 63 transition count 129
Iterating global reduction 21 with 1 rules applied. Total rules applied 3670 place count 63 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 21 with 1 rules applied. Total rules applied 3671 place count 62 transition count 128
Applied a total of 3671 rules in 706 ms. Remains 62 /2585 variables (removed 2523) and now considering 128/3095 (removed 2967) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/2585 places, 128/3095 transitions.
Normalized transition count is 123 out of 128 initially.
// Phase 1: matrix 123 rows 62 cols
[2022-05-16 03:52:19] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 13621 resets, run finished after 1228 ms. (steps per millisecond=814 ) properties (out of 11) seen :11
FORMULA CloudReconfiguration-PT-313-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-313-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-313-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-313-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-313-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-313-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-313-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-313-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-313-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-313-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-313-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 93425 ms.

BK_STOP 1652673141235

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

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