About the Execution of GreatSPN+red for HealthRecord-PT-13
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 792.336 | 20293.00 | 34857.00 | 85.10 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
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-171640602300797.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-13, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602300797
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 13K Apr 12 20:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 12 20:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 20:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 20:05 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 71K 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-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 1716491152265
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-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 19:05:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 19:05:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:05:53] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-23 19:05:53] [INFO ] Transformed 161 places.
[2024-05-23 19:05:53] [INFO ] Transformed 341 transitions.
[2024-05-23 19:05:53] [INFO ] Found NUPN structural information;
[2024-05-23 19:05:53] [INFO ] Parsed PT model containing 161 places and 341 transitions and 899 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 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, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-23 19:05:53] [INFO ] Flow matrix only has 301 transitions (discarded 12 similar events)
// Phase 1: matrix 301 rows 161 cols
[2024-05-23 19:05:53] [INFO ] Computed 18 invariants in 25 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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (779 resets) in 44 ms. (222 steps per ms)
FORMULA HealthRecord-PT-13-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80006 steps (861 resets) in 67 ms. (1176 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-23 19:05:53] [INFO ] Flow matrix only has 301 transitions (discarded 12 similar events)
[2024-05-23 19:05:53] [INFO ] Invariant cache hit.
[2024-05-23 19:05:54] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-05-23 19:05:54] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2024-05-23 19:05:54] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-23 19:05:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 19:05:54] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2024-05-23 19:05:54] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 9 ms to minimize.
[2024-05-23 19:05:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:05:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-23 19:05:54] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-23 19:05:54] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2024-05-23 19:05:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-23 19:05:54] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 2 ms to minimize.
[2024-05-23 19:05:54] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:05:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 228 ms
[2024-05-23 19:05:54] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 28 ms.
[2024-05-23 19:05:54] [INFO ] Added : 16 causal constraints over 4 iterations in 132 ms. Result :sat
Minimization took 142 ms.
[2024-05-23 19:05:55] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-23 19:05:55] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2024-05-23 19:05:55] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-23 19:05:55] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-23 19:05:55] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 20 ms.
[2024-05-23 19:05:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:05:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-23 19:05:55] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-23 19:05:55] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-23 19:05:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 19:05:55] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 29 ms.
[2024-05-23 19:05:55] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:05:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-05-23 19:05:55] [INFO ] Added : 34 causal constraints over 8 iterations in 252 ms. Result :sat
Minimization took 133 ms.
[2024-05-23 19:05:55] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-23 19:05:55] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-23 19:05:55] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-23 19:05:55] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 19:05:55] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:05:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:05:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-05-23 19:05:56] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-23 19:05:56] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-23 19:05:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 19:05:56] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:05:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-23 19:05:56] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 30 ms.
[2024-05-23 19:05:56] [INFO ] Added : 22 causal constraints over 5 iterations in 127 ms. Result :sat
Minimization took 127 ms.
[2024-05-23 19:05:56] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-23 19:05:56] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 19:05:56] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-23 19:05:56] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 19:05:56] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 2 ms to minimize.
[2024-05-23 19:05:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:05:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-23 19:05:56] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 19:05:56] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-23 19:05:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-23 19:05:56] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
[2024-05-23 19:05:56] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:05:56] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-23 19:05:56] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:05:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 282 ms
[2024-05-23 19:05:57] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 19 ms.
[2024-05-23 19:05:57] [INFO ] Added : 14 causal constraints over 3 iterations in 77 ms. Result :sat
Minimization took 118 ms.
[2024-05-23 19:05:57] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-23 19:05:57] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2024-05-23 19:05:57] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-23 19:05:57] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 19:05:57] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 16 ms.
[2024-05-23 19:05:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:05:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-23 19:05:57] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 19:05:57] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-23 19:05:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 19:05:57] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 22 ms.
[2024-05-23 19:05:57] [INFO ] Added : 28 causal constraints over 7 iterations in 150 ms. Result :sat
Minimization took 120 ms.
[2024-05-23 19:05:57] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-23 19:05:57] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 19:05:57] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-23 19:05:57] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 19:05:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:05:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-23 19:05:58] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 19:05:58] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-23 19:05:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2024-05-23 19:05:58] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 23 ms.
[2024-05-23 19:05:58] [INFO ] Added : 10 causal constraints over 2 iterations in 68 ms. Result :sat
Minimization took 127 ms.
[2024-05-23 19:05:58] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-23 19:05:58] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 19:05:58] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-23 19:05:58] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 19:05:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:05:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-23 19:05:58] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 19:05:58] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-23 19:05:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 19:05:58] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 21 ms.
[2024-05-23 19:05:58] [INFO ] Added : 13 causal constraints over 3 iterations in 82 ms. Result :sat
Minimization took 108 ms.
[2024-05-23 19:05:58] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-23 19:05:58] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-23 19:05:58] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-23 19:05:58] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 19:05:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:05:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-23 19:05:58] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 19:05:58] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-23 19:05:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 19:05:59] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 17 ms.
[2024-05-23 19:05:59] [INFO ] Added : 14 causal constraints over 3 iterations in 79 ms. Result :sat
Minimization took 112 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-13-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 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 3 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 681 edges and 157 vertex of which 148 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 148 transition count 288
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 16 place count 144 transition count 282
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 19 place count 142 transition count 281
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 142 transition count 280
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 21 place count 141 transition count 280
Discarding 81 places :
Symmetric choice reduction at 3 with 81 rule applications. Total rules 102 place count 60 transition count 118
Iterating global reduction 3 with 81 rules applied. Total rules applied 183 place count 60 transition count 118
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 191 place count 52 transition count 102
Iterating global reduction 3 with 8 rules applied. Total rules applied 199 place count 52 transition count 102
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 208 place count 52 transition count 93
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 209 place count 51 transition count 90
Iterating global reduction 4 with 1 rules applied. Total rules applied 210 place count 51 transition count 90
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 211 place count 50 transition count 88
Iterating global reduction 4 with 1 rules applied. Total rules applied 212 place count 50 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 215 place count 50 transition count 85
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 217 place count 49 transition count 84
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 227 place count 44 transition count 111
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 231 place count 44 transition count 107
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 235 place count 40 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 237 place count 40 transition count 105
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 238 place count 40 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 239 place count 39 transition count 276
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 241 place count 39 transition count 274
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 242 place count 38 transition count 229
Iterating global reduction 7 with 1 rules applied. Total rules applied 243 place count 38 transition count 229
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 244 place count 37 transition count 227
Iterating global reduction 7 with 1 rules applied. Total rules applied 245 place count 37 transition count 227
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 261 place count 37 transition count 211
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 275 place count 37 transition count 211
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 287 place count 37 transition count 211
Applied a total of 287 rules in 99 ms. Remains 37 /161 variables (removed 124) and now considering 211/313 (removed 102) transitions.
Running 195 sub problems to find dead transitions.
[2024-05-23 19:05:59] [INFO ] Flow matrix only has 147 transitions (discarded 64 similar events)
// Phase 1: matrix 147 rows 37 cols
[2024-05-23 19:05:59] [INFO ] Computed 9 invariants in 2 ms
[2024-05-23 19:05:59] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 2/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
At refinement iteration 4 (OVERLAPS) 147/184 variables, 37/46 constraints. Problems are: Problem set: 13 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 28/74 constraints. Problems are: Problem set: 13 solved, 182 unsolved
[2024-05-23 19:06:01] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-23 19:06:01] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 2/76 constraints. Problems are: Problem set: 16 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/76 constraints. Problems are: Problem set: 16 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/76 constraints. Problems are: Problem set: 16 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 76 constraints, problems are : Problem set: 16 solved, 179 unsolved in 3289 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 16 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 16 solved, 179 unsolved
At refinement iteration 1 (OVERLAPS) 3/36 variables, 1/1 constraints. Problems are: Problem set: 16 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 2/3 constraints. Problems are: Problem set: 16 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 16 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 1/37 variables, 8/11 constraints. Problems are: Problem set: 16 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 16 solved, 179 unsolved
At refinement iteration 6 (OVERLAPS) 147/184 variables, 37/48 constraints. Problems are: Problem set: 16 solved, 179 unsolved
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 28/76 constraints. Problems are: Problem set: 18 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 177/253 constraints. Problems are: Problem set: 18 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/253 constraints. Problems are: Problem set: 18 solved, 177 unsolved
At refinement iteration 10 (OVERLAPS) 0/184 variables, 0/253 constraints. Problems are: Problem set: 18 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 253 constraints, problems are : Problem set: 18 solved, 177 unsolved in 4581 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 177/195 constraints, Known Traps: 2/2 constraints]
After SMT, in 8200ms problems are : Problem set: 18 solved, 177 unsolved
Search for dead transitions found 18 dead transitions in 8214ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 18 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 37/161 places, 193/313 transitions.
Graph (complete) has 167 edges and 37 vertex of which 35 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 35 /37 variables (removed 2) and now considering 193/193 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8339 ms. Remains : 35/161 places, 193/313 transitions.
[2024-05-23 19:06:07] [INFO ] Flow matrix only has 129 transitions (discarded 64 similar events)
// Phase 1: matrix 129 rows 35 cols
[2024-05-23 19:06:07] [INFO ] Computed 8 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (7 resets) in 1305 ms. (765 steps per ms)
BEST_FIRST walk for 4000002 steps (28 resets) in 1912 ms. (2090 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-05-23 19:06:10] [INFO ] Flow matrix only has 129 transitions (discarded 64 similar events)
[2024-05-23 19:06:10] [INFO ] Invariant cache hit.
[2024-05-23 19:06:10] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 19:06:11] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-23 19:06:11] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-23 19:06:11] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 19:06:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:06:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 19:06:11] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-23 19:06:11] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 19:06:11] [INFO ] Computed and/alt/rep : 40/277/40 causal constraints (skipped 73 transitions) in 8 ms.
[2024-05-23 19:06:11] [INFO ] Added : 0 causal constraints over 0 iterations in 18 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 19:06:11] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 19:06:11] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-23 19:06:11] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 19:06:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:06:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 19:06:11] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-23 19:06:11] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 19:06:11] [INFO ] Computed and/alt/rep : 40/277/40 causal constraints (skipped 73 transitions) in 8 ms.
[2024-05-23 19:06:11] [INFO ] Added : 0 causal constraints over 0 iterations in 22 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 19:06:11] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 19:06:11] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-23 19:06:11] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 19:06:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:06:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 19:06:11] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-23 19:06:11] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 19:06:11] [INFO ] Computed and/alt/rep : 40/277/40 causal constraints (skipped 73 transitions) in 8 ms.
[2024-05-23 19:06:11] [INFO ] Added : 3 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 19:06:11] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 19:06:11] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-23 19:06:11] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 19:06:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:06:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 19:06:11] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-23 19:06:11] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 19:06:11] [INFO ] Computed and/alt/rep : 40/277/40 causal constraints (skipped 73 transitions) in 9 ms.
[2024-05-23 19:06:11] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
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-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 35 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p128) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 191/191 transitions.
Graph (complete) has 153 edges and 35 vertex of which 28 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 28 transition count 188
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 24 transition count 115
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 24 transition count 115
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 24 transition count 104
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 23 place count 24 transition count 103
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 23 transition count 103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 22 transition count 102
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 22 transition count 102
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 2 with 2 rules applied. Total rules applied 29 place count 21 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 21 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 20 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 20 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 19 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 19 transition count 77
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 46 place count 19 transition count 65
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 63 place count 19 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 67 place count 19 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 18 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 17 transition count 60
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 77 place count 13 transition count 56
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 84 place count 13 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 104 place count 13 transition count 29
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 105 place count 13 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 106 place count 13 transition count 28
Applied a total of 106 rules in 16 ms. Remains 13 /35 variables (removed 22) and now considering 28/191 (removed 163) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 13/35 places, 28/191 transitions.
[2024-05-23 19:06:11] [INFO ] Flow matrix only has 20 transitions (discarded 8 similar events)
// Phase 1: matrix 20 rows 13 cols
[2024-05-23 19:06:11] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (4 resets) in 453 ms. (2202 steps per ms)
FORMULA HealthRecord-PT-13-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (93 resets) in 441 ms. (2262 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 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 19067 ms.
ITS solved all properties within timeout
BK_STOP 1716491172558
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-13"
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-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 r179-tall-171640602300797"
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 '
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 ;