About the Execution of GreatSPN+red for FireWire-PT-07
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 588.695 | 51827.00 | 87714.00 | 208.80 | TTTFTFTFTFTFTFTT | 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-171734898100222.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-07, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898100222
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 8.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K 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 97K 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 booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-07-ReachabilityCardinality-2024-00
FORMULA_NAME FireWire-PT-07-ReachabilityCardinality-2024-01
FORMULA_NAME FireWire-PT-07-ReachabilityCardinality-2024-02
FORMULA_NAME FireWire-PT-07-ReachabilityCardinality-2024-03
FORMULA_NAME FireWire-PT-07-ReachabilityCardinality-2024-04
FORMULA_NAME FireWire-PT-07-ReachabilityCardinality-2024-05
FORMULA_NAME FireWire-PT-07-ReachabilityCardinality-2024-06
FORMULA_NAME FireWire-PT-07-ReachabilityCardinality-2024-07
FORMULA_NAME FireWire-PT-07-ReachabilityCardinality-2024-08
FORMULA_NAME FireWire-PT-07-ReachabilityCardinality-2024-09
FORMULA_NAME FireWire-PT-07-ReachabilityCardinality-2024-10
FORMULA_NAME FireWire-PT-07-ReachabilityCardinality-2024-11
FORMULA_NAME FireWire-PT-07-ReachabilityCardinality-2024-12
FORMULA_NAME FireWire-PT-07-ReachabilityCardinality-2024-13
FORMULA_NAME FireWire-PT-07-ReachabilityCardinality-2024-14
FORMULA_NAME FireWire-PT-07-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717366369110
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:12:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 22:12:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:12:50] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-06-02 22:12:50] [INFO ] Transformed 126 places.
[2024-06-02 22:12:50] [INFO ] Transformed 396 transitions.
[2024-06-02 22:12:50] [INFO ] Found NUPN structural information;
[2024-06-02 22:12:50] [INFO ] Parsed PT model containing 126 places and 396 transitions and 1471 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
FORMULA FireWire-PT-07-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (2150 resets) in 1787 ms. (22 steps per ms) remains 7/8 properties
FORMULA FireWire-PT-07-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (561 resets) in 143 ms. (277 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (689 resets) in 308 ms. (129 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (570 resets) in 635 ms. (62 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (544 resets) in 157 ms. (253 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (507 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (573 resets) in 164 ms. (242 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (536 resets) in 53 ms. (740 steps per ms) remains 7/7 properties
[2024-06-02 22:12:51] [INFO ] Flow matrix only has 311 transitions (discarded 32 similar events)
// Phase 1: matrix 311 rows 126 cols
[2024-06-02 22:12:51] [INFO ] Computed 8 invariants in 18 ms
[2024-06-02 22:12:51] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 57/125 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 57/133 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 310/435 variables, 125/258 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 44/302 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1/436 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 1/437 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/437 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 305 constraints, problems are : Problem set: 0 solved, 7 unsolved in 836 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 57/125 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 57/133 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 22:12:52] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 10 ms to minimize.
[2024-06-02 22:12:52] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:12:52] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 310/435 variables, 125/261 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 44/305 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 4/309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/436 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 22:12:53] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/436 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/436 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 1/437 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/437 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/437 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 316 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1781 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints]
After SMT, in 2751ms problems are : Problem set: 0 solved, 7 unsolved
FORMULA FireWire-PT-07-ReachabilityCardinality-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA FireWire-PT-07-ReachabilityCardinality-2024-07 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 3533 ms.
Support contains 66 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 343/343 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 3 place count 126 transition count 340
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 125 transition count 339
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 124 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 124 transition count 339
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 16 place count 124 transition count 332
Applied a total of 16 rules in 73 ms. Remains 124 /126 variables (removed 2) and now considering 332/343 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 124/126 places, 332/343 transitions.
RANDOM walk for 40000 steps (2208 resets) in 363 ms. (109 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (493 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (649 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (529 resets) in 145 ms. (273 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (562 resets) in 73 ms. (540 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (575 resets) in 150 ms. (264 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 1003791 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :2 out of 5
Probabilistic random walk after 1003791 steps, saw 211559 distinct states, run finished after 3018 ms. (steps per millisecond=332 ) properties seen :2
FORMULA FireWire-PT-07-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-07-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 22:13:01] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 124 cols
[2024-06-02 22:13:01] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:13:01] [INFO ] State equation strengthened by 46 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 90/122 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 90/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 308/430 variables, 122/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 46/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/432 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/432 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/432 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 302 constraints, problems are : Problem set: 0 solved, 3 unsolved in 285 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 90/122 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 90/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:13:01] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:13:01] [INFO ] Deduced a trap composed of 44 places in 28 ms of which 0 ms to minimize.
[2024-06-02 22:13:01] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 308/430 variables, 122/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 46/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/432 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/432 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/432 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:13:02] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/432 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/432 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/432 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 309 constraints, problems are : Problem set: 0 solved, 3 unsolved in 658 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 972ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 196 ms.
Support contains 32 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 332/332 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 123 transition count 330
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 123 transition count 330
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 123 transition count 329
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 122 transition count 331
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 122 transition count 329
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 8 place count 122 transition count 328
Applied a total of 8 rules in 36 ms. Remains 122 /124 variables (removed 2) and now considering 328/332 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 122/124 places, 328/332 transitions.
RANDOM walk for 40000 steps (2288 resets) in 141 ms. (281 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (606 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (534 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (578 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 865996 steps, run timeout after 3001 ms. (steps per millisecond=288 ) properties seen :0 out of 3
Probabilistic random walk after 865996 steps, saw 184752 distinct states, run finished after 3001 ms. (steps per millisecond=288 ) properties seen :0
[2024-06-02 22:13:05] [INFO ] Flow matrix only has 302 transitions (discarded 26 similar events)
// Phase 1: matrix 302 rows 122 cols
[2024-06-02 22:13:05] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:13:05] [INFO ] State equation strengthened by 46 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 88/120 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 302/422 variables, 120/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 46/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/424 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/424 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 176 constraints, problems are : Problem set: 0 solved, 3 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 88/120 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:13:06] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:13:06] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
[2024-06-02 22:13:06] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 302/422 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 46/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/424 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:13:06] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/424 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 183 constraints, problems are : Problem set: 0 solved, 3 unsolved in 605 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 804ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1284 ms.
Support contains 32 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 328/328 transitions.
Applied a total of 0 rules in 19 ms. Remains 122 /122 variables (removed 0) and now considering 328/328 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 122/122 places, 328/328 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 328/328 transitions.
Applied a total of 0 rules in 8 ms. Remains 122 /122 variables (removed 0) and now considering 328/328 (removed 0) transitions.
[2024-06-02 22:13:07] [INFO ] Flow matrix only has 302 transitions (discarded 26 similar events)
[2024-06-02 22:13:07] [INFO ] Invariant cache hit.
[2024-06-02 22:13:07] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 22:13:07] [INFO ] Flow matrix only has 302 transitions (discarded 26 similar events)
[2024-06-02 22:13:07] [INFO ] Invariant cache hit.
[2024-06-02 22:13:08] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-02 22:13:08] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-06-02 22:13:08] [INFO ] Redundant transitions in 19 ms returned []
Running 327 sub problems to find dead transitions.
[2024-06-02 22:13:08] [INFO ] Flow matrix only has 302 transitions (discarded 26 similar events)
[2024-06-02 22:13:08] [INFO ] Invariant cache hit.
[2024-06-02 22:13:08] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 327 unsolved
[2024-06-02 22:13:09] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-06-02 22:13:09] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-02 22:13:10] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 1 ms to minimize.
[2024-06-02 22:13:10] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:13:10] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:13:10] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2024-06-02 22:13:10] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:13:10] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:13:11] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (OVERLAPS) 302/424 variables, 122/139 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 46/185 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 7 (OVERLAPS) 0/424 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 185 constraints, problems are : Problem set: 0 solved, 327 unsolved in 8594 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (OVERLAPS) 302/424 variables, 122/139 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 46/185 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 327/512 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 8 (OVERLAPS) 0/424 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 512 constraints, problems are : Problem set: 0 solved, 327 unsolved in 16534 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 9/9 constraints]
After SMT, in 25385ms problems are : Problem set: 0 solved, 327 unsolved
Search for dead transitions found 0 dead transitions in 25390ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25672 ms. Remains : 122/122 places, 328/328 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 67 edges and 122 vertex of which 13 / 122 are part of one of the 5 SCC in 2 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 38 transitions
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 73 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 113 transition count 254
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 0 with 32 rules applied. Total rules applied 35 place count 113 transition count 222
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 36 place count 113 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 112 transition count 221
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 37 place count 112 transition count 220
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 39 place count 111 transition count 220
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 109 transition count 218
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 44 place count 109 transition count 217
Free-agglomeration rule applied 3 times with reduction of 1 identical transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 47 place count 109 transition count 213
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 51 place count 106 transition count 212
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 106 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 53 place count 105 transition count 213
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 57 place count 105 transition count 213
Applied a total of 57 rules in 71 ms. Remains 105 /122 variables (removed 17) and now considering 213/328 (removed 115) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 213 rows 105 cols
[2024-06-02 22:13:33] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:13:33] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:13:33] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 22:13:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 22:13:33] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-02 22:13:33] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-02 22:13:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
TRAPS : Iteration 1
[2024-06-02 22:13:33] [INFO ] After 270ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-02 22:13:34] [INFO ] After 360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 500 ms.
[2024-06-02 22:13:34] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-06-02 22:13:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 122 places, 328 transitions and 1225 arcs took 4 ms.
[2024-06-02 22:13:34] [INFO ] Flatten gal took : 111 ms
Total runtime 44092 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running FireWire-PT-07
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 122
TRANSITIONS: 328
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]
SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 647
MODEL NAME: /home/mcc/execution/411/model
122 places, 328 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA FireWire-PT-07-ReachabilityCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-07-ReachabilityCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-07-ReachabilityCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717366420937
--------------------
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 ReachabilityCardinality -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-07"
export BK_EXAMINATION="ReachabilityCardinality"
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-07, examination is ReachabilityCardinality"
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-171734898100222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-07.tgz
mv FireWire-PT-07 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;