Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r063-tajo-167813711600066.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is BusinessProcesses-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r063-tajo-167813711600066
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 131K Mar 5 18:22 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-10-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678933628629

Running Version 202205111006
[2023-03-16 02:27:09] [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]
[2023-03-16 02:27:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 02:27:09] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2023-03-16 02:27:09] [INFO ] Transformed 518 places.
[2023-03-16 02:27:09] [INFO ] Transformed 471 transitions.
[2023-03-16 02:27:09] [INFO ] Found NUPN structural information;
[2023-03-16 02:27:09] [INFO ] Parsed PT model containing 518 places and 471 transitions in 212 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 471 rows 518 cols
[2023-03-16 02:27:10] [INFO ] Computed 85 place invariants in 32 ms
Incomplete random walk after 10000 steps, including 82 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :11
FORMULA BusinessProcesses-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :2
FORMULA BusinessProcesses-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
// Phase 1: matrix 471 rows 518 cols
[2023-03-16 02:27:10] [INFO ] Computed 85 place invariants in 13 ms
[2023-03-16 02:27:10] [INFO ] [Real]Absence check using 48 positive place invariants in 20 ms returned sat
[2023-03-16 02:27:10] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 11 ms returned sat
[2023-03-16 02:27:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:27:10] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2023-03-16 02:27:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:27:10] [INFO ] [Nat]Absence check using 48 positive place invariants in 19 ms returned sat
[2023-03-16 02:27:10] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 9 ms returned sat
[2023-03-16 02:27:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:27:10] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2023-03-16 02:27:11] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 13 ms to minimize.
[2023-03-16 02:27:11] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 2 ms to minimize.
[2023-03-16 02:27:11] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 1 ms to minimize.
[2023-03-16 02:27:11] [INFO ] Deduced a trap composed of 35 places in 209 ms of which 1 ms to minimize.
[2023-03-16 02:27:11] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 0 ms to minimize.
[2023-03-16 02:27:12] [INFO ] Deduced a trap composed of 109 places in 170 ms of which 0 ms to minimize.
[2023-03-16 02:27:12] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2023-03-16 02:27:12] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2023-03-16 02:27:12] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2023-03-16 02:27:12] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 1 ms to minimize.
[2023-03-16 02:27:12] [INFO ] Deduced a trap composed of 136 places in 125 ms of which 1 ms to minimize.
[2023-03-16 02:27:12] [INFO ] Deduced a trap composed of 123 places in 120 ms of which 1 ms to minimize.
[2023-03-16 02:27:13] [INFO ] Deduced a trap composed of 127 places in 137 ms of which 1 ms to minimize.
[2023-03-16 02:27:13] [INFO ] Deduced a trap composed of 130 places in 134 ms of which 0 ms to minimize.
[2023-03-16 02:27:13] [INFO ] Deduced a trap composed of 115 places in 115 ms of which 0 ms to minimize.
[2023-03-16 02:27:13] [INFO ] Deduced a trap composed of 123 places in 121 ms of which 1 ms to minimize.
[2023-03-16 02:27:13] [INFO ] Deduced a trap composed of 129 places in 132 ms of which 1 ms to minimize.
[2023-03-16 02:27:13] [INFO ] Deduced a trap composed of 122 places in 102 ms of which 2 ms to minimize.
[2023-03-16 02:27:13] [INFO ] Deduced a trap composed of 120 places in 114 ms of which 1 ms to minimize.
[2023-03-16 02:27:14] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 0 ms to minimize.
[2023-03-16 02:27:14] [INFO ] Deduced a trap composed of 134 places in 156 ms of which 1 ms to minimize.
[2023-03-16 02:27:14] [INFO ] Deduced a trap composed of 131 places in 117 ms of which 1 ms to minimize.
[2023-03-16 02:27:14] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 0 ms to minimize.
[2023-03-16 02:27:14] [INFO ] Deduced a trap composed of 127 places in 138 ms of which 1 ms to minimize.
[2023-03-16 02:27:14] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 1 ms to minimize.
[2023-03-16 02:27:14] [INFO ] Deduced a trap composed of 132 places in 130 ms of which 14 ms to minimize.
[2023-03-16 02:27:15] [INFO ] Deduced a trap composed of 131 places in 108 ms of which 0 ms to minimize.
[2023-03-16 02:27:15] [INFO ] Deduced a trap composed of 120 places in 128 ms of which 1 ms to minimize.
[2023-03-16 02:27:15] [INFO ] Deduced a trap composed of 123 places in 102 ms of which 1 ms to minimize.
[2023-03-16 02:27:15] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 0 ms to minimize.
[2023-03-16 02:27:15] [INFO ] Deduced a trap composed of 122 places in 92 ms of which 1 ms to minimize.
[2023-03-16 02:27:15] [INFO ] Deduced a trap composed of 127 places in 121 ms of which 1 ms to minimize.
[2023-03-16 02:27: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 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)
[2023-03-16 02:27:15] [INFO ] [Real]Absence check using 48 positive place invariants in 25 ms returned sat
[2023-03-16 02:27:15] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 11 ms returned sat
[2023-03-16 02:27:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:27:15] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2023-03-16 02:27:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:27:16] [INFO ] [Nat]Absence check using 48 positive place invariants in 15 ms returned sat
[2023-03-16 02:27:16] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 8 ms returned sat
[2023-03-16 02:27:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:27:16] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2023-03-16 02:27:16] [INFO ] Deduced a trap composed of 115 places in 115 ms of which 1 ms to minimize.
[2023-03-16 02:27:16] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2023-03-16 02:27:16] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 1 ms to minimize.
[2023-03-16 02:27:16] [INFO ] Deduced a trap composed of 111 places in 155 ms of which 1 ms to minimize.
[2023-03-16 02:27:16] [INFO ] Deduced a trap composed of 115 places in 121 ms of which 0 ms to minimize.
[2023-03-16 02:27:17] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 1 ms to minimize.
[2023-03-16 02:27:17] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 0 ms to minimize.
[2023-03-16 02:27:17] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2023-03-16 02:27:17] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 0 ms to minimize.
[2023-03-16 02:27:17] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 1 ms to minimize.
[2023-03-16 02:27:17] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 1 ms to minimize.
[2023-03-16 02:27:17] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 1 ms to minimize.
[2023-03-16 02:27:18] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 0 ms to minimize.
[2023-03-16 02:27:18] [INFO ] Deduced a trap composed of 120 places in 112 ms of which 0 ms to minimize.
[2023-03-16 02:27:18] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 0 ms to minimize.
[2023-03-16 02:27:18] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 0 ms to minimize.
[2023-03-16 02:27:18] [INFO ] Deduced a trap composed of 119 places in 108 ms of which 1 ms to minimize.
[2023-03-16 02:27:18] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 0 ms to minimize.
[2023-03-16 02:27:18] [INFO ] Deduced a trap composed of 115 places in 106 ms of which 1 ms to minimize.
[2023-03-16 02:27:18] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 1 ms to minimize.
[2023-03-16 02:27:19] [INFO ] Deduced a trap composed of 127 places in 106 ms of which 0 ms to minimize.
[2023-03-16 02:27:19] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 0 ms to minimize.
[2023-03-16 02:27:19] [INFO ] Deduced a trap composed of 118 places in 109 ms of which 0 ms to minimize.
[2023-03-16 02:27:19] [INFO ] Deduced a trap composed of 119 places in 109 ms of which 0 ms to minimize.
[2023-03-16 02:27:19] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 1 ms to minimize.
[2023-03-16 02:27:19] [INFO ] Deduced a trap composed of 120 places in 113 ms of which 0 ms to minimize.
[2023-03-16 02:27:19] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 0 ms to minimize.
[2023-03-16 02:27:20] [INFO ] Deduced a trap composed of 127 places in 133 ms of which 1 ms to minimize.
[2023-03-16 02:27:20] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 0 ms to minimize.
[2023-03-16 02:27:20] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 0 ms to minimize.
[2023-03-16 02:27:20] [INFO ] Deduced a trap composed of 123 places in 144 ms of which 1 ms to minimize.
[2023-03-16 02:27:20] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 1 ms to minimize.
[2023-03-16 02:27:20] [INFO ] Deduced a trap composed of 116 places in 116 ms of which 1 ms to minimize.
[2023-03-16 02:27:20] [INFO ] Deduced a trap composed of 118 places in 119 ms of which 2 ms to minimize.
[2023-03-16 02:27:21] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 1 ms to minimize.
[2023-03-16 02:27:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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)
[2023-03-16 02:27:21] [INFO ] [Real]Absence check using 48 positive place invariants in 16 ms returned sat
[2023-03-16 02:27:21] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 9 ms returned sat
[2023-03-16 02:27:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:27:21] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2023-03-16 02:27:21] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 1 ms to minimize.
[2023-03-16 02:27:21] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 2 ms to minimize.
[2023-03-16 02:27:21] [INFO ] Deduced a trap composed of 118 places in 141 ms of which 1 ms to minimize.
[2023-03-16 02:27:21] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 0 ms to minimize.
[2023-03-16 02:27:22] [INFO ] Deduced a trap composed of 119 places in 142 ms of which 1 ms to minimize.
[2023-03-16 02:27:22] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 1 ms to minimize.
[2023-03-16 02:27:22] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 0 ms to minimize.
[2023-03-16 02:27:22] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 0 ms to minimize.
[2023-03-16 02:27:22] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 0 ms to minimize.
[2023-03-16 02:27:22] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 1 ms to minimize.
[2023-03-16 02:27:23] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 1 ms to minimize.
[2023-03-16 02:27:23] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 1 ms to minimize.
[2023-03-16 02:27:23] [INFO ] Deduced a trap composed of 116 places in 120 ms of which 0 ms to minimize.
[2023-03-16 02:27:23] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 0 ms to minimize.
[2023-03-16 02:27:23] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 1 ms to minimize.
[2023-03-16 02:27:23] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2023-03-16 02:27:23] [INFO ] Deduced a trap composed of 125 places in 122 ms of which 1 ms to minimize.
[2023-03-16 02:27:24] [INFO ] Deduced a trap composed of 110 places in 108 ms of which 0 ms to minimize.
[2023-03-16 02:27:24] [INFO ] Deduced a trap composed of 121 places in 103 ms of which 0 ms to minimize.
[2023-03-16 02:27:24] [INFO ] Deduced a trap composed of 113 places in 110 ms of which 0 ms to minimize.
[2023-03-16 02:27:24] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 0 ms to minimize.
[2023-03-16 02:27:24] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 0 ms to minimize.
[2023-03-16 02:27:24] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2023-03-16 02:27:24] [INFO ] Deduced a trap composed of 122 places in 101 ms of which 0 ms to minimize.
[2023-03-16 02:27:24] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 0 ms to minimize.
[2023-03-16 02:27:25] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2023-03-16 02:27:25] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 1 ms to minimize.
[2023-03-16 02:27:25] [INFO ] Deduced a trap composed of 116 places in 117 ms of which 0 ms to minimize.
[2023-03-16 02:27:25] [INFO ] Deduced a trap composed of 114 places in 107 ms of which 0 ms to minimize.
[2023-03-16 02:27:25] [INFO ] Deduced a trap composed of 117 places in 89 ms of which 0 ms to minimize.
[2023-03-16 02:27:25] [INFO ] Deduced a trap composed of 129 places in 120 ms of which 1 ms to minimize.
[2023-03-16 02:27:25] [INFO ] Deduced a trap composed of 125 places in 93 ms of which 0 ms to minimize.
[2023-03-16 02:27:25] [INFO ] Deduced a trap composed of 120 places in 96 ms of which 0 ms to minimize.
[2023-03-16 02:27:26] [INFO ] Deduced a trap composed of 117 places in 111 ms of which 0 ms to minimize.
[2023-03-16 02:27:26] [INFO ] Deduced a trap composed of 129 places in 93 ms of which 0 ms to minimize.
[2023-03-16 02:27:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 518 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 518/518 places, 471/471 transitions.
Graph (trivial) has 292 edges and 518 vertex of which 7 / 518 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 1063 edges and 512 vertex of which 510 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 113 place count 510 transition count 351
Reduce places removed 111 places and 0 transitions.
Iterating post reduction 1 with 111 rules applied. Total rules applied 224 place count 399 transition count 351
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 224 place count 399 transition count 273
Deduced a syphon composed of 78 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 169 rules applied. Total rules applied 393 place count 308 transition count 273
Discarding 65 places :
Symmetric choice reduction at 2 with 65 rule applications. Total rules 458 place count 243 transition count 208
Iterating global reduction 2 with 65 rules applied. Total rules applied 523 place count 243 transition count 208
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 523 place count 243 transition count 200
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 541 place count 233 transition count 200
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 161 rules applied. Total rules applied 702 place count 151 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 704 place count 150 transition count 124
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 706 place count 150 transition count 122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 708 place count 148 transition count 122
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 709 place count 148 transition count 122
Applied a total of 709 rules in 141 ms. Remains 148 /518 variables (removed 370) and now considering 122/471 (removed 349) transitions.
Finished structural reductions, in 1 iterations. Remains : 148/518 places, 122/471 transitions.
// Phase 1: matrix 122 rows 148 cols
[2023-03-16 02:27:26] [INFO ] Computed 66 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 46915 resets, run finished after 2346 ms. (steps per millisecond=426 ) properties (out of 3) seen :3
FORMULA BusinessProcesses-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 18927 ms.

BK_STOP 1678933648706

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is BusinessProcesses-PT-10, 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 r063-tajo-167813711600066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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