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.r041-tajo-167813694700469.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 ltsminxred
Input is BusinessProcesses-PT-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694700469
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K 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.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 16:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 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 63K 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-03-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678639708943

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-03
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:48:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 16:48:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:48:30] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-12 16:48:30] [INFO ] Transformed 274 places.
[2023-03-12 16:48:30] [INFO ] Transformed 237 transitions.
[2023-03-12 16:48:30] [INFO ] Found NUPN structural information;
[2023-03-12 16:48:30] [INFO ] Parsed PT model containing 274 places and 237 transitions and 632 arcs in 115 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 236 rows 273 cols
[2023-03-12 16:48:30] [INFO ] Computed 43 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 121 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 16) seen :9
FORMULA BusinessProcesses-PT-03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 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 21 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 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 22 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
[2023-03-12 16:48:30] [INFO ] Invariant cache hit.
[2023-03-12 16:48:30] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-12 16:48:30] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-12 16:48:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:31] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-12 16:48:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:48:31] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2023-03-12 16:48:31] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-12 16:48:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:31] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-12 16:48:31] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
[2023-03-12 16:48:31] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2023-03-12 16:48:31] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2023-03-12 16:48:31] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2023-03-12 16:48:31] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2023-03-12 16:48:31] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2023-03-12 16:48:31] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2023-03-12 16:48:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 368 ms
[2023-03-12 16:48:31] [INFO ] Computed and/alt/rep : 216/267/216 causal constraints (skipped 19 transitions) in 22 ms.
[2023-03-12 16:48:32] [INFO ] Added : 152 causal constraints over 32 iterations in 421 ms. Result :sat
Minimization took 41 ms.
[2023-03-12 16:48:32] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2023-03-12 16:48:32] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-12 16:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:32] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-12 16:48:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:48:32] [INFO ] [Nat]Absence check using 31 positive place invariants in 9 ms returned sat
[2023-03-12 16:48:32] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-12 16:48:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:32] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-12 16:48:32] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2023-03-12 16:48:32] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2023-03-12 16:48:32] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2023-03-12 16:48:32] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2023-03-12 16:48:32] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2023-03-12 16:48:32] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2023-03-12 16:48:32] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2023-03-12 16:48:32] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 0 ms to minimize.
[2023-03-12 16:48:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 428 ms
[2023-03-12 16:48:32] [INFO ] Computed and/alt/rep : 216/267/216 causal constraints (skipped 19 transitions) in 16 ms.
[2023-03-12 16:48:33] [INFO ] Added : 103 causal constraints over 21 iterations in 269 ms. Result :sat
Minimization took 27 ms.
[2023-03-12 16:48:33] [INFO ] [Real]Absence check using 31 positive place invariants in 8 ms returned sat
[2023-03-12 16:48:33] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-12 16:48:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:33] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-12 16:48:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:48:33] [INFO ] [Nat]Absence check using 31 positive place invariants in 9 ms returned sat
[2023-03-12 16:48:33] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-12 16:48:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:33] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-12 16:48:33] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2023-03-12 16:48:33] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2023-03-12 16:48:33] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2023-03-12 16:48:33] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2023-03-12 16:48:33] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2023-03-12 16:48:33] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2023-03-12 16:48:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 239 ms
[2023-03-12 16:48:33] [INFO ] Computed and/alt/rep : 216/267/216 causal constraints (skipped 19 transitions) in 11 ms.
[2023-03-12 16:48:33] [INFO ] Added : 156 causal constraints over 32 iterations in 375 ms. Result :sat
Minimization took 37 ms.
[2023-03-12 16:48:34] [INFO ] [Real]Absence check using 31 positive place invariants in 8 ms returned sat
[2023-03-12 16:48:34] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-12 16:48:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:34] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2023-03-12 16:48:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:48:34] [INFO ] [Nat]Absence check using 31 positive place invariants in 8 ms returned sat
[2023-03-12 16:48:34] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-12 16:48:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:34] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-12 16:48:34] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2023-03-12 16:48:34] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2023-03-12 16:48:34] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2023-03-12 16:48:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 115 ms
[2023-03-12 16:48:34] [INFO ] Computed and/alt/rep : 216/267/216 causal constraints (skipped 19 transitions) in 13 ms.
[2023-03-12 16:48:34] [INFO ] Added : 150 causal constraints over 30 iterations in 356 ms. Result :sat
Minimization took 33 ms.
[2023-03-12 16:48:34] [INFO ] [Real]Absence check using 31 positive place invariants in 8 ms returned sat
[2023-03-12 16:48:34] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-12 16:48:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:34] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-12 16:48:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:48:34] [INFO ] [Nat]Absence check using 31 positive place invariants in 8 ms returned sat
[2023-03-12 16:48:34] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-12 16:48:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:35] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-12 16:48:35] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2023-03-12 16:48:35] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2023-03-12 16:48:35] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2023-03-12 16:48:35] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2023-03-12 16:48:35] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2023-03-12 16:48:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 257 ms
[2023-03-12 16:48:35] [INFO ] Computed and/alt/rep : 216/267/216 causal constraints (skipped 19 transitions) in 11 ms.
[2023-03-12 16:48:35] [INFO ] Added : 131 causal constraints over 27 iterations in 332 ms. Result :sat
Minimization took 34 ms.
[2023-03-12 16:48:35] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned sat
[2023-03-12 16:48:35] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-12 16:48:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:35] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-12 16:48:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:48:35] [INFO ] [Nat]Absence check using 31 positive place invariants in 8 ms returned sat
[2023-03-12 16:48:35] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-12 16:48:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:35] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-12 16:48:35] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2023-03-12 16:48:36] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2023-03-12 16:48:36] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2023-03-12 16:48:36] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2023-03-12 16:48:36] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2023-03-12 16:48:36] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 3 ms to minimize.
[2023-03-12 16:48:36] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2023-03-12 16:48:36] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2023-03-12 16:48:36] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 356 ms
[2023-03-12 16:48:36] [INFO ] Computed and/alt/rep : 216/267/216 causal constraints (skipped 19 transitions) in 13 ms.
[2023-03-12 16:48:36] [INFO ] Added : 118 causal constraints over 25 iterations in 330 ms. Result :sat
Minimization took 32 ms.
[2023-03-12 16:48:36] [INFO ] [Real]Absence check using 31 positive place invariants in 7 ms returned sat
[2023-03-12 16:48:36] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-12 16:48:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:36] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-12 16:48:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:48:36] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2023-03-12 16:48:36] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-12 16:48:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:48:36] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-12 16:48:36] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2023-03-12 16:48:37] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2023-03-12 16:48:37] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2023-03-12 16:48:37] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2023-03-12 16:48:37] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 0 ms to minimize.
[2023-03-12 16:48:37] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2023-03-12 16:48:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 288 ms
[2023-03-12 16:48:37] [INFO ] Computed and/alt/rep : 216/267/216 causal constraints (skipped 19 transitions) in 12 ms.
[2023-03-12 16:48:37] [INFO ] Added : 96 causal constraints over 20 iterations in 224 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-03-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-03-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 7127 ms.
ITS solved all properties within timeout

BK_STOP 1678639717764

--------------------
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-03"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-03, 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 r041-tajo-167813694700469"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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