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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 5.5K Apr 30 00:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 30 00:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 30 00:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Apr 30 00:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:09 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 131K 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-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 1652541265264

Running Version 0
[2022-05-14 15:14:26] [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:14:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 15:14:27] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2022-05-14 15:14:27] [INFO ] Transformed 518 places.
[2022-05-14 15:14:27] [INFO ] Transformed 471 transitions.
[2022-05-14 15:14:27] [INFO ] Found NUPN structural information;
[2022-05-14 15:14:27] [INFO ] Parsed PT model containing 518 places and 471 transitions in 113 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 471 rows 518 cols
[2022-05-14 15:14:27] [INFO ] Computed 85 place invariants in 37 ms
Incomplete random walk after 10000 steps, including 82 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :9
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-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-08 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
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 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 15 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 15 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) 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 7) seen :2
FORMULA BusinessProcesses-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 471 rows 518 cols
[2022-05-14 15:14:27] [INFO ] Computed 85 place invariants in 17 ms
[2022-05-14 15:14:27] [INFO ] [Real]Absence check using 48 positive place invariants in 129 ms returned sat
[2022-05-14 15:14:27] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 21 ms returned sat
[2022-05-14 15:14:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:14:27] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2022-05-14 15:14:28] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 5 ms to minimize.
[2022-05-14 15:14:28] [INFO ] Deduced a trap composed of 8 places in 364 ms of which 2 ms to minimize.
[2022-05-14 15:14:28] [INFO ] Deduced a trap composed of 118 places in 132 ms of which 1 ms to minimize.
[2022-05-14 15:14:28] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
[2022-05-14 15:14:29] [INFO ] Deduced a trap composed of 119 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:14:29] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 0 ms to minimize.
[2022-05-14 15:14:29] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 1 ms to minimize.
[2022-05-14 15:14:29] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
[2022-05-14 15:14:29] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 1 ms to minimize.
[2022-05-14 15:14:29] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 0 ms to minimize.
[2022-05-14 15:14:30] [INFO ] Deduced a trap composed of 34 places in 177 ms of which 1 ms to minimize.
[2022-05-14 15:14:30] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 1 ms to minimize.
[2022-05-14 15:14:30] [INFO ] Deduced a trap composed of 116 places in 124 ms of which 0 ms to minimize.
[2022-05-14 15:14:30] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:14:30] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 1 ms to minimize.
[2022-05-14 15:14:30] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2022-05-14 15:14:30] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 0 ms to minimize.
[2022-05-14 15:14:31] [INFO ] Deduced a trap composed of 110 places in 104 ms of which 1 ms to minimize.
[2022-05-14 15:14:31] [INFO ] Deduced a trap composed of 121 places in 142 ms of which 0 ms to minimize.
[2022-05-14 15:14:31] [INFO ] Deduced a trap composed of 113 places in 100 ms of which 1 ms to minimize.
[2022-05-14 15:14:31] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 0 ms to minimize.
[2022-05-14 15:14:31] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2022-05-14 15:14:31] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2022-05-14 15:14:31] [INFO ] Deduced a trap composed of 122 places in 113 ms of which 0 ms to minimize.
[2022-05-14 15:14:31] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 1 ms to minimize.
[2022-05-14 15:14:32] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 1 ms to minimize.
[2022-05-14 15:14:32] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 1 ms to minimize.
[2022-05-14 15:14:32] [INFO ] Deduced a trap composed of 116 places in 115 ms of which 0 ms to minimize.
[2022-05-14 15:14:32] [INFO ] Deduced a trap composed of 114 places in 107 ms of which 0 ms to minimize.
[2022-05-14 15:14:32] [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: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)
[2022-05-14 15:14:32] [INFO ] [Real]Absence check using 48 positive place invariants in 24 ms returned sat
[2022-05-14 15:14:32] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 9 ms returned sat
[2022-05-14 15:14:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:14:32] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2022-05-14 15:14:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:14:32] [INFO ] [Nat]Absence check using 48 positive place invariants in 18 ms returned sat
[2022-05-14 15:14:32] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 12 ms returned sat
[2022-05-14 15:14:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:14:32] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2022-05-14 15:14:33] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 1 ms to minimize.
[2022-05-14 15:14:33] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2022-05-14 15:14:33] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 1 ms to minimize.
[2022-05-14 15:14:33] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 1 ms to minimize.
[2022-05-14 15:14:33] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2022-05-14 15:14:33] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 4 ms to minimize.
[2022-05-14 15:14:33] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 1 ms to minimize.
[2022-05-14 15:14:34] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 0 ms to minimize.
[2022-05-14 15:14:34] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 0 ms to minimize.
[2022-05-14 15:14:34] [INFO ] Deduced a trap composed of 120 places in 127 ms of which 0 ms to minimize.
[2022-05-14 15:14:34] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2022-05-14 15:14:34] [INFO ] Deduced a trap composed of 117 places in 102 ms of which 1 ms to minimize.
[2022-05-14 15:14:34] [INFO ] Deduced a trap composed of 129 places in 98 ms of which 1 ms to minimize.
[2022-05-14 15:14:34] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 0 ms to minimize.
[2022-05-14 15:14:34] [INFO ] Deduced a trap composed of 119 places in 97 ms of which 1 ms to minimize.
[2022-05-14 15:14:35] [INFO ] Deduced a trap composed of 122 places in 109 ms of which 1 ms to minimize.
[2022-05-14 15:14:35] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 1 ms to minimize.
[2022-05-14 15:14:35] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
[2022-05-14 15:14:35] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2022-05-14 15:14:35] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 1 ms to minimize.
[2022-05-14 15:14:35] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 0 ms to minimize.
[2022-05-14 15:14:35] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2022-05-14 15:14:35] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2022-05-14 15:14:35] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2875 ms
[2022-05-14 15:14:35] [INFO ] Computed and/alt/rep : 442/759/442 causal constraints (skipped 28 transitions) in 30 ms.
[2022-05-14 15:14:37] [INFO ] Added : 241 causal constraints over 49 iterations in 1775 ms. Result :sat
Minimization took 93 ms.
[2022-05-14 15:14:37] [INFO ] [Real]Absence check using 48 positive place invariants in 17 ms returned sat
[2022-05-14 15:14:37] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 10 ms returned sat
[2022-05-14 15:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:14:37] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2022-05-14 15:14:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:14:38] [INFO ] [Nat]Absence check using 48 positive place invariants in 18 ms returned sat
[2022-05-14 15:14:38] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 23 ms returned sat
[2022-05-14 15:14:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:14:38] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2022-05-14 15:14:38] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 2 ms to minimize.
[2022-05-14 15:14:38] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:14:38] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 0 ms to minimize.
[2022-05-14 15:14:38] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:14:38] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 0 ms to minimize.
[2022-05-14 15:14:39] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 1 ms to minimize.
[2022-05-14 15:14:39] [INFO ] Deduced a trap composed of 136 places in 124 ms of which 0 ms to minimize.
[2022-05-14 15:14:39] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 2 ms to minimize.
[2022-05-14 15:14:39] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:14:39] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 1 ms to minimize.
[2022-05-14 15:14:39] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 1 ms to minimize.
[2022-05-14 15:14:39] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 1 ms to minimize.
[2022-05-14 15:14:40] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 1 ms to minimize.
[2022-05-14 15:14:40] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 1 ms to minimize.
[2022-05-14 15:14:40] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 2 ms to minimize.
[2022-05-14 15:14:40] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2022-05-14 15:14:40] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2022-05-14 15:14:40] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 0 ms to minimize.
[2022-05-14 15:14:40] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2215 ms
[2022-05-14 15:14:40] [INFO ] Computed and/alt/rep : 442/759/442 causal constraints (skipped 28 transitions) in 25 ms.
[2022-05-14 15:14:42] [INFO ] Added : 279 causal constraints over 56 iterations in 1787 ms. Result :sat
Minimization took 108 ms.
[2022-05-14 15:14:42] [INFO ] [Real]Absence check using 48 positive place invariants in 16 ms returned sat
[2022-05-14 15:14:42] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 10 ms returned sat
[2022-05-14 15:14:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:14:42] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2022-05-14 15:14:42] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 0 ms to minimize.
[2022-05-14 15:14:42] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 0 ms to minimize.
[2022-05-14 15:14:43] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 0 ms to minimize.
[2022-05-14 15:14:43] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 1 ms to minimize.
[2022-05-14 15:14:43] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 0 ms to minimize.
[2022-05-14 15:14:43] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 1 ms to minimize.
[2022-05-14 15:14:43] [INFO ] Deduced a trap composed of 113 places in 117 ms of which 1 ms to minimize.
[2022-05-14 15:14:43] [INFO ] Deduced a trap composed of 113 places in 114 ms of which 0 ms to minimize.
[2022-05-14 15:14:43] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 0 ms to minimize.
[2022-05-14 15:14:44] [INFO ] Deduced a trap composed of 123 places in 116 ms of which 1 ms to minimize.
[2022-05-14 15:14:44] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 1 ms to minimize.
[2022-05-14 15:14:44] [INFO ] Deduced a trap composed of 126 places in 107 ms of which 0 ms to minimize.
[2022-05-14 15:14:44] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 0 ms to minimize.
[2022-05-14 15:14:44] [INFO ] Deduced a trap composed of 115 places in 103 ms of which 1 ms to minimize.
[2022-05-14 15:14:44] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 0 ms to minimize.
[2022-05-14 15:14:44] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 0 ms to minimize.
[2022-05-14 15:14:45] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 0 ms to minimize.
[2022-05-14 15:14:45] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 0 ms to minimize.
[2022-05-14 15:14:45] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 0 ms to minimize.
[2022-05-14 15:14:45] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 0 ms to minimize.
[2022-05-14 15:14:45] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 1 ms to minimize.
[2022-05-14 15:14:45] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 1 ms to minimize.
[2022-05-14 15:14:45] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2022-05-14 15:14:45] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 0 ms to minimize.
[2022-05-14 15:14:46] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 1 ms to minimize.
[2022-05-14 15:14:46] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 1 ms to minimize.
[2022-05-14 15:14:46] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 1 ms to minimize.
[2022-05-14 15:14:46] [INFO ] Deduced a trap composed of 134 places in 95 ms of which 1 ms to minimize.
[2022-05-14 15:14:46] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
[2022-05-14 15:14:46] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2022-05-14 15:14:46] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 0 ms to minimize.
[2022-05-14 15:14:46] [INFO ] Deduced a trap composed of 122 places in 102 ms of which 0 ms to minimize.
[2022-05-14 15:14:47] [INFO ] Deduced a trap composed of 119 places in 102 ms of which 1 ms to minimize.
[2022-05-14 15:14:47] [INFO ] Deduced a trap composed of 132 places in 108 ms of which 0 ms to minimize.
[2022-05-14 15:14:47] [INFO ] Deduced a trap composed of 139 places in 96 ms of which 0 ms to minimize.
[2022-05-14 15:14:47] [INFO ] Deduced a trap composed of 127 places in 93 ms of which 1 ms to minimize.
[2022-05-14 15:14:47] [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: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)
[2022-05-14 15:14:47] [INFO ] [Real]Absence check using 48 positive place invariants in 17 ms returned sat
[2022-05-14 15:14:47] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 10 ms returned sat
[2022-05-14 15:14:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:14:47] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2022-05-14 15:14:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:14:47] [INFO ] [Nat]Absence check using 48 positive place invariants in 17 ms returned sat
[2022-05-14 15:14:47] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 9 ms returned sat
[2022-05-14 15:14:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:14:47] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2022-05-14 15:14:48] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 1 ms to minimize.
[2022-05-14 15:14:48] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 0 ms to minimize.
[2022-05-14 15:14:48] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 0 ms to minimize.
[2022-05-14 15:14:48] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2022-05-14 15:14:48] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 0 ms to minimize.
[2022-05-14 15:14:48] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 1 ms to minimize.
[2022-05-14 15:14:48] [INFO ] Deduced a trap composed of 127 places in 117 ms of which 1 ms to minimize.
[2022-05-14 15:14:49] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2022-05-14 15:14:49] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2022-05-14 15:14:49] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 0 ms to minimize.
[2022-05-14 15:14:49] [INFO ] Deduced a trap composed of 111 places in 107 ms of which 0 ms to minimize.
[2022-05-14 15:14:49] [INFO ] Deduced a trap composed of 109 places in 106 ms of which 1 ms to minimize.
[2022-05-14 15:14:49] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2022-05-14 15:14:49] [INFO ] Deduced a trap composed of 124 places in 107 ms of which 0 ms to minimize.
[2022-05-14 15:14:49] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 1 ms to minimize.
[2022-05-14 15:14:49] [INFO ] Deduced a trap composed of 118 places in 133 ms of which 1 ms to minimize.
[2022-05-14 15:14:50] [INFO ] Deduced a trap composed of 138 places in 116 ms of which 0 ms to minimize.
[2022-05-14 15:14:50] [INFO ] Deduced a trap composed of 118 places in 113 ms of which 0 ms to minimize.
[2022-05-14 15:14:50] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2022-05-14 15:14:50] [INFO ] Deduced a trap composed of 122 places in 111 ms of which 0 ms to minimize.
[2022-05-14 15:14:50] [INFO ] Deduced a trap composed of 137 places in 115 ms of which 1 ms to minimize.
[2022-05-14 15:14:50] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 1 ms to minimize.
[2022-05-14 15:14:50] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2022-05-14 15:14:51] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 0 ms to minimize.
[2022-05-14 15:14:51] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2022-05-14 15:14:51] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3155 ms
[2022-05-14 15:14:51] [INFO ] Computed and/alt/rep : 442/759/442 causal constraints (skipped 28 transitions) in 31 ms.
[2022-05-14 15:14:52] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 0 ms to minimize.
[2022-05-14 15:14: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 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.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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Incomplete Parikh walk after 24400 steps, including 229 resets, run finished after 77 ms. (steps per millisecond=316 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 27600 steps, including 258 resets, run finished after 75 ms. (steps per millisecond=368 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 5 out of 518 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 518/518 places, 471/471 transitions.
Graph (trivial) has 290 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 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 110 place count 510 transition count 354
Reduce places removed 108 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 112 rules applied. Total rules applied 222 place count 402 transition count 350
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 226 place count 398 transition count 350
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 226 place count 398 transition count 273
Deduced a syphon composed of 77 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 167 rules applied. Total rules applied 393 place count 308 transition count 273
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 457 place count 244 transition count 209
Iterating global reduction 3 with 64 rules applied. Total rules applied 521 place count 244 transition count 209
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 521 place count 244 transition count 203
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 3 with 13 rules applied. Total rules applied 534 place count 237 transition count 203
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 163 rules applied. Total rules applied 697 place count 154 transition count 123
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 699 place count 153 transition count 126
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 701 place count 153 transition count 124
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 703 place count 151 transition count 124
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 704 place count 151 transition count 124
Applied a total of 704 rules in 114 ms. Remains 151 /518 variables (removed 367) and now considering 124/471 (removed 347) transitions.
Finished structural reductions, in 1 iterations. Remains : 151/518 places, 124/471 transitions.
// Phase 1: matrix 124 rows 151 cols
[2022-05-14 15:14:53] [INFO ] Computed 67 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 45929 resets, run finished after 2689 ms. (steps per millisecond=371 ) properties (out of 5) seen :5
FORMULA BusinessProcesses-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652541296738

--------------------
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-10"
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-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 r028-tall-165251936100148"
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 ;