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.r028-tall-165251936200175.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 gold2021
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 r028-tall-165251936200175
=====================================================================

--------------------
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 1652541465920

Running Version 0
[2022-05-14 15:17:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-14 15:17:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 15:17:47] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2022-05-14 15:17:47] [INFO ] Transformed 772 places.
[2022-05-14 15:17:47] [INFO ] Transformed 685 transitions.
[2022-05-14 15:17:47] [INFO ] Found NUPN structural information;
[2022-05-14 15:17:47] [INFO ] Parsed PT model containing 772 places and 685 transitions in 126 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 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-14 15:17:47] [INFO ] Computed 125 place invariants in 52 ms
Incomplete random walk after 10000 steps, including 55 resets, run finished after 44 ms. (steps per millisecond=227 ) 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 9 resets, run finished after 22 ms. (steps per millisecond=454 ) 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 :1
FORMULA BusinessProcesses-PT-19-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) 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 7) seen :2
FORMULA BusinessProcesses-PT-19-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 670 rows 757 cols
[2022-05-14 15:17:48] [INFO ] Computed 125 place invariants in 30 ms
[2022-05-14 15:17:48] [INFO ] [Real]Absence check using 78 positive place invariants in 43 ms returned sat
[2022-05-14 15:17:48] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 21 ms returned sat
[2022-05-14 15:17:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:48] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2022-05-14 15:17:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:17:48] [INFO ] [Nat]Absence check using 78 positive place invariants in 29 ms returned sat
[2022-05-14 15:17:48] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 16 ms returned sat
[2022-05-14 15:17:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:49] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2022-05-14 15:17:49] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 3 ms to minimize.
[2022-05-14 15:17:49] [INFO ] Deduced a trap composed of 13 places in 280 ms of which 2 ms to minimize.
[2022-05-14 15:17:50] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 1 ms to minimize.
[2022-05-14 15:17:50] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 4 ms to minimize.
[2022-05-14 15:17:50] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 1 ms to minimize.
[2022-05-14 15:17:50] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 0 ms to minimize.
[2022-05-14 15:17:50] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 3 ms to minimize.
[2022-05-14 15:17:51] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 1 ms to minimize.
[2022-05-14 15:17:51] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 1 ms to minimize.
[2022-05-14 15:17:51] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2022-05-14 15:17:51] [INFO ] Deduced a trap composed of 142 places in 142 ms of which 2 ms to minimize.
[2022-05-14 15:17:51] [INFO ] Deduced a trap composed of 144 places in 142 ms of which 1 ms to minimize.
[2022-05-14 15:17:51] [INFO ] Deduced a trap composed of 169 places in 170 ms of which 1 ms to minimize.
[2022-05-14 15:17:52] [INFO ] Deduced a trap composed of 165 places in 168 ms of which 1 ms to minimize.
[2022-05-14 15:17:52] [INFO ] Deduced a trap composed of 76 places in 155 ms of which 1 ms to minimize.
[2022-05-14 15:17:52] [INFO ] Deduced a trap composed of 176 places in 157 ms of which 1 ms to minimize.
[2022-05-14 15:17:52] [INFO ] Deduced a trap composed of 180 places in 153 ms of which 1 ms to minimize.
[2022-05-14 15:17:52] [INFO ] Deduced a trap composed of 164 places in 152 ms of which 0 ms to minimize.
[2022-05-14 15:17:53] [INFO ] Deduced a trap composed of 187 places in 145 ms of which 1 ms to minimize.
[2022-05-14 15:17:53] [INFO ] Deduced a trap composed of 163 places in 150 ms of which 0 ms to minimize.
[2022-05-14 15:17:53] [INFO ] Deduced a trap composed of 161 places in 148 ms of which 1 ms to minimize.
[2022-05-14 15:17:53] [INFO ] Deduced a trap composed of 177 places in 167 ms of which 1 ms to minimize.
[2022-05-14 15:17:53] [INFO ] Deduced a trap composed of 190 places in 161 ms of which 9 ms to minimize.
[2022-05-14 15:17:53] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-14 15:17:53] [INFO ] [Real]Absence check using 78 positive place invariants in 38 ms returned sat
[2022-05-14 15:17:53] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 15 ms returned sat
[2022-05-14 15:17:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:54] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2022-05-14 15:17:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:17:54] [INFO ] [Nat]Absence check using 78 positive place invariants in 29 ms returned sat
[2022-05-14 15:17:54] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 13 ms returned sat
[2022-05-14 15:17:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:54] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2022-05-14 15:17:54] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 0 ms to minimize.
[2022-05-14 15:17:55] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 1 ms to minimize.
[2022-05-14 15:17:55] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 0 ms to minimize.
[2022-05-14 15:17:55] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 1 ms to minimize.
[2022-05-14 15:17:55] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 0 ms to minimize.
[2022-05-14 15:17:55] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 0 ms to minimize.
[2022-05-14 15:17:56] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 0 ms to minimize.
[2022-05-14 15:17:56] [INFO ] Deduced a trap composed of 144 places in 124 ms of which 0 ms to minimize.
[2022-05-14 15:17:56] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 1 ms to minimize.
[2022-05-14 15:17:56] [INFO ] Deduced a trap composed of 155 places in 135 ms of which 1 ms to minimize.
[2022-05-14 15:17:56] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 1 ms to minimize.
[2022-05-14 15:17:56] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 0 ms to minimize.
[2022-05-14 15:17:57] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 0 ms to minimize.
[2022-05-14 15:17:57] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 0 ms to minimize.
[2022-05-14 15:17:57] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 1 ms to minimize.
[2022-05-14 15:17:57] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 1 ms to minimize.
[2022-05-14 15:17:57] [INFO ] Deduced a trap composed of 139 places in 127 ms of which 0 ms to minimize.
[2022-05-14 15:17:57] [INFO ] Deduced a trap composed of 140 places in 129 ms of which 1 ms to minimize.
[2022-05-14 15:17:58] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 1 ms to minimize.
[2022-05-14 15:17:58] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 0 ms to minimize.
[2022-05-14 15:17:58] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 0 ms to minimize.
[2022-05-14 15:17:58] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 0 ms to minimize.
[2022-05-14 15:17:58] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 0 ms to minimize.
[2022-05-14 15:17:58] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2022-05-14 15:17:58] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 0 ms to minimize.
[2022-05-14 15:17:58] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2022-05-14 15:17:59] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2022-05-14 15:17:59] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4443 ms
[2022-05-14 15:17:59] [INFO ] Computed and/alt/rep : 629/987/629 causal constraints (skipped 40 transitions) in 48 ms.
[2022-05-14 15:17:59] [INFO ] Deduced a trap composed of 8 places in 243 ms of which 2 ms to minimize.
[2022-05-14 15:17:59] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-14 15:17:59] [INFO ] [Real]Absence check using 78 positive place invariants in 41 ms returned sat
[2022-05-14 15:17:59] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 17 ms returned sat
[2022-05-14 15:17:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:59] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2022-05-14 15:17:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:18:00] [INFO ] [Nat]Absence check using 78 positive place invariants in 32 ms returned sat
[2022-05-14 15:18:00] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 12 ms returned sat
[2022-05-14 15:18:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:18:00] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2022-05-14 15:18:00] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 1 ms to minimize.
[2022-05-14 15:18:00] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2022-05-14 15:18:00] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
[2022-05-14 15:18:00] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 0 ms to minimize.
[2022-05-14 15:18:01] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 1 ms to minimize.
[2022-05-14 15:18:01] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 7 ms to minimize.
[2022-05-14 15:18:01] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
[2022-05-14 15:18:01] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 0 ms to minimize.
[2022-05-14 15:18:01] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 0 ms to minimize.
[2022-05-14 15:18:01] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 0 ms to minimize.
[2022-05-14 15:18:01] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2022-05-14 15:18:01] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 0 ms to minimize.
[2022-05-14 15:18:02] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 0 ms to minimize.
[2022-05-14 15:18:02] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 0 ms to minimize.
[2022-05-14 15:18:02] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2022-05-14 15:18:02] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2022-05-14 15:18:02] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 8 ms to minimize.
[2022-05-14 15:18:02] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 0 ms to minimize.
[2022-05-14 15:18:02] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 1 ms to minimize.
[2022-05-14 15:18:02] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 1 ms to minimize.
[2022-05-14 15:18:02] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 0 ms to minimize.
[2022-05-14 15:18:03] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 0 ms to minimize.
[2022-05-14 15:18:03] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2022-05-14 15:18:03] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 1 ms to minimize.
[2022-05-14 15:18:03] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 0 ms to minimize.
[2022-05-14 15:18:03] [INFO ] Deduced a trap composed of 94 places in 73 ms of which 0 ms to minimize.
[2022-05-14 15:18:03] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 0 ms to minimize.
[2022-05-14 15:18:03] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 0 ms to minimize.
[2022-05-14 15:18:03] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 0 ms to minimize.
[2022-05-14 15:18:03] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 0 ms to minimize.
[2022-05-14 15:18:04] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2022-05-14 15:18:04] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2022-05-14 15:18:04] [INFO ] Deduced a trap composed of 170 places in 151 ms of which 1 ms to minimize.
[2022-05-14 15:18:04] [INFO ] Deduced a trap composed of 66 places in 139 ms of which 1 ms to minimize.
[2022-05-14 15:18:04] [INFO ] Deduced a trap composed of 67 places in 136 ms of which 1 ms to minimize.
[2022-05-14 15:18:04] [INFO ] Deduced a trap composed of 72 places in 138 ms of which 0 ms to minimize.
[2022-05-14 15:18:04] [INFO ] Deduced a trap composed of 170 places in 149 ms of which 1 ms to minimize.
[2022-05-14 15:18:05] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 1 ms to minimize.
[2022-05-14 15:18:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-14 15:18:05] [INFO ] [Real]Absence check using 78 positive place invariants in 29 ms returned sat
[2022-05-14 15:18:05] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 14 ms returned sat
[2022-05-14 15:18:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:18:05] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2022-05-14 15:18:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:18:05] [INFO ] [Nat]Absence check using 78 positive place invariants in 36 ms returned sat
[2022-05-14 15:18:05] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 12 ms returned sat
[2022-05-14 15:18:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:18:05] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2022-05-14 15:18:06] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 1 ms to minimize.
[2022-05-14 15:18:06] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 0 ms to minimize.
[2022-05-14 15:18:06] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 1 ms to minimize.
[2022-05-14 15:18:06] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 0 ms to minimize.
[2022-05-14 15:18:07] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2022-05-14 15:18:07] [INFO ] Deduced a trap composed of 146 places in 135 ms of which 0 ms to minimize.
[2022-05-14 15:18:07] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 1 ms to minimize.
[2022-05-14 15:18:07] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 0 ms to minimize.
[2022-05-14 15:18:07] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 1 ms to minimize.
[2022-05-14 15:18:07] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 1 ms to minimize.
[2022-05-14 15:18:08] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 1 ms to minimize.
[2022-05-14 15:18:08] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 1 ms to minimize.
[2022-05-14 15:18:08] [INFO ] Deduced a trap composed of 161 places in 131 ms of which 0 ms to minimize.
[2022-05-14 15:18:08] [INFO ] Deduced a trap composed of 153 places in 128 ms of which 0 ms to minimize.
[2022-05-14 15:18:08] [INFO ] Deduced a trap composed of 171 places in 120 ms of which 1 ms to minimize.
[2022-05-14 15:18:08] [INFO ] Deduced a trap composed of 168 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:18:08] [INFO ] Deduced a trap composed of 146 places in 122 ms of which 1 ms to minimize.
[2022-05-14 15:18:09] [INFO ] Deduced a trap composed of 173 places in 124 ms of which 0 ms to minimize.
[2022-05-14 15:18:09] [INFO ] Deduced a trap composed of 166 places in 123 ms of which 1 ms to minimize.
[2022-05-14 15:18:09] [INFO ] Deduced a trap composed of 149 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:18:09] [INFO ] Deduced a trap composed of 159 places in 121 ms of which 0 ms to minimize.
[2022-05-14 15:18:09] [INFO ] Deduced a trap composed of 154 places in 124 ms of which 1 ms to minimize.
[2022-05-14 15:18:09] [INFO ] Deduced a trap composed of 168 places in 119 ms of which 1 ms to minimize.
[2022-05-14 15:18:09] [INFO ] Deduced a trap composed of 168 places in 121 ms of which 0 ms to minimize.
[2022-05-14 15:18:10] [INFO ] Deduced a trap composed of 172 places in 122 ms of which 0 ms to minimize.
[2022-05-14 15:18:10] [INFO ] Deduced a trap composed of 165 places in 124 ms of which 0 ms to minimize.
[2022-05-14 15:18:10] [INFO ] Deduced a trap composed of 173 places in 120 ms of which 1 ms to minimize.
[2022-05-14 15:18:10] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 1 ms to minimize.
[2022-05-14 15:18:10] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 1 ms to minimize.
[2022-05-14 15:18:10] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-14 15:18:10] [INFO ] [Real]Absence check using 78 positive place invariants in 27 ms returned sat
[2022-05-14 15:18:10] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 19 ms returned sat
[2022-05-14 15:18:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:18:11] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2022-05-14 15:18:11] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 1 ms to minimize.
[2022-05-14 15:18:11] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 1 ms to minimize.
[2022-05-14 15:18:11] [INFO ] Deduced a trap composed of 148 places in 140 ms of which 0 ms to minimize.
[2022-05-14 15:18:11] [INFO ] Deduced a trap composed of 145 places in 146 ms of which 1 ms to minimize.
[2022-05-14 15:18:12] [INFO ] Deduced a trap composed of 143 places in 143 ms of which 0 ms to minimize.
[2022-05-14 15:18:12] [INFO ] Deduced a trap composed of 168 places in 143 ms of which 1 ms to minimize.
[2022-05-14 15:18:12] [INFO ] Deduced a trap composed of 160 places in 146 ms of which 1 ms to minimize.
[2022-05-14 15:18:12] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 0 ms to minimize.
[2022-05-14 15:18:12] [INFO ] Deduced a trap composed of 154 places in 135 ms of which 1 ms to minimize.
[2022-05-14 15:18:12] [INFO ] Deduced a trap composed of 136 places in 148 ms of which 0 ms to minimize.
[2022-05-14 15:18:13] [INFO ] Deduced a trap composed of 154 places in 138 ms of which 1 ms to minimize.
[2022-05-14 15:18:13] [INFO ] Deduced a trap composed of 149 places in 138 ms of which 0 ms to minimize.
[2022-05-14 15:18:13] [INFO ] Deduced a trap composed of 155 places in 140 ms of which 0 ms to minimize.
[2022-05-14 15:18:13] [INFO ] Deduced a trap composed of 151 places in 135 ms of which 0 ms to minimize.
[2022-05-14 15:18:13] [INFO ] Deduced a trap composed of 149 places in 166 ms of which 1 ms to minimize.
[2022-05-14 15:18:14] [INFO ] Deduced a trap composed of 144 places in 140 ms of which 1 ms to minimize.
[2022-05-14 15:18:14] [INFO ] Deduced a trap composed of 144 places in 139 ms of which 0 ms to minimize.
[2022-05-14 15:18:14] [INFO ] Deduced a trap composed of 159 places in 139 ms of which 1 ms to minimize.
[2022-05-14 15:18:14] [INFO ] Deduced a trap composed of 160 places in 135 ms of which 1 ms to minimize.
[2022-05-14 15:18:14] [INFO ] Deduced a trap composed of 163 places in 133 ms of which 1 ms to minimize.
[2022-05-14 15:18:14] [INFO ] Deduced a trap composed of 162 places in 139 ms of which 0 ms to minimize.
[2022-05-14 15:18:15] [INFO ] Deduced a trap composed of 133 places in 145 ms of which 1 ms to minimize.
[2022-05-14 15:18:15] [INFO ] Deduced a trap composed of 169 places in 137 ms of which 0 ms to minimize.
[2022-05-14 15:18:15] [INFO ] Deduced a trap composed of 166 places in 143 ms of which 0 ms to minimize.
[2022-05-14 15:18:15] [INFO ] Deduced a trap composed of 138 places in 133 ms of which 0 ms to minimize.
[2022-05-14 15:18:15] [INFO ] Deduced a trap composed of 167 places in 138 ms of which 1 ms to minimize.
[2022-05-14 15:18:15] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
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, 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 13 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.7 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 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 114 Pre rules applied. Total rules applied 344 place count 571 transition count 376
Deduced a syphon composed of 114 places in 2 ms
Ensure Unique test removed 25 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 253 rules applied. Total rules applied 597 place count 432 transition count 376
Discarding 96 places :
Symmetric choice reduction at 3 with 96 rule applications. Total rules 693 place count 336 transition count 280
Iterating global reduction 3 with 96 rules applied. Total rules applied 789 place count 336 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 789 place count 336 transition count 270
Deduced a syphon composed of 10 places in 1 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 812 place count 323 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 813 place count 322 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 814 place count 322 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 1050 place count 203 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 1052 place count 202 transition count 155
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1054 place count 202 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1056 place count 200 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 1057 place count 200 transition count 153
Applied a total of 1057 rules in 214 ms. Remains 200 /757 variables (removed 557) and now considering 153/670 (removed 517) transitions.
Finished structural reductions, in 1 iterations. Remains : 200/757 places, 153/670 transitions.
// Phase 1: matrix 153 rows 200 cols
[2022-05-14 15:18:16] [INFO ] Computed 87 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 46179 resets, run finished after 3243 ms. (steps per millisecond=308 ) 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-06 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.

BK_STOP 1652541500512

--------------------
content from stderr:

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="gold2021"
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 gold2021"
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 r028-tall-165251936200175"
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 ;