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.r202-smll-167840348400261.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 marciexred
Input is HealthRecord-PT-04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348400261
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 6.4K Feb 26 17:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 17:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 17:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 17:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 17:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 17:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 17:50 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 50K 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-04-UpperBounds-00
FORMULA_NAME HealthRecord-PT-04-UpperBounds-01
FORMULA_NAME HealthRecord-PT-04-UpperBounds-02
FORMULA_NAME HealthRecord-PT-04-UpperBounds-03
FORMULA_NAME HealthRecord-PT-04-UpperBounds-04
FORMULA_NAME HealthRecord-PT-04-UpperBounds-05
FORMULA_NAME HealthRecord-PT-04-UpperBounds-06
FORMULA_NAME HealthRecord-PT-04-UpperBounds-07
FORMULA_NAME HealthRecord-PT-04-UpperBounds-08
FORMULA_NAME HealthRecord-PT-04-UpperBounds-09
FORMULA_NAME HealthRecord-PT-04-UpperBounds-10
FORMULA_NAME HealthRecord-PT-04-UpperBounds-11
FORMULA_NAME HealthRecord-PT-04-UpperBounds-12
FORMULA_NAME HealthRecord-PT-04-UpperBounds-13
FORMULA_NAME HealthRecord-PT-04-UpperBounds-14
FORMULA_NAME HealthRecord-PT-04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678682752538

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-04
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 04:45:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 04:45:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 04:45:55] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2023-03-13 04:45:55] [INFO ] Transformed 123 places.
[2023-03-13 04:45:55] [INFO ] Transformed 239 transitions.
[2023-03-13 04:45:55] [INFO ] Found NUPN structural information;
[2023-03-13 04:45:55] [INFO ] Parsed PT model containing 123 places and 239 transitions and 617 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
Normalized transition count is 223 out of 231 initially.
// Phase 1: matrix 223 rows 123 cols
[2023-03-13 04:45:55] [INFO ] Computed 14 place invariants in 26 ms
Incomplete random walk after 10000 steps, including 779 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 16) seen :9
FORMULA HealthRecord-PT-04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 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 113 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 110 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :1
FORMULA HealthRecord-PT-04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-13 04:45:55] [INFO ] Flow matrix only has 223 transitions (discarded 8 similar events)
// Phase 1: matrix 223 rows 123 cols
[2023-03-13 04:45:55] [INFO ] Computed 14 place invariants in 9 ms
[2023-03-13 04:45:56] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2023-03-13 04:45:56] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-13 04:45:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 04:45:56] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2023-03-13 04:45:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 04:45:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-13 04:45:56] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-13 04:45:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 04:45:56] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2023-03-13 04:45:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 04:45:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-13 04:45:56] [INFO ] Computed and/alt/rep : 173/188/173 causal constraints (skipped 49 transitions) in 35 ms.
[2023-03-13 04:45:56] [INFO ] Added : 7 causal constraints over 2 iterations in 107 ms. Result :sat
Minimization took 25 ms.
[2023-03-13 04:45:56] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-13 04:45:56] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-13 04:45:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 04:45:56] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2023-03-13 04:45:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 04:45:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2023-03-13 04:45:57] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-13 04:45:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 04:45:57] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2023-03-13 04:45:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 16 ms returned sat
[2023-03-13 04:45:57] [INFO ] Computed and/alt/rep : 173/188/173 causal constraints (skipped 49 transitions) in 51 ms.
[2023-03-13 04:45:57] [INFO ] Added : 5 causal constraints over 1 iterations in 110 ms. Result :sat
Minimization took 22 ms.
[2023-03-13 04:45:57] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-13 04:45:57] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-13 04:45:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 04:45:57] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2023-03-13 04:45:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 04:45:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-13 04:45:57] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-13 04:45:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 04:45:57] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-13 04:45:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 16 ms returned sat
[2023-03-13 04:45:57] [INFO ] Computed and/alt/rep : 173/188/173 causal constraints (skipped 49 transitions) in 22 ms.
[2023-03-13 04:45:57] [INFO ] Added : 19 causal constraints over 4 iterations in 95 ms. Result :sat
Minimization took 27 ms.
[2023-03-13 04:45:57] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-13 04:45:57] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-13 04:45:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 04:45:57] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-13 04:45:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 04:45:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2023-03-13 04:45:58] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-13 04:45:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 04:45:58] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2023-03-13 04:45:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-13 04:45:58] [INFO ] Computed and/alt/rep : 173/188/173 causal constraints (skipped 49 transitions) in 22 ms.
[2023-03-13 04:45:58] [INFO ] Added : 7 causal constraints over 2 iterations in 69 ms. Result :sat
Minimization took 20 ms.
[2023-03-13 04:45:58] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-13 04:45:58] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-13 04:45:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 04:45:58] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2023-03-13 04:45:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 04:45:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2023-03-13 04:45:58] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-13 04:45:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 04:45:58] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2023-03-13 04:45:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-13 04:45:58] [INFO ] Computed and/alt/rep : 173/188/173 causal constraints (skipped 49 transitions) in 25 ms.
[2023-03-13 04:45:58] [INFO ] Added : 9 causal constraints over 2 iterations in 90 ms. Result :sat
Minimization took 35 ms.
[2023-03-13 04:45:58] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-13 04:45:58] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-13 04:45:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 04:45:58] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2023-03-13 04:45:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 04:45:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2023-03-13 04:45:58] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-13 04:45:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 04:45:59] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-13 04:45:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-13 04:45:59] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 9 ms to minimize.
[2023-03-13 04:45:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-13 04:45:59] [INFO ] Computed and/alt/rep : 173/188/173 causal constraints (skipped 49 transitions) in 27 ms.
[2023-03-13 04:45:59] [INFO ] Added : 6 causal constraints over 2 iterations in 86 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA HealthRecord-PT-04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 123 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 229/229 transitions.
Graph (trivial) has 179 edges and 123 vertex of which 6 / 123 are part of one of the 3 SCC in 6 ms
Free SCC test removed 3 places
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 443 edges and 120 vertex of which 112 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 112 transition count 211
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 8 rules applied. Total rules applied 13 place count 109 transition count 206
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 16 place count 107 transition count 205
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 107 transition count 204
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 106 transition count 204
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 73 place count 51 transition count 94
Iterating global reduction 3 with 55 rules applied. Total rules applied 128 place count 51 transition count 94
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 138 place count 41 transition count 74
Iterating global reduction 3 with 10 rules applied. Total rules applied 148 place count 41 transition count 74
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 152 place count 41 transition count 70
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 155 place count 38 transition count 61
Iterating global reduction 4 with 3 rules applied. Total rules applied 158 place count 38 transition count 61
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 161 place count 35 transition count 55
Iterating global reduction 4 with 3 rules applied. Total rules applied 164 place count 35 transition count 55
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 167 place count 35 transition count 52
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 169 place count 34 transition count 51
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -23
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 179 place count 29 transition count 74
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 180 place count 29 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 181 place count 28 transition count 73
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 184 place count 28 transition count 129
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 189 place count 25 transition count 127
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 190 place count 24 transition count 96
Iterating global reduction 7 with 1 rules applied. Total rules applied 191 place count 24 transition count 96
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 192 place count 23 transition count 94
Iterating global reduction 7 with 1 rules applied. Total rules applied 193 place count 23 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 197 place count 23 transition count 90
Applied a total of 197 rules in 123 ms. Remains 23 /123 variables (removed 100) and now considering 90/229 (removed 139) transitions.
[2023-03-13 04:45:59] [INFO ] Flow matrix only has 70 transitions (discarded 20 similar events)
// Phase 1: matrix 70 rows 23 cols
[2023-03-13 04:45:59] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-13 04:45:59] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 23/123 places, 90/229 transitions.
Successfully produced net in file /tmp/petri1000_2485901106171193845.dot
Successfully produced net in file /tmp/petri1001_4739779275248492998.dot
Drop transitions removed 2 transitions
Dominated transitions for bounds rules discarded 2 transitions
Normalized transition count is 68 out of 88 initially.
// Phase 1: matrix 68 rows 23 cols
[2023-03-13 04:45:59] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 212892 resets, run finished after 2205 ms. (steps per millisecond=453 ) properties (out of 1) seen :1
FORMULA HealthRecord-PT-04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 6519 ms.
ITS solved all properties within timeout

BK_STOP 1678682762712

--------------------
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-04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is HealthRecord-PT-04, 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 r202-smll-167840348400261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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