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-171734898300319.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-19, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898300319
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K 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 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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 221K 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-19-ReachabilityFireability-2024-00
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-01
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-02
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-03
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-04
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-05
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-06
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-07
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-08
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-09
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-10
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-11
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-12
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-13
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-14
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717374845121

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-03 00:34:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-03 00:34:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 00:34:06] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-06-03 00:34:06] [INFO ] Transformed 602 places.
[2024-06-03 00:34:06] [INFO ] Transformed 944 transitions.
[2024-06-03 00:34:06] [INFO ] Found NUPN structural information;
[2024-06-03 00:34:06] [INFO ] Parsed PT model containing 602 places and 944 transitions and 2776 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (25 resets) in 1891 ms. (21 steps per ms) remains 14/16 properties
FORMULA FireWire-PT-19-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-19-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (20 resets) in 393 ms. (101 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (16 resets) in 947 ms. (42 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (14 resets) in 441 ms. (90 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (17 resets) in 269 ms. (148 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (21 resets) in 286 ms. (139 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (23 resets) in 139 ms. (285 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (18 resets) in 128 ms. (310 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (14 resets) in 325 ms. (122 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (26 resets) in 141 ms. (281 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (27 resets) in 131 ms. (303 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (16 resets) in 155 ms. (256 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (10 resets) in 167 ms. (238 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (15 resets) in 172 ms. (231 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (10 resets) in 111 ms. (357 steps per ms) remains 14/14 properties
// Phase 1: matrix 944 rows 602 cols
[2024-06-03 00:34:08] [INFO ] Computed 13 invariants in 18 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 204/204 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem FireWire-PT-19-ReachabilityFireability-2024-03 is UNSAT
FORMULA FireWire-PT-19-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-19-ReachabilityFireability-2024-07 is UNSAT
FORMULA FireWire-PT-19-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-19-ReachabilityFireability-2024-09 is UNSAT
FORMULA FireWire-PT-19-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 398/602 variables, 13/217 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/602 variables, 398/615 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/602 variables, 0/615 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 944/1546 variables, 602/1217 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1546 variables, 0/1217 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/1546 variables, 0/1217 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1546/1546 variables, and 1217 constraints, problems are : Problem set: 3 solved, 11 unsolved in 1727 ms.
Refiners :[Domain max(s): 602/602 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/138 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 464/602 variables, 13/151 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/602 variables, 464/615 constraints. Problems are: Problem set: 3 solved, 11 unsolved
[2024-06-03 00:34:11] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 28 ms to minimize.
[2024-06-03 00:34:11] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 2 ms to minimize.
[2024-06-03 00:34:11] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 9 ms to minimize.
Problem FireWire-PT-19-ReachabilityFireability-2024-01 is UNSAT
FORMULA FireWire-PT-19-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-03 00:34:11] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 3 ms to minimize.
[2024-06-03 00:34:11] [INFO ] Deduced a trap composed of 115 places in 97 ms of which 3 ms to minimize.
[2024-06-03 00:34:11] [INFO ] Deduced a trap composed of 119 places in 135 ms of which 2 ms to minimize.
[2024-06-03 00:34:12] [INFO ] Deduced a trap composed of 109 places in 74 ms of which 2 ms to minimize.
[2024-06-03 00:34:12] [INFO ] Deduced a trap composed of 107 places in 73 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/602 variables, 8/623 constraints. Problems are: Problem set: 4 solved, 10 unsolved
[2024-06-03 00:34:12] [INFO ] Deduced a trap composed of 173 places in 221 ms of which 3 ms to minimize.
[2024-06-03 00:34:12] [INFO ] Deduced a trap composed of 121 places in 205 ms of which 4 ms to minimize.
[2024-06-03 00:34:12] [INFO ] Deduced a trap composed of 103 places in 73 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 3/626 constraints. Problems are: Problem set: 4 solved, 10 unsolved
[2024-06-03 00:34:13] [INFO ] Deduced a trap composed of 110 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 1/627 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/602 variables, 0/627 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 944/1546 variables, 602/1229 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1546 variables, 10/1239 constraints. Problems are: Problem set: 4 solved, 10 unsolved
[2024-06-03 00:34:15] [INFO ] Deduced a trap composed of 103 places in 109 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1546/1546 variables, and 1240 constraints, problems are : Problem set: 4 solved, 10 unsolved in 5016 ms.
Refiners :[Domain max(s): 602/602 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 10/14 constraints, Known Traps: 13/13 constraints]
After SMT, in 7007ms problems are : Problem set: 4 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 120 out of 602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 602/602 places, 944/944 transitions.
Graph (trivial) has 274 edges and 602 vertex of which 5 / 602 are part of one of the 1 SCC in 3 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1600 edges and 598 vertex of which 589 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 589 transition count 857
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 1 with 106 rules applied. Total rules applied 190 place count 509 transition count 831
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 215 place count 484 transition count 831
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 215 place count 484 transition count 814
Deduced a syphon composed of 17 places in 6 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 249 place count 467 transition count 814
Discarding 78 places :
Symmetric choice reduction at 3 with 78 rule applications. Total rules 327 place count 389 transition count 736
Iterating global reduction 3 with 78 rules applied. Total rules applied 405 place count 389 transition count 736
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 406 place count 389 transition count 735
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 406 place count 389 transition count 727
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 422 place count 381 transition count 727
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 430 place count 373 transition count 710
Iterating global reduction 4 with 8 rules applied. Total rules applied 438 place count 373 transition count 710
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 440 place count 373 transition count 708
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 441 place count 372 transition count 708
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 6 with 68 rules applied. Total rules applied 509 place count 338 transition count 674
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 549 place count 318 transition count 732
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 552 place count 318 transition count 729
Free-agglomeration rule applied 21 times.
Iterating global reduction 6 with 21 rules applied. Total rules applied 573 place count 318 transition count 708
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 594 place count 297 transition count 708
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 603 place count 297 transition count 708
Applied a total of 603 rules in 257 ms. Remains 297 /602 variables (removed 305) and now considering 708/944 (removed 236) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 267 ms. Remains : 297/602 places, 708/944 transitions.
RANDOM walk for 40000 steps (30 resets) in 744 ms. (53 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (19 resets) in 216 ms. (184 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (30 resets) in 189 ms. (210 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (56 resets) in 229 ms. (173 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (28 resets) in 122 ms. (325 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (42 resets) in 161 ms. (246 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (108 resets) in 58 ms. (678 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (11 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (33 resets) in 132 ms. (300 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (20 resets) in 118 ms. (336 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (19 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 505599 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :5 out of 10
Probabilistic random walk after 505599 steps, saw 132274 distinct states, run finished after 3005 ms. (steps per millisecond=168 ) properties seen :5
FORMULA FireWire-PT-19-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-19-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-19-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-19-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-19-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-03 00:34:19] [INFO ] Flow matrix only has 703 transitions (discarded 5 similar events)
// Phase 1: matrix 703 rows 297 cols
[2024-06-03 00:34:19] [INFO ] Computed 10 invariants in 3 ms
[2024-06-03 00:34:19] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 169/284 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 703/987 variables, 284/294 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/987 variables, 10/304 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/987 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 13/1000 variables, 13/317 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1000 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 317 constraints, problems are : Problem set: 0 solved, 5 unsolved in 587 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 297/297 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 169/284 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 00:34:20] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 3 ms to minimize.
[2024-06-03 00:34:20] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 703/987 variables, 284/296 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/987 variables, 10/306 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/987 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 13/1000 variables, 13/319 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 5/324 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1000 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1000 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 324 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2040 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 297/297 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 2728ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA FireWire-PT-19-ReachabilityFireability-2024-05 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 3255 ms.
Support contains 99 out of 297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 297/297 places, 708/708 transitions.
Graph (trivial) has 30 edges and 297 vertex of which 2 / 297 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 296 transition count 701
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 291 transition count 700
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 290 transition count 700
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 13 place count 290 transition count 697
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 19 place count 287 transition count 697
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 21 place count 285 transition count 695
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 285 transition count 695
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 31 place count 281 transition count 691
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 35 place count 279 transition count 705
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 279 transition count 703
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 41 place count 277 transition count 701
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 43 place count 277 transition count 701
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 277 transition count 701
Applied a total of 44 rules in 92 ms. Remains 277 /297 variables (removed 20) and now considering 701/708 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 277/297 places, 701/708 transitions.
RANDOM walk for 40000 steps (800 resets) in 187 ms. (212 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (123 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (147 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (141 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (125 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 490108 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :0 out of 4
Probabilistic random walk after 490108 steps, saw 135428 distinct states, run finished after 3002 ms. (steps per millisecond=163 ) properties seen :0
[2024-06-03 00:34:29] [INFO ] Flow matrix only has 696 transitions (discarded 5 similar events)
// Phase 1: matrix 696 rows 277 cols
[2024-06-03 00:34:29] [INFO ] Computed 10 invariants in 3 ms
[2024-06-03 00:34:29] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 167/266 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 696/962 variables, 266/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/962 variables, 10/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/962 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 11/973 variables, 11/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/973 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/973 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 973/973 variables, and 297 constraints, problems are : Problem set: 0 solved, 4 unsolved in 559 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 277/277 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 167/266 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 00:34:30] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 696/962 variables, 266/277 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/962 variables, 10/287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/962 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 11/973 variables, 11/298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/973 variables, 4/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/973 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/973 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 973/973 variables, and 302 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2076 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 277/277 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 2699ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 7198 ms.
Support contains 99 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 701/701 transitions.
Applied a total of 0 rules in 12 ms. Remains 277 /277 variables (removed 0) and now considering 701/701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 277/277 places, 701/701 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 701/701 transitions.
Applied a total of 0 rules in 11 ms. Remains 277 /277 variables (removed 0) and now considering 701/701 (removed 0) transitions.
[2024-06-03 00:34:39] [INFO ] Flow matrix only has 696 transitions (discarded 5 similar events)
[2024-06-03 00:34:39] [INFO ] Invariant cache hit.
[2024-06-03 00:34:39] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-03 00:34:39] [INFO ] Flow matrix only has 696 transitions (discarded 5 similar events)
[2024-06-03 00:34:39] [INFO ] Invariant cache hit.
[2024-06-03 00:34:39] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-03 00:34:39] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2024-06-03 00:34:39] [INFO ] Redundant transitions in 38 ms returned []
Running 699 sub problems to find dead transitions.
[2024-06-03 00:34:39] [INFO ] Flow matrix only has 696 transitions (discarded 5 similar events)
[2024-06-03 00:34:39] [INFO ] Invariant cache hit.
[2024-06-03 00:34:39] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 699 unsolved
[2024-06-03 00:34:46] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:34:46] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 1 ms to minimize.
[2024-06-03 00:34:46] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:34:46] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:34:47] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 0 ms to minimize.
[2024-06-03 00:34:47] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 2 ms to minimize.
[2024-06-03 00:34:49] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:34:49] [INFO ] Deduced a trap composed of 83 places in 137 ms of which 2 ms to minimize.
[2024-06-03 00:34:49] [INFO ] Deduced a trap composed of 54 places in 139 ms of which 2 ms to minimize.
[2024-06-03 00:34:50] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 2 ms to minimize.
[2024-06-03 00:34:52] [INFO ] Deduced a trap composed of 178 places in 129 ms of which 2 ms to minimize.
[2024-06-03 00:34:52] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 1 ms to minimize.
[2024-06-03 00:34:52] [INFO ] Deduced a trap composed of 96 places in 150 ms of which 2 ms to minimize.
[2024-06-03 00:34:52] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 2 ms to minimize.
[2024-06-03 00:34:53] [INFO ] Deduced a trap composed of 66 places in 150 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 699 unsolved
[2024-06-03 00:34:53] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:34:53] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 1 ms to minimize.
[2024-06-03 00:34:56] [INFO ] Deduced a trap composed of 51 places in 146 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 5 (OVERLAPS) 696/973 variables, 277/305 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/973 variables, 10/315 constraints. Problems are: Problem set: 0 solved, 699 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 973/973 variables, and 315 constraints, problems are : Problem set: 0 solved, 699 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 277/277 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 699/699 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 699 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 4 (OVERLAPS) 696/973 variables, 277/305 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/973 variables, 10/315 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/973 variables, 699/1014 constraints. Problems are: Problem set: 0 solved, 699 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 973/973 variables, and 1014 constraints, problems are : Problem set: 0 solved, 699 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 277/277 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 699/699 constraints, Known Traps: 18/18 constraints]
After SMT, in 60527ms problems are : Problem set: 0 solved, 699 unsolved
Search for dead transitions found 0 dead transitions in 60535ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61004 ms. Remains : 277/277 places, 701/701 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 1224 edges and 277 vertex of which 276 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 276 transition count 696
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 12 place count 276 transition count 690
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 276 transition count 690
Applied a total of 14 rules in 37 ms. Remains 276 /277 variables (removed 1) and now considering 690/701 (removed 11) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 690 rows 276 cols
[2024-06-03 00:35:40] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:35:40] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-03 00:35:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-03 00:35:40] [INFO ] After 552ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-03 00:35:41] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2024-06-03 00:35:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
TRAPS : Iteration 1
[2024-06-03 00:35:42] [INFO ] After 1607ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-03 00:35:42] [INFO ] After 2127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 2276 ms.
[2024-06-03 00:35:42] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-06-03 00:35:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 277 places, 701 transitions and 2490 arcs took 6 ms.
[2024-06-03 00:35:42] [INFO ] Flatten gal took : 83 ms
Total runtime 96456 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-19

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 277
TRANSITIONS: 701
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.014s, Sys 0.000s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.002s, 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: 698
MODEL NAME: /home/mcc/execution/410/model
277 places, 701 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-19-ReachabilityFireability-2024-00 CANNOT_COMPUTE
FORMULA FireWire-PT-19-ReachabilityFireability-2024-11 CANNOT_COMPUTE
FORMULA FireWire-PT-19-ReachabilityFireability-2024-12 CANNOT_COMPUTE
FORMULA FireWire-PT-19-ReachabilityFireability-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717375588968

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-19"
export BK_EXAMINATION="ReachabilityFireability"
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-19, examination is ReachabilityFireability"
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-171734898300319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-19.tgz
mv FireWire-PT-19 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;