About the Execution of GreatSPN+red for FireWire-PT-01
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 562.191 | 43640.00 | 62396.00 | 122.90 | 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.r549-tall-171734898000173.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 FireWire-PT-01, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898000173
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 84K Jun 2 16:33 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 FireWire-PT-01-UpperBounds-00
FORMULA_NAME FireWire-PT-01-UpperBounds-01
FORMULA_NAME FireWire-PT-01-UpperBounds-02
FORMULA_NAME FireWire-PT-01-UpperBounds-03
FORMULA_NAME FireWire-PT-01-UpperBounds-04
FORMULA_NAME FireWire-PT-01-UpperBounds-05
FORMULA_NAME FireWire-PT-01-UpperBounds-06
FORMULA_NAME FireWire-PT-01-UpperBounds-07
FORMULA_NAME FireWire-PT-01-UpperBounds-08
FORMULA_NAME FireWire-PT-01-UpperBounds-09
FORMULA_NAME FireWire-PT-01-UpperBounds-10
FORMULA_NAME FireWire-PT-01-UpperBounds-11
FORMULA_NAME FireWire-PT-01-UpperBounds-12
FORMULA_NAME FireWire-PT-01-UpperBounds-13
FORMULA_NAME FireWire-PT-01-UpperBounds-14
FORMULA_NAME FireWire-PT-01-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717365131187
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 21:52:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 21:52:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:52:12] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-06-02 21:52:12] [INFO ] Transformed 107 places.
[2024-06-02 21:52:12] [INFO ] Transformed 346 transitions.
[2024-06-02 21:52:12] [INFO ] Found NUPN structural information;
[2024-06-02 21:52:12] [INFO ] Parsed PT model containing 107 places and 346 transitions and 1271 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 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-06-02 21:52:12] [INFO ] Flow matrix only has 261 transitions (discarded 32 similar events)
// Phase 1: matrix 261 rows 107 cols
[2024-06-02 21:52:12] [INFO ] Computed 8 invariants in 16 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 (551 resets) in 43 ms. (227 steps per ms)
FORMULA FireWire-PT-01-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-01-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-01-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-01-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-01-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-01-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-01-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-01-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-01-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-01-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60005 steps (853 resets) in 67 ms. (882 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2024-06-02 21:52:12] [INFO ] Flow matrix only has 261 transitions (discarded 32 similar events)
[2024-06-02 21:52:12] [INFO ] Invariant cache hit.
[2024-06-02 21:52:12] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-02 21:52:12] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-06-02 21:52:13] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:52:13] [INFO ] [Real]Added 40 Read/Feed constraints in 21 ms returned sat
[2024-06-02 21:52:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:52:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 21:52:13] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-02 21:52:13] [INFO ] [Nat]Added 40 Read/Feed constraints in 18 ms returned sat
[2024-06-02 21:52:13] [INFO ] Computed and/alt/rep : 115/463/115 causal constraints (skipped 145 transitions) in 40 ms.
[2024-06-02 21:52:13] [INFO ] Added : 36 causal constraints over 8 iterations in 227 ms. Result :sat
Minimization took 131 ms.
[2024-06-02 21:52:13] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 21:52:13] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-06-02 21:52:13] [INFO ] [Real]Added 40 Read/Feed constraints in 11 ms returned sat
[2024-06-02 21:52:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:52:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 21:52:13] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-02 21:52:13] [INFO ] [Nat]Added 40 Read/Feed constraints in 16 ms returned sat
[2024-06-02 21:52:13] [INFO ] Computed and/alt/rep : 115/463/115 causal constraints (skipped 145 transitions) in 27 ms.
[2024-06-02 21:52:13] [INFO ] Added : 28 causal constraints over 6 iterations in 140 ms. Result :sat
Minimization took 128 ms.
[2024-06-02 21:52:14] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 21:52:14] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-02 21:52:14] [INFO ] [Real]Added 40 Read/Feed constraints in 5 ms returned sat
[2024-06-02 21:52:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:52:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 21:52:14] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-02 21:52:14] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2024-06-02 21:52:14] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 10 ms to minimize.
[2024-06-02 21:52:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2024-06-02 21:52:14] [INFO ] Computed and/alt/rep : 115/463/115 causal constraints (skipped 145 transitions) in 26 ms.
[2024-06-02 21:52:14] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-06-02 21:52:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2024-06-02 21:52:14] [INFO ] Added : 16 causal constraints over 7 iterations in 238 ms. Result :sat
Minimization took 116 ms.
[2024-06-02 21:52:14] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 21:52:14] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-06-02 21:52:14] [INFO ] [Real]Added 40 Read/Feed constraints in 11 ms returned sat
[2024-06-02 21:52:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:52:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 21:52:14] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-02 21:52:14] [INFO ] [Nat]Added 40 Read/Feed constraints in 20 ms returned sat
[2024-06-02 21:52:14] [INFO ] Computed and/alt/rep : 115/463/115 causal constraints (skipped 145 transitions) in 36 ms.
[2024-06-02 21:52:15] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:52:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2024-06-02 21:52:15] [INFO ] Added : 34 causal constraints over 7 iterations in 268 ms. Result :sat
Minimization took 126 ms.
[2024-06-02 21:52:15] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:52:15] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-02 21:52:15] [INFO ] [Real]Added 40 Read/Feed constraints in 6 ms returned sat
[2024-06-02 21:52:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:52:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 21:52:15] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-02 21:52:15] [INFO ] [Nat]Added 40 Read/Feed constraints in 22 ms returned sat
[2024-06-02 21:52:15] [INFO ] Computed and/alt/rep : 115/463/115 causal constraints (skipped 145 transitions) in 25 ms.
[2024-06-02 21:52:15] [INFO ] Added : 5 causal constraints over 3 iterations in 78 ms. Result :sat
Minimization took 119 ms.
[2024-06-02 21:52:15] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:52:15] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-06-02 21:52:15] [INFO ] [Real]Added 40 Read/Feed constraints in 9 ms returned sat
[2024-06-02 21:52:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:52:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 21:52:15] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-02 21:52:15] [INFO ] [Nat]Added 40 Read/Feed constraints in 12 ms returned sat
[2024-06-02 21:52:16] [INFO ] Computed and/alt/rep : 115/463/115 causal constraints (skipped 145 transitions) in 25 ms.
[2024-06-02 21:52:16] [INFO ] Added : 38 causal constraints over 9 iterations in 174 ms. Result :sat
Minimization took 124 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 293/293 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 107 transition count 289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 106 transition count 289
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 106 transition count 288
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 7 place count 105 transition count 288
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 10 place count 102 transition count 280
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 102 transition count 280
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 100 transition count 276
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 100 transition count 276
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 97 transition count 283
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 29 place count 97 transition count 277
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 38 place count 97 transition count 268
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 97 transition count 270
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 42 place count 96 transition count 268
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 44 place count 96 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 45 place count 95 transition count 265
Applied a total of 45 rules in 101 ms. Remains 95 /107 variables (removed 12) and now considering 265/293 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 95/107 places, 265/293 transitions.
[2024-06-02 21:52:16] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
// Phase 1: matrix 236 rows 95 cols
[2024-06-02 21:52:16] [INFO ] Computed 8 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (64204 resets) in 1201 ms. (831 steps per ms)
FORMULA FireWire-PT-01-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-01-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-01-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000004 steps (64603 resets) in 1541 ms. (2594 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 21:52:19] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
[2024-06-02 21:52:19] [INFO ] Invariant cache hit.
[2024-06-02 21:52:19] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:52:19] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-06-02 21:52:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 21:52:19] [INFO ] [Real]Added 38 Read/Feed constraints in 4 ms returned sat
[2024-06-02 21:52:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:52:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:52:19] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-02 21:52:19] [INFO ] [Nat]Added 38 Read/Feed constraints in 8 ms returned sat
[2024-06-02 21:52:19] [INFO ] Computed and/alt/rep : 105/418/105 causal constraints (skipped 129 transitions) in 19 ms.
[2024-06-02 21:52:19] [INFO ] Added : 4 causal constraints over 2 iterations in 60 ms. Result :sat
Minimization took 57 ms.
[2024-06-02 21:52:19] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:52:19] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-06-02 21:52:19] [INFO ] [Real]Added 38 Read/Feed constraints in 8 ms returned sat
[2024-06-02 21:52:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:52:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 21:52:19] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-06-02 21:52:19] [INFO ] [Nat]Added 38 Read/Feed constraints in 6 ms returned sat
[2024-06-02 21:52:19] [INFO ] Computed and/alt/rep : 105/418/105 causal constraints (skipped 129 transitions) in 22 ms.
[2024-06-02 21:52:19] [INFO ] Added : 3 causal constraints over 2 iterations in 60 ms. Result :sat
Minimization took 63 ms.
[2024-06-02 21:52:20] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:52:20] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-06-02 21:52:20] [INFO ] [Real]Added 38 Read/Feed constraints in 5 ms returned sat
[2024-06-02 21:52:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:52:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:52:20] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-02 21:52:20] [INFO ] [Nat]Added 38 Read/Feed constraints in 13 ms returned sat
[2024-06-02 21:52:20] [INFO ] Computed and/alt/rep : 105/418/105 causal constraints (skipped 129 transitions) in 19 ms.
[2024-06-02 21:52:20] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:52:20] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:52:20] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-02 21:52:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 197 ms
[2024-06-02 21:52:20] [INFO ] Added : 50 causal constraints over 13 iterations in 389 ms. Result :sat
Minimization took 80 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 265/265 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 95 transition count 266
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 94 transition count 265
Applied a total of 3 rules in 17 ms. Remains 94 /95 variables (removed 1) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 94/95 places, 265/265 transitions.
[2024-06-02 21:52:20] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
// Phase 1: matrix 236 rows 94 cols
[2024-06-02 21:52:20] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (63360 resets) in 1051 ms. (950 steps per ms)
FORMULA FireWire-PT-01-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000001 steps (32056 resets) in 787 ms. (2538 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-02 21:52:22] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
[2024-06-02 21:52:22] [INFO ] Invariant cache hit.
[2024-06-02 21:52:22] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:52:22] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-06-02 21:52:22] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 21:52:22] [INFO ] [Real]Added 38 Read/Feed constraints in 4 ms returned sat
[2024-06-02 21:52:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:52:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-02 21:52:22] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-02 21:52:22] [INFO ] [Nat]Added 38 Read/Feed constraints in 6 ms returned sat
[2024-06-02 21:52:22] [INFO ] Computed and/alt/rep : 105/420/105 causal constraints (skipped 129 transitions) in 16 ms.
[2024-06-02 21:52:22] [INFO ] Added : 40 causal constraints over 8 iterations in 126 ms. Result :sat
Minimization took 72 ms.
[2024-06-02 21:52:22] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:52:22] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-06-02 21:52:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:52:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:52:23] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-02 21:52:23] [INFO ] [Nat]Added 38 Read/Feed constraints in 23 ms returned sat
[2024-06-02 21:52:23] [INFO ] Computed and/alt/rep : 105/420/105 causal constraints (skipped 129 transitions) in 15 ms.
[2024-06-02 21:52:23] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-02 21:52:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-06-02 21:52:23] [INFO ] Added : 39 causal constraints over 10 iterations in 206 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 265/265 transitions.
Applied a total of 0 rules in 7 ms. Remains 94 /94 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 94/94 places, 265/265 transitions.
[2024-06-02 21:52:23] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
[2024-06-02 21:52:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (64133 resets) in 1036 ms. (964 steps per ms)
BEST_FIRST walk for 2000001 steps (32147 resets) in 762 ms. (2621 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-02 21:52:25] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
[2024-06-02 21:52:25] [INFO ] Invariant cache hit.
[2024-06-02 21:52:25] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:52:25] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-06-02 21:52:25] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 21:52:25] [INFO ] [Real]Added 38 Read/Feed constraints in 5 ms returned sat
[2024-06-02 21:52:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:52:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:52:25] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-06-02 21:52:25] [INFO ] [Nat]Added 38 Read/Feed constraints in 8 ms returned sat
[2024-06-02 21:52:25] [INFO ] Computed and/alt/rep : 105/420/105 causal constraints (skipped 129 transitions) in 31 ms.
[2024-06-02 21:52:25] [INFO ] Added : 40 causal constraints over 8 iterations in 173 ms. Result :sat
Minimization took 73 ms.
[2024-06-02 21:52:25] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:52:25] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-06-02 21:52:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:52:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:52:25] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-06-02 21:52:25] [INFO ] [Nat]Added 38 Read/Feed constraints in 8 ms returned sat
[2024-06-02 21:52:25] [INFO ] Computed and/alt/rep : 105/420/105 causal constraints (skipped 129 transitions) in 11 ms.
[2024-06-02 21:52:25] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-06-02 21:52:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-06-02 21:52:25] [INFO ] Added : 39 causal constraints over 10 iterations in 184 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 265/265 transitions.
Applied a total of 0 rules in 7 ms. Remains 94 /94 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 94/94 places, 265/265 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 265/265 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 265/265 (removed 0) transitions.
[2024-06-02 21:52:26] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
[2024-06-02 21:52:26] [INFO ] Invariant cache hit.
[2024-06-02 21:52:26] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 21:52:26] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
[2024-06-02 21:52:26] [INFO ] Invariant cache hit.
[2024-06-02 21:52:26] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 21:52:26] [INFO ] Implicit Places using invariants and state equation in 126 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 194 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 93/94 places, 265/265 transitions.
Applied a total of 0 rules in 6 ms. Remains 93 /93 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 210 ms. Remains : 93/94 places, 265/265 transitions.
[2024-06-02 21:52:26] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
// Phase 1: matrix 236 rows 93 cols
[2024-06-02 21:52:26] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (64235 resets) in 1094 ms. (913 steps per ms)
BEST_FIRST walk for 2000001 steps (32437 resets) in 808 ms. (2472 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-02 21:52:28] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
[2024-06-02 21:52:28] [INFO ] Invariant cache hit.
[2024-06-02 21:52:28] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:52:28] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-02 21:52:28] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 21:52:28] [INFO ] [Real]Added 38 Read/Feed constraints in 7 ms returned sat
[2024-06-02 21:52:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:52:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:52:28] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-06-02 21:52:28] [INFO ] [Nat]Added 38 Read/Feed constraints in 13 ms returned sat
[2024-06-02 21:52:28] [INFO ] Computed and/alt/rep : 105/420/105 causal constraints (skipped 129 transitions) in 17 ms.
[2024-06-02 21:52:28] [INFO ] Added : 36 causal constraints over 8 iterations in 118 ms. Result :sat
Minimization took 67 ms.
[2024-06-02 21:52:28] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:52:28] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-02 21:52:28] [INFO ] [Real]Added 38 Read/Feed constraints in 7 ms returned sat
[2024-06-02 21:52:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:52:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:52:28] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-06-02 21:52:28] [INFO ] [Nat]Added 38 Read/Feed constraints in 13 ms returned sat
[2024-06-02 21:52:28] [INFO ] Computed and/alt/rep : 105/420/105 causal constraints (skipped 129 transitions) in 13 ms.
[2024-06-02 21:52:28] [INFO ] Added : 33 causal constraints over 7 iterations in 109 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 265/265 transitions.
Applied a total of 0 rules in 6 ms. Remains 93 /93 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 93/93 places, 265/265 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 265/265 transitions.
Applied a total of 0 rules in 12 ms. Remains 93 /93 variables (removed 0) and now considering 265/265 (removed 0) transitions.
[2024-06-02 21:52:29] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
[2024-06-02 21:52:29] [INFO ] Invariant cache hit.
[2024-06-02 21:52:29] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 21:52:29] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
[2024-06-02 21:52:29] [INFO ] Invariant cache hit.
[2024-06-02 21:52:29] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 21:52:29] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2024-06-02 21:52:29] [INFO ] Redundant transitions in 19 ms returned []
Running 263 sub problems to find dead transitions.
[2024-06-02 21:52:29] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
[2024-06-02 21:52:29] [INFO ] Invariant cache hit.
[2024-06-02 21:52:29] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-02 21:52:30] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-06-02 21:52:30] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:52:30] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:52:30] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-06-02 21:52:30] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-06-02 21:52:30] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-06-02 21:52:31] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-02 21:52:31] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:52:31] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 236/328 variables, 92/108 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 38/146 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 1/329 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (OVERLAPS) 0/329 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 147 constraints, problems are : Problem set: 0 solved, 263 unsolved in 10148 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 236/328 variables, 92/108 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 38/146 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 263/409 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 1/329 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (OVERLAPS) 0/329 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 410 constraints, problems are : Problem set: 0 solved, 263 unsolved in 14388 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 9/9 constraints]
After SMT, in 24785ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 24798ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25081 ms. Remains : 93/93 places, 265/265 transitions.
RANDOM walk for 40000 steps (2613 resets) in 1021 ms. (39 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (682 resets) in 186 ms. (213 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (665 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (659 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (654 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 12217 steps, run visited all 4 properties in 82 ms. (steps per millisecond=148 )
Probabilistic random walk after 12217 steps, saw 5056 distinct states, run finished after 86 ms. (steps per millisecond=142 ) properties seen :4
FORMULA FireWire-PT-01-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-01-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 42452 ms.
ITS solved all properties within timeout
BK_STOP 1717365174827
--------------------
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="FireWire-PT-01"
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 FireWire-PT-01, 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 r549-tall-171734898000173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-01.tgz
mv FireWire-PT-01 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 ;