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-167840345700269.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-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-167840345700269
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.9K Feb 26 17:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 17:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 17:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 17:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 18K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Feb 26 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 18:00 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 51K 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-05-UpperBounds-00
FORMULA_NAME HealthRecord-PT-05-UpperBounds-01
FORMULA_NAME HealthRecord-PT-05-UpperBounds-02
FORMULA_NAME HealthRecord-PT-05-UpperBounds-03
FORMULA_NAME HealthRecord-PT-05-UpperBounds-04
FORMULA_NAME HealthRecord-PT-05-UpperBounds-05
FORMULA_NAME HealthRecord-PT-05-UpperBounds-06
FORMULA_NAME HealthRecord-PT-05-UpperBounds-07
FORMULA_NAME HealthRecord-PT-05-UpperBounds-08
FORMULA_NAME HealthRecord-PT-05-UpperBounds-09
FORMULA_NAME HealthRecord-PT-05-UpperBounds-10
FORMULA_NAME HealthRecord-PT-05-UpperBounds-11
FORMULA_NAME HealthRecord-PT-05-UpperBounds-12
FORMULA_NAME HealthRecord-PT-05-UpperBounds-13
FORMULA_NAME HealthRecord-PT-05-UpperBounds-14
FORMULA_NAME HealthRecord-PT-05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678503978109

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-05
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:06:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 03:06:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:06:21] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2023-03-11 03:06:21] [INFO ] Transformed 125 places.
[2023-03-11 03:06:21] [INFO ] Transformed 246 transitions.
[2023-03-11 03:06:21] [INFO ] Found NUPN structural information;
[2023-03-11 03:06:21] [INFO ] Parsed PT model containing 125 places and 246 transitions and 637 arcs in 306 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
Normalized transition count is 229 out of 237 initially.
// Phase 1: matrix 229 rows 125 cols
[2023-03-11 03:06:22] [INFO ] Computed 14 place invariants in 21 ms
Incomplete random walk after 10000 steps, including 929 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 16) seen :9
FORMULA HealthRecord-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
[2023-03-11 03:06:22] [INFO ] Flow matrix only has 229 transitions (discarded 8 similar events)
// Phase 1: matrix 229 rows 125 cols
[2023-03-11 03:06:22] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-11 03:06:22] [INFO ] [Real]Absence check using 8 positive place invariants in 18 ms returned sat
[2023-03-11 03:06:22] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-11 03:06:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:06:22] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2023-03-11 03:06:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:06:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 23 ms returned sat
[2023-03-11 03:06:23] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-11 03:06:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:06:23] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2023-03-11 03:06:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 03:06:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2023-03-11 03:06:23] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 5 ms to minimize.
[2023-03-11 03:06:23] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 20 ms to minimize.
[2023-03-11 03:06:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 461 ms
[2023-03-11 03:06:23] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 47 ms.
[2023-03-11 03:06:23] [INFO ] Added : 7 causal constraints over 2 iterations in 149 ms. Result :sat
Minimization took 39 ms.
[2023-03-11 03:06:24] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2023-03-11 03:06:24] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 16 ms returned sat
[2023-03-11 03:06:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:06:24] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2023-03-11 03:06:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:06:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2023-03-11 03:06:24] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-11 03:06:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:06:24] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2023-03-11 03:06:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 03:06:24] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 37 ms.
[2023-03-11 03:06:24] [INFO ] Added : 6 causal constraints over 2 iterations in 123 ms. Result :sat
Minimization took 39 ms.
[2023-03-11 03:06:24] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2023-03-11 03:06:24] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-11 03:06:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:06:24] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2023-03-11 03:06:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:06:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2023-03-11 03:06:24] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-11 03:06:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:06:25] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2023-03-11 03:06:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 03:06:25] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 40 ms.
[2023-03-11 03:06:25] [INFO ] Added : 9 causal constraints over 2 iterations in 118 ms. Result :sat
Minimization took 34 ms.
[2023-03-11 03:06:25] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2023-03-11 03:06:25] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-11 03:06:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:06:25] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2023-03-11 03:06:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:06:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 40 ms returned sat
[2023-03-11 03:06:25] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2023-03-11 03:06:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:06:25] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2023-03-11 03:06:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 03:06:25] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 35 ms.
[2023-03-11 03:06:25] [INFO ] Added : 24 causal constraints over 5 iterations in 187 ms. Result :sat
Minimization took 41 ms.
[2023-03-11 03:06:26] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-11 03:06:26] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-11 03:06:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:06:26] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2023-03-11 03:06:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:06:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2023-03-11 03:06:26] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-11 03:06:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:06:26] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2023-03-11 03:06:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 03:06:26] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 2 ms to minimize.
[2023-03-11 03:06:26] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 2 ms to minimize.
[2023-03-11 03:06:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 249 ms
[2023-03-11 03:06:26] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 31 ms.
[2023-03-11 03:06:26] [INFO ] Added : 5 causal constraints over 1 iterations in 91 ms. Result :sat
Minimization took 38 ms.
[2023-03-11 03:06:26] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2023-03-11 03:06:26] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-11 03:06:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:06:26] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2023-03-11 03:06:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:06:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-11 03:06:27] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-11 03:06:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:06:27] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2023-03-11 03:06:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 03:06:27] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 2 ms to minimize.
[2023-03-11 03:06:27] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2023-03-11 03:06:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 254 ms
[2023-03-11 03:06:27] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 30 ms.
[2023-03-11 03:06:27] [INFO ] Added : 6 causal constraints over 2 iterations in 95 ms. Result :sat
Minimization took 24 ms.
[2023-03-11 03:06:27] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2023-03-11 03:06:27] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-11 03:06:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:06:27] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-03-11 03:06:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:06:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2023-03-11 03:06:27] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-11 03:06:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:06:27] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2023-03-11 03:06:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-11 03:06:28] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 30 ms.
[2023-03-11 03:06:28] [INFO ] Added : 8 causal constraints over 2 iterations in 106 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA HealthRecord-PT-05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 237/237 transitions.
Graph (trivial) has 181 edges and 125 vertex of which 6 / 125 are part of one of the 3 SCC in 6 ms
Free SCC test removed 3 places
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 457 edges and 122 vertex of which 100 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Iterating post reduction 0 with 91 rules applied. Total rules applied 93 place count 100 transition count 122
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 150 place count 43 transition count 65
Iterating global reduction 1 with 57 rules applied. Total rules applied 207 place count 43 transition count 65
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 207 place count 43 transition count 59
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 219 place count 37 transition count 59
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 233 place count 23 transition count 37
Iterating global reduction 1 with 14 rules applied. Total rules applied 247 place count 23 transition count 37
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 250 place count 23 transition count 34
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 254 place count 19 transition count 27
Iterating global reduction 2 with 4 rules applied. Total rules applied 258 place count 19 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 259 place count 19 transition count 26
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 262 place count 16 transition count 23
Iterating global reduction 3 with 3 rules applied. Total rules applied 265 place count 16 transition count 23
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 268 place count 16 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 272 place count 14 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 273 place count 13 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 274 place count 12 transition count 17
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 276 place count 12 transition count 15
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 278 place count 11 transition count 14
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 279 place count 10 transition count 13
Iterating global reduction 5 with 1 rules applied. Total rules applied 280 place count 10 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 281 place count 10 transition count 12
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 282 place count 10 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 283 place count 9 transition count 11
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 284 place count 9 transition count 11
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 285 place count 9 transition count 10
Applied a total of 285 rules in 81 ms. Remains 9 /125 variables (removed 116) and now considering 10/237 (removed 227) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 9/125 places, 10/237 transitions.
// Phase 1: matrix 10 rows 9 cols
[2023-03-11 03:06:28] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 151222 resets, run finished after 790 ms. (steps per millisecond=1265 ) properties (out of 2) seen :2
FORMULA HealthRecord-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 7461 ms.
ITS solved all properties within timeout

BK_STOP 1678503990145

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-05"
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-05, 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-167840345700269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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