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-171620414800286.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-02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414800286
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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.8K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 14K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 16:38 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 59K 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-02-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716650104225

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-02
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 15:15:07] [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:15:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:15:07] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-05-25 15:15:07] [INFO ] Transformed 262 places.
[2024-05-25 15:15:07] [INFO ] Transformed 219 transitions.
[2024-05-25 15:15:07] [INFO ] Found NUPN structural information;
[2024-05-25 15:15:07] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 268 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 15 transitions.
// Phase 1: matrix 204 rows 245 cols
[2024-05-25 15:15:07] [INFO ] Computed 43 invariants in 25 ms
Incomplete random walk after 10000 steps, including 140 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :8
FORMULA BusinessProcesses-PT-02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :1
FORMULA BusinessProcesses-PT-02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 7) seen :0
[2024-05-25 15:15:07] [INFO ] Invariant cache hit.
[2024-05-25 15:15:08] [INFO ] [Real]Absence check using 30 positive place invariants in 202 ms returned sat
[2024-05-25 15:15:08] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 98 ms returned sat
[2024-05-25 15:15:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:15:10] [INFO ] [Real]Absence check using state equation in 2011 ms returned sat
[2024-05-25 15:15:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:15:10] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-25 15:15:10] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2024-05-25 15:15:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:15:10] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-05-25 15:15:11] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 4 ms to minimize.
[2024-05-25 15:15:11] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2024-05-25 15:15:11] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-25 15:15:11] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
[2024-05-25 15:15:11] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-25 15:15:11] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 0 ms to minimize.
[2024-05-25 15:15:11] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 1 ms to minimize.
[2024-05-25 15:15:11] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 0 ms to minimize.
[2024-05-25 15:15:11] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-25 15:15:11] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 1 ms to minimize.
[2024-05-25 15:15:11] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-05-25 15:15:11] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1031 ms
[2024-05-25 15:15:12] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 46 ms.
[2024-05-25 15:15:12] [INFO ] Added : 130 causal constraints over 26 iterations in 966 ms. Result :sat
Minimization took 44 ms.
[2024-05-25 15:15:13] [INFO ] [Real]Absence check using 30 positive place invariants in 18 ms returned sat
[2024-05-25 15:15:13] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2024-05-25 15:15:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:15:13] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-25 15:15:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:15:13] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2024-05-25 15:15:13] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 12 ms returned sat
[2024-05-25 15:15:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:15:13] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-05-25 15:15:13] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-25 15:15:13] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2024-05-25 15:15:13] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 0 ms to minimize.
[2024-05-25 15:15:16] [INFO ] Deduced a trap composed of 15 places in 2950 ms of which 25 ms to minimize.
[2024-05-25 15:15:16] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 0 ms to minimize.
[2024-05-25 15:15:16] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2024-05-25 15:15:16] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 1 ms to minimize.
[2024-05-25 15:15:17] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 0 ms to minimize.
[2024-05-25 15:15:17] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 1 ms to minimize.
[2024-05-25 15:15:17] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2024-05-25 15:15:19] [INFO ] Deduced a trap composed of 57 places in 2206 ms of which 26 ms to minimize.
[2024-05-25 15:15:19] [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: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:15:19] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2024-05-25 15:15:19] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2024-05-25 15:15:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:15:19] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-05-25 15:15:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:15:19] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned sat
[2024-05-25 15:15:19] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2024-05-25 15:15:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:15:19] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-05-25 15:15:19] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 2 ms to minimize.
[2024-05-25 15:15:20] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 1 ms to minimize.
[2024-05-25 15:15:20] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2024-05-25 15:15:20] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2024-05-25 15:15:22] [INFO ] Deduced a trap composed of 17 places in 2481 ms of which 27 ms to minimize.
[2024-05-25 15:15:22] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-05-25 15:15:22] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 0 ms to minimize.
[2024-05-25 15:15:23] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 0 ms to minimize.
[2024-05-25 15:15:23] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-25 15:15:23] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-25 15:15:23] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-25 15:15:23] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2024-05-25 15:15:23] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 13 ms to minimize.
[2024-05-25 15:15:23] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2024-05-25 15:15:23] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:15:23] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3748 ms
[2024-05-25 15:15:23] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 13 ms.
[2024-05-25 15:15:24] [INFO ] Added : 135 causal constraints over 27 iterations in 427 ms. Result :sat
Minimization took 41 ms.
[2024-05-25 15:15:24] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned sat
[2024-05-25 15:15:24] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-25 15:15:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:15:24] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-25 15:15:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:15:24] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2024-05-25 15:15:24] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 16 ms returned sat
[2024-05-25 15:15:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:15:24] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-25 15:15:24] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-25 15:15:24] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2024-05-25 15:15:24] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 0 ms to minimize.
[2024-05-25 15:15:24] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-05-25 15:15:24] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2024-05-25 15:15:25] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-05-25 15:15:25] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 1 ms to minimize.
[2024-05-25 15:15:25] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 1 ms to minimize.
[2024-05-25 15:15:25] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-25 15:15:25] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-25 15:15:25] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 0 ms to minimize.
[2024-05-25 15:15:25] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 0 ms to minimize.
[2024-05-25 15:15:25] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-05-25 15:15:25] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 2 ms to minimize.
[2024-05-25 15:15:25] [INFO ] Deduced a trap composed of 56 places in 106 ms of which 0 ms to minimize.
[2024-05-25 15:15:25] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2024-05-25 15:15:26] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-25 15:15:26] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2024-05-25 15:15:26] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 11 ms to minimize.
[2024-05-25 15:15:26] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2024-05-25 15:15:26] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1792 ms
[2024-05-25 15:15:26] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 13 ms.
[2024-05-25 15:15:26] [INFO ] Added : 93 causal constraints over 19 iterations in 355 ms. Result :sat
Minimization took 42 ms.
[2024-05-25 15:15:26] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2024-05-25 15:15:26] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-25 15:15:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:15:26] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-05-25 15:15:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:15:26] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-25 15:15:26] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2024-05-25 15:15:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:15:27] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-25 15:15:27] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 0 ms to minimize.
[2024-05-25 15:15:27] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 1 ms to minimize.
[2024-05-25 15:15:27] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 0 ms to minimize.
[2024-05-25 15:15:27] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
[2024-05-25 15:15:27] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-25 15:15:27] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2024-05-25 15:15:27] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2024-05-25 15:15:27] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2024-05-25 15:15:27] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 0 ms to minimize.
[2024-05-25 15:15:27] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 1 ms to minimize.
[2024-05-25 15:15:27] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 0 ms to minimize.
[2024-05-25 15:15:28] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 1 ms to minimize.
[2024-05-25 15:15:28] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-25 15:15:28] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:15:28] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-25 15:15:28] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:15:28] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-05-25 15:15:28] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 0 ms to minimize.
[2024-05-25 15:15:28] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1437 ms
[2024-05-25 15:15:28] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 9 ms.
[2024-05-25 15:15:29] [INFO ] Added : 125 causal constraints over 25 iterations in 888 ms. Result :sat
Minimization took 40 ms.
[2024-05-25 15:15:29] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2024-05-25 15:15:29] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2024-05-25 15:15:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:15:29] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-05-25 15:15:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:15:29] [INFO ] [Nat]Absence check using 30 positive place invariants in 18 ms returned sat
[2024-05-25 15:15:29] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-25 15:15:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:15:29] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-25 15:15:29] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 0 ms to minimize.
[2024-05-25 15:15:29] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-25 15:15:30] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-25 15:15:30] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2024-05-25 15:15:30] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2024-05-25 15:15:30] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-25 15:15:30] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-25 15:15:30] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 0 ms to minimize.
[2024-05-25 15:15:30] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-25 15:15:30] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-25 15:15:30] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-25 15:15:30] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 0 ms to minimize.
[2024-05-25 15:15:30] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-05-25 15:15:31] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 1 ms to minimize.
[2024-05-25 15:15:31] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2024-05-25 15:15:31] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1337 ms
[2024-05-25 15:15:31] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 17 ms.
[2024-05-25 15:15:31] [INFO ] Added : 134 causal constraints over 27 iterations in 453 ms. Result :sat
Minimization took 51 ms.
[2024-05-25 15:15:31] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-25 15:15:31] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2024-05-25 15:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:15:31] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-05-25 15:15:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:15:31] [INFO ] [Nat]Absence check using 30 positive place invariants in 13 ms returned sat
[2024-05-25 15:15:31] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2024-05-25 15:15:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:15:32] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-25 15:15:32] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2024-05-25 15:15:32] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 0 ms to minimize.
[2024-05-25 15:15:32] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2024-05-25 15:15:32] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 1 ms to minimize.
[2024-05-25 15:15:32] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 0 ms to minimize.
[2024-05-25 15:15:32] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2024-05-25 15:15:32] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 0 ms to minimize.
[2024-05-25 15:15:32] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2024-05-25 15:15:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 798 ms
[2024-05-25 15:15:32] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 14 ms.
[2024-05-25 15:15:33] [INFO ] Added : 141 causal constraints over 29 iterations in 425 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 204/204 transitions.
Graph (trivial) has 135 edges and 245 vertex of which 7 / 245 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 438 edges and 239 vertex of which 227 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 227 transition count 141
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 179 transition count 139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 177 transition count 139
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 103 place count 177 transition count 102
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 81 rules applied. Total rules applied 184 place count 133 transition count 102
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 209 place count 108 transition count 77
Iterating global reduction 3 with 25 rules applied. Total rules applied 234 place count 108 transition count 77
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 312 place count 68 transition count 39
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 313 place count 68 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 314 place count 67 transition count 38
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 315 place count 67 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 66 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 65 transition count 37
Applied a total of 317 rules in 105 ms. Remains 65 /245 variables (removed 180) and now considering 37/204 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 65/245 places, 37/204 transitions.
// Phase 1: matrix 37 rows 65 cols
[2024-05-25 15:15:33] [INFO ] Computed 28 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 40815 resets, run finished after 1374 ms. (steps per millisecond=727 ) properties (out of 7) seen :7
FORMULA BusinessProcesses-PT-02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 27574 ms.

BK_STOP 1716650135222

--------------------
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-02"
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-02, 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-171620414800286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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