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.r575-smll-171734919500079.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 MedleyA-PT-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919500079
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K 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.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 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.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K 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 107K 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 MedleyA-PT-10-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-10-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717358776227

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 20:06:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 20:06:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:06:19] [INFO ] Load time of PNML (sax parser for PT used): 267 ms
[2024-06-02 20:06:19] [INFO ] Transformed 149 places.
[2024-06-02 20:06:19] [INFO ] Transformed 340 transitions.
[2024-06-02 20:06:19] [INFO ] Found NUPN structural information;
[2024-06-02 20:06:19] [INFO ] Parsed PT model containing 149 places and 340 transitions and 1721 arcs in 475 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 43 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1724 resets) in 3079 ms. (12 steps per ms) remains 13/16 properties
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (433 resets) in 344 ms. (115 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (430 resets) in 735 ms. (54 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (436 resets) in 1696 ms. (23 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (453 resets) in 342 ms. (116 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (395 resets) in 281 ms. (141 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (423 resets) in 232 ms. (171 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (383 resets) in 109 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (401 resets) in 247 ms. (161 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (431 resets) in 289 ms. (137 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (477 resets) in 450 ms. (88 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (334 resets) in 98 ms. (404 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (461 resets) in 89 ms. (444 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (443 resets) in 106 ms. (373 steps per ms) remains 13/13 properties
// Phase 1: matrix 340 rows 149 cols
[2024-06-02 20:06:22] [INFO ] Computed 12 invariants in 42 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 96/96 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem MedleyA-PT-10-ReachabilityFireability-2024-09 is UNSAT
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 33/129 variables, 7/104 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 33/137 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Problem MedleyA-PT-10-ReachabilityFireability-2024-03 is UNSAT
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-10-ReachabilityFireability-2024-04 is UNSAT
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 20/149 variables, 4/141 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 20/161 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/161 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 340/489 variables, 149/310 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 0/310 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/489 variables, 0/310 constraints. Problems are: Problem set: 3 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 489/489 variables, and 310 constraints, problems are : Problem set: 3 solved, 10 unsolved in 1623 ms.
Refiners :[Domain max(s): 149/149 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 1/81 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/81 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Problem MedleyA-PT-10-ReachabilityFireability-2024-07 is UNSAT
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-10-ReachabilityFireability-2024-12 is UNSAT
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 43/123 variables, 7/88 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 43/131 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/131 constraints. Problems are: Problem set: 5 solved, 8 unsolved
Problem MedleyA-PT-10-ReachabilityFireability-2024-13 is UNSAT
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 26/149 variables, 4/135 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 26/161 constraints. Problems are: Problem set: 6 solved, 7 unsolved
[2024-06-02 20:06:25] [INFO ] Deduced a trap composed of 33 places in 254 ms of which 34 ms to minimize.
[2024-06-02 20:06:25] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 2/163 constraints. Problems are: Problem set: 6 solved, 7 unsolved
[2024-06-02 20:06:25] [INFO ] Deduced a trap composed of 47 places in 189 ms of which 3 ms to minimize.
[2024-06-02 20:06:26] [INFO ] Deduced a trap composed of 35 places in 224 ms of which 4 ms to minimize.
[2024-06-02 20:06:26] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 3/166 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/166 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 340/489 variables, 149/315 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/489 variables, 7/322 constraints. Problems are: Problem set: 6 solved, 7 unsolved
[2024-06-02 20:06:28] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 3 ms to minimize.
[2024-06-02 20:06:28] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2024-06-02 20:06:28] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/489 variables, 3/325 constraints. Problems are: Problem set: 6 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 489/489 variables, and 325 constraints, problems are : Problem set: 6 solved, 7 unsolved in 5013 ms.
Refiners :[Domain max(s): 149/149 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 7/13 constraints, Known Traps: 8/8 constraints]
After SMT, in 7621ms problems are : Problem set: 6 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 80 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 340/340 transitions.
Graph (complete) has 543 edges and 149 vertex of which 146 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 146 transition count 336
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 143 transition count 336
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 143 transition count 335
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 142 transition count 335
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 28 place count 124 transition count 317
Iterating global reduction 2 with 18 rules applied. Total rules applied 46 place count 124 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 124 transition count 315
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 123 transition count 314
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 123 transition count 314
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 58 place count 119 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 64 place count 119 transition count 304
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 64 place count 119 transition count 302
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 117 transition count 302
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 71 place count 117 transition count 299
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 74 place count 114 transition count 299
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 77 place count 114 transition count 299
Applied a total of 77 rules in 208 ms. Remains 114 /149 variables (removed 35) and now considering 299/340 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 114/149 places, 299/340 transitions.
RANDOM walk for 40000 steps (1948 resets) in 490 ms. (81 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (423 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (447 resets) in 261 ms. (152 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (331 resets) in 290 ms. (137 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (435 resets) in 177 ms. (224 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (435 resets) in 314 ms. (126 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (489 resets) in 412 ms. (96 steps per ms) remains 6/7 properties
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (438 resets) in 108 ms. (367 steps per ms) remains 6/6 properties
// Phase 1: matrix 299 rows 114 cols
[2024-06-02 20:06:30] [INFO ] Computed 11 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 28/97 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 16/113 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 299/412 variables, 113/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/413 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/413 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 125 constraints, problems are : Problem set: 0 solved, 6 unsolved in 781 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 28/97 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 16/113 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 20:06:32] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 2 ms to minimize.
[2024-06-02 20:06:32] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 299/412 variables, 113/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/413 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 20:06:36] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-06-02 20:06:36] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/413 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 20:06:38] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 2 ms to minimize.
[2024-06-02 20:06:38] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 2 ms to minimize.
[2024-06-02 20:06:38] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 20:06:39] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/413 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 20:06:41] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/413 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/413 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/413 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 140 constraints, problems are : Problem set: 0 solved, 6 unsolved in 11395 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 9/9 constraints]
After SMT, in 12373ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 1151 ms.
Support contains 69 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 299/299 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 114 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 113 transition count 298
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 113 transition count 296
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 6 place count 111 transition count 296
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 13 place count 104 transition count 286
Iterating global reduction 2 with 7 rules applied. Total rules applied 20 place count 104 transition count 286
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 104 transition count 286
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 103 transition count 284
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 103 transition count 284
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 26 place count 103 transition count 283
Applied a total of 26 rules in 37 ms. Remains 103 /114 variables (removed 11) and now considering 283/299 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 103/114 places, 283/299 transitions.
RANDOM walk for 40000 steps (2205 resets) in 316 ms. (126 steps per ms) remains 5/6 properties
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (458 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (479 resets) in 194 ms. (205 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (310 resets) in 241 ms. (165 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (518 resets) in 126 ms. (314 steps per ms) remains 4/5 properties
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (466 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
// Phase 1: matrix 283 rows 103 cols
[2024-06-02 20:06:44] [INFO ] Computed 11 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 30/78 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 23/101 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 283/384 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/386 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/386 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 114 constraints, problems are : Problem set: 0 solved, 4 unsolved in 500 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 103/103 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/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 30/78 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 23/101 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 283/384 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 20:06:45] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 2 ms to minimize.
[2024-06-02 20:06:45] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 2 ms to minimize.
[2024-06-02 20:06:46] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/386 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 20:06:47] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/386 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/386 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/386 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 122 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2574 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 3167ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1601 ms.
Support contains 47 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 283/283 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 103 transition count 280
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 100 transition count 280
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 13 place count 93 transition count 271
Iterating global reduction 0 with 7 rules applied. Total rules applied 20 place count 93 transition count 271
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 93 transition count 270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 92 transition count 270
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 29 place count 92 transition count 270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 91 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 91 transition count 268
Applied a total of 31 rules in 63 ms. Remains 91 /103 variables (removed 12) and now considering 268/283 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 91/103 places, 268/283 transitions.
RANDOM walk for 40000 steps (2340 resets) in 222 ms. (179 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (497 resets) in 228 ms. (174 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (325 resets) in 258 ms. (154 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (480 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 625817 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :0 out of 3
Probabilistic random walk after 625817 steps, saw 124537 distinct states, run finished after 3013 ms. (steps per millisecond=207 ) properties seen :0
// Phase 1: matrix 268 rows 91 cols
[2024-06-02 20:06:52] [INFO ] Computed 11 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 24/71 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 19/90 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 268/358 variables, 90/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/359 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/359 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 102 constraints, problems are : Problem set: 0 solved, 3 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 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/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 24/71 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 19/90 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 268/358 variables, 90/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/359 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 20:06:54] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/359 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/359 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 359/359 variables, and 106 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1429 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1874ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-02 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 985 ms.
Support contains 31 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 268/268 transitions.
Graph (complete) has 435 edges and 91 vertex of which 89 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 83 transition count 256
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 83 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 83 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 82 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 82 transition count 254
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 22 place count 79 transition count 251
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 78 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 78 transition count 250
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 78 transition count 246
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 32 place count 74 transition count 246
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 73 transition count 240
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 73 transition count 240
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 73 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 72 transition count 242
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 72 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 71 transition count 241
Applied a total of 38 rules in 50 ms. Remains 71 /91 variables (removed 20) and now considering 241/268 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 71/91 places, 241/268 transitions.
RANDOM walk for 40000 steps (2825 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (346 resets) in 257 ms. (155 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1226122 steps, run visited all 1 properties in 1971 ms. (steps per millisecond=622 )
Probabilistic random walk after 1226122 steps, saw 240261 distinct states, run finished after 1977 ms. (steps per millisecond=620 ) properties seen :1
FORMULA MedleyA-PT-10-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 39188 ms.
ITS solved all properties within timeout

BK_STOP 1717358817866

--------------------
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

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="MedleyA-PT-10"
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 MedleyA-PT-10, 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 r575-smll-171734919500079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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