Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r203-smll-167840349400317.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is HealthRecord-PT-11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r203-smll-167840349400317
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.3K Feb 26 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 18:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 18:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 18:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 70K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-11-UpperBounds-00
FORMULA_NAME HealthRecord-PT-11-UpperBounds-01
FORMULA_NAME HealthRecord-PT-11-UpperBounds-02
FORMULA_NAME HealthRecord-PT-11-UpperBounds-03
FORMULA_NAME HealthRecord-PT-11-UpperBounds-04
FORMULA_NAME HealthRecord-PT-11-UpperBounds-05
FORMULA_NAME HealthRecord-PT-11-UpperBounds-06
FORMULA_NAME HealthRecord-PT-11-UpperBounds-07
FORMULA_NAME HealthRecord-PT-11-UpperBounds-08
FORMULA_NAME HealthRecord-PT-11-UpperBounds-09
FORMULA_NAME HealthRecord-PT-11-UpperBounds-10
FORMULA_NAME HealthRecord-PT-11-UpperBounds-11
FORMULA_NAME HealthRecord-PT-11-UpperBounds-12
FORMULA_NAME HealthRecord-PT-11-UpperBounds-13
FORMULA_NAME HealthRecord-PT-11-UpperBounds-14
FORMULA_NAME HealthRecord-PT-11-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678582407725

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-11
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-12 00:53:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 00:53:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 00:53:31] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2023-03-12 00:53:31] [INFO ] Transformed 159 places.
[2023-03-12 00:53:31] [INFO ] Transformed 334 transitions.
[2023-03-12 00:53:31] [INFO ] Found NUPN structural information;
[2023-03-12 00:53:31] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 270 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
Normalized transition count is 295 out of 307 initially.
// Phase 1: matrix 295 rows 159 cols
[2023-03-12 00:53:31] [INFO ] Computed 18 place invariants in 26 ms
Incomplete random walk after 10000 steps, including 683 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 16) seen :7
FORMULA HealthRecord-PT-11-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :1
FORMULA HealthRecord-PT-11-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :1
FORMULA HealthRecord-PT-11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 95 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
[2023-03-12 00:53:32] [INFO ] Flow matrix only has 295 transitions (discarded 12 similar events)
// Phase 1: matrix 295 rows 159 cols
[2023-03-12 00:53:32] [INFO ] Computed 18 place invariants in 11 ms
[2023-03-12 00:53:32] [INFO ] [Real]Absence check using 10 positive place invariants in 22 ms returned sat
[2023-03-12 00:53:32] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2023-03-12 00:53:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:53:32] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2023-03-12 00:53:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:53:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-12 00:53:32] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-12 00:53:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:53:32] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2023-03-12 00:53:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 00:53:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-12 00:53:33] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 6 ms to minimize.
[2023-03-12 00:53:33] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2023-03-12 00:53:33] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2023-03-12 00:53:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 388 ms
[2023-03-12 00:53:33] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 62 ms.
[2023-03-12 00:53:33] [INFO ] Added : 19 causal constraints over 4 iterations in 209 ms. Result :sat
Minimization took 35 ms.
[2023-03-12 00:53:33] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-12 00:53:33] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-12 00:53:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:53:33] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2023-03-12 00:53:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:53:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-12 00:53:34] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-12 00:53:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:53:34] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2023-03-12 00:53:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-12 00:53:34] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 36 ms.
[2023-03-12 00:53:34] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2023-03-12 00:53:34] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2023-03-12 00:53:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 186 ms
[2023-03-12 00:53:34] [INFO ] Added : 14 causal constraints over 5 iterations in 364 ms. Result :sat
Minimization took 50 ms.
[2023-03-12 00:53:34] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-12 00:53:34] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-12 00:53:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:53:34] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-03-12 00:53:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:53:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-12 00:53:34] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-12 00:53:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:53:34] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2023-03-12 00:53:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-12 00:53:35] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 38 ms.
[2023-03-12 00:53:35] [INFO ] Added : 7 causal constraints over 3 iterations in 131 ms. Result :sat
Minimization took 28 ms.
[2023-03-12 00:53:35] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-12 00:53:35] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-12 00:53:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:53:35] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-03-12 00:53:35] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-12 00:53:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:53:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-12 00:53:35] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-12 00:53:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:53:35] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-12 00:53:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-12 00:53:35] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 48 ms.
[2023-03-12 00:53:35] [INFO ] Added : 29 causal constraints over 7 iterations in 275 ms. Result :sat
Minimization took 56 ms.
[2023-03-12 00:53:36] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-12 00:53:36] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2023-03-12 00:53:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:53:36] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-03-12 00:53:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:53:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-12 00:53:36] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-12 00:53:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:53:36] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2023-03-12 00:53:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-12 00:53:36] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 43 ms.
[2023-03-12 00:53:36] [INFO ] Added : 10 causal constraints over 2 iterations in 150 ms. Result :sat
Minimization took 48 ms.
[2023-03-12 00:53:36] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-12 00:53:36] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-12 00:53:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:53:36] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2023-03-12 00:53:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:53:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-12 00:53:36] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-12 00:53:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:53:37] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2023-03-12 00:53:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-12 00:53:37] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2023-03-12 00:53:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-03-12 00:53:37] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 39 ms.
[2023-03-12 00:53:37] [INFO ] Added : 14 causal constraints over 4 iterations in 169 ms. Result :sat
Minimization took 50 ms.
[2023-03-12 00:53:37] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-12 00:53:37] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-12 00:53:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:53:37] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2023-03-12 00:53:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:53:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-12 00:53:37] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-12 00:53:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:53:37] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2023-03-12 00:53:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-12 00:53:38] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 0 ms to minimize.
[2023-03-12 00:53:38] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2023-03-12 00:53:38] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2023-03-12 00:53:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 309 ms
[2023-03-12 00:53:38] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 38 ms.
[2023-03-12 00:53:38] [INFO ] Added : 15 causal constraints over 3 iterations in 158 ms. Result :sat
Minimization took 51 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-11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 307/307 transitions.
Graph (trivial) has 234 edges and 159 vertex of which 10 / 159 are part of one of the 5 SCC in 6 ms
Free SCC test removed 5 places
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Graph (complete) has 667 edges and 154 vertex of which 145 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 145 transition count 279
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 17 place count 140 transition count 274
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 17 place count 140 transition count 272
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 22 place count 137 transition count 272
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 99 place count 60 transition count 119
Iterating global reduction 2 with 77 rules applied. Total rules applied 176 place count 60 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 177 place count 60 transition count 118
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 185 place count 52 transition count 102
Iterating global reduction 3 with 8 rules applied. Total rules applied 193 place count 52 transition count 102
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 202 place count 52 transition count 93
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 204 place count 50 transition count 87
Iterating global reduction 4 with 2 rules applied. Total rules applied 206 place count 50 transition count 87
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 207 place count 49 transition count 85
Iterating global reduction 4 with 1 rules applied. Total rules applied 208 place count 49 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 211 place count 49 transition count 82
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 5 with 4 rules applied. Total rules applied 215 place count 47 transition count 80
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 227 place count 41 transition count 118
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 229 place count 41 transition count 116
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 231 place count 39 transition count 116
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 232 place count 39 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 233 place count 38 transition count 253
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 236 place count 38 transition count 250
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 250 place count 38 transition count 250
Applied a total of 250 rules in 171 ms. Remains 38 /159 variables (removed 121) and now considering 250/307 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 38/159 places, 250/307 transitions.
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 38 cols
[2023-03-12 00:53:38] [INFO ] Computed 8 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 233455 resets, run finished after 3822 ms. (steps per millisecond=261 ) properties (out of 5) seen :5
FORMULA HealthRecord-PT-11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 11184 ms.
ITS solved all properties within timeout

BK_STOP 1678582423644

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-11"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is HealthRecord-PT-11, 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 r203-smll-167840349400317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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