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.r536-tall-171690533400903.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 ltsminxred
Input is Szymanski-PT-b12, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690533400903
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 15:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 15:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7M 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 Szymanski-PT-b12-ReachabilityFireability-2024-00
FORMULA_NAME Szymanski-PT-b12-ReachabilityFireability-2023-01
FORMULA_NAME Szymanski-PT-b12-ReachabilityFireability-2024-02
FORMULA_NAME Szymanski-PT-b12-ReachabilityFireability-2024-03
FORMULA_NAME Szymanski-PT-b12-ReachabilityFireability-2024-04
FORMULA_NAME Szymanski-PT-b12-ReachabilityFireability-2024-05
FORMULA_NAME Szymanski-PT-b12-ReachabilityFireability-2024-06
FORMULA_NAME Szymanski-PT-b12-ReachabilityFireability-2024-07
FORMULA_NAME Szymanski-PT-b12-ReachabilityFireability-2024-08
FORMULA_NAME Szymanski-PT-b12-ReachabilityFireability-2024-09
FORMULA_NAME Szymanski-PT-b12-ReachabilityFireability-2024-10
FORMULA_NAME Szymanski-PT-b12-ReachabilityFireability-2024-11
FORMULA_NAME Szymanski-PT-b12-ReachabilityFireability-2024-12
FORMULA_NAME Szymanski-PT-b12-ReachabilityFireability-2023-13
FORMULA_NAME Szymanski-PT-b12-ReachabilityFireability-2024-14
FORMULA_NAME Szymanski-PT-b12-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717285748134

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 23:49:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 23:49:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 23:49:09] [INFO ] Load time of PNML (sax parser for PT used): 332 ms
[2024-06-01 23:49:09] [INFO ] Transformed 568 places.
[2024-06-01 23:49:09] [INFO ] Transformed 8320 transitions.
[2024-06-01 23:49:09] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 480 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 260 places in 18 ms
Reduce places removed 260 places and 256 transitions.
RANDOM walk for 40032 steps (14 resets) in 2049 ms. (19 steps per ms) remains 15/16 properties
FORMULA Szymanski-PT-b12-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 14/15 properties
FORMULA Szymanski-PT-b12-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 290 ms. (13 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 13/14 properties
FORMULA Szymanski-PT-b12-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 133 ms. (29 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 410 ms. (9 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 13/13 properties
[2024-06-01 23:49:10] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2024-06-01 23:49:10] [INFO ] Computed 3 invariants in 48 ms
[2024-06-01 23:49:11] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem Szymanski-PT-b12-ReachabilityFireability-2024-05 is UNSAT
FORMULA Szymanski-PT-b12-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b12-ReachabilityFireability-2024-08 is UNSAT
FORMULA Szymanski-PT-b12-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b12-ReachabilityFireability-2024-12 is UNSAT
FORMULA Szymanski-PT-b12-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 173/307 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1/308 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2733/3041 variables, 308/311 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3041 variables, 147/458 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3041 variables, 0/458 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/3041 variables, 0/458 constraints. Problems are: Problem set: 3 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3041/3041 variables, and 458 constraints, problems are : Problem set: 3 solved, 10 unsolved in 2385 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 308/308 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 13/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 195/307 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 10 unsolved
[2024-06-01 23:49:14] [INFO ] Deduced a trap composed of 58 places in 594 ms of which 35 ms to minimize.
[2024-06-01 23:49:15] [INFO ] Deduced a trap composed of 139 places in 377 ms of which 2 ms to minimize.
[2024-06-01 23:49:15] [INFO ] Deduced a trap composed of 73 places in 458 ms of which 3 ms to minimize.
[2024-06-01 23:49:16] [INFO ] Deduced a trap composed of 102 places in 430 ms of which 2 ms to minimize.
[2024-06-01 23:49:16] [INFO ] Deduced a trap composed of 196 places in 425 ms of which 3 ms to minimize.
[2024-06-01 23:49:17] [INFO ] Deduced a trap composed of 83 places in 510 ms of which 3 ms to minimize.
[2024-06-01 23:49:17] [INFO ] Deduced a trap composed of 71 places in 507 ms of which 3 ms to minimize.
[2024-06-01 23:49:18] [INFO ] Deduced a trap composed of 107 places in 485 ms of which 2 ms to minimize.
[2024-06-01 23:49:18] [INFO ] Deduced a trap composed of 133 places in 404 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 9/11 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 307/3041 variables, and 11 constraints, problems are : Problem set: 3 solved, 10 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/308 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 3/8 constraints, Known Traps: 9/9 constraints]
After SMT, in 7999ms problems are : Problem set: 3 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 112 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 368 ms. Remains 306 /308 variables (removed 2) and now considering 8064/8064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 379 ms. Remains : 306/308 places, 8064/8064 transitions.
RANDOM walk for 40010 steps (11 resets) in 212 ms. (187 steps per ms) remains 9/10 properties
FORMULA Szymanski-PT-b12-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (10 resets) in 115 ms. (344 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (10 resets) in 99 ms. (400 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 252 ms. (158 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (10 resets) in 109 ms. (363 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (10 resets) in 129 ms. (307 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (13 resets) in 99 ms. (400 steps per ms) remains 8/9 properties
FORMULA Szymanski-PT-b12-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (10 resets) in 193 ms. (206 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (10 resets) in 97 ms. (408 steps per ms) remains 8/8 properties
[2024-06-01 23:49:19] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2024-06-01 23:49:19] [INFO ] Computed 1 invariants in 26 ms
[2024-06-01 23:49:19] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 204/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2733/3039 variables, 306/307 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3039 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3039 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/3039 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3039/3039 variables, and 454 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1782 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 8/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 204/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2733/3039 variables, 306/307 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3039 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3039 variables, 6/460 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3039 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/3039 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3039/3039 variables, and 460 constraints, problems are : Problem set: 0 solved, 8 unsolved in 19203 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 8/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 21212ms problems are : Problem set: 0 solved, 8 unsolved
FORMULA Szymanski-PT-b12-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA Szymanski-PT-b12-ReachabilityFireability-2024-07 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 8398 ms.
Support contains 62 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 306 transition count 8020
Applied a total of 44 rules in 260 ms. Remains 306 /306 variables (removed 0) and now considering 8020/8064 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 260 ms. Remains : 306/306 places, 8020/8064 transitions.
RANDOM walk for 40025 steps (13 resets) in 146 ms. (272 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (10 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (14 resets) in 77 ms. (512 steps per ms) remains 5/6 properties
FORMULA Szymanski-PT-b12-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (10 resets) in 48 ms. (816 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 133 ms. (298 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (11 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
[2024-06-01 23:49:49] [INFO ] Flow matrix only has 2689 transitions (discarded 5331 similar events)
// Phase 1: matrix 2689 rows 306 cols
[2024-06-01 23:49:49] [INFO ] Computed 1 invariants in 17 ms
[2024-06-01 23:49:49] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 245/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2689/2995 variables, 306/307 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2995 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2995 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/2995 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2995/2995 variables, and 454 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1457 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 245/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2689/2995 variables, 306/307 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2995 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2995 variables, 4/458 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2995 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/2995 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2995/2995 variables, and 458 constraints, problems are : Problem set: 0 solved, 5 unsolved in 21214 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 22784ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 61 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8020/8020 transitions.
Applied a total of 0 rules in 301 ms. Remains 306 /306 variables (removed 0) and now considering 8020/8020 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 301 ms. Remains : 306/306 places, 8020/8020 transitions.
RANDOM walk for 40021 steps (13 resets) in 167 ms. (238 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (10 resets) in 81 ms. (487 steps per ms) remains 4/5 properties
FORMULA Szymanski-PT-b12-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (14 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (10 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (11 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
[2024-06-01 23:50:13] [INFO ] Flow matrix only has 2689 transitions (discarded 5331 similar events)
[2024-06-01 23:50:13] [INFO ] Invariant cache hit.
[2024-06-01 23:50:13] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 246/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2689/2995 variables, 306/307 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2995 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2995 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/2995 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2995/2995 variables, and 454 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2139 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 246/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2689/2995 variables, 306/307 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2995 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2995 variables, 3/457 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2995 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/2995 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2995/2995 variables, and 457 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4001 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 6225ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 3006 ms.
Support contains 60 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8020/8020 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 306 transition count 8019
Applied a total of 1 rules in 209 ms. Remains 306 /306 variables (removed 0) and now considering 8019/8020 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 306/306 places, 8019/8020 transitions.
RANDOM walk for 40015 steps (11 resets) in 145 ms. (274 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (11 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (9 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (11 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 153571 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 4
Probabilistic random walk after 153571 steps, saw 119604 distinct states, run finished after 3007 ms. (steps per millisecond=51 ) properties seen :0
[2024-06-01 23:50:25] [INFO ] Flow matrix only has 2688 transitions (discarded 5331 similar events)
// Phase 1: matrix 2688 rows 306 cols
[2024-06-01 23:50:25] [INFO ] Computed 1 invariants in 24 ms
[2024-06-01 23:50:25] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 246/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2688/2994 variables, 306/307 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2994 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2994 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/2994 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2994/2994 variables, and 454 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1374 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 246/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2688/2994 variables, 306/307 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2994 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2994 variables, 3/457 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2994 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/2994 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2994/2994 variables, and 457 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4528 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 6027ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 60 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8019/8019 transitions.
Applied a total of 0 rules in 207 ms. Remains 306 /306 variables (removed 0) and now considering 8019/8019 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 306/306 places, 8019/8019 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8019/8019 transitions.
Applied a total of 0 rules in 196 ms. Remains 306 /306 variables (removed 0) and now considering 8019/8019 (removed 0) transitions.
[2024-06-01 23:50:32] [INFO ] Flow matrix only has 2688 transitions (discarded 5331 similar events)
[2024-06-01 23:50:32] [INFO ] Invariant cache hit.
[2024-06-01 23:50:32] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-06-01 23:50:32] [INFO ] Flow matrix only has 2688 transitions (discarded 5331 similar events)
[2024-06-01 23:50:32] [INFO ] Invariant cache hit.
[2024-06-01 23:50:33] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:50:47] [INFO ] Implicit Places using invariants and state equation in 15196 ms returned []
Implicit Place search using SMT with State Equation took 15537 ms to find 0 implicit places.
[2024-06-01 23:50:48] [INFO ] Redundant transitions in 994 ms returned []
Running 8017 sub problems to find dead transitions.
[2024-06-01 23:50:49] [INFO ] Flow matrix only has 2688 transitions (discarded 5331 similar events)
[2024-06-01 23:50:49] [INFO ] Invariant cache hit.
[2024-06-01 23:50:49] [INFO ] State equation strengthened by 147 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8017 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/2994 variables, and 1 constraints, problems are : Problem set: 0 solved, 8017 unsolved in 30117 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/306 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 8017/8017 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8017 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8017 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/2994 variables, and 1 constraints, problems are : Problem set: 0 solved, 8017 unsolved in 30109 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/306 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/8017 constraints, Known Traps: 0/0 constraints]
After SMT, in 88109ms problems are : Problem set: 0 solved, 8017 unsolved
Search for dead transitions found 0 dead transitions in 88248ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105045 ms. Remains : 306/306 places, 8019/8019 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 688 edges and 306 vertex of which 4 / 306 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Ensure Unique test removed 4951 transitions
Reduce isomorphic transitions removed 5335 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 304 transition count 2683
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 303 transition count 2683
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 303 transition count 2681
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 303 transition count 2680
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 302 transition count 2680
Applied a total of 7 rules in 364 ms. Remains 302 /306 variables (removed 4) and now considering 2680/8019 (removed 5339) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 2680 rows 302 cols
[2024-06-01 23:52:17] [INFO ] Computed 1 invariants in 16 ms
[2024-06-01 23:52:17] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 23:52:18] [INFO ] After 1247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 23:52:18] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-06-01 23:52:19] [INFO ] After 734ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :4
[2024-06-01 23:52:19] [INFO ] After 826ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 2613 ms.
[2024-06-01 23:52:19] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-06-01 23:52:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 306 places, 8019 transitions and 32038 arcs took 38 ms.
[2024-06-01 23:52:20] [INFO ] Flatten gal took : 759 ms
Total runtime 191630 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Szymanski-PT-b12-ReachabilityFireability-2023-01
Could not compute solution for formula : Szymanski-PT-b12-ReachabilityFireability-2024-04
Could not compute solution for formula : Szymanski-PT-b12-ReachabilityFireability-2023-13
Could not compute solution for formula : Szymanski-PT-b12-ReachabilityFireability-2024-14

BK_STOP 1717285941187

--------------------
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
mcc2024
rfs formula name Szymanski-PT-b12-ReachabilityFireability-2023-01
rfs formula type EF
rfs formula formula --invariant=/tmp/603/inv_0_
rfs formula name Szymanski-PT-b12-ReachabilityFireability-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/603/inv_1_
rfs formula name Szymanski-PT-b12-ReachabilityFireability-2023-13
rfs formula type AG
rfs formula formula --invariant=/tmp/603/inv_2_
rfs formula name Szymanski-PT-b12-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/603/inv_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="Szymanski-PT-b12"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Szymanski-PT-b12, 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 r536-tall-171690533400903"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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