Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r199-smll-167840345800309.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is HealthRecord-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-167840345800309
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 8.1K Feb 26 18:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 18:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 18:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 18:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Feb 26 18:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 18:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 26 18:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 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 69K 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 HealthRecord-PT-10-UpperBounds-00
FORMULA_NAME HealthRecord-PT-10-UpperBounds-01
FORMULA_NAME HealthRecord-PT-10-UpperBounds-02
FORMULA_NAME HealthRecord-PT-10-UpperBounds-03
FORMULA_NAME HealthRecord-PT-10-UpperBounds-04
FORMULA_NAME HealthRecord-PT-10-UpperBounds-05
FORMULA_NAME HealthRecord-PT-10-UpperBounds-06
FORMULA_NAME HealthRecord-PT-10-UpperBounds-07
FORMULA_NAME HealthRecord-PT-10-UpperBounds-08
FORMULA_NAME HealthRecord-PT-10-UpperBounds-09
FORMULA_NAME HealthRecord-PT-10-UpperBounds-10
FORMULA_NAME HealthRecord-PT-10-UpperBounds-11
FORMULA_NAME HealthRecord-PT-10-UpperBounds-12
FORMULA_NAME HealthRecord-PT-10-UpperBounds-13
FORMULA_NAME HealthRecord-PT-10-UpperBounds-14
FORMULA_NAME HealthRecord-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678516820552

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 06:40:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 06:40:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 06:40:24] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2023-03-11 06:40:24] [INFO ] Transformed 158 places.
[2023-03-11 06:40:24] [INFO ] Transformed 333 transitions.
[2023-03-11 06:40:24] [INFO ] Found NUPN structural information;
[2023-03-11 06:40:24] [INFO ] Parsed PT model containing 158 places and 333 transitions and 875 arcs in 407 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
Normalized transition count is 294 out of 306 initially.
// Phase 1: matrix 294 rows 158 cols
[2023-03-11 06:40:24] [INFO ] Computed 18 place invariants in 35 ms
Incomplete random walk after 10000 steps, including 640 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 16) seen :6
FORMULA HealthRecord-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :1
FORMULA HealthRecord-PT-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 82 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
[2023-03-11 06:40:24] [INFO ] Flow matrix only has 294 transitions (discarded 12 similar events)
// Phase 1: matrix 294 rows 158 cols
[2023-03-11 06:40:24] [INFO ] Computed 18 place invariants in 11 ms
[2023-03-11 06:40:25] [INFO ] [Real]Absence check using 10 positive place invariants in 23 ms returned sat
[2023-03-11 06:40:25] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 06:40:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:40:25] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2023-03-11 06:40:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:40:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-11 06:40:25] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 06:40:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:40:25] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2023-03-11 06:40:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:40:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2023-03-11 06:40:25] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 7 ms to minimize.
[2023-03-11 06:40:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2023-03-11 06:40:26] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 67 ms.
[2023-03-11 06:40:26] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2023-03-11 06:40:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-03-11 06:40:26] [INFO ] Added : 16 causal constraints over 5 iterations in 381 ms. Result :sat
Minimization took 32 ms.
[2023-03-11 06:40:26] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-11 06:40:26] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 06:40:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:40:26] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2023-03-11 06:40:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:40:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-11 06:40:26] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2023-03-11 06:40:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:40:26] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2023-03-11 06:40:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 06:40:26] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 38 ms.
[2023-03-11 06:40:26] [INFO ] Added : 13 causal constraints over 3 iterations in 132 ms. Result :sat
Minimization took 30 ms.
[2023-03-11 06:40:27] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-11 06:40:27] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 06:40:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:40:27] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2023-03-11 06:40:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:40:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-11 06:40:27] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 06:40:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:40:27] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-03-11 06:40:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-11 06:40:27] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 1 ms to minimize.
[2023-03-11 06:40:27] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 3 ms to minimize.
[2023-03-11 06:40:27] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 1 ms to minimize.
[2023-03-11 06:40:27] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 1 ms to minimize.
[2023-03-11 06:40:28] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 0 ms to minimize.
[2023-03-11 06:40:28] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2023-03-11 06:40:28] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 1 ms to minimize.
[2023-03-11 06:40:28] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 1 ms to minimize.
[2023-03-11 06:40:28] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1025 ms
[2023-03-11 06:40:28] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 26 ms.
[2023-03-11 06:40:28] [INFO ] Added : 14 causal constraints over 3 iterations in 114 ms. Result :sat
Minimization took 35 ms.
[2023-03-11 06:40:28] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-11 06:40:28] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 06:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:40:28] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2023-03-11 06:40:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:40:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 22 ms returned sat
[2023-03-11 06:40:28] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 06:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:40:29] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2023-03-11 06:40:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 06:40:29] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 69 ms.
[2023-03-11 06:40:29] [INFO ] Added : 13 causal constraints over 3 iterations in 241 ms. Result :sat
Minimization took 47 ms.
[2023-03-11 06:40:29] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-11 06:40:29] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 06:40:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:40:29] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2023-03-11 06:40:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:40:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-11 06:40:29] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 06:40:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:40:30] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2023-03-11 06:40:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-11 06:40:30] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 45 ms.
[2023-03-11 06:40:30] [INFO ] Added : 21 causal constraints over 5 iterations in 188 ms. Result :sat
Minimization took 54 ms.
[2023-03-11 06:40:30] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-11 06:40:30] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 06:40:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:40:30] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2023-03-11 06:40:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:40:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-11 06:40:30] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 06:40:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:40:30] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2023-03-11 06:40:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2023-03-11 06:40:30] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 39 ms.
[2023-03-11 06:40:30] [INFO ] Added : 18 causal constraints over 4 iterations in 159 ms. Result :sat
Minimization took 48 ms.
[2023-03-11 06:40:31] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-11 06:40:31] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 06:40:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:40:31] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2023-03-11 06:40:31] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 06:40:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:40:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-11 06:40:31] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 06:40:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:40:31] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2023-03-11 06:40:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 06:40:31] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 42 ms.
[2023-03-11 06:40:31] [INFO ] Added : 24 causal constraints over 6 iterations in 207 ms. Result :sat
Minimization took 40 ms.
[2023-03-11 06:40:31] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-11 06:40:31] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 06:40:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:40:31] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2023-03-11 06:40:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:40:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-11 06:40:32] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 06:40:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:40:32] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2023-03-11 06:40:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2023-03-11 06:40:32] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 1 ms to minimize.
[2023-03-11 06:40:32] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2023-03-11 06:40:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 213 ms
[2023-03-11 06:40:32] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 47 ms.
[2023-03-11 06:40:32] [INFO ] Added : 23 causal constraints over 6 iterations in 206 ms. Result :sat
Minimization took 33 ms.
[2023-03-11 06:40:32] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-11 06:40:32] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 06:40:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:40:32] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2023-03-11 06:40:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:40:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-11 06:40:32] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 06:40:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:40:33] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2023-03-11 06:40:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 06:40:33] [INFO ] Computed and/alt/rep : 230/264/230 causal constraints (skipped 63 transitions) in 36 ms.
[2023-03-11 06:40:33] [INFO ] Added : 16 causal constraints over 4 iterations in 167 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA HealthRecord-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Graph (trivial) has 236 edges and 158 vertex of which 10 / 158 are part of one of the 5 SCC in 7 ms
Free SCC test removed 5 places
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Graph (complete) has 664 edges and 153 vertex of which 123 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.3 ms
Discarding 30 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Drop transitions removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Iterating post reduction 0 with 111 rules applied. Total rules applied 113 place count 123 transition count 157
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 191 place count 45 transition count 79
Iterating global reduction 1 with 78 rules applied. Total rules applied 269 place count 45 transition count 79
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 269 place count 45 transition count 74
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 279 place count 40 transition count 74
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 290 place count 29 transition count 59
Iterating global reduction 1 with 11 rules applied. Total rules applied 301 place count 29 transition count 59
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 310 place count 29 transition count 50
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 312 place count 27 transition count 47
Iterating global reduction 2 with 2 rules applied. Total rules applied 314 place count 27 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 315 place count 27 transition count 46
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 316 place count 26 transition count 45
Iterating global reduction 3 with 1 rules applied. Total rules applied 317 place count 26 transition count 45
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 320 place count 26 transition count 42
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 326 place count 23 transition count 39
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 327 place count 23 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 328 place count 22 transition count 37
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 331 place count 20 transition count 36
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 340 place count 20 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 342 place count 19 transition count 26
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 343 place count 18 transition count 25
Iterating global reduction 5 with 1 rules applied. Total rules applied 344 place count 18 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 345 place count 18 transition count 24
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 348 place count 18 transition count 21
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 351 place count 15 transition count 21
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 352 place count 15 transition count 21
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 353 place count 15 transition count 20
Applied a total of 353 rules in 99 ms. Remains 15 /158 variables (removed 143) and now considering 20/306 (removed 286) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 15/158 places, 20/306 transitions.
// Phase 1: matrix 20 rows 15 cols
[2023-03-11 06:40:33] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 95465 resets, run finished after 976 ms. (steps per millisecond=1024 ) properties (out of 4) seen :4
FORMULA HealthRecord-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 10614 ms.
ITS solved all properties within timeout

BK_STOP 1678516835681

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="HealthRecord-PT-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is HealthRecord-PT-10, 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 r199-smll-167840345800309"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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