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.r197-smll-167840344100349.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 itstools
Input is HealthRecord-PT-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-167840344100349
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.4K Feb 26 17:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 17:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 17:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:14 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 73K 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-15-UpperBounds-00
FORMULA_NAME HealthRecord-PT-15-UpperBounds-01
FORMULA_NAME HealthRecord-PT-15-UpperBounds-02
FORMULA_NAME HealthRecord-PT-15-UpperBounds-03
FORMULA_NAME HealthRecord-PT-15-UpperBounds-04
FORMULA_NAME HealthRecord-PT-15-UpperBounds-05
FORMULA_NAME HealthRecord-PT-15-UpperBounds-06
FORMULA_NAME HealthRecord-PT-15-UpperBounds-07
FORMULA_NAME HealthRecord-PT-15-UpperBounds-08
FORMULA_NAME HealthRecord-PT-15-UpperBounds-09
FORMULA_NAME HealthRecord-PT-15-UpperBounds-10
FORMULA_NAME HealthRecord-PT-15-UpperBounds-11
FORMULA_NAME HealthRecord-PT-15-UpperBounds-12
FORMULA_NAME HealthRecord-PT-15-UpperBounds-13
FORMULA_NAME HealthRecord-PT-15-UpperBounds-14
FORMULA_NAME HealthRecord-PT-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678515200685

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-15
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-11 06:13:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 06:13:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 06:13:23] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2023-03-11 06:13:23] [INFO ] Transformed 163 places.
[2023-03-11 06:13:23] [INFO ] Transformed 348 transitions.
[2023-03-11 06:13:23] [INFO ] Found NUPN structural information;
[2023-03-11 06:13:23] [INFO ] Parsed PT model containing 163 places and 348 transitions and 919 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
Normalized transition count is 307 out of 319 initially.
// Phase 1: matrix 307 rows 163 cols
[2023-03-11 06:13:23] [INFO ] Computed 18 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 917 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 16) seen :8
FORMULA HealthRecord-PT-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 120 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 118 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 8) seen :0
[2023-03-11 06:13:23] [INFO ] Flow matrix only has 307 transitions (discarded 12 similar events)
// Phase 1: matrix 307 rows 163 cols
[2023-03-11 06:13:23] [INFO ] Computed 18 place invariants in 14 ms
[2023-03-11 06:13:24] [INFO ] [Real]Absence check using 10 positive place invariants in 28 ms returned sat
[2023-03-11 06:13:24] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 36 ms returned sat
[2023-03-11 06:13:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:13:24] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2023-03-11 06:13:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:13:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-11 06:13:24] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 06:13:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:13:24] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2023-03-11 06:13:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:13:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-11 06:13:25] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 3 ms to minimize.
[2023-03-11 06:13:25] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2023-03-11 06:13:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 218 ms
[2023-03-11 06:13:25] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 48 ms.
[2023-03-11 06:13:25] [INFO ] Added : 12 causal constraints over 3 iterations in 186 ms. Result :sat
Minimization took 34 ms.
[2023-03-11 06:13:25] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-11 06:13:25] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 06:13:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:13:25] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2023-03-11 06:13:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:13:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-11 06:13:25] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 06:13:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:13:25] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2023-03-11 06:13:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-11 06:13:25] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2023-03-11 06:13:26] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2023-03-11 06:13:26] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2023-03-11 06:13:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 279 ms
[2023-03-11 06:13:26] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 33 ms.
[2023-03-11 06:13:26] [INFO ] Added : 19 causal constraints over 4 iterations in 126 ms. Result :sat
Minimization took 30 ms.
[2023-03-11 06:13:26] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-11 06:13:26] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 06:13:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:13:26] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-11 06:13:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:13:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-11 06:13:26] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 06:13:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:13:26] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2023-03-11 06:13:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-11 06:13:26] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 41 ms.
[2023-03-11 06:13:26] [INFO ] Added : 9 causal constraints over 2 iterations in 121 ms. Result :sat
Minimization took 30 ms.
[2023-03-11 06:13:27] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-11 06:13:27] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 06:13:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:13:27] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-03-11 06:13:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:13:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-11 06:13:27] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 06:13:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:13:27] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-11 06:13:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 06:13:27] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 1 ms to minimize.
[2023-03-11 06:13:27] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2023-03-11 06:13:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 245 ms
[2023-03-11 06:13:27] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 33 ms.
[2023-03-11 06:13:27] [INFO ] Added : 15 causal constraints over 3 iterations in 141 ms. Result :sat
Minimization took 49 ms.
[2023-03-11 06:13:28] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-11 06:13:28] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 06:13:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:13:28] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2023-03-11 06:13:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:13:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-11 06:13:28] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 06:13:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:13:28] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2023-03-11 06:13:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 06:13:28] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2023-03-11 06:13:28] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2023-03-11 06:13:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2023-03-11 06:13:28] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 46 ms.
[2023-03-11 06:13:28] [INFO ] Added : 19 causal constraints over 4 iterations in 141 ms. Result :sat
Minimization took 31 ms.
[2023-03-11 06:13:28] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-11 06:13:28] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 06:13:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:13:29] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2023-03-11 06:13:29] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 06:13:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:13:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-11 06:13:29] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 06:13:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:13:29] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2023-03-11 06:13:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 06:13:29] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 40 ms.
[2023-03-11 06:13:29] [INFO ] Added : 17 causal constraints over 5 iterations in 176 ms. Result :sat
Minimization took 30 ms.
[2023-03-11 06:13:29] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-11 06:13:29] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 06:13:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:13:29] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2023-03-11 06:13:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:13:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-11 06:13:29] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 06:13:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:13:29] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2023-03-11 06:13:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 06:13:29] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 30 ms.
[2023-03-11 06:13:30] [INFO ] Added : 9 causal constraints over 2 iterations in 108 ms. Result :sat
Minimization took 45 ms.
[2023-03-11 06:13:30] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-11 06:13:30] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 06:13:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 06:13:30] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-03-11 06:13:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 06:13:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-11 06:13:30] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 06:13:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 06:13:30] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-11 06:13:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 06:13:30] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 38 ms.
[2023-03-11 06:13:30] [INFO ] Added : 10 causal constraints over 2 iterations in 125 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
FORMULA HealthRecord-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-15-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-15-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 319/319 transitions.
Graph (trivial) has 243 edges and 163 vertex of which 6 / 163 are part of one of the 3 SCC in 7 ms
Free SCC test removed 3 places
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 695 edges and 160 vertex of which 134 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.3 ms
Discarding 26 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 122 place count 134 transition count 171
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 206 place count 50 transition count 87
Iterating global reduction 1 with 84 rules applied. Total rules applied 290 place count 50 transition count 87
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 290 place count 50 transition count 81
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 302 place count 44 transition count 81
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 317 place count 29 transition count 58
Iterating global reduction 1 with 15 rules applied. Total rules applied 332 place count 29 transition count 58
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 341 place count 29 transition count 49
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 345 place count 25 transition count 42
Iterating global reduction 2 with 4 rules applied. Total rules applied 349 place count 25 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 350 place count 25 transition count 41
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 352 place count 23 transition count 39
Iterating global reduction 3 with 2 rules applied. Total rules applied 354 place count 23 transition count 39
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 360 place count 23 transition count 33
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 368 place count 19 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 369 place count 19 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 370 place count 18 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 371 place count 17 transition count 27
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 375 place count 17 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 377 place count 16 transition count 22
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 378 place count 15 transition count 21
Iterating global reduction 5 with 1 rules applied. Total rules applied 379 place count 15 transition count 21
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 382 place count 15 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 383 place count 15 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 384 place count 14 transition count 17
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 385 place count 14 transition count 17
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 386 place count 14 transition count 16
Applied a total of 386 rules in 61 ms. Remains 14 /163 variables (removed 149) and now considering 16/319 (removed 303) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 14/163 places, 16/319 transitions.
Normalized transition count is 14 out of 16 initially.
// Phase 1: matrix 14 rows 14 cols
[2023-03-11 06:13:30] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 138247 resets, run finished after 848 ms. (steps per millisecond=1179 ) properties (out of 3) seen :3
FORMULA HealthRecord-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 8253 ms.

BK_STOP 1678515212631

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

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