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-171640604100741.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-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640604100741
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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 27K 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 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 20:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 20:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 20:43 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 67K 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-06-UpperBounds-00
FORMULA_NAME HealthRecord-PT-06-UpperBounds-01
FORMULA_NAME HealthRecord-PT-06-UpperBounds-02
FORMULA_NAME HealthRecord-PT-06-UpperBounds-03
FORMULA_NAME HealthRecord-PT-06-UpperBounds-04
FORMULA_NAME HealthRecord-PT-06-UpperBounds-05
FORMULA_NAME HealthRecord-PT-06-UpperBounds-06
FORMULA_NAME HealthRecord-PT-06-UpperBounds-07
FORMULA_NAME HealthRecord-PT-06-UpperBounds-08
FORMULA_NAME HealthRecord-PT-06-UpperBounds-09
FORMULA_NAME HealthRecord-PT-06-UpperBounds-10
FORMULA_NAME HealthRecord-PT-06-UpperBounds-11
FORMULA_NAME HealthRecord-PT-06-UpperBounds-12
FORMULA_NAME HealthRecord-PT-06-UpperBounds-13
FORMULA_NAME HealthRecord-PT-06-UpperBounds-14
FORMULA_NAME HealthRecord-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717201070118

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-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:17:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 00:17:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:17:51] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-06-01 00:17:51] [INFO ] Transformed 154 places.
[2024-06-01 00:17:51] [INFO ] Transformed 319 transitions.
[2024-06-01 00:17:51] [INFO ] Found NUPN structural information;
[2024-06-01 00:17:51] [INFO ] Parsed PT model containing 154 places and 319 transitions and 835 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 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:17:51] [INFO ] Flow matrix only has 282 transitions (discarded 12 similar events)
// Phase 1: matrix 282 rows 154 cols
[2024-06-01 00:17:51] [INFO ] Computed 18 invariants in 30 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 (508 resets) in 40 ms. (243 steps per ms)
FORMULA HealthRecord-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (533 resets) in 59 ms. (1333 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-01 00:17:51] [INFO ] Flow matrix only has 282 transitions (discarded 12 similar events)
[2024-06-01 00:17:51] [INFO ] Invariant cache hit.
[2024-06-01 00:17:51] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2024-06-01 00:17:51] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2024-06-01 00:17:52] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-06-01 00:17:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:17:52] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-06-01 00:17:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:17:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 35 ms returned sat
[2024-06-01 00:17:52] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2024-06-01 00:17:52] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-06-01 00:17:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-06-01 00:17:52] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 94 ms.
[2024-06-01 00:17:52] [INFO ] Added : 22 causal constraints over 5 iterations in 225 ms. Result :sat
Minimization took 108 ms.
[2024-06-01 00:17:52] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:17:52] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-06-01 00:17:52] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-06-01 00:17:52] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2024-06-01 00:17:53] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 23 ms.
[2024-06-01 00:17:53] [INFO ] Added : 15 causal constraints over 3 iterations in 89 ms. Result :sat
Minimization took 133 ms.
[2024-06-01 00:17:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:17:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-01 00:17:53] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:17:53] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-06-01 00:17:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:17:53] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 20 ms.
[2024-06-01 00:17:53] [INFO ] Added : 15 causal constraints over 3 iterations in 77 ms. Result :sat
Minimization took 99 ms.
[2024-06-01 00:17:53] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:17:53] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:17:53] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-01 00:17:53] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 00:17:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:17:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-01 00:17:53] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:17:53] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-06-01 00:17:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 00:17:53] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 28 ms.
[2024-06-01 00:17:53] [INFO ] Added : 22 causal constraints over 5 iterations in 125 ms. Result :sat
Minimization took 99 ms.
[2024-06-01 00:17:54] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 00:17:54] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2024-06-01 00:17:54] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-06-01 00:17:54] [INFO ] [Real]Added 1 Read/Feed constraints in 10 ms returned sat
[2024-06-01 00:17:54] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 14 ms to minimize.
[2024-06-01 00:17:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:17:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-06-01 00:17:54] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:17:54] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-06-01 00:17:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:17:54] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:17:54] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:17:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 126 ms
[2024-06-01 00:17:54] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 36 ms.
[2024-06-01 00:17:54] [INFO ] Added : 22 causal constraints over 5 iterations in 145 ms. Result :sat
Minimization took 106 ms.
[2024-06-01 00:17:54] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:17:54] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2024-06-01 00:17:54] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-06-01 00:17:54] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 00:17:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:17:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:17:55] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2024-06-01 00:17:55] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-06-01 00:17:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-06-01 00:17:55] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 19 ms.
[2024-06-01 00:17:55] [INFO ] Added : 19 causal constraints over 5 iterations in 99 ms. Result :sat
Minimization took 103 ms.
[2024-06-01 00:17:55] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:17:55] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:17:55] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-06-01 00:17:55] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:17:55] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:17:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:17:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:17:55] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:17:55] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-06-01 00:17:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:17:55] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:17:55] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:17:55] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-06-01 00:17:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 153 ms
[2024-06-01 00:17:55] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 21 ms.
[2024-06-01 00:17:55] [INFO ] Added : 29 causal constraints over 7 iterations in 129 ms. Result :sat
Minimization took 98 ms.
[2024-06-01 00:17:56] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 00:17:56] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-06-01 00:17:56] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-01 00:17:56] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-06-01 00:17:56] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 16 ms.
[2024-06-01 00:17:56] [INFO ] Added : 17 causal constraints over 4 iterations in 90 ms. Result :sat
Minimization took 145 ms.
[2024-06-01 00:17:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:17:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:17:56] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:17:56] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-06-01 00:17:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2024-06-01 00:17:56] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 19 ms.
[2024-06-01 00:17:56] [INFO ] Added : 17 causal constraints over 4 iterations in 82 ms. Result :sat
Minimization took 93 ms.
[2024-06-01 00:17:56] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 00:17:56] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:17:56] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-01 00:17:56] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:17:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:17:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:17:56] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:17:57] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-06-01 00:17:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:17:57] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 18 ms.
[2024-06-01 00:17:57] [INFO ] Added : 19 causal constraints over 5 iterations in 102 ms. Result :sat
Minimization took 100 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 294/294 transitions.
Graph (trivial) has 231 edges and 154 vertex of which 14 / 154 are part of one of the 7 SCC in 3 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Graph (complete) has 636 edges and 147 vertex of which 113 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.1 ms
Discarding 34 places :
Also discarding 21 output transitions
Drop transitions (Output transitions of discarded places.) removed 21 transitions
Drop transitions (Empty/Sink Transition effects.) removed 103 transitions
Reduce isomorphic transitions removed 103 transitions.
Iterating post reduction 0 with 103 rules applied. Total rules applied 105 place count 113 transition count 143
Discarding 73 places :
Symmetric choice reduction at 1 with 73 rule applications. Total rules 178 place count 40 transition count 70
Iterating global reduction 1 with 73 rules applied. Total rules applied 251 place count 40 transition count 70
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 251 place count 40 transition count 67
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 257 place count 37 transition count 67
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 266 place count 28 transition count 58
Iterating global reduction 1 with 9 rules applied. Total rules applied 275 place count 28 transition count 58
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 284 place count 28 transition count 49
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 287 place count 25 transition count 44
Iterating global reduction 2 with 3 rules applied. Total rules applied 290 place count 25 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 291 place count 25 transition count 43
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 293 place count 23 transition count 41
Iterating global reduction 3 with 2 rules applied. Total rules applied 295 place count 23 transition count 41
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 301 place count 23 transition count 35
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 307 place count 20 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 308 place count 19 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 309 place count 18 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 313 place count 18 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 315 place count 17 transition count 26
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 316 place count 16 transition count 25
Iterating global reduction 5 with 1 rules applied. Total rules applied 317 place count 16 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 320 place count 16 transition count 22
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 321 place count 16 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 322 place count 15 transition count 21
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 323 place count 15 transition count 21
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 324 place count 15 transition count 20
Applied a total of 324 rules in 55 ms. Remains 15 /154 variables (removed 139) and now considering 20/294 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 15/154 places, 20/294 transitions.
[2024-06-01 00:17:57] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 15 cols
[2024-06-01 00:17:57] [INFO ] Computed 2 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (121386 resets) in 566 ms. (1763 steps per ms)
FORMULA HealthRecord-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (53379 resets) in 293 ms. (3401 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 7040 ms.
ITS solved all properties within timeout

BK_STOP 1717201078340

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

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

Sequence of Actions to be Executed by the VM

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

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

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