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.r333-tall-171679078400439.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 SafeBus-PT-15, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679078400439
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 28K Apr 12 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 202K Apr 12 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 961K Apr 12 15:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.0M Apr 12 15:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 17K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 111K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 339K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 88K Apr 12 16:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 488K Apr 12 16:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 378K Apr 12 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 12 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.5M May 18 16:43 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 SafeBus-PT-15-ReachabilityFireability-2024-00
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-01
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-02
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-03
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-04
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-05
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-06
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-07
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-08
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-09
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-10
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-11
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-12
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-13
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-14
FORMULA_NAME SafeBus-PT-15-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716861303262

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 01:55:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 01:55:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 01:55:04] [INFO ] Load time of PNML (sax parser for PT used): 294 ms
[2024-05-28 01:55:04] [INFO ] Transformed 621 places.
[2024-05-28 01:55:04] [INFO ] Transformed 4771 transitions.
[2024-05-28 01:55:04] [INFO ] Found NUPN structural information;
[2024-05-28 01:55:04] [INFO ] Parsed PT model containing 621 places and 4771 transitions and 34549 arcs in 439 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 68 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 15 places and 0 transitions.
RANDOM walk for 40000 steps (8 resets) in 2627 ms. (15 steps per ms) remains 4/16 properties
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 6707 ms. (5 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1203 ms. (33 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 562 ms. (71 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 352 ms. (113 steps per ms) remains 4/4 properties
[2024-05-28 01:55:08] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 606 cols
[2024-05-28 01:55:08] [INFO ] Computed 65 invariants in 94 ms
[2024-05-28 01:55:08] [INFO ] State equation strengthened by 241 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 606/606 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 32/638 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem SafeBus-PT-15-ReachabilityFireability-2024-08 is UNSAT
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 33/671 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/606 variables, 0/671 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1412/2018 variables, 606/1277 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2018 variables, 241/1518 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2018 variables, 0/1518 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/2018 variables, 0/1518 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2018/2018 variables, and 1518 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2433 ms.
Refiners :[Domain max(s): 606/606 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 606/606 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 606/606 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem SafeBus-PT-15-ReachabilityFireability-2024-02 is UNSAT
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 32/638 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem SafeBus-PT-15-ReachabilityFireability-2024-10 is UNSAT
FORMULA SafeBus-PT-15-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 33/671 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/606 variables, 0/671 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1412/2018 variables, 606/1277 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2018/2018 variables, and 1518 constraints, problems are : Problem set: 3 solved, 1 unsolved in 2079 ms.
Refiners :[Domain max(s): 606/606 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 606/606 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 9397ms problems are : Problem set: 3 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 4771/4771 transitions.
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 606 transition count 4758
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 26 place count 593 transition count 4758
Applied a total of 26 rules in 2535 ms. Remains 593 /606 variables (removed 13) and now considering 4758/4771 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2549 ms. Remains : 593/606 places, 4758/4771 transitions.
RANDOM walk for 40000 steps (8 resets) in 888 ms. (44 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 252 ms. (158 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 118533 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 1
Probabilistic random walk after 118533 steps, saw 73682 distinct states, run finished after 3005 ms. (steps per millisecond=39 ) properties seen :0
[2024-05-28 01:55:23] [INFO ] Flow matrix only has 1399 transitions (discarded 3359 similar events)
// Phase 1: matrix 1399 rows 593 cols
[2024-05-28 01:55:23] [INFO ] Computed 65 invariants in 54 ms
[2024-05-28 01:55:23] [INFO ] State equation strengthened by 241 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 340/368 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/368 variables, 340/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 163/531 variables, 8/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 163/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 3/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/536 variables, 5/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/536 variables, 5/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/536 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 55/591 variables, 30/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/591 variables, 55/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/591 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1398/1989 variables, 591/1246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1989 variables, 240/1486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1989 variables, 0/1486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/1992 variables, 2/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1992 variables, 2/1490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1992 variables, 1/1491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1992 variables, 1/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1992 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1992 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1992/1992 variables, and 1492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 735 ms.
Refiners :[Domain max(s): 593/593 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 593/593 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 340/368 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/368 variables, 340/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 163/531 variables, 8/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 163/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 3/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/536 variables, 5/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/536 variables, 5/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/536 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 55/591 variables, 30/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/591 variables, 55/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 01:55:25] [INFO ] Deduced a trap composed of 101 places in 473 ms of which 28 ms to minimize.
[2024-05-28 01:55:25] [INFO ] Deduced a trap composed of 100 places in 367 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/591 variables, 2/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/591 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1398/1989 variables, 591/1248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1989 variables, 240/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1989 variables, 0/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/1992 variables, 2/1490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1992 variables, 2/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1992 variables, 1/1493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1992 variables, 1/1494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1992 variables, 1/1495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1992 variables, 0/1495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1992 variables, 0/1495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1992/1992 variables, and 1495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4847 ms.
Refiners :[Domain max(s): 593/593 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 593/593 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 5763ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2562 ms.
Support contains 28 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 4758/4758 transitions.
Applied a total of 0 rules in 1079 ms. Remains 593 /593 variables (removed 0) and now considering 4758/4758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1079 ms. Remains : 593/593 places, 4758/4758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 4758/4758 transitions.
Applied a total of 0 rules in 1047 ms. Remains 593 /593 variables (removed 0) and now considering 4758/4758 (removed 0) transitions.
[2024-05-28 01:55:34] [INFO ] Flow matrix only has 1399 transitions (discarded 3359 similar events)
[2024-05-28 01:55:34] [INFO ] Invariant cache hit.
[2024-05-28 01:55:38] [INFO ] Implicit Places using invariants in 4668 ms returned [546, 547, 548, 549, 550, 552, 553, 554, 555, 556, 557, 559, 560]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 4690 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 580/593 places, 4758/4758 transitions.
Applied a total of 0 rules in 1181 ms. Remains 580 /580 variables (removed 0) and now considering 4758/4758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6924 ms. Remains : 580/593 places, 4758/4758 transitions.
RANDOM walk for 40000 steps (8 resets) in 760 ms. (52 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 215 ms. (185 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 136160 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 1
Probabilistic random walk after 136160 steps, saw 84461 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
[2024-05-28 01:55:43] [INFO ] Flow matrix only has 1399 transitions (discarded 3359 similar events)
// Phase 1: matrix 1399 rows 580 cols
[2024-05-28 01:55:43] [INFO ] Computed 52 invariants in 13 ms
[2024-05-28 01:55:43] [INFO ] State equation strengthened by 241 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 314/342 variables, 13/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 314/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 152/494 variables, 32/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 152/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 84/578 variables, 6/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 84/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1398/1976 variables, 578/1207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1976 variables, 240/1447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1976 variables, 0/1447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/1979 variables, 2/1449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1979 variables, 2/1451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1979 variables, 1/1452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1979 variables, 1/1453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1979 variables, 0/1453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1979 variables, 0/1453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1979/1979 variables, and 1453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 870 ms.
Refiners :[Domain max(s): 580/580 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 580/580 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 314/342 variables, 13/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 314/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 152/494 variables, 32/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 152/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 84/578 variables, 6/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 84/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 01:55:45] [INFO ] Deduced a trap composed of 74 places in 519 ms of which 5 ms to minimize.
[2024-05-28 01:55:45] [INFO ] Deduced a trap composed of 74 places in 518 ms of which 4 ms to minimize.
[2024-05-28 01:55:46] [INFO ] Deduced a trap composed of 74 places in 515 ms of which 3 ms to minimize.
[2024-05-28 01:55:46] [INFO ] Deduced a trap composed of 74 places in 512 ms of which 3 ms to minimize.
[2024-05-28 01:55:47] [INFO ] Deduced a trap composed of 74 places in 546 ms of which 3 ms to minimize.
[2024-05-28 01:55:47] [INFO ] Deduced a trap composed of 61 places in 532 ms of which 4 ms to minimize.
[2024-05-28 01:55:48] [INFO ] Deduced a trap composed of 74 places in 531 ms of which 4 ms to minimize.
[2024-05-28 01:55:49] [INFO ] Deduced a trap composed of 74 places in 538 ms of which 3 ms to minimize.
[2024-05-28 01:55:49] [INFO ] Deduced a trap composed of 74 places in 517 ms of which 3 ms to minimize.
[2024-05-28 01:55:50] [INFO ] Deduced a trap composed of 74 places in 509 ms of which 3 ms to minimize.
[2024-05-28 01:55:50] [INFO ] Deduced a trap composed of 74 places in 517 ms of which 3 ms to minimize.
[2024-05-28 01:55:51] [INFO ] Deduced a trap composed of 61 places in 515 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 12/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1398/1976 variables, 578/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1976 variables, 240/1459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1976 variables, 0/1459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/1979 variables, 2/1461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1979 variables, 2/1463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1979 variables, 1/1464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1979 variables, 1/1465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1979 variables, 1/1466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 01:55:53] [INFO ] Deduced a trap composed of 53 places in 309 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1979 variables, 1/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1979 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1979 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1979/1979 variables, and 1467 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10313 ms.
Refiners :[Domain max(s): 580/580 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 580/580 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 11279ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 314 ms.
Support contains 28 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 4758/4758 transitions.
Applied a total of 0 rules in 921 ms. Remains 580 /580 variables (removed 0) and now considering 4758/4758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 922 ms. Remains : 580/580 places, 4758/4758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 4758/4758 transitions.
Applied a total of 0 rules in 966 ms. Remains 580 /580 variables (removed 0) and now considering 4758/4758 (removed 0) transitions.
[2024-05-28 01:55:56] [INFO ] Flow matrix only has 1399 transitions (discarded 3359 similar events)
[2024-05-28 01:55:56] [INFO ] Invariant cache hit.
[2024-05-28 01:56:01] [INFO ] Implicit Places using invariants in 4243 ms returned []
[2024-05-28 01:56:01] [INFO ] Flow matrix only has 1399 transitions (discarded 3359 similar events)
[2024-05-28 01:56:01] [INFO ] Invariant cache hit.
[2024-05-28 01:56:01] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-28 01:56:08] [INFO ] Implicit Places using invariants and state equation in 7417 ms returned []
Implicit Place search using SMT with State Equation took 11667 ms to find 0 implicit places.
[2024-05-28 01:56:08] [INFO ] Redundant transitions in 369 ms returned []
Running 4743 sub problems to find dead transitions.
[2024-05-28 01:56:09] [INFO ] Flow matrix only has 1399 transitions (discarded 3359 similar events)
[2024-05-28 01:56:09] [INFO ] Invariant cache hit.
[2024-05-28 01:56:09] [INFO ] State equation strengthened by 241 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)timeout

(s270 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 580/580 constraints. Problems are: Problem set: 0 solved, 4743 unsolved
SMT process timed out in 56641ms, After SMT, problems are : Problem set: 0 solved, 4743 unsolved
Search for dead transitions found 0 dead transitions in 56687ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69724 ms. Remains : 580/580 places, 4758/4758 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 3359 transitions
Reduce isomorphic transitions removed 3359 transitions.
Iterating post reduction 0 with 3359 rules applied. Total rules applied 3359 place count 580 transition count 1399
Discarding 192 places :
Symmetric choice reduction at 1 with 192 rule applications. Total rules 3551 place count 388 transition count 1207
Iterating global reduction 1 with 192 rules applied. Total rules applied 3743 place count 388 transition count 1207
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 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 3746 place count 386 transition count 1206
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 1 with 15 rules applied. Total rules applied 3761 place count 386 transition count 1191
Applied a total of 3761 rules in 108 ms. Remains 386 /580 variables (removed 194) and now considering 1191/4758 (removed 3567) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1191 rows 386 cols
[2024-05-28 01:57:05] [INFO ] Computed 51 invariants in 14 ms
[2024-05-28 01:57:06] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 01:57:06] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2024-05-28 01:57:06] [INFO ] [Nat]Absence check using 18 positive and 33 generalized place invariants in 18 ms returned sat
[2024-05-28 01:57:06] [INFO ] After 743ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 01:57:07] [INFO ] After 991ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 01:57:07] [INFO ] After 1326ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1652 ms.
[2024-05-28 01:57:07] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-28 01:57:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 580 places, 4758 transitions and 33518 arcs took 32 ms.
[2024-05-28 01:57:08] [INFO ] Flatten gal took : 390 ms
Total runtime 123626 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SafeBus-PT-15

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/408/model (.net / .def) ...
EXPORT TIME: [User 0.019s, 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: 640
MODEL NAME: /home/mcc/execution/408/model
580 places, 4758 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

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="SafeBus-PT-15"
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 SafeBus-PT-15, 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 r333-tall-171679078400439"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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