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-167840348500333.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-13, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348500333
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.7K Feb 26 18:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 18:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 18:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 18:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Feb 26 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 18:08 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 71K 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-13-UpperBounds-00
FORMULA_NAME HealthRecord-PT-13-UpperBounds-01
FORMULA_NAME HealthRecord-PT-13-UpperBounds-02
FORMULA_NAME HealthRecord-PT-13-UpperBounds-03
FORMULA_NAME HealthRecord-PT-13-UpperBounds-04
FORMULA_NAME HealthRecord-PT-13-UpperBounds-05
FORMULA_NAME HealthRecord-PT-13-UpperBounds-06
FORMULA_NAME HealthRecord-PT-13-UpperBounds-07
FORMULA_NAME HealthRecord-PT-13-UpperBounds-08
FORMULA_NAME HealthRecord-PT-13-UpperBounds-09
FORMULA_NAME HealthRecord-PT-13-UpperBounds-10
FORMULA_NAME HealthRecord-PT-13-UpperBounds-11
FORMULA_NAME HealthRecord-PT-13-UpperBounds-12
FORMULA_NAME HealthRecord-PT-13-UpperBounds-13
FORMULA_NAME HealthRecord-PT-13-UpperBounds-14
FORMULA_NAME HealthRecord-PT-13-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678706239931

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-13
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 11:17:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 11:17:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 11:17:23] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2023-03-13 11:17:23] [INFO ] Transformed 161 places.
[2023-03-13 11:17:23] [INFO ] Transformed 341 transitions.
[2023-03-13 11:17:23] [INFO ] Found NUPN structural information;
[2023-03-13 11:17:23] [INFO ] Parsed PT model containing 161 places and 341 transitions and 899 arcs in 295 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Normalized transition count is 301 out of 313 initially.
// Phase 1: matrix 301 rows 161 cols
[2023-03-13 11:17:23] [INFO ] Computed 18 place invariants in 26 ms
Incomplete random walk after 10000 steps, including 782 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 16) seen :6
FORMULA HealthRecord-PT-13-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :1
FORMULA HealthRecord-PT-13-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 104 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 108 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :1
FORMULA HealthRecord-PT-13-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-13 11:17:24] [INFO ] Flow matrix only has 301 transitions (discarded 12 similar events)
// Phase 1: matrix 301 rows 161 cols
[2023-03-13 11:17:24] [INFO ] Computed 18 place invariants in 9 ms
[2023-03-13 11:17:24] [INFO ] [Real]Absence check using 10 positive place invariants in 23 ms returned sat
[2023-03-13 11:17:24] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-13 11:17:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 11:17:24] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2023-03-13 11:17:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 11:17:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-13 11:17:24] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-13 11:17:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 11:17:25] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2023-03-13 11:17:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:17:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-13 11:17:25] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 6 ms to minimize.
[2023-03-13 11:17:25] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2023-03-13 11:17:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 289 ms
[2023-03-13 11:17:25] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 45 ms.
[2023-03-13 11:17:25] [INFO ] Added : 24 causal constraints over 5 iterations in 288 ms. Result :sat
Minimization took 54 ms.
[2023-03-13 11:17:25] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-13 11:17:25] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-13 11:17:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 11:17:25] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2023-03-13 11:17:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 11:17:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-13 11:17:26] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-13 11:17:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 11:17:26] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2023-03-13 11:17:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-13 11:17:26] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 2 ms to minimize.
[2023-03-13 11:17:26] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 2 ms to minimize.
[2023-03-13 11:17:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
[2023-03-13 11:17:26] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 38 ms.
[2023-03-13 11:17:26] [INFO ] Added : 13 causal constraints over 3 iterations in 143 ms. Result :sat
Minimization took 48 ms.
[2023-03-13 11:17:26] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-13 11:17:26] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-13 11:17:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 11:17:26] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2023-03-13 11:17:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 11:17:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-13 11:17:26] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-13 11:17:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 11:17:26] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2023-03-13 11:17:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2023-03-13 11:17:26] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 35 ms.
[2023-03-13 11:17:27] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2023-03-13 11:17:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-13 11:17:27] [INFO ] Added : 12 causal constraints over 4 iterations in 270 ms. Result :sat
Minimization took 43 ms.
[2023-03-13 11:17:27] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-13 11:17:27] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-13 11:17:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 11:17:27] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2023-03-13 11:17:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 11:17:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-13 11:17:27] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-13 11:17:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 11:17:27] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2023-03-13 11:17:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2023-03-13 11:17:27] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 49 ms.
[2023-03-13 11:17:27] [INFO ] Added : 6 causal constraints over 2 iterations in 154 ms. Result :sat
Minimization took 28 ms.
[2023-03-13 11:17:28] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-13 11:17:28] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-13 11:17:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 11:17:28] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2023-03-13 11:17:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 11:17:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-13 11:17:28] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-13 11:17:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 11:17:28] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2023-03-13 11:17:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-13 11:17:28] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 47 ms.
[2023-03-13 11:17:28] [INFO ] Added : 8 causal constraints over 2 iterations in 142 ms. Result :sat
Minimization took 46 ms.
[2023-03-13 11:17:28] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-13 11:17:28] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-13 11:17:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 11:17:28] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2023-03-13 11:17:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 11:17:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-13 11:17:29] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-13 11:17:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 11:17:29] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2023-03-13 11:17:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2023-03-13 11:17:29] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 1 ms to minimize.
[2023-03-13 11:17:29] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 1 ms to minimize.
[2023-03-13 11:17:29] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 2 ms to minimize.
[2023-03-13 11:17:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 435 ms
[2023-03-13 11:17:29] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 39 ms.
[2023-03-13 11:17:29] [INFO ] Added : 11 causal constraints over 3 iterations in 131 ms. Result :sat
Minimization took 50 ms.
[2023-03-13 11:17:29] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-13 11:17:29] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-13 11:17:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 11:17:30] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2023-03-13 11:17:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 11:17:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-13 11:17:30] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-13 11:17:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 11:17:30] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-13 11:17:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-13 11:17:30] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 42 ms.
[2023-03-13 11:17:30] [INFO ] Added : 18 causal constraints over 5 iterations in 219 ms. Result :sat
Minimization took 54 ms.
[2023-03-13 11:17:30] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-13 11:17:30] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-13 11:17:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 11:17:30] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2023-03-13 11:17:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 11:17:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-13 11:17:30] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-13 11:17:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 11:17:31] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2023-03-13 11:17:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-13 11:17:31] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 2 ms to minimize.
[2023-03-13 11:17:31] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 1 ms to minimize.
[2023-03-13 11:17:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 328 ms
[2023-03-13 11:17:31] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 45 ms.
[2023-03-13 11:17:31] [INFO ] Added : 12 causal constraints over 3 iterations in 173 ms. Result :sat
Minimization took 49 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-13-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 313/313 transitions.
Graph (trivial) has 240 edges and 161 vertex of which 8 / 161 are part of one of the 4 SCC in 7 ms
Free SCC test removed 4 places
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 681 edges and 157 vertex of which 129 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.3 ms
Discarding 28 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Drop transitions removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 0 with 116 rules applied. Total rules applied 118 place count 129 transition count 164
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 199 place count 48 transition count 83
Iterating global reduction 1 with 81 rules applied. Total rules applied 280 place count 48 transition count 83
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 280 place count 48 transition count 78
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 290 place count 43 transition count 78
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 303 place count 30 transition count 59
Iterating global reduction 1 with 13 rules applied. Total rules applied 316 place count 30 transition count 59
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 325 place count 30 transition count 50
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 327 place count 28 transition count 47
Iterating global reduction 2 with 2 rules applied. Total rules applied 329 place count 28 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 330 place count 28 transition count 46
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 331 place count 27 transition count 45
Iterating global reduction 3 with 1 rules applied. Total rules applied 332 place count 27 transition count 45
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 335 place count 27 transition count 42
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 343 place count 23 transition count 38
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 344 place count 23 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 345 place count 22 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 346 place count 21 transition count 36
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 350 place count 21 transition count 32
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 352 place count 20 transition count 31
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 353 place count 19 transition count 30
Iterating global reduction 5 with 1 rules applied. Total rules applied 354 place count 19 transition count 30
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 357 place count 19 transition count 27
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 358 place count 19 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 359 place count 18 transition count 26
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 360 place count 18 transition count 26
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 361 place count 18 transition count 25
Applied a total of 361 rules in 94 ms. Remains 18 /161 variables (removed 143) and now considering 25/313 (removed 288) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 18/161 places, 25/313 transitions.
Normalized transition count is 21 out of 25 initially.
// Phase 1: matrix 21 rows 18 cols
[2023-03-13 11:17:31] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 83413 resets, run finished after 1128 ms. (steps per millisecond=886 ) properties (out of 3) seen :3
FORMULA HealthRecord-PT-13-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 9693 ms.
ITS solved all properties within timeout

BK_STOP 1678706253934

--------------------
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-13"
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-13, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r202-smll-167840348500333"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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