Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 91K May 5 16:51 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-08-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620544463606

Running Version 0
[2021-05-09 07:14:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 07:14:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:14:25] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2021-05-09 07:14:25] [INFO ] Transformed 393 places.
[2021-05-09 07:14:25] [INFO ] Transformed 344 transitions.
[2021-05-09 07:14:25] [INFO ] Found NUPN structural information;
[2021-05-09 07:14:25] [INFO ] Parsed PT model containing 393 places and 344 transitions in 99 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 13 places in 5 ms
Reduce places removed 13 places and 13 transitions.
FORMULA BusinessProcesses-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 331 rows 380 cols
[2021-05-09 07:14:25] [INFO ] Computed 58 place invariants in 25 ms
Incomplete random walk after 10000 steps, including 86 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 15) seen :8
FORMULA BusinessProcesses-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 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 15 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :1
FORMULA BusinessProcesses-PT-08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 331 rows 380 cols
[2021-05-09 07:14:25] [INFO ] Computed 58 place invariants in 13 ms
[2021-05-09 07:14:25] [INFO ] [Real]Absence check using 44 positive place invariants in 19 ms returned sat
[2021-05-09 07:14:25] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-09 07:14:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:14:25] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2021-05-09 07:14:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:14:25] [INFO ] [Nat]Absence check using 44 positive place invariants in 15 ms returned sat
[2021-05-09 07:14:25] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-09 07:14:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:14:26] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2021-05-09 07:14:26] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 3 ms to minimize.
[2021-05-09 07:14:26] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2021-05-09 07:14:26] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2021-05-09 07:14:26] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 2 ms to minimize.
[2021-05-09 07:14:26] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2021-05-09 07:14:26] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2021-05-09 07:14:26] [INFO ] Deduced a trap composed of 91 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:14:26] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2021-05-09 07:14:26] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2021-05-09 07:14:26] [INFO ] Deduced a trap composed of 85 places in 72 ms of which 0 ms to minimize.
[2021-05-09 07:14:26] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 0 ms to minimize.
[2021-05-09 07:14:26] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:14:26] [INFO ] Deduced a trap composed of 67 places in 38 ms of which 1 ms to minimize.
[2021-05-09 07:14:26] [INFO ] Deduced a trap composed of 67 places in 33 ms of which 0 ms to minimize.
[2021-05-09 07:14:26] [INFO ] Deduced a trap composed of 22 places in 13 ms of which 1 ms to minimize.
[2021-05-09 07:14:26] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 950 ms
[2021-05-09 07:14:26] [INFO ] Computed and/alt/rep : 305/374/305 causal constraints (skipped 25 transitions) in 21 ms.
[2021-05-09 07:14:27] [INFO ] Added : 192 causal constraints over 39 iterations in 862 ms. Result :sat
Minimization took 70 ms.
[2021-05-09 07:14:28] [INFO ] [Real]Absence check using 44 positive place invariants in 14 ms returned sat
[2021-05-09 07:14:28] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 2 ms returned sat
[2021-05-09 07:14:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:14:28] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2021-05-09 07:14:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:14:28] [INFO ] [Nat]Absence check using 44 positive place invariants in 13 ms returned sat
[2021-05-09 07:14:28] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-09 07:14:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:14:28] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2021-05-09 07:14:28] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2021-05-09 07:14:28] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2021-05-09 07:14:28] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 0 ms to minimize.
[2021-05-09 07:14:28] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2021-05-09 07:14:28] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2021-05-09 07:14:28] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2021-05-09 07:14:28] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 0 ms to minimize.
[2021-05-09 07:14:28] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2021-05-09 07:14:29] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 0 ms to minimize.
[2021-05-09 07:14:29] [INFO ] Deduced a trap composed of 91 places in 72 ms of which 1 ms to minimize.
[2021-05-09 07:14:29] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2021-05-09 07:14:29] [INFO ] Deduced a trap composed of 93 places in 64 ms of which 0 ms to minimize.
[2021-05-09 07:14:29] [INFO ] Deduced a trap composed of 100 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:14:29] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2021-05-09 07:14:29] [INFO ] Deduced a trap composed of 90 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:14:29] [INFO ] Deduced a trap composed of 86 places in 55 ms of which 0 ms to minimize.
[2021-05-09 07:14:29] [INFO ] Deduced a trap composed of 90 places in 72 ms of which 0 ms to minimize.
[2021-05-09 07:14:29] [INFO ] Deduced a trap composed of 90 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:14:29] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 1 ms to minimize.
[2021-05-09 07:14:29] [INFO ] Deduced a trap composed of 79 places in 56 ms of which 4 ms to minimize.
[2021-05-09 07:14:29] [INFO ] Deduced a trap composed of 88 places in 53 ms of which 1 ms to minimize.
[2021-05-09 07:14:29] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 1 ms to minimize.
[2021-05-09 07:14:30] [INFO ] Deduced a trap composed of 93 places in 55 ms of which 0 ms to minimize.
[2021-05-09 07:14:30] [INFO ] Deduced a trap composed of 93 places in 56 ms of which 1 ms to minimize.
[2021-05-09 07:14:30] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 1837 ms
[2021-05-09 07:14:30] [INFO ] Computed and/alt/rep : 305/374/305 causal constraints (skipped 25 transitions) in 26 ms.
[2021-05-09 07:14:30] [INFO ] Added : 189 causal constraints over 38 iterations in 647 ms. Result :sat
Minimization took 47 ms.
[2021-05-09 07:14:30] [INFO ] [Real]Absence check using 44 positive place invariants in 18 ms returned sat
[2021-05-09 07:14:30] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 4 ms returned sat
[2021-05-09 07:14:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:14:31] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2021-05-09 07:14:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:14:31] [INFO ] [Nat]Absence check using 44 positive place invariants in 12 ms returned sat
[2021-05-09 07:14:31] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 14 ms returned sat
[2021-05-09 07:14:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:14:31] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2021-05-09 07:14:31] [INFO ] Deduced a trap composed of 11 places in 355 ms of which 0 ms to minimize.
[2021-05-09 07:14:31] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2021-05-09 07:14:31] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:14:31] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 0 ms to minimize.
[2021-05-09 07:14:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 605 ms
[2021-05-09 07:14:31] [INFO ] Computed and/alt/rep : 305/374/305 causal constraints (skipped 25 transitions) in 18 ms.
[2021-05-09 07:14:32] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:14:32] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2021-05-09 07:14:32] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
[2021-05-09 07:14:32] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:14:33] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2021-05-09 07:14:33] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 0 ms to minimize.
[2021-05-09 07:14:33] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2021-05-09 07:14:33] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 0 ms to minimize.
[2021-05-09 07:14:33] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 0 ms to minimize.
[2021-05-09 07:14:33] [INFO ] Deduced a trap composed of 73 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:14:33] [INFO ] Deduced a trap composed of 59 places in 32 ms of which 0 ms to minimize.
[2021-05-09 07:14:33] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 719 ms
[2021-05-09 07:14:33] [INFO ] Added : 182 causal constraints over 38 iterations in 1525 ms. Result :sat
Minimization took 79 ms.
[2021-05-09 07:14:33] [INFO ] [Real]Absence check using 44 positive place invariants in 15 ms returned sat
[2021-05-09 07:14:33] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 4 ms returned sat
[2021-05-09 07:14:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:14:33] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2021-05-09 07:14:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:14:33] [INFO ] [Nat]Absence check using 44 positive place invariants in 19 ms returned sat
[2021-05-09 07:14:33] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-09 07:14:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:14:33] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2021-05-09 07:14:34] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2021-05-09 07:14:34] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2021-05-09 07:14:34] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 8 ms to minimize.
[2021-05-09 07:14:34] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
[2021-05-09 07:14:34] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2021-05-09 07:14:34] [INFO ] Deduced a trap composed of 86 places in 62 ms of which 0 ms to minimize.
[2021-05-09 07:14:34] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 0 ms to minimize.
[2021-05-09 07:14:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 618 ms
[2021-05-09 07:14:34] [INFO ] Computed and/alt/rep : 305/374/305 causal constraints (skipped 25 transitions) in 18 ms.
[2021-05-09 07:14:35] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 0 ms to minimize.
[2021-05-09 07:14:35] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 0 ms to minimize.
[2021-05-09 07:14:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2021-05-09 07:14:35] [INFO ] Added : 224 causal constraints over 46 iterations in 1084 ms. Result :sat
Minimization took 73 ms.
[2021-05-09 07:14:35] [INFO ] [Real]Absence check using 44 positive place invariants in 10 ms returned sat
[2021-05-09 07:14:35] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 2 ms returned sat
[2021-05-09 07:14:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:14:35] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2021-05-09 07:14:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:14:36] [INFO ] [Nat]Absence check using 44 positive place invariants in 17 ms returned sat
[2021-05-09 07:14:36] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-09 07:14:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:14:36] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2021-05-09 07:14:36] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2021-05-09 07:14:36] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2021-05-09 07:14:36] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2021-05-09 07:14:36] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 2 ms to minimize.
[2021-05-09 07:14:36] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2021-05-09 07:14:36] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 6 ms to minimize.
[2021-05-09 07:14:36] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2021-05-09 07:14:36] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2021-05-09 07:14:36] [INFO ] Deduced a trap composed of 24 places in 17 ms of which 0 ms to minimize.
[2021-05-09 07:14:36] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 458 ms
[2021-05-09 07:14:36] [INFO ] Computed and/alt/rep : 305/374/305 causal constraints (skipped 25 transitions) in 23 ms.
[2021-05-09 07:14:37] [INFO ] Added : 211 causal constraints over 43 iterations in 719 ms. Result :sat
Minimization took 47 ms.
[2021-05-09 07:14:37] [INFO ] [Real]Absence check using 44 positive place invariants in 11 ms returned sat
[2021-05-09 07:14:37] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 2 ms returned sat
[2021-05-09 07:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:14:37] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2021-05-09 07:14:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:14:37] [INFO ] [Nat]Absence check using 44 positive place invariants in 20 ms returned sat
[2021-05-09 07:14:37] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 5 ms returned sat
[2021-05-09 07:14:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:14:37] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2021-05-09 07:14:37] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2021-05-09 07:14:37] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:14:38] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 0 ms to minimize.
[2021-05-09 07:14:38] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2021-05-09 07:14:38] [INFO ] Deduced a trap composed of 101 places in 65 ms of which 0 ms to minimize.
[2021-05-09 07:14:38] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2021-05-09 07:14:38] [INFO ] Deduced a trap composed of 97 places in 59 ms of which 1 ms to minimize.
[2021-05-09 07:14:38] [INFO ] Deduced a trap composed of 104 places in 59 ms of which 0 ms to minimize.
[2021-05-09 07:14:38] [INFO ] Deduced a trap composed of 93 places in 61 ms of which 0 ms to minimize.
[2021-05-09 07:14:38] [INFO ] Deduced a trap composed of 93 places in 64 ms of which 1 ms to minimize.
[2021-05-09 07:14:38] [INFO ] Deduced a trap composed of 99 places in 62 ms of which 1 ms to minimize.
[2021-05-09 07:14:38] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2021-05-09 07:14:38] [INFO ] Deduced a trap composed of 97 places in 61 ms of which 0 ms to minimize.
[2021-05-09 07:14:38] [INFO ] Deduced a trap composed of 22 places in 12 ms of which 1 ms to minimize.
[2021-05-09 07:14:38] [INFO ] Deduced a trap composed of 20 places in 13 ms of which 0 ms to minimize.
[2021-05-09 07:14:38] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1077 ms
[2021-05-09 07:14:38] [INFO ] Computed and/alt/rep : 305/374/305 causal constraints (skipped 25 transitions) in 16 ms.
[2021-05-09 07:14:39] [INFO ] Deduced a trap composed of 102 places in 90 ms of which 0 ms to minimize.
[2021-05-09 07:14:39] [INFO ] Deduced a trap composed of 92 places in 71 ms of which 0 ms to minimize.
[2021-05-09 07:14:39] [INFO ] Deduced a trap composed of 99 places in 50 ms of which 1 ms to minimize.
[2021-05-09 07:14:39] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 0 ms to minimize.
[2021-05-09 07:14:40] [INFO ] Deduced a trap composed of 97 places in 48 ms of which 0 ms to minimize.
[2021-05-09 07:14:40] [INFO ] Deduced a trap composed of 97 places in 64 ms of which 0 ms to minimize.
[2021-05-09 07:14:40] [INFO ] Deduced a trap composed of 103 places in 63 ms of which 0 ms to minimize.
[2021-05-09 07:14:40] [INFO ] Deduced a trap composed of 102 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:14:40] [INFO ] Deduced a trap composed of 96 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:14:40] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 831 ms
[2021-05-09 07:14:40] [INFO ] Added : 235 causal constraints over 48 iterations in 1578 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 28700 steps, including 162 resets, run finished after 84 ms. (steps per millisecond=341 ) properties (out of 6) seen :5 could not realise parikh vector
FORMULA BusinessProcesses-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 22800 steps, including 164 resets, run finished after 47 ms. (steps per millisecond=485 ) properties (out of 1) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620544480930

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-08, 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 r026-tajo-162038143800379"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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