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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K 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 168K 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-18-ReachabilityFireability-2024-00
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-01
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-02
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-03
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-04
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-05
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-06
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-07
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-08
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-09
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-10
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-11
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-12
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-13
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-14
FORMULA_NAME FireWire-PT-18-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717373538958

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-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-03 00:12:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-03 00:12:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 00:12:20] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-06-03 00:12:20] [INFO ] Transformed 437 places.
[2024-06-03 00:12:20] [INFO ] Transformed 707 transitions.
[2024-06-03 00:12:20] [INFO ] Found NUPN structural information;
[2024-06-03 00:12:20] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (18 resets) in 1657 ms. (24 steps per ms) remains 13/16 properties
FORMULA FireWire-PT-18-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-18-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-18-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (26 resets) in 374 ms. (106 steps per ms) remains 11/13 properties
FORMULA FireWire-PT-18-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (13 resets) in 461 ms. (86 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (11 resets) in 367 ms. (108 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (23 resets) in 244 ms. (163 steps per ms) remains 10/11 properties
FORMULA FireWire-PT-18-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (15 resets) in 280 ms. (142 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (19 resets) in 131 ms. (303 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 446 ms. (89 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (17 resets) in 131 ms. (303 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (25 resets) in 108 ms. (366 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (21 resets) in 251 ms. (158 steps per ms) remains 10/10 properties
// Phase 1: matrix 707 rows 437 cols
[2024-06-03 00:12:22] [INFO ] Computed 9 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 359/437 variables, 9/87 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 359/446 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 707/1144 variables, 437/883 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1144 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/1144 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1144/1144 variables, and 883 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1171 ms.
Refiners :[Domain max(s): 437/437 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem FireWire-PT-18-ReachabilityFireability-2024-01 is UNSAT
FORMULA FireWire-PT-18-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 359/437 variables, 9/87 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 359/446 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-03 00:12:23] [INFO ] Deduced a trap composed of 98 places in 232 ms of which 35 ms to minimize.
[2024-06-03 00:12:24] [INFO ] Deduced a trap composed of 114 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 2/448 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/448 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 707/1144 variables, 437/885 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1144 variables, 9/894 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1144 variables, 0/894 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-03 00:12:26] [INFO ] Deduced a trap composed of 81 places in 175 ms of which 7 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/1144 variables, 1/895 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-03 00:12:26] [INFO ] Deduced a trap composed of 128 places in 88 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1144 variables, 1/896 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1144 variables, 0/896 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/1144 variables, 0/896 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 896 constraints, problems are : Problem set: 1 solved, 9 unsolved in 5014 ms.
Refiners :[Domain max(s): 437/437 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 9/10 constraints, Known Traps: 4/4 constraints]
After SMT, in 6377ms problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 75 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 707/707 transitions.
Graph (trivial) has 194 edges and 437 vertex of which 3 / 437 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1279 edges and 435 vertex of which 425 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 425 transition count 659
Reduce places removed 44 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 54 rules applied. Total rules applied 101 place count 381 transition count 649
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 111 place count 371 transition count 649
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 111 place count 371 transition count 636
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 137 place count 358 transition count 636
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 203 place count 292 transition count 570
Iterating global reduction 3 with 66 rules applied. Total rules applied 269 place count 292 transition count 570
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 272 place count 292 transition count 567
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 272 place count 292 transition count 562
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 282 place count 287 transition count 562
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 294 place count 275 transition count 545
Iterating global reduction 4 with 12 rules applied. Total rules applied 306 place count 275 transition count 545
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 309 place count 272 transition count 540
Iterating global reduction 4 with 3 rules applied. Total rules applied 312 place count 272 transition count 540
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 314 place count 272 transition count 538
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 315 place count 271 transition count 538
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 316 place count 270 transition count 535
Iterating global reduction 6 with 1 rules applied. Total rules applied 317 place count 270 transition count 535
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 318 place count 269 transition count 533
Iterating global reduction 6 with 1 rules applied. Total rules applied 319 place count 269 transition count 533
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 371 place count 243 transition count 507
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 403 place count 227 transition count 573
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 409 place count 227 transition count 567
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 415 place count 227 transition count 561
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 421 place count 221 transition count 561
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 423 place count 221 transition count 559
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 430 place count 221 transition count 559
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 431 place count 221 transition count 559
Applied a total of 431 rules in 248 ms. Remains 221 /437 variables (removed 216) and now considering 559/707 (removed 148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 257 ms. Remains : 221/437 places, 559/707 transitions.
RANDOM walk for 40000 steps (35 resets) in 309 ms. (129 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (11 resets) in 280 ms. (142 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (16 resets) in 271 ms. (147 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (59 resets) in 228 ms. (174 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (11 resets) in 251 ms. (158 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (17 resets) in 228 ms. (174 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (26 resets) in 159 ms. (250 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (18 resets) in 136 ms. (291 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (20 resets) in 118 ms. (336 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (13 resets) in 109 ms. (363 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 468680 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :2 out of 9
Probabilistic random walk after 468680 steps, saw 129451 distinct states, run finished after 3004 ms. (steps per millisecond=156 ) properties seen :2
FORMULA FireWire-PT-18-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-18-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 559 rows 221 cols
[2024-06-03 00:12:32] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 00:12:32] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 142/212 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 559/771 variables, 212/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/771 variables, 8/227 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/771 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 9/780 variables, 9/236 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/780 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/780 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 780/780 variables, and 236 constraints, problems are : Problem set: 0 solved, 7 unsolved in 588 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 221/221 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 142/212 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-03 00:12:33] [INFO ] Deduced a trap composed of 61 places in 174 ms of which 2 ms to minimize.
[2024-06-03 00:12:33] [INFO ] Deduced a trap composed of 127 places in 95 ms of which 2 ms to minimize.
[2024-06-03 00:12:33] [INFO ] Deduced a trap composed of 125 places in 97 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 559/771 variables, 212/222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/771 variables, 8/230 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/771 variables, 6/236 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 9/780 variables, 9/245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/780 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/780 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/780 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 780/780 variables, and 246 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2125 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 221/221 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 3/3 constraints]
After SMT, in 2774ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 2788 ms.
Support contains 70 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 559/559 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 221 transition count 558
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 220 transition count 558
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 219 transition count 557
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 219 transition count 553
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 215 transition count 553
Applied a total of 12 rules in 40 ms. Remains 215 /221 variables (removed 6) and now considering 553/559 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 215/221 places, 553/559 transitions.
RANDOM walk for 40000 steps (13 resets) in 164 ms. (242 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (17 resets) in 221 ms. (180 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (14 resets) in 235 ms. (169 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (17 resets) in 206 ms. (193 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (16 resets) in 173 ms. (229 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (27 resets) in 169 ms. (235 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (15 resets) in 115 ms. (344 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (20 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 549819 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 7
Probabilistic random walk after 549819 steps, saw 150776 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
// Phase 1: matrix 553 rows 215 cols
[2024-06-03 00:12:41] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 00:12:41] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 136/206 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 553/759 variables, 206/213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/759 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/759 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 9/768 variables, 9/230 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/768 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 768/768 variables, and 230 constraints, problems are : Problem set: 0 solved, 7 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 215/215 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 136/206 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-03 00:12:42] [INFO ] Deduced a trap composed of 61 places in 43 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 553/759 variables, 206/214 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/759 variables, 8/222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 6/228 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-03 00:12:42] [INFO ] Deduced a trap composed of 118 places in 96 ms of which 2 ms to minimize.
[2024-06-03 00:12:43] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/759 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/759 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 9/768 variables, 9/239 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/768 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-03 00:12:44] [INFO ] Deduced a trap composed of 119 places in 113 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/768 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/768 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/768 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 768/768 variables, and 241 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2646 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 215/215 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints]
After SMT, in 3216ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 23680 ms.
Support contains 70 out of 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 553/553 transitions.
Applied a total of 0 rules in 10 ms. Remains 215 /215 variables (removed 0) and now considering 553/553 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 215/215 places, 553/553 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 553/553 transitions.
Applied a total of 0 rules in 8 ms. Remains 215 /215 variables (removed 0) and now considering 553/553 (removed 0) transitions.
[2024-06-03 00:13:08] [INFO ] Invariant cache hit.
[2024-06-03 00:13:08] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-03 00:13:08] [INFO ] Invariant cache hit.
[2024-06-03 00:13:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-03 00:13:09] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-06-03 00:13:09] [INFO ] Redundant transitions in 35 ms returned []
Running 549 sub problems to find dead transitions.
[2024-06-03 00:13:09] [INFO ] Invariant cache hit.
[2024-06-03 00:13:09] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-06-03 00:13:13] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 2 ms to minimize.
[2024-06-03 00:13:13] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 1 ms to minimize.
[2024-06-03 00:13:13] [INFO ] Deduced a trap composed of 83 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:13:13] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 0 ms to minimize.
[2024-06-03 00:13:13] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 0 ms to minimize.
[2024-06-03 00:13:14] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-06-03 00:13:14] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:13:15] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2024-06-03 00:13:15] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-06-03 00:13:16] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (OVERLAPS) 553/768 variables, 215/232 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/768 variables, 8/240 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-06-03 00:13:23] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/768 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-06-03 00:13:32] [INFO ] Deduced a trap composed of 83 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/768 variables, and 242 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 215/215 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 549 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (OVERLAPS) 553/768 variables, 215/234 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/768 variables, 8/242 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/768 variables, 549/791 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/768 variables, and 791 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 215/215 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 12/12 constraints]
After SMT, in 60443ms problems are : Problem set: 0 solved, 549 unsolved
Search for dead transitions found 0 dead transitions in 60453ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60848 ms. Remains : 215/215 places, 553/553 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 552
Applied a total of 1 rules in 19 ms. Remains 215 /215 variables (removed 0) and now considering 552/553 (removed 1) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 552 rows 215 cols
[2024-06-03 00:14:09] [INFO ] Computed 7 invariants in 2 ms
[2024-06-03 00:14:09] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-03 00:14:09] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-03 00:14:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-03 00:14:10] [INFO ] After 450ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
TRAPS : Iteration 0
[2024-06-03 00:14:10] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-06-03 00:14:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
TRAPS : Iteration 1
[2024-06-03 00:14:10] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 2 ms to minimize.
[2024-06-03 00:14:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2024-06-03 00:14:11] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-06-03 00:14:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
TRAPS : Iteration 2
[2024-06-03 00:14:11] [INFO ] Deduced a trap composed of 125 places in 95 ms of which 4 ms to minimize.
[2024-06-03 00:14:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
TRAPS : Iteration 3
[2024-06-03 00:14:12] [INFO ] After 2382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
[2024-06-03 00:14:12] [INFO ] After 2783ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Over-approximation ignoring read arcs solved 0 properties in 2918 ms.
[2024-06-03 00:14:12] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-06-03 00:14:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 215 places, 553 transitions and 2020 arcs took 5 ms.
[2024-06-03 00:14:12] [INFO ] Flatten gal took : 73 ms
Total runtime 112533 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-18

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/403/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 215
TRANSITIONS: 553
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.010s, Sys 0.004s]


SAVING FILE /home/mcc/execution/403/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 661
MODEL NAME: /home/mcc/execution/403/model
215 places, 553 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-18-ReachabilityFireability-2024-00 CANNOT_COMPUTE
FORMULA FireWire-PT-18-ReachabilityFireability-2024-05 CANNOT_COMPUTE
FORMULA FireWire-PT-18-ReachabilityFireability-2024-07 CANNOT_COMPUTE
FORMULA FireWire-PT-18-ReachabilityFireability-2024-08 CANNOT_COMPUTE
FORMULA FireWire-PT-18-ReachabilityFireability-2024-09 CANNOT_COMPUTE
FORMULA FireWire-PT-18-ReachabilityFireability-2024-12 CANNOT_COMPUTE
FORMULA FireWire-PT-18-ReachabilityFireability-2024-14 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717374871001

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

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
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-18"
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-18, 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-171734898300311"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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