Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 5.6K Apr 30 11:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 30 11:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 30 11:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 30 11:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 68K May 10 09:34 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652694200883

Running Version 202205111006
[2022-05-16 09:43:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 09:43:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 09:43:23] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2022-05-16 09:43:23] [INFO ] Transformed 157 places.
[2022-05-16 09:43:23] [INFO ] Transformed 327 transitions.
[2022-05-16 09:43:23] [INFO ] Found NUPN structural information;
[2022-05-16 09:43:23] [INFO ] Parsed PT model containing 157 places and 327 transitions in 350 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Normalized transition count is 289 out of 301 initially.
// Phase 1: matrix 289 rows 157 cols
[2022-05-16 09:43:23] [INFO ] Computed 18 place invariants in 31 ms
Incomplete random walk after 10000 steps, including 603 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :7
FORMULA HealthRecord-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :1
FORMULA HealthRecord-PT-09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :1
FORMULA HealthRecord-PT-09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
[2022-05-16 09:43:23] [INFO ] Flow matrix only has 289 transitions (discarded 12 similar events)
// Phase 1: matrix 289 rows 157 cols
[2022-05-16 09:43:23] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-16 09:43:23] [INFO ] [Real]Absence check using 10 positive place invariants in 20 ms returned sat
[2022-05-16 09:43:23] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2022-05-16 09:43:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:43:24] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2022-05-16 09:43:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:43:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2022-05-16 09:43:24] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-16 09:43:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:43:24] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2022-05-16 09:43:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:43:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2022-05-16 09:43:24] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 28 ms to minimize.
[2022-05-16 09:43:25] [INFO ] Deduced a trap composed of 30 places in 522 ms of which 1 ms to minimize.
[2022-05-16 09:43:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 715 ms
[2022-05-16 09:43:25] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 53 ms.
[2022-05-16 09:43:25] [INFO ] Added : 18 causal constraints over 4 iterations in 183 ms. Result :sat
Minimization took 37 ms.
[2022-05-16 09:43:25] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2022-05-16 09:43:25] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-16 09:43:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:43:25] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2022-05-16 09:43:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:43:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2022-05-16 09:43:25] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-16 09:43:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:43:25] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2022-05-16 09:43:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2022-05-16 09:43:25] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2022-05-16 09:43:25] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 2 ms to minimize.
[2022-05-16 09:43:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2022-05-16 09:43:25] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 42 ms.
[2022-05-16 09:43:26] [INFO ] Added : 18 causal constraints over 4 iterations in 156 ms. Result :sat
Minimization took 34 ms.
[2022-05-16 09:43:26] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2022-05-16 09:43:26] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2022-05-16 09:43:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:43:26] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2022-05-16 09:43:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:43:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2022-05-16 09:43:26] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-16 09:43:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:43:26] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2022-05-16 09:43:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2022-05-16 09:43:26] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 30 ms.
[2022-05-16 09:43:26] [INFO ] Added : 6 causal constraints over 2 iterations in 98 ms. Result :sat
Minimization took 31 ms.
[2022-05-16 09:43:26] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2022-05-16 09:43:26] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2022-05-16 09:43:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:43:26] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2022-05-16 09:43:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:43:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2022-05-16 09:43:27] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2022-05-16 09:43:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:43:27] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2022-05-16 09:43:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-16 09:43:27] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 3 ms to minimize.
[2022-05-16 09:43:27] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2022-05-16 09:43:27] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 0 ms to minimize.
[2022-05-16 09:43:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 310 ms
[2022-05-16 09:43:27] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 30 ms.
[2022-05-16 09:43:27] [INFO ] Added : 10 causal constraints over 2 iterations in 94 ms. Result :sat
Minimization took 32 ms.
[2022-05-16 09:43:27] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2022-05-16 09:43:27] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2022-05-16 09:43:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:43:27] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2022-05-16 09:43:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:43:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2022-05-16 09:43:27] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-16 09:43:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:43:27] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2022-05-16 09:43:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-16 09:43:28] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 1 ms to minimize.
[2022-05-16 09:43:28] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
[2022-05-16 09:43:28] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 0 ms to minimize.
[2022-05-16 09:43:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 289 ms
[2022-05-16 09:43:28] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 27 ms.
[2022-05-16 09:43:28] [INFO ] Added : 18 causal constraints over 4 iterations in 131 ms. Result :sat
Minimization took 32 ms.
[2022-05-16 09:43:28] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2022-05-16 09:43:28] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-16 09:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:43:28] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2022-05-16 09:43:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:43:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2022-05-16 09:43:28] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2022-05-16 09:43:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:43:28] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2022-05-16 09:43:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-16 09:43:28] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 26 ms.
[2022-05-16 09:43:28] [INFO ] Added : 11 causal constraints over 3 iterations in 111 ms. Result :sat
Minimization took 29 ms.
[2022-05-16 09:43:28] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2022-05-16 09:43:28] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2022-05-16 09:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:43:29] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2022-05-16 09:43:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:43:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2022-05-16 09:43:29] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-16 09:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:43:29] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2022-05-16 09:43:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2022-05-16 09:43:29] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 26 ms.
[2022-05-16 09:43:29] [INFO ] Added : 30 causal constraints over 7 iterations in 183 ms. Result :sat
Minimization took 34 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-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 157 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 157/157 places, 301/301 transitions.
Graph (trivial) has 232 edges and 157 vertex of which 10 / 157 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 655 edges and 152 vertex of which 142 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.4 ms
Discarding 10 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 142 transition count 273
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 12 rules applied. Total rules applied 19 place count 137 transition count 266
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 22 place count 135 transition count 265
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 22 place count 135 transition count 262
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 30 place count 130 transition count 262
Discarding 77 places :
Symmetric choice reduction at 3 with 77 rule applications. Total rules 107 place count 53 transition count 108
Iterating global reduction 3 with 77 rules applied. Total rules applied 184 place count 53 transition count 108
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 193 place count 44 transition count 90
Iterating global reduction 3 with 9 rules applied. Total rules applied 202 place count 44 transition count 90
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 211 place count 44 transition count 81
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 213 place count 42 transition count 75
Iterating global reduction 4 with 2 rules applied. Total rules applied 215 place count 42 transition count 75
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 217 place count 40 transition count 71
Iterating global reduction 4 with 2 rules applied. Total rules applied 219 place count 40 transition count 71
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 225 place count 40 transition count 65
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 235 place count 35 transition count 95
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 237 place count 35 transition count 93
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 239 place count 33 transition count 93
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 251 place count 33 transition count 93
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 262 place count 33 transition count 93
Applied a total of 262 rules in 100 ms. Remains 33 /157 variables (removed 124) and now considering 93/301 (removed 208) transitions.
[2022-05-16 09:43:29] [INFO ] Flow matrix only has 83 transitions (discarded 10 similar events)
// Phase 1: matrix 83 rows 33 cols
[2022-05-16 09:43:29] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 09:43:29] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 33/157 places, 93/301 transitions.
Normalized transition count is 83 out of 93 initially.
// Phase 1: matrix 83 rows 33 cols
[2022-05-16 09:43:29] [INFO ] Computed 6 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 166330 resets, run finished after 1966 ms. (steps per millisecond=508 ) properties (out of 4) seen :3
FORMULA HealthRecord-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 32065 resets, run finished after 509 ms. (steps per millisecond=1964 ) properties (out of 1) seen :0
[2022-05-16 09:43:32] [INFO ] Flow matrix only has 83 transitions (discarded 10 similar events)
// Phase 1: matrix 83 rows 33 cols
[2022-05-16 09:43:32] [INFO ] Computed 6 place invariants in 7 ms
[2022-05-16 09:43:32] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-16 09:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:43:32] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-05-16 09:43:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:43:32] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-16 09:43:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:43:32] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2022-05-16 09:43:32] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-16 09:43:32] [INFO ] [Nat]Added 30 Read/Feed constraints in 11 ms returned sat
[2022-05-16 09:43:32] [INFO ] Computed and/alt/rep : 48/290/48 causal constraints (skipped 27 transitions) in 10 ms.
[2022-05-16 09:43:32] [INFO ] Added : 13 causal constraints over 3 iterations in 50 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 33/33 places, 93/93 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 31 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 31 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 30 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 30 transition count 84
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 11 place count 30 transition count 79
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 30 transition count 137
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 28 transition count 137
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 27 transition count 134
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 27 transition count 134
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 21 place count 27 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 22 place count 26 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 26 transition count 98
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 25 transition count 95
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 25 transition count 95
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 35 place count 25 transition count 85
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 41 place count 25 transition count 79
Applied a total of 41 rules in 31 ms. Remains 25 /33 variables (removed 8) and now considering 79/93 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/33 places, 79/93 transitions.
Normalized transition count is 67 out of 79 initially.
// Phase 1: matrix 67 rows 25 cols
[2022-05-16 09:43:32] [INFO ] Computed 6 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 228172 resets, run finished after 1939 ms. (steps per millisecond=515 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 35575 resets, run finished after 475 ms. (steps per millisecond=2105 ) properties (out of 1) seen :0
[2022-05-16 09:43:34] [INFO ] Flow matrix only has 67 transitions (discarded 12 similar events)
// Phase 1: matrix 67 rows 25 cols
[2022-05-16 09:43:34] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:43:35] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-16 09:43:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:43:35] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-16 09:43:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-16 09:43:35] [INFO ] [Real]Added 20 Read/Feed constraints in 5 ms returned sat
[2022-05-16 09:43:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:43:35] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-16 09:43:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:43:35] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-05-16 09:43:35] [INFO ] [Nat]Added 20 Read/Feed constraints in 7 ms returned sat
[2022-05-16 09:43:35] [INFO ] Computed and/alt/rep : 18/134/18 causal constraints (skipped 41 transitions) in 9 ms.
[2022-05-16 09:43:35] [INFO ] Added : 4 causal constraints over 2 iterations in 31 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 25/25 places, 79/79 transitions.
Applied a total of 0 rules in 4 ms. Remains 25 /25 variables (removed 0) and now considering 79/79 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 79/79 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 25/25 places, 79/79 transitions.
Applied a total of 0 rules in 4 ms. Remains 25 /25 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2022-05-16 09:43:35] [INFO ] Flow matrix only has 67 transitions (discarded 12 similar events)
// Phase 1: matrix 67 rows 25 cols
[2022-05-16 09:43:35] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:43:35] [INFO ] Implicit Places using invariants in 79 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 24/25 places, 79/79 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 79/79 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 24/25 places, 79/79 transitions.
Normalized transition count is 67 out of 79 initially.
// Phase 1: matrix 67 rows 24 cols
[2022-05-16 09:43:35] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 227860 resets, run finished after 1755 ms. (steps per millisecond=569 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 35466 resets, run finished after 448 ms. (steps per millisecond=2232 ) properties (out of 1) seen :0
[2022-05-16 09:43:37] [INFO ] Flow matrix only has 67 transitions (discarded 12 similar events)
// Phase 1: matrix 67 rows 24 cols
[2022-05-16 09:43:37] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 09:43:37] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-16 09:43:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:43:37] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-16 09:43:37] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-16 09:43:37] [INFO ] [Real]Added 20 Read/Feed constraints in 4 ms returned sat
[2022-05-16 09:43:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:43:37] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-16 09:43:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:43:37] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-05-16 09:43:37] [INFO ] [Nat]Added 20 Read/Feed constraints in 8 ms returned sat
[2022-05-16 09:43:37] [INFO ] Computed and/alt/rep : 18/134/18 causal constraints (skipped 41 transitions) in 9 ms.
[2022-05-16 09:43:37] [INFO ] Added : 4 causal constraints over 2 iterations in 32 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 24/24 places, 79/79 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 79/79 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 79/79 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 24/24 places, 79/79 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2022-05-16 09:43:37] [INFO ] Flow matrix only has 67 transitions (discarded 12 similar events)
// Phase 1: matrix 67 rows 24 cols
[2022-05-16 09:43:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 09:43:37] [INFO ] Implicit Places using invariants in 63 ms returned []
[2022-05-16 09:43:37] [INFO ] Flow matrix only has 67 transitions (discarded 12 similar events)
// Phase 1: matrix 67 rows 24 cols
[2022-05-16 09:43:37] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 09:43:37] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-16 09:43:37] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2022-05-16 09:43:37] [INFO ] Redundant transitions in 17 ms returned []
[2022-05-16 09:43:37] [INFO ] Flow matrix only has 67 transitions (discarded 12 similar events)
// Phase 1: matrix 67 rows 24 cols
[2022-05-16 09:43:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 09:43:37] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 79/79 transitions.
Starting property specific reduction for HealthRecord-PT-09-UpperBounds-15
Normalized transition count is 67 out of 79 initially.
// Phase 1: matrix 67 rows 24 cols
[2022-05-16 09:43:37] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2260 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 355 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2022-05-16 09:43:37] [INFO ] Flow matrix only has 67 transitions (discarded 12 similar events)
// Phase 1: matrix 67 rows 24 cols
[2022-05-16 09:43:37] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 09:43:38] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-16 09:43:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:43:38] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 09:43:38] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-16 09:43:38] [INFO ] [Real]Added 20 Read/Feed constraints in 7 ms returned sat
[2022-05-16 09:43:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:43:38] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-16 09:43:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:43:38] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-05-16 09:43:38] [INFO ] [Nat]Added 20 Read/Feed constraints in 7 ms returned sat
[2022-05-16 09:43:38] [INFO ] Computed and/alt/rep : 18/134/18 causal constraints (skipped 41 transitions) in 9 ms.
[2022-05-16 09:43:38] [INFO ] Added : 4 causal constraints over 2 iterations in 33 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 24/24 places, 79/79 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2022-05-16 09:43:38] [INFO ] Flow matrix only has 67 transitions (discarded 12 similar events)
// Phase 1: matrix 67 rows 24 cols
[2022-05-16 09:43:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 09:43:38] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 79/79 transitions.
Normalized transition count is 67 out of 79 initially.
// Phase 1: matrix 67 rows 24 cols
[2022-05-16 09:43:38] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 227872 resets, run finished after 1786 ms. (steps per millisecond=559 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 35505 resets, run finished after 441 ms. (steps per millisecond=2267 ) properties (out of 1) seen :0
[2022-05-16 09:43:40] [INFO ] Flow matrix only has 67 transitions (discarded 12 similar events)
// Phase 1: matrix 67 rows 24 cols
[2022-05-16 09:43:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 09:43:40] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-16 09:43:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:43:40] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 09:43:40] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-16 09:43:40] [INFO ] [Real]Added 20 Read/Feed constraints in 6 ms returned sat
[2022-05-16 09:43:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:43:40] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-16 09:43:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:43:40] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-16 09:43:40] [INFO ] [Nat]Added 20 Read/Feed constraints in 8 ms returned sat
[2022-05-16 09:43:40] [INFO ] Computed and/alt/rep : 18/134/18 causal constraints (skipped 41 transitions) in 7 ms.
[2022-05-16 09:43:40] [INFO ] Added : 4 causal constraints over 2 iterations in 32 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 24/24 places, 79/79 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 79/79 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 79/79 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 24/24 places, 79/79 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2022-05-16 09:43:40] [INFO ] Flow matrix only has 67 transitions (discarded 12 similar events)
// Phase 1: matrix 67 rows 24 cols
[2022-05-16 09:43:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 09:43:40] [INFO ] Implicit Places using invariants in 58 ms returned []
[2022-05-16 09:43:40] [INFO ] Flow matrix only has 67 transitions (discarded 12 similar events)
// Phase 1: matrix 67 rows 24 cols
[2022-05-16 09:43:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 09:43:40] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-16 09:43:40] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2022-05-16 09:43:40] [INFO ] Redundant transitions in 17 ms returned []
[2022-05-16 09:43:40] [INFO ] Flow matrix only has 67 transitions (discarded 12 similar events)
// Phase 1: matrix 67 rows 24 cols
[2022-05-16 09:43:40] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 09:43:40] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 79/79 transitions.
Ending property specific reduction for HealthRecord-PT-09-UpperBounds-15 in 3003 ms.
[2022-05-16 09:43:41] [INFO ] Flatten gal took : 59 ms
[2022-05-16 09:43:41] [INFO ] Applying decomposition
[2022-05-16 09:43:41] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph270041810142678130.txt' '-o' '/tmp/graph270041810142678130.bin' '-w' '/tmp/graph270041810142678130.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph270041810142678130.bin' '-l' '-1' '-v' '-w' '/tmp/graph270041810142678130.weights' '-q' '0' '-e' '0.001'
[2022-05-16 09:43:41] [INFO ] Decomposing Gal with order
[2022-05-16 09:43:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 09:43:41] [INFO ] Removed a total of 142 redundant transitions.
[2022-05-16 09:43:41] [INFO ] Flatten gal took : 83 ms
[2022-05-16 09:43:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 10 ms.
[2022-05-16 09:43:41] [INFO ] Time to serialize gal into /tmp/UpperBounds6060793816616240555.gal : 6 ms
[2022-05-16 09:43:41] [INFO ] Time to serialize properties into /tmp/UpperBounds15514531354444116304.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6060793816616240555.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15514531354444116304.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds15514531354444116304.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,899,0.040243,4084,92,55,711,237,168,627,96,881,0
Total reachable state count : 899

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property HealthRecord-PT-09-UpperBounds-15 :0 <= u5.p147 <= 1
FORMULA HealthRecord-PT-09-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
HealthRecord-PT-09-UpperBounds-15,0,0.041859,4084,1,0,711,237,208,627,108,881,80
Total runtime 18824 ms.

BK_STOP 1652694221736

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-09"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-09, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-smll-165264477300141"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-09.tgz
mv HealthRecord-PT-09 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;