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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 8.6K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 00:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 146K 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-12-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652630325419

Running Version 202205111006
[2022-05-15 15:58:46] [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 15:58:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 15:58:47] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2022-05-15 15:58:47] [INFO ] Transformed 586 places.
[2022-05-15 15:58:47] [INFO ] Transformed 525 transitions.
[2022-05-15 15:58:47] [INFO ] Found NUPN structural information;
[2022-05-15 15:58:47] [INFO ] Parsed PT model containing 586 places and 525 transitions in 216 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 4 transitions.
// Phase 1: matrix 521 rows 582 cols
[2022-05-15 15:58:47] [INFO ] Computed 98 place invariants in 32 ms
Incomplete random walk after 10000 steps, including 73 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :10
FORMULA BusinessProcesses-PT-12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :1
FORMULA BusinessProcesses-PT-12-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :0
// Phase 1: matrix 521 rows 582 cols
[2022-05-15 15:58:47] [INFO ] Computed 98 place invariants in 13 ms
[2022-05-15 15:58:47] [INFO ] [Real]Absence check using 55 positive place invariants in 28 ms returned sat
[2022-05-15 15:58:47] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 12 ms returned sat
[2022-05-15 15:58:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 15:58:47] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2022-05-15 15:58:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 15:58:47] [INFO ] [Nat]Absence check using 55 positive place invariants in 21 ms returned sat
[2022-05-15 15:58:47] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 10 ms returned sat
[2022-05-15 15:58:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 15:58:48] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2022-05-15 15:58:48] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 9 ms to minimize.
[2022-05-15 15:58:48] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 1 ms to minimize.
[2022-05-15 15:58:48] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 1 ms to minimize.
[2022-05-15 15:58:48] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 3 ms to minimize.
[2022-05-15 15:58:49] [INFO ] Deduced a trap composed of 110 places in 173 ms of which 2 ms to minimize.
[2022-05-15 15:58:49] [INFO ] Deduced a trap composed of 104 places in 173 ms of which 0 ms to minimize.
[2022-05-15 15:58:49] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 1 ms to minimize.
[2022-05-15 15:58:49] [INFO ] Deduced a trap composed of 104 places in 153 ms of which 0 ms to minimize.
[2022-05-15 15:58:49] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 0 ms to minimize.
[2022-05-15 15:58:50] [INFO ] Deduced a trap composed of 22 places in 216 ms of which 1 ms to minimize.
[2022-05-15 15:58:50] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 1 ms to minimize.
[2022-05-15 15:58:50] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 0 ms to minimize.
[2022-05-15 15:58:50] [INFO ] Deduced a trap composed of 132 places in 134 ms of which 0 ms to minimize.
[2022-05-15 15:58:50] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 1 ms to minimize.
[2022-05-15 15:58:50] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 1 ms to minimize.
[2022-05-15 15:58:51] [INFO ] Deduced a trap composed of 112 places in 159 ms of which 0 ms to minimize.
[2022-05-15 15:58:51] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 1 ms to minimize.
[2022-05-15 15:58:51] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 1 ms to minimize.
[2022-05-15 15:58:51] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 0 ms to minimize.
[2022-05-15 15:58:51] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 1 ms to minimize.
[2022-05-15 15:58:51] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 1 ms to minimize.
[2022-05-15 15:58:52] [INFO ] Deduced a trap composed of 110 places in 139 ms of which 1 ms to minimize.
[2022-05-15 15:58:52] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 0 ms to minimize.
[2022-05-15 15:58:52] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 0 ms to minimize.
[2022-05-15 15:58:52] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2022-05-15 15:58:52] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2022-05-15 15:58:52] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2022-05-15 15:58:52] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2022-05-15 15:58:52] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 0 ms to minimize.
[2022-05-15 15:58:52] [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 15:58:52] [INFO ] [Real]Absence check using 55 positive place invariants in 26 ms returned sat
[2022-05-15 15:58:53] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 17 ms returned sat
[2022-05-15 15:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 15:58:53] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2022-05-15 15:58:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 15:58:53] [INFO ] [Nat]Absence check using 55 positive place invariants in 19 ms returned sat
[2022-05-15 15:58:53] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 11 ms returned sat
[2022-05-15 15:58:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 15:58:53] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2022-05-15 15:58:53] [INFO ] Deduced a trap composed of 119 places in 148 ms of which 0 ms to minimize.
[2022-05-15 15:58:53] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 1 ms to minimize.
[2022-05-15 15:58:54] [INFO ] Deduced a trap composed of 125 places in 143 ms of which 0 ms to minimize.
[2022-05-15 15:58:54] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 1 ms to minimize.
[2022-05-15 15:58:54] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 1 ms to minimize.
[2022-05-15 15:58:54] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 2 ms to minimize.
[2022-05-15 15:58:54] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 0 ms to minimize.
[2022-05-15 15:58:54] [INFO ] Deduced a trap composed of 122 places in 133 ms of which 0 ms to minimize.
[2022-05-15 15:58:55] [INFO ] Deduced a trap composed of 124 places in 133 ms of which 0 ms to minimize.
[2022-05-15 15:58:55] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 0 ms to minimize.
[2022-05-15 15:58:55] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 0 ms to minimize.
[2022-05-15 15:58:55] [INFO ] Deduced a trap composed of 107 places in 137 ms of which 1 ms to minimize.
[2022-05-15 15:58:55] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 0 ms to minimize.
[2022-05-15 15:58:55] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 0 ms to minimize.
[2022-05-15 15:58:55] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 0 ms to minimize.
[2022-05-15 15:58:56] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 1 ms to minimize.
[2022-05-15 15:58:56] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 0 ms to minimize.
[2022-05-15 15:58:56] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 0 ms to minimize.
[2022-05-15 15:58:56] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 0 ms to minimize.
[2022-05-15 15:58:56] [INFO ] Deduced a trap composed of 100 places in 137 ms of which 1 ms to minimize.
[2022-05-15 15:58:56] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 0 ms to minimize.
[2022-05-15 15:58:57] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 1 ms to minimize.
[2022-05-15 15:58:57] [INFO ] Deduced a trap composed of 124 places in 129 ms of which 1 ms to minimize.
[2022-05-15 15:58:57] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 0 ms to minimize.
[2022-05-15 15:58:57] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 0 ms to minimize.
[2022-05-15 15:58:57] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 0 ms to minimize.
[2022-05-15 15:58:57] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 0 ms to minimize.
[2022-05-15 15:58:57] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 1 ms to minimize.
[2022-05-15 15:58:58] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 0 ms to minimize.
[2022-05-15 15:58:58] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 1 ms to minimize.
[2022-05-15 15:58:58] [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 15:58:58] [INFO ] [Real]Absence check using 55 positive place invariants in 18 ms returned sat
[2022-05-15 15:58:58] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 10 ms returned sat
[2022-05-15 15:58:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 15:58:58] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2022-05-15 15:58:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 15:58:58] [INFO ] [Nat]Absence check using 55 positive place invariants in 18 ms returned sat
[2022-05-15 15:58:58] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 18 ms returned sat
[2022-05-15 15:58:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 15:58:58] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2022-05-15 15:58:58] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 1 ms to minimize.
[2022-05-15 15:58:59] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 0 ms to minimize.
[2022-05-15 15:58:59] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 0 ms to minimize.
[2022-05-15 15:58:59] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 0 ms to minimize.
[2022-05-15 15:58:59] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2022-05-15 15:58:59] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2022-05-15 15:58:59] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2022-05-15 15:58:59] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 0 ms to minimize.
[2022-05-15 15:58:59] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2022-05-15 15:59:00] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2022-05-15 15:59:00] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2022-05-15 15:59:00] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2022-05-15 15:59:00] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 0 ms to minimize.
[2022-05-15 15:59:00] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 0 ms to minimize.
[2022-05-15 15:59:00] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 0 ms to minimize.
[2022-05-15 15:59:00] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2022-05-15 15:59:00] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
[2022-05-15 15:59:00] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 0 ms to minimize.
[2022-05-15 15:59:00] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 0 ms to minimize.
[2022-05-15 15:59:00] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2022 ms
[2022-05-15 15:59:00] [INFO ] Computed and/alt/rep : 489/815/489 causal constraints (skipped 31 transitions) in 35 ms.
[2022-05-15 15:59:03] [INFO ] Added : 331 causal constraints over 67 iterations in 2443 ms. Result :sat
Minimization took 128 ms.
[2022-05-15 15:59:03] [INFO ] [Real]Absence check using 55 positive place invariants in 19 ms returned sat
[2022-05-15 15:59:03] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 11 ms returned sat
[2022-05-15 15:59:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 15:59:03] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2022-05-15 15:59:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 15:59:03] [INFO ] [Nat]Absence check using 55 positive place invariants in 20 ms returned sat
[2022-05-15 15:59:03] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 10 ms returned sat
[2022-05-15 15:59:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 15:59:04] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2022-05-15 15:59:04] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 0 ms to minimize.
[2022-05-15 15:59:04] [INFO ] Deduced a trap composed of 118 places in 144 ms of which 1 ms to minimize.
[2022-05-15 15:59:04] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 0 ms to minimize.
[2022-05-15 15:59:04] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 1 ms to minimize.
[2022-05-15 15:59:04] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 1 ms to minimize.
[2022-05-15 15:59:05] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 0 ms to minimize.
[2022-05-15 15:59:05] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 0 ms to minimize.
[2022-05-15 15:59:05] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 1 ms to minimize.
[2022-05-15 15:59:05] [INFO ] Deduced a trap composed of 113 places in 143 ms of which 0 ms to minimize.
[2022-05-15 15:59:05] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 0 ms to minimize.
[2022-05-15 15:59:05] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 0 ms to minimize.
[2022-05-15 15:59:06] [INFO ] Deduced a trap composed of 111 places in 134 ms of which 1 ms to minimize.
[2022-05-15 15:59:06] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 0 ms to minimize.
[2022-05-15 15:59:06] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 1 ms to minimize.
[2022-05-15 15:59:06] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 0 ms to minimize.
[2022-05-15 15:59:06] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 0 ms to minimize.
[2022-05-15 15:59:06] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 0 ms to minimize.
[2022-05-15 15:59:06] [INFO ] Deduced a trap composed of 134 places in 114 ms of which 0 ms to minimize.
[2022-05-15 15:59:07] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 0 ms to minimize.
[2022-05-15 15:59:07] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 0 ms to minimize.
[2022-05-15 15:59:07] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 1 ms to minimize.
[2022-05-15 15:59:07] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 1 ms to minimize.
[2022-05-15 15:59:07] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 0 ms to minimize.
[2022-05-15 15:59:07] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 0 ms to minimize.
[2022-05-15 15:59:07] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 0 ms to minimize.
[2022-05-15 15:59:07] [INFO ] Deduced a trap composed of 131 places in 109 ms of which 1 ms to minimize.
[2022-05-15 15:59:08] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 0 ms to minimize.
[2022-05-15 15:59:08] [INFO ] Deduced a trap composed of 127 places in 109 ms of which 0 ms to minimize.
[2022-05-15 15:59:08] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 1 ms to minimize.
[2022-05-15 15:59:08] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 1 ms to minimize.
[2022-05-15 15:59:08] [INFO ] Deduced a trap composed of 133 places in 109 ms of which 0 ms to minimize.
[2022-05-15 15:59:08] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 1 ms to minimize.
[2022-05-15 15:59:08] [INFO ] Trap strengthening (SAT) tested/added 32/32 trap constraints in 4712 ms
[2022-05-15 15:59:08] [INFO ] [Real]Absence check using 55 positive place invariants in 19 ms returned sat
[2022-05-15 15:59:08] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 11 ms returned sat
[2022-05-15 15:59:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 15:59:09] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2022-05-15 15:59:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 15:59:09] [INFO ] [Nat]Absence check using 55 positive place invariants in 20 ms returned sat
[2022-05-15 15:59:09] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 10 ms returned sat
[2022-05-15 15:59:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 15:59:09] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2022-05-15 15:59:09] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 1 ms to minimize.
[2022-05-15 15:59:09] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 1 ms to minimize.
[2022-05-15 15:59:09] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 0 ms to minimize.
[2022-05-15 15:59:10] [INFO ] Deduced a trap composed of 132 places in 126 ms of which 0 ms to minimize.
[2022-05-15 15:59:10] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 1 ms to minimize.
[2022-05-15 15:59:10] [INFO ] Deduced a trap composed of 126 places in 120 ms of which 1 ms to minimize.
[2022-05-15 15:59:10] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 1 ms to minimize.
[2022-05-15 15:59:10] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
[2022-05-15 15:59:10] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 1 ms to minimize.
[2022-05-15 15:59:10] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 1 ms to minimize.
[2022-05-15 15:59:10] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 1 ms to minimize.
[2022-05-15 15:59:11] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 1 ms to minimize.
[2022-05-15 15:59:11] [INFO ] Deduced a trap composed of 130 places in 137 ms of which 0 ms to minimize.
[2022-05-15 15:59:11] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 0 ms to minimize.
[2022-05-15 15:59:11] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 0 ms to minimize.
[2022-05-15 15:59:11] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 0 ms to minimize.
[2022-05-15 15:59:11] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2022-05-15 15:59:11] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2022-05-15 15:59:11] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 0 ms to minimize.
[2022-05-15 15:59:12] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2022-05-15 15:59:12] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2022-05-15 15:59:12] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2022-05-15 15:59:12] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
[2022-05-15 15:59:12] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2806 ms
[2022-05-15 15:59:12] [INFO ] Computed and/alt/rep : 489/815/489 causal constraints (skipped 31 transitions) in 33 ms.
[2022-05-15 15:59:14] [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.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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 582 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 582/582 places, 521/521 transitions.
Graph (trivial) has 327 edges and 582 vertex of which 7 / 582 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1178 edges and 576 vertex of which 572 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 126 rules applied. Total rules applied 128 place count 572 transition count 386
Reduce places removed 126 places and 0 transitions.
Iterating post reduction 1 with 126 rules applied. Total rules applied 254 place count 446 transition count 386
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 254 place count 446 transition count 296
Deduced a syphon composed of 90 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 452 place count 338 transition count 296
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 522 place count 268 transition count 226
Iterating global reduction 2 with 70 rules applied. Total rules applied 592 place count 268 transition count 226
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 592 place count 268 transition count 220
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 605 place count 261 transition count 220
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 185 rules applied. Total rules applied 790 place count 167 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 792 place count 166 transition count 133
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 794 place count 166 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 796 place count 164 transition count 131
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 797 place count 164 transition count 131
Applied a total of 797 rules in 117 ms. Remains 164 /582 variables (removed 418) and now considering 131/521 (removed 390) transitions.
Finished structural reductions, in 1 iterations. Remains : 164/582 places, 131/521 transitions.
// Phase 1: matrix 131 rows 164 cols
[2022-05-15 15:59:14] [INFO ] Computed 73 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 34417 resets, run finished after 2674 ms. (steps per millisecond=373 ) properties (out of 5) seen :5
FORMULA BusinessProcesses-PT-12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 30287 ms.

BK_STOP 1652630357127

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="BusinessProcesses-PT-12"
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-12, 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-165251918500413"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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