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.r179-tall-171640602100709.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 greatspnxred
Input is HealthRecord-PT-02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602100709
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 20:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 20:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 20:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 20:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:47 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 47K 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-02-UpperBounds-00
FORMULA_NAME HealthRecord-PT-02-UpperBounds-01
FORMULA_NAME HealthRecord-PT-02-UpperBounds-02
FORMULA_NAME HealthRecord-PT-02-UpperBounds-03
FORMULA_NAME HealthRecord-PT-02-UpperBounds-04
FORMULA_NAME HealthRecord-PT-02-UpperBounds-05
FORMULA_NAME HealthRecord-PT-02-UpperBounds-06
FORMULA_NAME HealthRecord-PT-02-UpperBounds-07
FORMULA_NAME HealthRecord-PT-02-UpperBounds-08
FORMULA_NAME HealthRecord-PT-02-UpperBounds-09
FORMULA_NAME HealthRecord-PT-02-UpperBounds-10
FORMULA_NAME HealthRecord-PT-02-UpperBounds-11
FORMULA_NAME HealthRecord-PT-02-UpperBounds-12
FORMULA_NAME HealthRecord-PT-02-UpperBounds-13
FORMULA_NAME HealthRecord-PT-02-UpperBounds-14
FORMULA_NAME HealthRecord-PT-02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716490144180

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 18:49:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 18:49:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 18:49:05] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-05-23 18:49:05] [INFO ] Transformed 119 places.
[2024-05-23 18:49:05] [INFO ] Transformed 225 transitions.
[2024-05-23 18:49:05] [INFO ] Found NUPN structural information;
[2024-05-23 18:49:05] [INFO ] Parsed PT model containing 119 places and 225 transitions and 577 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 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-05-23 18:49:05] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
// Phase 1: matrix 211 rows 119 cols
[2024-05-23 18:49:05] [INFO ] Computed 14 invariants in 17 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 33 ms. (294 steps per ms)
FORMULA HealthRecord-PT-02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70007 steps (631 resets) in 61 ms. (1129 steps per ms)
FORMULA HealthRecord-PT-02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2024-05-23 18:49:05] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
[2024-05-23 18:49:05] [INFO ] Invariant cache hit.
[2024-05-23 18:49:05] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-23 18:49:05] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 8 ms returned sat
[2024-05-23 18:49:05] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-23 18:49:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 18:49:05] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 18:49:05] [INFO ] Computed and/alt/rep : 167/178/167 causal constraints (skipped 43 transitions) in 21 ms.
[2024-05-23 18:49:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:49:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-23 18:49:06] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-23 18:49:06] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-23 18:49:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-23 18:49:06] [INFO ] Computed and/alt/rep : 167/178/167 causal constraints (skipped 43 transitions) in 21 ms.
[2024-05-23 18:49:06] [INFO ] Added : 11 causal constraints over 3 iterations in 87 ms. Result :sat
Minimization took 93 ms.
[2024-05-23 18:49:06] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-23 18:49:06] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:49:06] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-23 18:49:06] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 18:49:06] [INFO ] Computed and/alt/rep : 167/178/167 causal constraints (skipped 43 transitions) in 22 ms.
[2024-05-23 18:49:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:49:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-23 18:49:06] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 10 ms returned sat
[2024-05-23 18:49:06] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-23 18:49:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 18:49:06] [INFO ] Computed and/alt/rep : 167/178/167 causal constraints (skipped 43 transitions) in 21 ms.
[2024-05-23 18:49:06] [INFO ] Added : 14 causal constraints over 4 iterations in 71 ms. Result :sat
Minimization took 106 ms.
[2024-05-23 18:49:06] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-23 18:49:06] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:49:06] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-23 18:49:06] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 18:49:06] [INFO ] Computed and/alt/rep : 167/178/167 causal constraints (skipped 43 transitions) in 15 ms.
[2024-05-23 18:49:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:49:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-23 18:49:07] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:49:07] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-23 18:49:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-23 18:49:07] [INFO ] Computed and/alt/rep : 167/178/167 causal constraints (skipped 43 transitions) in 19 ms.
[2024-05-23 18:49:07] [INFO ] Added : 14 causal constraints over 4 iterations in 76 ms. Result :sat
Minimization took 79 ms.
[2024-05-23 18:49:07] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-23 18:49:07] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:49:07] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-23 18:49:07] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 18:49:07] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 19 ms to minimize.
[2024-05-23 18:49:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:49:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-23 18:49:07] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:49:07] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-23 18:49:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 18:49:07] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 2 ms to minimize.
[2024-05-23 18:49:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-05-23 18:49:07] [INFO ] Computed and/alt/rep : 167/178/167 causal constraints (skipped 43 transitions) in 16 ms.
[2024-05-23 18:49:07] [INFO ] Added : 22 causal constraints over 5 iterations in 76 ms. Result :sat
Minimization took 81 ms.
[2024-05-23 18:49:07] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-23 18:49:07] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-23 18:49:07] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-23 18:49:07] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 18:49:07] [INFO ] Computed and/alt/rep : 167/178/167 causal constraints (skipped 43 transitions) in 13 ms.
[2024-05-23 18:49:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:49:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-23 18:49:07] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:49:08] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-23 18:49:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-23 18:49:08] [INFO ] Computed and/alt/rep : 167/178/167 causal constraints (skipped 43 transitions) in 12 ms.
[2024-05-23 18:49:08] [INFO ] Added : 16 causal constraints over 4 iterations in 63 ms. Result :sat
Minimization took 89 ms.
[2024-05-23 18:49:08] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-23 18:49:08] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-23 18:49:08] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-23 18:49:08] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 18:49:08] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 2 ms to minimize.
[2024-05-23 18:49:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:49:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-23 18:49:08] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:49:08] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-23 18:49:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 18:49:08] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-23 18:49:08] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:49:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2024-05-23 18:49:08] [INFO ] Computed and/alt/rep : 167/178/167 causal constraints (skipped 43 transitions) in 12 ms.
[2024-05-23 18:49:08] [INFO ] Added : 21 causal constraints over 5 iterations in 66 ms. Result :sat
Minimization took 75 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-02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 219/219 transitions.
Graph (trivial) has 172 edges and 119 vertex of which 12 / 119 are part of one of the 6 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 415 edges and 113 vertex of which 85 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Drop transitions (Empty/Sink Transition effects.) removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 85 transition count 101
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 129 place count 37 transition count 53
Iterating global reduction 1 with 48 rules applied. Total rules applied 177 place count 37 transition count 53
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 177 place count 37 transition count 50
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 183 place count 34 transition count 50
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 193 place count 24 transition count 38
Iterating global reduction 1 with 10 rules applied. Total rules applied 203 place count 24 transition count 38
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 206 place count 24 transition count 35
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 209 place count 21 transition count 30
Iterating global reduction 2 with 3 rules applied. Total rules applied 212 place count 21 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 213 place count 21 transition count 29
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 215 place count 19 transition count 27
Iterating global reduction 3 with 2 rules applied. Total rules applied 217 place count 19 transition count 27
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 219 place count 19 transition count 25
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 223 place count 17 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 224 place count 16 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 225 place count 15 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 227 place count 15 transition count 20
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 229 place count 14 transition count 19
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 230 place count 13 transition count 18
Iterating global reduction 5 with 1 rules applied. Total rules applied 231 place count 13 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 232 place count 13 transition count 17
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 233 place count 13 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 234 place count 12 transition count 16
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 235 place count 12 transition count 16
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 236 place count 12 transition count 15
Applied a total of 236 rules in 47 ms. Remains 12 /119 variables (removed 107) and now considering 15/219 (removed 204) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 12/119 places, 15/219 transitions.
// Phase 1: matrix 15 rows 12 cols
[2024-05-23 18:49:08] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (115798 resets) in 540 ms. (1848 steps per ms)
FORMULA HealthRecord-PT-02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (47330 resets) in 211 ms. (4716 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 4371 ms.
ITS solved all properties within timeout

BK_STOP 1716490149693

--------------------
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-02"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is HealthRecord-PT-02, 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 r179-tall-171640602100709"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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