Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r496-tall-171640604100765.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is HealthRecord-PT-09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640604100765
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 21:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 230K Apr 12 21:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 21:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 21:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 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 68K 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 HealthRecord-PT-09-UpperBounds-00
FORMULA_NAME HealthRecord-PT-09-UpperBounds-01
FORMULA_NAME HealthRecord-PT-09-UpperBounds-02
FORMULA_NAME HealthRecord-PT-09-UpperBounds-03
FORMULA_NAME HealthRecord-PT-09-UpperBounds-04
FORMULA_NAME HealthRecord-PT-09-UpperBounds-05
FORMULA_NAME HealthRecord-PT-09-UpperBounds-06
FORMULA_NAME HealthRecord-PT-09-UpperBounds-07
FORMULA_NAME HealthRecord-PT-09-UpperBounds-08
FORMULA_NAME HealthRecord-PT-09-UpperBounds-09
FORMULA_NAME HealthRecord-PT-09-UpperBounds-10
FORMULA_NAME HealthRecord-PT-09-UpperBounds-11
FORMULA_NAME HealthRecord-PT-09-UpperBounds-12
FORMULA_NAME HealthRecord-PT-09-UpperBounds-13
FORMULA_NAME HealthRecord-PT-09-UpperBounds-14
FORMULA_NAME HealthRecord-PT-09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717201268172

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:21:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 00:21:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:21:09] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-06-01 00:21:09] [INFO ] Transformed 157 places.
[2024-06-01 00:21:09] [INFO ] Transformed 327 transitions.
[2024-06-01 00:21:09] [INFO ] Found NUPN structural information;
[2024-06-01 00:21:09] [INFO ] Parsed PT model containing 157 places and 327 transitions and 859 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
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]
[2024-06-01 00:21:09] [INFO ] Flow matrix only has 289 transitions (discarded 12 similar events)
// Phase 1: matrix 289 rows 157 cols
[2024-06-01 00:21:09] [INFO ] Computed 18 invariants in 22 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 (591 resets) in 44 ms. (222 steps per ms)
FORMULA HealthRecord-PT-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-09-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (521 resets) in 56 ms. (1052 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 00:21:09] [INFO ] Flow matrix only has 289 transitions (discarded 12 similar events)
[2024-06-01 00:21:09] [INFO ] Invariant cache hit.
[2024-06-01 00:21:09] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-06-01 00:21:09] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2024-06-01 00:21:09] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-06-01 00:21:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:21:09] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:21:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:21:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-01 00:21:10] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-06-01 00:21:10] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-06-01 00:21:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 00:21:10] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 35 ms.
[2024-06-01 00:21:10] [INFO ] Added : 15 causal constraints over 4 iterations in 257 ms. Result :sat
Minimization took 115 ms.
[2024-06-01 00:21:10] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:21:10] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:21:10] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-06-01 00:21:10] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:21:10] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 21 ms to minimize.
[2024-06-01 00:21:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:21:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:21:10] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 15 ms returned sat
[2024-06-01 00:21:10] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-06-01 00:21:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:21:11] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
[2024-06-01 00:21:11] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 0 ms to minimize.
[2024-06-01 00:21:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 179 ms
[2024-06-01 00:21:11] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 25 ms.
[2024-06-01 00:21:11] [INFO ] Added : 22 causal constraints over 5 iterations in 120 ms. Result :sat
Minimization took 113 ms.
[2024-06-01 00:21:11] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:21:11] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:21:11] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-06-01 00:21:11] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:21:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:21:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-01 00:21:11] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-06-01 00:21:11] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-06-01 00:21:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-06-01 00:21:11] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 19 ms.
[2024-06-01 00:21:11] [INFO ] Added : 13 causal constraints over 3 iterations in 83 ms. Result :sat
Minimization took 115 ms.
[2024-06-01 00:21:11] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:21:11] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:21:11] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-06-01 00:21:11] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:21:12] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:21:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:21:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 00:21:12] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2024-06-01 00:21:12] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-01 00:21:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:21:12] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:21:12] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:21:12] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:21:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 161 ms
[2024-06-01 00:21:12] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 22 ms.
[2024-06-01 00:21:12] [INFO ] Added : 18 causal constraints over 5 iterations in 98 ms. Result :sat
Minimization took 123 ms.
[2024-06-01 00:21:12] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 00:21:12] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:21:12] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-06-01 00:21:12] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:21:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:21:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 00:21:12] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2024-06-01 00:21:12] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-06-01 00:21:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 00:21:12] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 22 ms.
[2024-06-01 00:21:12] [INFO ] Added : 18 causal constraints over 5 iterations in 108 ms. Result :sat
Minimization took 122 ms.
[2024-06-01 00:21:13] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:21:13] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:21:13] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-06-01 00:21:13] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 00:21:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:21:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 00:21:13] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:21:13] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-01 00:21:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 00:21:13] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 22 ms.
[2024-06-01 00:21:13] [INFO ] Added : 12 causal constraints over 3 iterations in 80 ms. Result :sat
Minimization took 113 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 301/301 transitions.
Graph (trivial) has 235 edges and 157 vertex of which 12 / 157 are part of one of the 6 SCC in 2 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (complete) has 653 edges and 151 vertex of which 119 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Drop transitions (Empty/Sink Transition effects.) removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 0 with 108 rules applied. Total rules applied 110 place count 119 transition count 150
Discarding 76 places :
Symmetric choice reduction at 1 with 76 rule applications. Total rules 186 place count 43 transition count 74
Iterating global reduction 1 with 76 rules applied. Total rules applied 262 place count 43 transition count 74
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 262 place count 43 transition count 69
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 272 place count 38 transition count 69
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 282 place count 28 transition count 57
Iterating global reduction 1 with 10 rules applied. Total rules applied 292 place count 28 transition count 57
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 301 place count 28 transition count 48
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 304 place count 25 transition count 43
Iterating global reduction 2 with 3 rules applied. Total rules applied 307 place count 25 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 308 place count 25 transition count 42
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 310 place count 23 transition count 40
Iterating global reduction 3 with 2 rules applied. Total rules applied 312 place count 23 transition count 40
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 317 place count 23 transition count 35
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 321 place count 21 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 322 place count 21 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 323 place count 20 transition count 31
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 8 edges and 18 vertex of which 2 / 18 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 327 place count 17 transition count 30
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 333 place count 16 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 333 place count 16 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 337 place count 14 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 338 place count 14 transition count 22
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 6 with 2 rules applied. Total rules applied 340 place count 13 transition count 21
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 342 place count 13 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 343 place count 13 transition count 18
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 345 place count 12 transition count 17
Applied a total of 345 rules in 72 ms. Remains 12 /157 variables (removed 145) and now considering 17/301 (removed 284) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 12/157 places, 17/301 transitions.
[2024-06-01 00:21:13] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
// Phase 1: matrix 15 rows 12 cols
[2024-06-01 00:21:13] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
FORMULA HealthRecord-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 459 ms. (2173 steps per ms)
FORMULA HealthRecord-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (3 resets) in 403 ms. (2475 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 5257 ms.
ITS solved all properties within timeout

BK_STOP 1717201274612

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="HealthRecord-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 HealthRecord-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 r496-tall-171640604100765"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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