Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r179-tall-171640602200733.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is HealthRecord-PT-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602200733
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 12 19:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 19:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 12 19:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 51K May 18 16:42 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-05-UpperBounds-00
FORMULA_NAME HealthRecord-PT-05-UpperBounds-01
FORMULA_NAME HealthRecord-PT-05-UpperBounds-02
FORMULA_NAME HealthRecord-PT-05-UpperBounds-03
FORMULA_NAME HealthRecord-PT-05-UpperBounds-04
FORMULA_NAME HealthRecord-PT-05-UpperBounds-05
FORMULA_NAME HealthRecord-PT-05-UpperBounds-06
FORMULA_NAME HealthRecord-PT-05-UpperBounds-07
FORMULA_NAME HealthRecord-PT-05-UpperBounds-08
FORMULA_NAME HealthRecord-PT-05-UpperBounds-09
FORMULA_NAME HealthRecord-PT-05-UpperBounds-10
FORMULA_NAME HealthRecord-PT-05-UpperBounds-11
FORMULA_NAME HealthRecord-PT-05-UpperBounds-12
FORMULA_NAME HealthRecord-PT-05-UpperBounds-13
FORMULA_NAME HealthRecord-PT-05-UpperBounds-14
FORMULA_NAME HealthRecord-PT-05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716490446173

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 18:54:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 18:54:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 18:54:07] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-23 18:54:07] [INFO ] Transformed 125 places.
[2024-05-23 18:54:07] [INFO ] Transformed 246 transitions.
[2024-05-23 18:54:07] [INFO ] Found NUPN structural information;
[2024-05-23 18:54:07] [INFO ] Parsed PT model containing 125 places and 246 transitions and 637 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-23 18:54:07] [INFO ] Flow matrix only has 229 transitions (discarded 8 similar events)
// Phase 1: matrix 229 rows 125 cols
[2024-05-23 18:54:07] [INFO ] Computed 14 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (925 resets) in 27 ms. (357 steps per ms)
FORMULA HealthRecord-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70007 steps (858 resets) in 52 ms. (1320 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-05-23 18:54:07] [INFO ] Flow matrix only has 229 transitions (discarded 8 similar events)
[2024-05-23 18:54:07] [INFO ] Invariant cache hit.
[2024-05-23 18:54:08] [INFO ] [Real]Absence check using 8 positive place invariants in 20 ms returned sat
[2024-05-23 18:54:08] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 24 ms returned sat
[2024-05-23 18:54:08] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-23 18:54:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 18:54:08] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2024-05-23 18:54:08] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 10 ms to minimize.
[2024-05-23 18:54:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:54:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2024-05-23 18:54:08] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-23 18:54:08] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-05-23 18:54:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 18:54:08] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 1 ms to minimize.
[2024-05-23 18:54:09] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 1 ms to minimize.
[2024-05-23 18:54:09] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 1 ms to minimize.
[2024-05-23 18:54:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 444 ms
[2024-05-23 18:54:09] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 41 ms.
[2024-05-23 18:54:09] [INFO ] Added : 11 causal constraints over 3 iterations in 97 ms. Result :sat
Minimization took 91 ms.
[2024-05-23 18:54:09] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-23 18:54:09] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:54:09] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-23 18:54:09] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 18:54:09] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-05-23 18:54:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:54:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-23 18:54:09] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-23 18:54:09] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-23 18:54:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 18:54:09] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-05-23 18:54:10] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-05-23 18:54:10] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 3 ms to minimize.
[2024-05-23 18:54:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 228 ms
[2024-05-23 18:54:10] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 35 ms.
[2024-05-23 18:54:10] [INFO ] Added : 13 causal constraints over 3 iterations in 185 ms. Result :sat
Minimization took 76 ms.
[2024-05-23 18:54:10] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-23 18:54:10] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:54:10] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-23 18:54:10] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 18:54:10] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 24 ms.
[2024-05-23 18:54:10] [INFO ] Added : 14 causal constraints over 3 iterations in 115 ms. Result :sat
Minimization took 109 ms.
[2024-05-23 18:54:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:54:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-23 18:54:10] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-23 18:54:10] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-23 18:54:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 18:54:10] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 14 ms.
[2024-05-23 18:54:10] [INFO ] Added : 14 causal constraints over 3 iterations in 69 ms. Result :sat
Minimization took 125 ms.
[2024-05-23 18:54:11] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-23 18:54:11] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:54:11] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2024-05-23 18:54:11] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 18:54:11] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 21 ms.
[2024-05-23 18:54:11] [INFO ] Added : 11 causal constraints over 3 iterations in 80 ms. Result :sat
Minimization took 111 ms.
[2024-05-23 18:54:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:54:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2024-05-23 18:54:11] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:54:11] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-23 18:54:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 18:54:11] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 21 ms.
[2024-05-23 18:54:11] [INFO ] Added : 11 causal constraints over 3 iterations in 86 ms. Result :sat
Minimization took 76 ms.
[2024-05-23 18:54:11] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-23 18:54:11] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-23 18:54:11] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-23 18:54:11] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 18:54:11] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 22 ms.
[2024-05-23 18:54:12] [INFO ] Added : 12 causal constraints over 3 iterations in 108 ms. Result :sat
Minimization took 134 ms.
[2024-05-23 18:54:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:54:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-23 18:54:12] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-23 18:54:12] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-23 18:54:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 18:54:12] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 23 ms.
[2024-05-23 18:54:12] [INFO ] Added : 12 causal constraints over 3 iterations in 90 ms. Result :sat
Minimization took 90 ms.
[2024-05-23 18:54:12] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-23 18:54:12] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:54:12] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-23 18:54:12] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 18:54:12] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-23 18:54:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:54:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-23 18:54:12] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:54:12] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-23 18:54:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 18:54:12] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:54:12] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-23 18:54:12] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 2 ms to minimize.
[2024-05-23 18:54:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 179 ms
[2024-05-23 18:54:12] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 14 ms.
[2024-05-23 18:54:13] [INFO ] Added : 11 causal constraints over 3 iterations in 87 ms. Result :sat
Minimization took 80 ms.
[2024-05-23 18:54:13] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-23 18:54:13] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:54:13] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-23 18:54:13] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 18:54:13] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-05-23 18:54:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:54:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-23 18:54:13] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:54:13] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-23 18:54:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 18:54:13] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-23 18:54:13] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 2 ms to minimize.
[2024-05-23 18:54:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2024-05-23 18:54:13] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 11 ms.
[2024-05-23 18:54:13] [INFO ] Added : 14 causal constraints over 3 iterations in 55 ms. Result :sat
Minimization took 98 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 237/237 transitions.
Graph (trivial) has 179 edges and 125 vertex of which 6 / 125 are part of one of the 3 SCC in 8 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 457 edges and 122 vertex of which 100 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 0 with 90 rules applied. Total rules applied 92 place count 100 transition count 123
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 149 place count 43 transition count 66
Iterating global reduction 1 with 57 rules applied. Total rules applied 206 place count 43 transition count 66
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 206 place count 43 transition count 59
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 220 place count 36 transition count 59
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 233 place count 23 transition count 38
Iterating global reduction 1 with 13 rules applied. Total rules applied 246 place count 23 transition count 38
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 249 place count 23 transition count 35
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 252 place count 20 transition count 30
Iterating global reduction 2 with 3 rules applied. Total rules applied 255 place count 20 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 256 place count 20 transition count 29
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 258 place count 18 transition count 27
Iterating global reduction 3 with 2 rules applied. Total rules applied 260 place count 18 transition count 27
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 262 place count 18 transition count 25
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 4 with 2 rules applied. Total rules applied 264 place count 17 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 265 place count 16 transition count 23
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 6 edges and 14 vertex of which 2 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 269 place count 13 transition count 22
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 273 place count 12 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 273 place count 12 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 275 place count 11 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 276 place count 11 transition count 17
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 6 with 2 rules applied. Total rules applied 278 place count 10 transition count 16
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 279 place count 10 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 280 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 282 place count 9 transition count 13
Applied a total of 282 rules in 132 ms. Remains 9 /125 variables (removed 116) and now considering 13/237 (removed 224) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 9/125 places, 13/237 transitions.
// Phase 1: matrix 13 rows 9 cols
[2024-05-23 18:54:14] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
FORMULA HealthRecord-PT-05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (115369 resets) in 636 ms. (1569 steps per ms)
FORMULA HealthRecord-PT-05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (54599 resets) in 197 ms. (5050 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 7558 ms.
ITS solved all properties within timeout

BK_STOP 1716490454930

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-05"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is HealthRecord-PT-05, 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 r179-tall-171640602200733"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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