Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 16:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 104K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678502413054

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-09
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:40:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 02:40:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:40:15] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2023-03-11 02:40:15] [INFO ] Transformed 403 places.
[2023-03-11 02:40:15] [INFO ] Transformed 374 transitions.
[2023-03-11 02:40:15] [INFO ] Found NUPN structural information;
[2023-03-11 02:40:15] [INFO ] Parsed PT model containing 403 places and 374 transitions and 1148 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 374 rows 403 cols
[2023-03-11 02:40:15] [INFO ] Computed 65 place invariants in 25 ms
Incomplete random walk after 10000 steps, including 101 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :11
FORMULA BusinessProcesses-PT-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :2
FORMULA BusinessProcesses-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
[2023-03-11 02:40:15] [INFO ] Invariant cache hit.
[2023-03-11 02:40:15] [INFO ] [Real]Absence check using 36 positive place invariants in 25 ms returned sat
[2023-03-11 02:40:15] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-11 02:40:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:40:15] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-03-11 02:40:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:40:16] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2023-03-11 02:40:16] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-11 02:40:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:40:16] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-03-11 02:40:16] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 3 ms to minimize.
[2023-03-11 02:40:16] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 1 ms to minimize.
[2023-03-11 02:40:16] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2023-03-11 02:40:16] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2023-03-11 02:40:16] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 0 ms to minimize.
[2023-03-11 02:40:17] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 0 ms to minimize.
[2023-03-11 02:40:17] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2023-03-11 02:40:17] [INFO ] Deduced a trap composed of 100 places in 83 ms of which 1 ms to minimize.
[2023-03-11 02:40:17] [INFO ] Deduced a trap composed of 107 places in 81 ms of which 1 ms to minimize.
[2023-03-11 02:40:17] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2023-03-11 02:40:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1101 ms
[2023-03-11 02:40:17] [INFO ] Computed and/alt/rep : 352/641/352 causal constraints (skipped 21 transitions) in 29 ms.
[2023-03-11 02:40:18] [INFO ] Added : 211 causal constraints over 43 iterations in 810 ms. Result :sat
Minimization took 65 ms.
[2023-03-11 02:40:18] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2023-03-11 02:40:18] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-11 02:40:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:40:18] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-03-11 02:40:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:40:18] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2023-03-11 02:40:18] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 02:40:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:40:18] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2023-03-11 02:40:18] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 1 ms to minimize.
[2023-03-11 02:40:19] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 1 ms to minimize.
[2023-03-11 02:40:19] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 0 ms to minimize.
[2023-03-11 02:40:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 507 ms
[2023-03-11 02:40:19] [INFO ] Computed and/alt/rep : 352/641/352 causal constraints (skipped 21 transitions) in 35 ms.
[2023-03-11 02:40:20] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 0 ms to minimize.
[2023-03-11 02:40:20] [INFO ] Deduced a trap composed of 92 places in 84 ms of which 1 ms to minimize.
[2023-03-11 02:40:20] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 1 ms to minimize.
[2023-03-11 02:40:20] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 0 ms to minimize.
[2023-03-11 02:40:20] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 1 ms to minimize.
[2023-03-11 02:40:20] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 1 ms to minimize.
[2023-03-11 02:40:21] [INFO ] Deduced a trap composed of 88 places in 139 ms of which 6 ms to minimize.
[2023-03-11 02:40:21] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 0 ms to minimize.
[2023-03-11 02:40:21] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 1 ms to minimize.
[2023-03-11 02:40:21] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 0 ms to minimize.
[2023-03-11 02:40:21] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 1 ms to minimize.
[2023-03-11 02:40:21] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 2 ms to minimize.
[2023-03-11 02:40:21] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 1 ms to minimize.
[2023-03-11 02:40:22] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 1 ms to minimize.
[2023-03-11 02:40:22] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 0 ms to minimize.
[2023-03-11 02:40:22] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 0 ms to minimize.
[2023-03-11 02:40:22] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 0 ms to minimize.
[2023-03-11 02:40:22] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 0 ms to minimize.
[2023-03-11 02:40:22] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 1 ms to minimize.
[2023-03-11 02:40:22] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 1 ms to minimize.
[2023-03-11 02:40:23] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 1 ms to minimize.
[2023-03-11 02:40:23] [INFO ] Deduced a trap composed of 104 places in 136 ms of which 3 ms to minimize.
[2023-03-11 02:40:23] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 0 ms to minimize.
[2023-03-11 02:40:23] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 1 ms to minimize.
[2023-03-11 02:40: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 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-11 02:40:23] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2023-03-11 02:40:23] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-11 02:40:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:40:23] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-11 02:40:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:40:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2023-03-11 02:40:23] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 16 ms returned sat
[2023-03-11 02:40:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:40:24] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2023-03-11 02:40:24] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 0 ms to minimize.
[2023-03-11 02:40:24] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 0 ms to minimize.
[2023-03-11 02:40:24] [INFO ] Deduced a trap composed of 100 places in 141 ms of which 1 ms to minimize.
[2023-03-11 02:40:24] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 1 ms to minimize.
[2023-03-11 02:40:24] [INFO ] Deduced a trap composed of 103 places in 115 ms of which 1 ms to minimize.
[2023-03-11 02:40:24] [INFO ] Deduced a trap composed of 115 places in 118 ms of which 1 ms to minimize.
[2023-03-11 02:40:25] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2023-03-11 02:40:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 916 ms
[2023-03-11 02:40:25] [INFO ] Computed and/alt/rep : 352/641/352 causal constraints (skipped 21 transitions) in 27 ms.
[2023-03-11 02:40:25] [INFO ] Added : 204 causal constraints over 41 iterations in 840 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA BusinessProcesses-PT-09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 403 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 373/373 transitions.
Graph (trivial) has 225 edges and 403 vertex of which 7 / 403 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 836 edges and 397 vertex of which 395 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 87 place count 395 transition count 279
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 172 place count 310 transition count 279
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 172 place count 310 transition count 217
Deduced a syphon composed of 62 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 306 place count 238 transition count 217
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 352 place count 192 transition count 171
Iterating global reduction 2 with 46 rules applied. Total rules applied 398 place count 192 transition count 171
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 398 place count 192 transition count 165
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 2 with 13 rules applied. Total rules applied 411 place count 185 transition count 165
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 535 place count 122 transition count 104
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 2 with 2 rules applied. Total rules applied 537 place count 121 transition count 107
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 539 place count 121 transition count 105
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 541 place count 119 transition count 105
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 542 place count 119 transition count 105
Applied a total of 542 rules in 112 ms. Remains 119 /403 variables (removed 284) and now considering 105/373 (removed 268) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 119/403 places, 105/373 transitions.
// Phase 1: matrix 105 rows 119 cols
[2023-03-11 02:40:26] [INFO ] Computed 51 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 71326 resets, run finished after 1829 ms. (steps per millisecond=546 ) properties (out of 1) seen :1
FORMULA BusinessProcesses-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 12839 ms.
ITS solved all properties within timeout

BK_STOP 1678502428329

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

+ 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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-09"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is BusinessProcesses-PT-09, 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 r039-tajo-167813692600517"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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