Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399700517.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
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 r472-tajo-171620399700517
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 11 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 104K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-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 1717225483213

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-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:04:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 07:04:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:04:44] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-06-01 07:04:44] [INFO ] Transformed 403 places.
[2024-06-01 07:04:44] [INFO ] Transformed 374 transitions.
[2024-06-01 07:04:44] [INFO ] Found NUPN structural information;
[2024-06-01 07:04:44] [INFO ] Parsed PT model containing 403 places and 374 transitions and 1148 arcs in 218 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 374 rows 403 cols
[2024-06-01 07:04:44] [INFO ] Computed 65 invariants in 31 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (102 resets) in 46 ms. (212 steps per ms)
FORMULA BusinessProcesses-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60004 steps (111 resets) in 70 ms. (845 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2024-06-01 07:04:45] [INFO ] Invariant cache hit.
[2024-06-01 07:04:45] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2024-06-01 07:04:45] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 10 ms returned sat
[2024-06-01 07:04:45] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2024-06-01 07:04:45] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 12 ms to minimize.
[2024-06-01 07:04:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:04:45] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2024-06-01 07:04:45] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 7 ms returned sat
[2024-06-01 07:04:46] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2024-06-01 07:04:46] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:04:46] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:04:46] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:04:46] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:04:46] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:04:46] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:04:46] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:04:46] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:04:47] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:04:47] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:04:47] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:04:47] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:04:47] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1392 ms
[2024-06-01 07:04:47] [INFO ] Computed and/alt/rep : 352/641/352 causal constraints (skipped 21 transitions) in 27 ms.
[2024-06-01 07:04:48] [INFO ] Added : 184 causal constraints over 37 iterations in 1003 ms. Result :sat
Minimization took 273 ms.
[2024-06-01 07:04:48] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2024-06-01 07:04:48] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 9 ms returned sat
[2024-06-01 07:04:49] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-06-01 07:04:49] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:04:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:04:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 21 ms returned sat
[2024-06-01 07:04:49] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 10 ms returned sat
[2024-06-01 07:04:49] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2024-06-01 07:04:49] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:04:49] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:04:49] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:04:49] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:04:50] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:04:50] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:04:50] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:04:50] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:04:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1018 ms
[2024-06-01 07:04:50] [INFO ] Computed and/alt/rep : 352/641/352 causal constraints (skipped 21 transitions) in 27 ms.
[2024-06-01 07:04:51] [INFO ] Added : 193 causal constraints over 39 iterations in 892 ms. Result :sat
Minimization took 196 ms.
[2024-06-01 07:04:51] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2024-06-01 07:04:51] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 9 ms returned sat
[2024-06-01 07:04:51] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2024-06-01 07:04:52] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:04:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:04:52] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2024-06-01 07:04:52] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 8 ms returned sat
[2024-06-01 07:04:52] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2024-06-01 07:04:52] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:04:52] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:04:52] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:04:52] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:04:52] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:04:53] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:04:53] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:04:53] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:04:53] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:04:53] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:04:53] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:04:53] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 8 ms to minimize.
[2024-06-01 07:04:53] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1267 ms
[2024-06-01 07:04:53] [INFO ] Computed and/alt/rep : 352/641/352 causal constraints (skipped 21 transitions) in 27 ms.
[2024-06-01 07:04:54] [INFO ] Added : 229 causal constraints over 47 iterations in 1191 ms. Result :sat
Minimization took 251 ms.
[2024-06-01 07:04:55] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2024-06-01 07:04:55] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 7 ms returned sat
[2024-06-01 07:04:55] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2024-06-01 07:04:55] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:04:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:04:55] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2024-06-01 07:04:55] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 9 ms returned sat
[2024-06-01 07:04:55] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2024-06-01 07:04:55] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:04:55] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:04:56] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:04:56] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 4 ms to minimize.
[2024-06-01 07:04:56] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 4 ms to minimize.
[2024-06-01 07:04:56] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:04:56] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:04:56] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:04:56] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:04:56] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:04:56] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1287 ms
[2024-06-01 07:04:56] [INFO ] Computed and/alt/rep : 352/641/352 causal constraints (skipped 21 transitions) in 29 ms.
[2024-06-01 07:04:57] [INFO ] Added : 219 causal constraints over 44 iterations in 974 ms. Result :sat
Minimization took 192 ms.
[2024-06-01 07:04:58] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2024-06-01 07:04:58] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 9 ms returned sat
[2024-06-01 07:04:58] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-06-01 07:04:58] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:04:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:04:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2024-06-01 07:04:58] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 9 ms returned sat
[2024-06-01 07:04:58] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2024-06-01 07:04:58] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:04:59] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:04:59] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:04:59] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:04:59] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:04:59] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:04:59] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:04:59] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:04:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 753 ms
[2024-06-01 07:04:59] [INFO ] Computed and/alt/rep : 352/641/352 causal constraints (skipped 21 transitions) in 27 ms.
[2024-06-01 07:05:00] [INFO ] Added : 219 causal constraints over 45 iterations in 1124 ms. Result :sat
Minimization took 243 ms.
[2024-06-01 07:05:01] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2024-06-01 07:05:01] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 9 ms returned sat
[2024-06-01 07:05:01] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2024-06-01 07:05:01] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 5 ms to minimize.
[2024-06-01 07:05:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:05:01] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2024-06-01 07:05:01] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 7 ms returned sat
[2024-06-01 07:05:01] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2024-06-01 07:05:01] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:05:01] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:05:02] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:05:02] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:05:02] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 5 ms to minimize.
[2024-06-01 07:05:02] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:05:02] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:05:02] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:05:02] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:05:03] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:05:03] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:05:03] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:05:03] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:05:03] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:05:03] [INFO ] Deduced a trap composed of 109 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:05:03] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:05:04] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:05:04] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:05:04] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:05:04] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:05:04] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:05:04] [INFO ] Deduced a trap composed of 101 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:05:04] [INFO ] Deduced a trap composed of 113 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:05:04] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:05:04] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:05:05] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:05:05] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:05:05] [INFO ] Deduced a trap composed of 101 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:05:05] [INFO ] Deduced a trap composed of 99 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:05:05] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:05:05] [INFO ] Deduced a trap composed of 94 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:05:05] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:05:05] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:05:05] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:05:06] [INFO ] Deduced a trap composed of 96 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:05:06] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:05:06] [INFO ] Deduced a trap composed of 104 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:05:06] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:05:06] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:05:06] [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 5
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 374/374 transitions.
Graph (trivial) has 219 edges and 403 vertex of which 7 / 403 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 837 edges and 397 vertex of which 395 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 395 transition count 284
Reduce places removed 81 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 84 rules applied. Total rules applied 167 place count 314 transition count 281
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 170 place count 311 transition count 281
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 170 place count 311 transition count 221
Deduced a syphon composed of 60 places in 2 ms
Ensure Unique test removed 9 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 129 rules applied. Total rules applied 299 place count 242 transition count 221
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 344 place count 197 transition count 176
Iterating global reduction 3 with 45 rules applied. Total rules applied 389 place count 197 transition count 176
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 389 place count 197 transition count 171
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 399 place count 192 transition count 171
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 521 place count 130 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 523 place count 129 transition count 114
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 525 place count 129 transition count 112
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 527 place count 127 transition count 112
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 528 place count 127 transition count 112
Applied a total of 528 rules in 169 ms. Remains 127 /403 variables (removed 276) and now considering 112/374 (removed 262) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 127/403 places, 112/374 transitions.
// Phase 1: matrix 112 rows 127 cols
[2024-06-01 07:05:06] [INFO ] Computed 53 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (55727 resets) in 2146 ms. (465 steps per ms)
FORMULA BusinessProcesses-PT-09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (23953 resets) in 1143 ms. (874 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 25637 ms.
ITS solved all properties within timeout

BK_STOP 1717225510330

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="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-5568"
echo " Executing tool ltsminxred"
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 r472-tajo-171620399700517"
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 ;