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.r024-tall-165251918600469.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 BusinessProcesses-PT-19, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918600469
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 5.8K Apr 30 00:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 30 00:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 29 23:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 23:59 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:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 189K 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 BusinessProcesses-PT-19-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652639049328

Running Version 202205111006
[2022-05-15 18:24:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 18:24:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 18:24:10] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2022-05-15 18:24:10] [INFO ] Transformed 772 places.
[2022-05-15 18:24:10] [INFO ] Transformed 685 transitions.
[2022-05-15 18:24:10] [INFO ] Found NUPN structural information;
[2022-05-15 18:24:10] [INFO ] Parsed PT model containing 772 places and 685 transitions in 251 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 15 places in 15 ms
Reduce places removed 15 places and 15 transitions.
// Phase 1: matrix 670 rows 757 cols
[2022-05-15 18:24:10] [INFO ] Computed 125 place invariants in 50 ms
Incomplete random walk after 10000 steps, including 55 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :8
FORMULA BusinessProcesses-PT-19-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :3
FORMULA BusinessProcesses-PT-19-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 670 rows 757 cols
[2022-05-15 18:24:11] [INFO ] Computed 125 place invariants in 11 ms
[2022-05-15 18:24:11] [INFO ] [Real]Absence check using 78 positive place invariants in 42 ms returned sat
[2022-05-15 18:24:11] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 17 ms returned sat
[2022-05-15 18:24:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:24:11] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2022-05-15 18:24:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:24:12] [INFO ] [Nat]Absence check using 78 positive place invariants in 28 ms returned sat
[2022-05-15 18:24:12] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 13 ms returned sat
[2022-05-15 18:24:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:24:12] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2022-05-15 18:24:12] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 8 ms to minimize.
[2022-05-15 18:24:12] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 1 ms to minimize.
[2022-05-15 18:24:13] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 1 ms to minimize.
[2022-05-15 18:24:13] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 1 ms to minimize.
[2022-05-15 18:24:13] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 0 ms to minimize.
[2022-05-15 18:24:13] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 0 ms to minimize.
[2022-05-15 18:24:13] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 1 ms to minimize.
[2022-05-15 18:24:14] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 1 ms to minimize.
[2022-05-15 18:24:14] [INFO ] Deduced a trap composed of 162 places in 166 ms of which 0 ms to minimize.
[2022-05-15 18:24:14] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 0 ms to minimize.
[2022-05-15 18:24:14] [INFO ] Deduced a trap composed of 142 places in 182 ms of which 0 ms to minimize.
[2022-05-15 18:24:14] [INFO ] Deduced a trap composed of 144 places in 172 ms of which 1 ms to minimize.
[2022-05-15 18:24:15] [INFO ] Deduced a trap composed of 169 places in 159 ms of which 1 ms to minimize.
[2022-05-15 18:24:15] [INFO ] Deduced a trap composed of 165 places in 168 ms of which 1 ms to minimize.
[2022-05-15 18:24:15] [INFO ] Deduced a trap composed of 76 places in 156 ms of which 0 ms to minimize.
[2022-05-15 18:24:15] [INFO ] Deduced a trap composed of 176 places in 163 ms of which 0 ms to minimize.
[2022-05-15 18:24:15] [INFO ] Deduced a trap composed of 180 places in 163 ms of which 1 ms to minimize.
[2022-05-15 18:24:16] [INFO ] Deduced a trap composed of 164 places in 170 ms of which 0 ms to minimize.
[2022-05-15 18:24:16] [INFO ] Deduced a trap composed of 187 places in 158 ms of which 1 ms to minimize.
[2022-05-15 18:24:16] [INFO ] Deduced a trap composed of 163 places in 160 ms of which 1 ms to minimize.
[2022-05-15 18:24:16] [INFO ] Deduced a trap composed of 161 places in 186 ms of which 1 ms to minimize.
[2022-05-15 18:24:16] [INFO ] Deduced a trap composed of 177 places in 174 ms of which 0 ms to minimize.
[2022-05-15 18:24:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 18:24:17] [INFO ] [Real]Absence check using 78 positive place invariants in 32 ms returned sat
[2022-05-15 18:24:17] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 13 ms returned sat
[2022-05-15 18:24:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:24:17] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2022-05-15 18:24:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:24:17] [INFO ] [Nat]Absence check using 78 positive place invariants in 30 ms returned sat
[2022-05-15 18:24:17] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 13 ms returned sat
[2022-05-15 18:24:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:24:17] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2022-05-15 18:24:18] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 0 ms to minimize.
[2022-05-15 18:24:18] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 1 ms to minimize.
[2022-05-15 18:24:18] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 0 ms to minimize.
[2022-05-15 18:24:18] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 0 ms to minimize.
[2022-05-15 18:24:19] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 0 ms to minimize.
[2022-05-15 18:24:19] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 1 ms to minimize.
[2022-05-15 18:24:19] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 0 ms to minimize.
[2022-05-15 18:24:19] [INFO ] Deduced a trap composed of 144 places in 149 ms of which 1 ms to minimize.
[2022-05-15 18:24:19] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 0 ms to minimize.
[2022-05-15 18:24:19] [INFO ] Deduced a trap composed of 155 places in 152 ms of which 1 ms to minimize.
[2022-05-15 18:24:20] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 1 ms to minimize.
[2022-05-15 18:24:20] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 1 ms to minimize.
[2022-05-15 18:24:20] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 0 ms to minimize.
[2022-05-15 18:24:20] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 0 ms to minimize.
[2022-05-15 18:24:20] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 1 ms to minimize.
[2022-05-15 18:24:21] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 1 ms to minimize.
[2022-05-15 18:24:21] [INFO ] Deduced a trap composed of 139 places in 151 ms of which 0 ms to minimize.
[2022-05-15 18:24:21] [INFO ] Deduced a trap composed of 140 places in 148 ms of which 1 ms to minimize.
[2022-05-15 18:24:21] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 1 ms to minimize.
[2022-05-15 18:24:21] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 0 ms to minimize.
[2022-05-15 18:24:21] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 1 ms to minimize.
[2022-05-15 18:24:22] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 0 ms to minimize.
[2022-05-15 18:24:22] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 1 ms to minimize.
[2022-05-15 18:24:22] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 0 ms to minimize.
[2022-05-15 18:24: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 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.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 18:24:22] [INFO ] [Real]Absence check using 78 positive place invariants in 29 ms returned sat
[2022-05-15 18:24:22] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 14 ms returned sat
[2022-05-15 18:24:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:24:22] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2022-05-15 18:24:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:24:23] [INFO ] [Nat]Absence check using 78 positive place invariants in 29 ms returned sat
[2022-05-15 18:24:23] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 19 ms returned sat
[2022-05-15 18:24:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:24:23] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2022-05-15 18:24:23] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 1 ms to minimize.
[2022-05-15 18:24:23] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 1 ms to minimize.
[2022-05-15 18:24:23] [INFO ] Deduced a trap composed of 154 places in 175 ms of which 0 ms to minimize.
[2022-05-15 18:24:24] [INFO ] Deduced a trap composed of 152 places in 170 ms of which 1 ms to minimize.
[2022-05-15 18:24:24] [INFO ] Deduced a trap composed of 145 places in 177 ms of which 0 ms to minimize.
[2022-05-15 18:24:24] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 1 ms to minimize.
[2022-05-15 18:24:24] [INFO ] Deduced a trap composed of 143 places in 164 ms of which 1 ms to minimize.
[2022-05-15 18:24:24] [INFO ] Deduced a trap composed of 146 places in 175 ms of which 1 ms to minimize.
[2022-05-15 18:24:25] [INFO ] Deduced a trap composed of 153 places in 166 ms of which 1 ms to minimize.
[2022-05-15 18:24:25] [INFO ] Deduced a trap composed of 153 places in 174 ms of which 1 ms to minimize.
[2022-05-15 18:24:25] [INFO ] Deduced a trap composed of 139 places in 161 ms of which 1 ms to minimize.
[2022-05-15 18:24:25] [INFO ] Deduced a trap composed of 151 places in 170 ms of which 1 ms to minimize.
[2022-05-15 18:24:25] [INFO ] Deduced a trap composed of 146 places in 177 ms of which 0 ms to minimize.
[2022-05-15 18:24:26] [INFO ] Deduced a trap composed of 146 places in 158 ms of which 1 ms to minimize.
[2022-05-15 18:24:26] [INFO ] Deduced a trap composed of 148 places in 159 ms of which 3 ms to minimize.
[2022-05-15 18:24:26] [INFO ] Deduced a trap composed of 150 places in 155 ms of which 0 ms to minimize.
[2022-05-15 18:24:26] [INFO ] Deduced a trap composed of 149 places in 152 ms of which 0 ms to minimize.
[2022-05-15 18:24:26] [INFO ] Deduced a trap composed of 130 places in 171 ms of which 1 ms to minimize.
[2022-05-15 18:24:27] [INFO ] Deduced a trap composed of 157 places in 160 ms of which 1 ms to minimize.
[2022-05-15 18:24:27] [INFO ] Deduced a trap composed of 134 places in 161 ms of which 1 ms to minimize.
[2022-05-15 18:24:27] [INFO ] Deduced a trap composed of 165 places in 169 ms of which 2 ms to minimize.
[2022-05-15 18:24:27] [INFO ] Deduced a trap composed of 137 places in 158 ms of which 0 ms to minimize.
[2022-05-15 18:24:27] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 1 ms to minimize.
[2022-05-15 18:24:28] [INFO ] Deduced a trap composed of 153 places in 162 ms of which 1 ms to minimize.
[2022-05-15 18:24:28] [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.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 18:24:28] [INFO ] [Real]Absence check using 78 positive place invariants in 29 ms returned sat
[2022-05-15 18:24:28] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 14 ms returned sat
[2022-05-15 18:24:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:24:28] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2022-05-15 18:24:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:24:28] [INFO ] [Nat]Absence check using 78 positive place invariants in 30 ms returned sat
[2022-05-15 18:24:28] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 13 ms returned sat
[2022-05-15 18:24:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:24:28] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2022-05-15 18:24:29] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 1 ms to minimize.
[2022-05-15 18:24:29] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 1 ms to minimize.
[2022-05-15 18:24:29] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 1 ms to minimize.
[2022-05-15 18:24:29] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 0 ms to minimize.
[2022-05-15 18:24:30] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 0 ms to minimize.
[2022-05-15 18:24:30] [INFO ] Deduced a trap composed of 146 places in 154 ms of which 1 ms to minimize.
[2022-05-15 18:24:30] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 0 ms to minimize.
[2022-05-15 18:24:30] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 0 ms to minimize.
[2022-05-15 18:24:30] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 0 ms to minimize.
[2022-05-15 18:24:30] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 0 ms to minimize.
[2022-05-15 18:24:31] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 1 ms to minimize.
[2022-05-15 18:24:31] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 1 ms to minimize.
[2022-05-15 18:24:31] [INFO ] Deduced a trap composed of 161 places in 150 ms of which 1 ms to minimize.
[2022-05-15 18:24:31] [INFO ] Deduced a trap composed of 153 places in 146 ms of which 1 ms to minimize.
[2022-05-15 18:24:31] [INFO ] Deduced a trap composed of 171 places in 144 ms of which 0 ms to minimize.
[2022-05-15 18:24:32] [INFO ] Deduced a trap composed of 168 places in 143 ms of which 0 ms to minimize.
[2022-05-15 18:24:32] [INFO ] Deduced a trap composed of 146 places in 140 ms of which 1 ms to minimize.
[2022-05-15 18:24:32] [INFO ] Deduced a trap composed of 173 places in 144 ms of which 0 ms to minimize.
[2022-05-15 18:24:32] [INFO ] Deduced a trap composed of 166 places in 143 ms of which 1 ms to minimize.
[2022-05-15 18:24:32] [INFO ] Deduced a trap composed of 149 places in 136 ms of which 0 ms to minimize.
[2022-05-15 18:24:32] [INFO ] Deduced a trap composed of 159 places in 139 ms of which 0 ms to minimize.
[2022-05-15 18:24:33] [INFO ] Deduced a trap composed of 154 places in 143 ms of which 1 ms to minimize.
[2022-05-15 18:24:33] [INFO ] Deduced a trap composed of 168 places in 138 ms of which 1 ms to minimize.
[2022-05-15 18:24:33] [INFO ] Deduced a trap composed of 168 places in 148 ms of which 0 ms to minimize.
[2022-05-15 18:24:33] [INFO ] Deduced a trap composed of 172 places in 141 ms of which 1 ms to minimize.
[2022-05-15 18:24:33] [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.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 18:24:33] [INFO ] [Real]Absence check using 78 positive place invariants in 28 ms returned sat
[2022-05-15 18:24:33] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 13 ms returned sat
[2022-05-15 18:24:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:24:33] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2022-05-15 18:24:34] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 0 ms to minimize.
[2022-05-15 18:24:34] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 1 ms to minimize.
[2022-05-15 18:24:34] [INFO ] Deduced a trap composed of 148 places in 180 ms of which 0 ms to minimize.
[2022-05-15 18:24:34] [INFO ] Deduced a trap composed of 145 places in 169 ms of which 0 ms to minimize.
[2022-05-15 18:24:35] [INFO ] Deduced a trap composed of 143 places in 156 ms of which 1 ms to minimize.
[2022-05-15 18:24:35] [INFO ] Deduced a trap composed of 168 places in 181 ms of which 1 ms to minimize.
[2022-05-15 18:24:35] [INFO ] Deduced a trap composed of 160 places in 162 ms of which 0 ms to minimize.
[2022-05-15 18:24:35] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 0 ms to minimize.
[2022-05-15 18:24:35] [INFO ] Deduced a trap composed of 154 places in 156 ms of which 1 ms to minimize.
[2022-05-15 18:24:36] [INFO ] Deduced a trap composed of 136 places in 156 ms of which 0 ms to minimize.
[2022-05-15 18:24:36] [INFO ] Deduced a trap composed of 154 places in 169 ms of which 1 ms to minimize.
[2022-05-15 18:24:36] [INFO ] Deduced a trap composed of 149 places in 167 ms of which 0 ms to minimize.
[2022-05-15 18:24:36] [INFO ] Deduced a trap composed of 155 places in 160 ms of which 1 ms to minimize.
[2022-05-15 18:24:36] [INFO ] Deduced a trap composed of 151 places in 172 ms of which 1 ms to minimize.
[2022-05-15 18:24:37] [INFO ] Deduced a trap composed of 149 places in 167 ms of which 0 ms to minimize.
[2022-05-15 18:24:37] [INFO ] Deduced a trap composed of 144 places in 169 ms of which 0 ms to minimize.
[2022-05-15 18:24:37] [INFO ] Deduced a trap composed of 144 places in 162 ms of which 0 ms to minimize.
[2022-05-15 18:24:37] [INFO ] Deduced a trap composed of 159 places in 158 ms of which 0 ms to minimize.
[2022-05-15 18:24:37] [INFO ] Deduced a trap composed of 160 places in 157 ms of which 0 ms to minimize.
[2022-05-15 18:24:38] [INFO ] Deduced a trap composed of 163 places in 155 ms of which 1 ms to minimize.
[2022-05-15 18:24:38] [INFO ] Deduced a trap composed of 162 places in 162 ms of which 1 ms to minimize.
[2022-05-15 18:24:38] [INFO ] Deduced a trap composed of 133 places in 155 ms of which 1 ms to minimize.
[2022-05-15 18:24:38] [INFO ] Deduced a trap composed of 169 places in 150 ms of which 1 ms to minimize.
[2022-05-15 18:24:38] [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 4
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.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 757 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 757/757 places, 670/670 transitions.
Graph (trivial) has 430 edges and 757 vertex of which 7 / 757 are part of one of the 1 SCC in 359 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1512 edges and 751 vertex of which 742 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 169 transitions
Trivial Post-agglo rules discarded 169 transitions
Performed 169 trivial Post agglomeration. Transition count delta: 169
Iterating post reduction 0 with 169 rules applied. Total rules applied 171 place count 742 transition count 492
Reduce places removed 169 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 171 rules applied. Total rules applied 342 place count 573 transition count 490
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 344 place count 571 transition count 490
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 344 place count 571 transition count 377
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 250 rules applied. Total rules applied 594 place count 434 transition count 377
Discarding 97 places :
Symmetric choice reduction at 3 with 97 rule applications. Total rules 691 place count 337 transition count 280
Iterating global reduction 3 with 97 rules applied. Total rules applied 788 place count 337 transition count 280
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 788 place count 337 transition count 270
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 811 place count 324 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 812 place count 323 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 813 place count 323 transition count 269
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 236 rules applied. Total rules applied 1049 place count 204 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1051 place count 203 transition count 155
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1053 place count 203 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1055 place count 201 transition count 153
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1056 place count 201 transition count 153
Applied a total of 1056 rules in 514 ms. Remains 201 /757 variables (removed 556) and now considering 153/670 (removed 517) transitions.
Finished structural reductions, in 1 iterations. Remains : 201/757 places, 153/670 transitions.
// Phase 1: matrix 153 rows 201 cols
[2022-05-15 18:24:39] [INFO ] Computed 88 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 47089 resets, run finished after 3401 ms. (steps per millisecond=294 ) properties (out of 5) seen :5
FORMULA BusinessProcesses-PT-19-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 32051 ms.

BK_STOP 1652639082648

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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="BusinessProcesses-PT-19"
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 BusinessProcesses-PT-19, 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 r024-tall-165251918600469"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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