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.r197-tall-171640625800496.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 gold2023
Input is HealthRecord-PT-13, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625800496
=====================================================================

--------------------
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 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K 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.5K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 13K Apr 12 20:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 12 20:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 20:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 20:05 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 71K 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-13-UpperBounds-00
FORMULA_NAME HealthRecord-PT-13-UpperBounds-01
FORMULA_NAME HealthRecord-PT-13-UpperBounds-02
FORMULA_NAME HealthRecord-PT-13-UpperBounds-03
FORMULA_NAME HealthRecord-PT-13-UpperBounds-04
FORMULA_NAME HealthRecord-PT-13-UpperBounds-05
FORMULA_NAME HealthRecord-PT-13-UpperBounds-06
FORMULA_NAME HealthRecord-PT-13-UpperBounds-07
FORMULA_NAME HealthRecord-PT-13-UpperBounds-08
FORMULA_NAME HealthRecord-PT-13-UpperBounds-09
FORMULA_NAME HealthRecord-PT-13-UpperBounds-10
FORMULA_NAME HealthRecord-PT-13-UpperBounds-11
FORMULA_NAME HealthRecord-PT-13-UpperBounds-12
FORMULA_NAME HealthRecord-PT-13-UpperBounds-13
FORMULA_NAME HealthRecord-PT-13-UpperBounds-14
FORMULA_NAME HealthRecord-PT-13-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716558096001

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-13
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-24 13:41:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 13:41:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 13:41:37] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2024-05-24 13:41:37] [INFO ] Transformed 161 places.
[2024-05-24 13:41:37] [INFO ] Transformed 341 transitions.
[2024-05-24 13:41:37] [INFO ] Found NUPN structural information;
[2024-05-24 13:41:37] [INFO ] Parsed PT model containing 161 places and 341 transitions and 899 arcs in 115 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Normalized transition count is 301 out of 313 initially.
// Phase 1: matrix 301 rows 161 cols
[2024-05-24 13:41:37] [INFO ] Computed 18 invariants in 20 ms
Incomplete random walk after 10000 steps, including 785 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :8
FORMULA HealthRecord-PT-13-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :1
FORMULA HealthRecord-PT-13-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
[2024-05-24 13:41:37] [INFO ] Flow matrix only has 301 transitions (discarded 12 similar events)
// Phase 1: matrix 301 rows 161 cols
[2024-05-24 13:41:37] [INFO ] Computed 18 invariants in 7 ms
[2024-05-24 13:41:38] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-05-24 13:41:38] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2024-05-24 13:41:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:41:38] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2024-05-24 13:41:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:41:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-24 13:41:38] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:41:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:41:38] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-24 13:41:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:41:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-24 13:41:38] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 4 ms to minimize.
[2024-05-24 13:41:38] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 2 ms to minimize.
[2024-05-24 13:41:38] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-24 13:41:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 269 ms
[2024-05-24 13:41:38] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 26 ms.
[2024-05-24 13:41:38] [INFO ] Added : 11 causal constraints over 3 iterations in 105 ms. Result :sat
Minimization took 28 ms.
[2024-05-24 13:41:38] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-05-24 13:41:38] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:41:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:41:39] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-24 13:41:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:41:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 13:41:39] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:41:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:41:39] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-24 13:41:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 13:41:39] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-24 13:41:39] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-24 13:41:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2024-05-24 13:41:39] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 21 ms.
[2024-05-24 13:41:39] [INFO ] Added : 30 causal constraints over 6 iterations in 130 ms. Result :sat
Minimization took 27 ms.
[2024-05-24 13:41:39] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 13:41:39] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-24 13:41:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:41:39] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-24 13:41:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:41:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2024-05-24 13:41:39] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:41:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:41:39] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-24 13:41:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 13:41:39] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-24 13:41:39] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-24 13:41:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2024-05-24 13:41:39] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 24 ms.
[2024-05-24 13:41:39] [INFO ] Added : 12 causal constraints over 3 iterations in 98 ms. Result :sat
Minimization took 23 ms.
[2024-05-24 13:41:39] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-24 13:41:39] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 13:41:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:41:39] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-24 13:41:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:41:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 13:41:40] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:41:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:41:40] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-24 13:41:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 13:41:40] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 1 ms to minimize.
[2024-05-24 13:41:40] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-05-24 13:41:40] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-05-24 13:41:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 208 ms
[2024-05-24 13:41:40] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 21 ms.
[2024-05-24 13:41:40] [INFO ] Added : 10 causal constraints over 2 iterations in 72 ms. Result :sat
Minimization took 26 ms.
[2024-05-24 13:41:40] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 13:41:40] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 13:41:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:41:40] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-24 13:41:40] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 13:41:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:41:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 13:41:40] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:41:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:41:40] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-24 13:41:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 13:41:40] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 19 ms.
[2024-05-24 13:41:40] [INFO ] Added : 28 causal constraints over 7 iterations in 129 ms. Result :sat
Minimization took 40 ms.
[2024-05-24 13:41:40] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 13:41:40] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:41:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:41:40] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-24 13:41:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:41:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 13:41:41] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:41:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:41:41] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-24 13:41:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 13:41:41] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 20 ms.
[2024-05-24 13:41:41] [INFO ] Added : 7 causal constraints over 2 iterations in 75 ms. Result :sat
Minimization took 24 ms.
[2024-05-24 13:41:41] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-24 13:41:41] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:41:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:41:41] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-24 13:41:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:41:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-24 13:41:41] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-24 13:41:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:41:41] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-24 13:41:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 13:41:41] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 19 ms.
[2024-05-24 13:41:41] [INFO ] Added : 8 causal constraints over 2 iterations in 65 ms. Result :sat
Minimization took 21 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-13-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 313/313 transitions.
Graph (trivial) has 239 edges and 161 vertex of which 8 / 161 are part of one of the 4 SCC in 3 ms
Free SCC test removed 4 places
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 681 edges and 157 vertex of which 148 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 148 transition count 288
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 16 place count 144 transition count 282
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 19 place count 142 transition count 281
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 142 transition count 280
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 141 transition count 280
Discarding 80 places :
Symmetric choice reduction at 3 with 80 rule applications. Total rules 101 place count 61 transition count 120
Iterating global reduction 3 with 80 rules applied. Total rules applied 181 place count 61 transition count 120
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 189 place count 53 transition count 104
Iterating global reduction 3 with 8 rules applied. Total rules applied 197 place count 53 transition count 104
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 203 place count 53 transition count 98
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 205 place count 51 transition count 92
Iterating global reduction 4 with 2 rules applied. Total rules applied 207 place count 51 transition count 92
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 209 place count 49 transition count 88
Iterating global reduction 4 with 2 rules applied. Total rules applied 211 place count 49 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 217 place count 49 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 219 place count 48 transition count 81
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 231 place count 42 transition count 119
Drop 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 42 transition count 118
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 234 place count 42 transition count 116
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 236 place count 40 transition count 116
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 238 place count 40 transition count 114
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 239 place count 40 transition count 260
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 241 place count 39 transition count 259
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 244 place count 39 transition count 256
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 245 place count 38 transition count 205
Iterating global reduction 7 with 1 rules applied. Total rules applied 246 place count 38 transition count 205
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 247 place count 37 transition count 203
Iterating global reduction 7 with 1 rules applied. Total rules applied 248 place count 37 transition count 203
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 263 place count 37 transition count 188
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 276 place count 37 transition count 188
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 287 place count 37 transition count 188
Applied a total of 287 rules in 89 ms. Remains 37 /161 variables (removed 124) and now considering 188/313 (removed 125) transitions.
[2024-05-24 13:41:41] [INFO ] Flow matrix only has 140 transitions (discarded 48 similar events)
// Phase 1: matrix 140 rows 37 cols
[2024-05-24 13:41:41] [INFO ] Computed 9 invariants in 4 ms
[2024-05-24 13:41:41] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 37/161 places, 188/313 transitions.
Normalized transition count is 140 out of 188 initially.
// Phase 1: matrix 140 rows 37 cols
[2024-05-24 13:41:41] [INFO ] Computed 9 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 80651 resets, run finished after 1671 ms. (steps per millisecond=598 ) properties (out of 4) seen :3
FORMULA HealthRecord-PT-13-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 14538 resets, run finished after 489 ms. (steps per millisecond=2044 ) properties (out of 1) seen :1
FORMULA HealthRecord-PT-13-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 6485 ms.

BK_STOP 1716558104972

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-13"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is HealthRecord-PT-13, 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 r197-tall-171640625800496"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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