Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 11 16:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 11 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 16:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 85K May 18 16:42 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-05-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716650415118

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-05
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 15:20:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 15:20:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:20:17] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-25 15:20:17] [INFO ] Transformed 368 places.
[2024-05-25 15:20:17] [INFO ] Transformed 319 transitions.
[2024-05-25 15:20:17] [INFO ] Found NUPN structural information;
[2024-05-25 15:20:17] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
// Phase 1: matrix 318 rows 367 cols
[2024-05-25 15:20:17] [INFO ] Computed 57 invariants in 39 ms
Incomplete random walk after 10000 steps, including 98 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 16) seen :9
FORMULA BusinessProcesses-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :1
FORMULA BusinessProcesses-PT-05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :2
FORMULA BusinessProcesses-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
[2024-05-25 15:20:17] [INFO ] Invariant cache hit.
[2024-05-25 15:20:17] [INFO ] [Real]Absence check using 41 positive place invariants in 34 ms returned sat
[2024-05-25 15:20:17] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 4 ms returned sat
[2024-05-25 15:20:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:20:17] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-05-25 15:20:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:20:18] [INFO ] [Nat]Absence check using 41 positive place invariants in 12 ms returned sat
[2024-05-25 15:20:18] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-25 15:20:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:20:18] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2024-05-25 15:20:18] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 9 ms to minimize.
[2024-05-25 15:20:18] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-25 15:20:18] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 3 ms to minimize.
[2024-05-25 15:20:18] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 3 ms to minimize.
[2024-05-25 15:20:19] [INFO ] Deduced a trap composed of 21 places in 619 ms of which 1 ms to minimize.
[2024-05-25 15:20:19] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 1 ms to minimize.
[2024-05-25 15:20:19] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2024-05-25 15:20:19] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 1 ms to minimize.
[2024-05-25 15:20:20] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2024-05-25 15:20:20] [INFO ] Deduced a trap composed of 21 places in 754 ms of which 24 ms to minimize.
[2024-05-25 15:20:21] [INFO ] Deduced a trap composed of 91 places in 143 ms of which 0 ms to minimize.
[2024-05-25 15:20:21] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 1 ms to minimize.
[2024-05-25 15:20:21] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 1 ms to minimize.
[2024-05-25 15:20:21] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 0 ms to minimize.
[2024-05-25 15:20:21] [INFO ] Deduced a trap composed of 100 places in 133 ms of which 1 ms to minimize.
[2024-05-25 15:20:22] [INFO ] Deduced a trap composed of 92 places in 1129 ms of which 0 ms to minimize.
[2024-05-25 15:20:22] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 1 ms to minimize.
[2024-05-25 15:20:22] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 1 ms to minimize.
[2024-05-25 15:20:23] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 1 ms to minimize.
[2024-05-25 15:20:23] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2024-05-25 15:20:23] [INFO ] [Real]Absence check using 41 positive place invariants in 12 ms returned sat
[2024-05-25 15:20:23] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 4 ms returned sat
[2024-05-25 15:20:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:20:23] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2024-05-25 15:20:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:20:23] [INFO ] [Nat]Absence check using 41 positive place invariants in 25 ms returned sat
[2024-05-25 15:20:23] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 6 ms returned sat
[2024-05-25 15:20:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:20:23] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-25 15:20:23] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-25 15:20:23] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-25 15:20:23] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 0 ms to minimize.
[2024-05-25 15:20:23] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2024-05-25 15:20:23] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2024-05-25 15:20:23] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2024-05-25 15:20:24] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 0 ms to minimize.
[2024-05-25 15:20:24] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-05-25 15:20:24] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:20:24] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:20:24] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-25 15:20:24] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 0 ms to minimize.
[2024-05-25 15:20:24] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
[2024-05-25 15:20:24] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 0 ms to minimize.
[2024-05-25 15:20:24] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 937 ms
[2024-05-25 15:20:24] [INFO ] Computed and/alt/rep : 291/355/291 causal constraints (skipped 26 transitions) in 18 ms.
[2024-05-25 15:20:25] [INFO ] Added : 213 causal constraints over 43 iterations in 903 ms. Result :sat
Minimization took 65 ms.
[2024-05-25 15:20:25] [INFO ] [Real]Absence check using 41 positive place invariants in 13 ms returned sat
[2024-05-25 15:20:25] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 4 ms returned sat
[2024-05-25 15:20:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:20:25] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2024-05-25 15:20:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:20:25] [INFO ] [Nat]Absence check using 41 positive place invariants in 13 ms returned sat
[2024-05-25 15:20:25] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-25 15:20:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:20:25] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-05-25 15:20:25] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 6 ms to minimize.
[2024-05-25 15:20:26] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 10 ms to minimize.
[2024-05-25 15:20:26] [INFO ] Deduced a trap composed of 88 places in 79 ms of which 0 ms to minimize.
[2024-05-25 15:20:26] [INFO ] Deduced a trap composed of 91 places in 76 ms of which 1 ms to minimize.
[2024-05-25 15:20:26] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 0 ms to minimize.
[2024-05-25 15:20:26] [INFO ] Deduced a trap composed of 91 places in 70 ms of which 1 ms to minimize.
[2024-05-25 15:20:26] [INFO ] Deduced a trap composed of 93 places in 76 ms of which 0 ms to minimize.
[2024-05-25 15:20:26] [INFO ] Deduced a trap composed of 94 places in 54 ms of which 0 ms to minimize.
[2024-05-25 15:20:26] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 0 ms to minimize.
[2024-05-25 15:20:26] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2024-05-25 15:20:26] [INFO ] Deduced a trap composed of 97 places in 75 ms of which 0 ms to minimize.
[2024-05-25 15:20:26] [INFO ] Deduced a trap composed of 93 places in 71 ms of which 1 ms to minimize.
[2024-05-25 15:20:27] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 1 ms to minimize.
[2024-05-25 15:20:27] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 0 ms to minimize.
[2024-05-25 15:20:27] [INFO ] Deduced a trap composed of 94 places in 71 ms of which 1 ms to minimize.
[2024-05-25 15:20:27] [INFO ] Deduced a trap composed of 93 places in 77 ms of which 1 ms to minimize.
[2024-05-25 15:20:27] [INFO ] Deduced a trap composed of 93 places in 67 ms of which 1 ms to minimize.
[2024-05-25 15:20:27] [INFO ] Deduced a trap composed of 93 places in 68 ms of which 1 ms to minimize.
[2024-05-25 15:20:27] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 0 ms to minimize.
[2024-05-25 15:20:27] [INFO ] Deduced a trap composed of 94 places in 73 ms of which 1 ms to minimize.
[2024-05-25 15:20:27] [INFO ] Deduced a trap composed of 92 places in 73 ms of which 0 ms to minimize.
[2024-05-25 15:20:27] [INFO ] Deduced a trap composed of 93 places in 74 ms of which 1 ms to minimize.
[2024-05-25 15:20:27] [INFO ] Deduced a trap composed of 95 places in 61 ms of which 5 ms to minimize.
[2024-05-25 15:20:28] [INFO ] Deduced a trap composed of 95 places in 75 ms of which 1 ms to minimize.
[2024-05-25 15:20:28] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 0 ms to minimize.
[2024-05-25 15:20:28] [INFO ] Deduced a trap composed of 90 places in 66 ms of which 1 ms to minimize.
[2024-05-25 15:20:28] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-25 15:20:28] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 0 ms to minimize.
[2024-05-25 15:20:28] [INFO ] Deduced a trap composed of 96 places in 78 ms of which 0 ms to minimize.
[2024-05-25 15:20:28] [INFO ] Deduced a trap composed of 97 places in 73 ms of which 0 ms to minimize.
[2024-05-25 15:20:28] [INFO ] Deduced a trap composed of 94 places in 69 ms of which 1 ms to minimize.
[2024-05-25 15:20:28] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 1 ms to minimize.
[2024-05-25 15:20:28] [INFO ] Deduced a trap composed of 89 places in 71 ms of which 0 ms to minimize.
[2024-05-25 15:20:28] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 2978 ms
[2024-05-25 15:20:28] [INFO ] Computed and/alt/rep : 291/355/291 causal constraints (skipped 26 transitions) in 15 ms.
[2024-05-25 15:20:29] [INFO ] Added : 204 causal constraints over 42 iterations in 844 ms. Result :sat
Minimization took 74 ms.
[2024-05-25 15:20:29] [INFO ] [Real]Absence check using 41 positive place invariants in 17 ms returned sat
[2024-05-25 15:20:29] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-25 15:20:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:20:30] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2024-05-25 15:20:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:20:30] [INFO ] [Nat]Absence check using 41 positive place invariants in 12 ms returned sat
[2024-05-25 15:20:30] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 2 ms returned sat
[2024-05-25 15:20:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:20:30] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-05-25 15:20:30] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2024-05-25 15:20:30] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-05-25 15:20:30] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 2 ms to minimize.
[2024-05-25 15:20:30] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2024-05-25 15:20:30] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-25 15:20:30] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-05-25 15:20:30] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2024-05-25 15:20:30] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:20:30] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 541 ms
[2024-05-25 15:20:30] [INFO ] Computed and/alt/rep : 291/355/291 causal constraints (skipped 26 transitions) in 22 ms.
[2024-05-25 15:20:31] [INFO ] Added : 179 causal constraints over 36 iterations in 671 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA BusinessProcesses-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 367 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 367/367 places, 317/317 transitions.
Graph (trivial) has 233 edges and 367 vertex of which 8 / 367 are part of one of the 1 SCC in 5 ms
Free SCC test removed 7 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 699 edges and 360 vertex of which 357 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 90 rules applied. Total rules applied 92 place count 356 transition count 216
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 180 place count 268 transition count 216
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 180 place count 268 transition count 167
Deduced a syphon composed of 49 places in 2 ms
Ensure Unique test removed 13 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 111 rules applied. Total rules applied 291 place count 206 transition count 167
Discarding 59 places :
Symmetric choice reduction at 2 with 59 rule applications. Total rules 350 place count 147 transition count 108
Iterating global reduction 2 with 59 rules applied. Total rules applied 409 place count 147 transition count 108
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 409 place count 147 transition count 101
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 426 place count 137 transition count 101
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 538 place count 81 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 539 place count 80 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 540 place count 79 transition count 44
Applied a total of 540 rules in 96 ms. Remains 79 /367 variables (removed 288) and now considering 44/317 (removed 273) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 79/367 places, 44/317 transitions.
// Phase 1: matrix 44 rows 79 cols
[2024-05-25 15:20:31] [INFO ] Computed 39 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 43685 resets, run finished after 2200 ms. (steps per millisecond=454 ) properties (out of 1) seen :1
FORMULA BusinessProcesses-PT-05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 16895 ms.

BK_STOP 1716650434209

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-05"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is BusinessProcesses-PT-05, 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 r065-tajo-171620414800301"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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