fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r605-tall-171774426800210
Last Updated
July 7, 2024

About the Execution of LTSMin+red for BlocksWorld-PT-07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15445.228 385287.00 648613.00 1132.50 ????????T??????? normal

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.r605-tall-171774426800210.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 BlocksWorld-PT-07, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r605-tall-171774426800210
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 292K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 356K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.9M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 31K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 230K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 933K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 599K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.7M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 8.1M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.8K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 1.5M Jun 7 06:26 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 BlocksWorld-PT-07-CTLFireability-2024-00
FORMULA_NAME BlocksWorld-PT-07-CTLFireability-2024-01
FORMULA_NAME BlocksWorld-PT-07-CTLFireability-2024-02
FORMULA_NAME BlocksWorld-PT-07-CTLFireability-2024-03
FORMULA_NAME BlocksWorld-PT-07-CTLFireability-2024-04
FORMULA_NAME BlocksWorld-PT-07-CTLFireability-2024-05
FORMULA_NAME BlocksWorld-PT-07-CTLFireability-2024-06
FORMULA_NAME BlocksWorld-PT-07-CTLFireability-2024-07
FORMULA_NAME BlocksWorld-PT-07-CTLFireability-2024-08
FORMULA_NAME BlocksWorld-PT-07-CTLFireability-2024-09
FORMULA_NAME BlocksWorld-PT-07-CTLFireability-2024-10
FORMULA_NAME BlocksWorld-PT-07-CTLFireability-2024-11
FORMULA_NAME BlocksWorld-PT-07-CTLFireability-2024-12
FORMULA_NAME BlocksWorld-PT-07-CTLFireability-2024-13
FORMULA_NAME BlocksWorld-PT-07-CTLFireability-2024-14
FORMULA_NAME BlocksWorld-PT-07-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717747533221

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-07 08:05:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-07 08:05:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 08:05:34] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2024-06-07 08:05:34] [INFO ] Transformed 1559 places.
[2024-06-07 08:05:34] [INFO ] Transformed 2965 transitions.
[2024-06-07 08:05:34] [INFO ] Found NUPN structural information;
[2024-06-07 08:05:34] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27, pred_on_table_28, pred_on_table_29, pred_on_table_30, pred_on_table_31, pred_on_table_32, pred_on_table_33, pred_on_table_34, pred_on_table_35, pred_on_table_36, pred_on_table_37]
[2024-06-07 08:05:34] [INFO ] Parsed PT model containing 1559 places and 2965 transitions and 14810 arcs in 348 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 93 ms.
Support contains 1559 out of 1559 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1559/1559 places, 2965/2965 transitions.
Applied a total of 0 rules in 30 ms. Remains 1559 /1559 variables (removed 0) and now considering 2965/2965 (removed 0) transitions.
// Phase 1: matrix 2965 rows 1559 cols
[2024-06-07 08:05:35] [INFO ] Computed 77 invariants in 54 ms
[2024-06-07 08:05:35] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-06-07 08:05:35] [INFO ] Invariant cache hit.
[2024-06-07 08:05:37] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-07 08:05:37] [INFO ] Implicit Places using invariants and state equation in 1513 ms returned []
Implicit Place search using SMT with State Equation took 1962 ms to find 0 implicit places.
Running 2958 sub problems to find dead transitions.
[2024-06-07 08:05:37] [INFO ] Invariant cache hit.
[2024-06-07 08:05:37] [INFO ] State equation strengthened by 63 read => feed constraints.
Problem TDEAD115 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD2034 is UNSAT
Problem TDEAD2094 is UNSAT
Problem TDEAD2152 is UNSAT
Problem TDEAD2208 is UNSAT
Problem TDEAD2262 is UNSAT
Problem TDEAD2314 is UNSAT
Problem TDEAD2364 is UNSAT
Problem TDEAD2412 is UNSAT
Problem TDEAD2458 is UNSAT
Problem TDEAD2502 is UNSAT
Problem TDEAD2544 is UNSAT
Problem TDEAD2622 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2754 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2808 is UNSAT
Problem TDEAD2832 is UNSAT
Problem TDEAD2854 is UNSAT
Problem TDEAD2874 is UNSAT
Problem TDEAD2892 is UNSAT
Problem TDEAD2908 is UNSAT
Problem TDEAD2922 is UNSAT
Problem TDEAD2934 is UNSAT
Problem TDEAD2944 is UNSAT
Problem TDEAD2952 is UNSAT
Problem TDEAD2958 is UNSAT
Problem TDEAD2962 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/1553 variables, 66/66 constraints. Problems are: Problem set: 66 solved, 2892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1553/4524 variables, and 66 constraints, problems are : Problem set: 66 solved, 2892 unsolved in 30094 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1559 constraints, ReadFeed: 0/63 constraints, PredecessorRefiner: 2925/1483 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 66 solved, 2892 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 6/6 constraints. Problems are: Problem set: 66 solved, 2892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/4524 variables, and 6 constraints, problems are : Problem set: 66 solved, 2892 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 6/77 constraints, State Equation: 0/1559 constraints, ReadFeed: 0/63 constraints, PredecessorRefiner: 1442/1483 constraints, Known Traps: 0/0 constraints]
After SMT, in 81101ms problems are : Problem set: 66 solved, 2892 unsolved
Search for dead transitions found 66 dead transitions in 81153ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in LTL mode, iteration 1 : 1559/1559 places, 2899/2965 transitions.
Deduced a syphon composed of 33 places in 3 ms
Applied a total of 0 rules in 13 ms. Remains 1559 /1559 variables (removed 0) and now considering 2899/2899 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83200 ms. Remains : 1559/1559 places, 2899/2965 transitions.
Deduced a syphon composed of 33 places in 3 ms
Reduce places removed 33 places and 0 transitions.
Support contains 1526 out of 1526 places after structural reductions.
[2024-06-07 08:06:59] [INFO ] Flatten gal took : 390 ms
[2024-06-07 08:07:01] [INFO ] Flatten gal took : 340 ms
[2024-06-07 08:07:03] [INFO ] Input system was already deterministic with 2899 transitions.
Reduction of identical properties reduced properties to check from 54 to 53
RANDOM walk for 40000 steps (8 resets) in 4664 ms. (8 steps per ms) remains 8/53 properties
BEST_FIRST walk for 36395 steps (8 resets) in 18198 ms. (1 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 441 ms. (90 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10106 ms. (3 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 509 ms. (78 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 260 ms. (153 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 289 ms. (137 steps per ms) remains 8/8 properties
// Phase 1: matrix 2899 rows 1526 cols
[2024-06-07 08:07:13] [INFO ] Computed 77 invariants in 31 ms
[2024-06-07 08:07:13] [INFO ] State equation strengthened by 11 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp39 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/1526 variables, 77/77 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1526 variables, 0/77 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2898/4424 variables, 1526/1603 constraints. Problems are: Problem set: 5 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/4424 variables, 10/1613 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4424 variables, 0/1613 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/4425 variables, 1/1614 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4425 variables, 0/1614 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/4425 variables, 0/1614 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4425/4425 variables, and 1614 constraints, problems are : Problem set: 5 solved, 3 unsolved in 2017 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1526/1526 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1414/1526 variables, 76/77 constraints. Problems are: Problem set: 5 solved, 3 unsolved
[2024-06-07 08:07:24] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 8 ms to minimize.
[2024-06-07 08:07:25] [INFO ] Deduced a trap composed of 175 places in 190 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1526 variables, 2/79 constraints. Problems are: Problem set: 5 solved, 3 unsolved
[2024-06-07 08:07:25] [INFO ] Deduced a trap composed of 375 places in 537 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1526 variables, 1/80 constraints. Problems are: Problem set: 5 solved, 3 unsolved
[2024-06-07 08:07:26] [INFO ] Deduced a trap composed of 175 places in 159 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1526 variables, 1/81 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1526 variables, 0/81 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2898/4424 variables, 1526/1607 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4424 variables, 10/1617 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4424 variables, 1/1618 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4424 variables, 0/1618 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/4425 variables, 1/1619 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4425 variables, 0/1619 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/4425 variables, 0/1619 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4425/4425 variables, and 1619 constraints, problems are : Problem set: 5 solved, 3 unsolved in 3811 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1526/1526 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 14515ms problems are : Problem set: 5 solved, 3 unsolved
Parikh walk visited 0 properties in 793 ms.
Support contains 112 out of 1526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1526/1526 places, 2899/2899 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 1526 transition count 2898
Applied a total of 1 rules in 5215 ms. Remains 1526 /1526 variables (removed 0) and now considering 2898/2899 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5215 ms. Remains : 1526/1526 places, 2898/2899 transitions.
RANDOM walk for 40000 steps (8 resets) in 1576 ms. (25 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 326 ms. (122 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 5097 ms. (7 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 190456 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 3
Probabilistic random walk after 190456 steps, saw 159023 distinct states, run finished after 3005 ms. (steps per millisecond=63 ) properties seen :0
// Phase 1: matrix 2898 rows 1526 cols
[2024-06-07 08:07:39] [INFO ] Computed 77 invariants in 22 ms
[2024-06-07 08:07:39] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1414/1526 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1526 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2898/4424 variables, 1526/1603 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4424 variables, 10/1613 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4424 variables, 0/1613 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/4424 variables, 0/1613 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4424/4424 variables, and 1613 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1772 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1526/1526 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1414/1526 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 08:07:43] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-06-07 08:07:43] [INFO ] Deduced a trap composed of 175 places in 158 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1526 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 08:07:43] [INFO ] Deduced a trap composed of 375 places in 516 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1526 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 08:07:44] [INFO ] Deduced a trap composed of 175 places in 156 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1526 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1526 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2898/4424 variables, 1526/1607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4424 variables, 10/1617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4424 variables, 1/1618 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4424 variables, 0/1618 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 08:07:46] [INFO ] Deduced a trap composed of 364 places in 765 ms of which 8 ms to minimize.
[2024-06-07 08:07:47] [INFO ] Deduced a trap composed of 351 places in 702 ms of which 7 ms to minimize.
[2024-06-07 08:07:47] [INFO ] Deduced a trap composed of 231 places in 210 ms of which 4 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/4424 variables, 3/1621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 08:07:48] [INFO ] Deduced a trap composed of 400 places in 712 ms of which 7 ms to minimize.
[2024-06-07 08:07:49] [INFO ] Deduced a trap composed of 375 places in 506 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/4424 variables, 2/1623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4424 variables, 0/1623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/4424 variables, 0/1623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4424/4424 variables, and 1623 constraints, problems are : Problem set: 0 solved, 3 unsolved in 7347 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1526/1526 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 10602ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 859 ms.
Support contains 112 out of 1526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1526/1526 places, 2898/2898 transitions.
Applied a total of 0 rules in 3711 ms. Remains 1526 /1526 variables (removed 0) and now considering 2898/2898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3711 ms. Remains : 1526/1526 places, 2898/2898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1526/1526 places, 2898/2898 transitions.
Applied a total of 0 rules in 3832 ms. Remains 1526 /1526 variables (removed 0) and now considering 2898/2898 (removed 0) transitions.
[2024-06-07 08:07:58] [INFO ] Invariant cache hit.
[2024-06-07 08:07:59] [INFO ] Implicit Places using invariants in 749 ms returned []
[2024-06-07 08:07:59] [INFO ] Invariant cache hit.
[2024-06-07 08:08:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-07 08:08:01] [INFO ] Implicit Places using invariants and state equation in 2219 ms returned []
Implicit Place search using SMT with State Equation took 2973 ms to find 0 implicit places.
[2024-06-07 08:08:01] [INFO ] Redundant transitions in 179 ms returned []
Running 2891 sub problems to find dead transitions.
[2024-06-07 08:08:01] [INFO ] Invariant cache hit.
[2024-06-07 08:08:01] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1519 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2891 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1519/4424 variables, and 64 constraints, problems are : Problem set: 0 solved, 2891 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 64/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 2891/1449 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2891 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1519 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2891 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1519/4424 variables, and 64 constraints, problems are : Problem set: 0 solved, 2891 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 64/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 1442/1449 constraints, Known Traps: 0/0 constraints]
After SMT, in 81094ms problems are : Problem set: 0 solved, 2891 unsolved
Search for dead transitions found 0 dead transitions in 81120ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88120 ms. Remains : 1526/1526 places, 2898/2898 transitions.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA BlocksWorld-PT-07-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-07 08:09:23] [INFO ] Flatten gal took : 216 ms
[2024-06-07 08:09:24] [INFO ] Flatten gal took : 269 ms
[2024-06-07 08:09:26] [INFO ] Input system was already deterministic with 2899 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1526/1526 places, 2899/2899 transitions.
Applied a total of 0 rules in 428 ms. Remains 1526 /1526 variables (removed 0) and now considering 2899/2899 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 431 ms. Remains : 1526/1526 places, 2899/2899 transitions.
[2024-06-07 08:09:27] [INFO ] Flatten gal took : 89 ms
[2024-06-07 08:09:27] [INFO ] Flatten gal took : 93 ms
[2024-06-07 08:09:27] [INFO ] Input system was already deterministic with 2899 transitions.
RANDOM walk for 40000 steps (8 resets) in 1856 ms. (21 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 353 ms. (113 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 442122 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 1
Probabilistic random walk after 442122 steps, saw 385113 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
// Phase 1: matrix 2899 rows 1526 cols
[2024-06-07 08:09:31] [INFO ] Computed 77 invariants in 24 ms
[2024-06-07 08:09:31] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1456/1489 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1489 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/1526 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1526 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2898/4424 variables, 1526/1603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/4424 variables, 10/1613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4424 variables, 0/1613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/4425 variables, 1/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4425 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/4425 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4425/4425 variables, and 1614 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1186 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1526/1526 constraints, ReadFeed: 11/11 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/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1456/1489 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1489 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/1526 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1526 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2898/4424 variables, 1526/1603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4424 variables, 10/1613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4424 variables, 1/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4424 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/4425 variables, 1/1615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4425 variables, 0/1615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/4425 variables, 0/1615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4425/4425 variables, and 1615 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1267 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1526/1526 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2504ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 177 ms.
Support contains 33 out of 1526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1526/1526 places, 2899/2899 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 1526 transition count 2898
Applied a total of 1 rules in 7256 ms. Remains 1526 /1526 variables (removed 0) and now considering 2898/2899 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7257 ms. Remains : 1526/1526 places, 2898/2899 transitions.
RANDOM walk for 3656233 steps (8 resets) in 120004 ms. (30 steps per ms) remains 1/1 properties
BEST_FIRST walk for 3450507 steps (8 resets) in 20004 ms. (172 steps per ms) remains 1/1 properties
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 : BlocksWorld-PT-07-CTLFireability-2024-00
Could not compute solution for formula : BlocksWorld-PT-07-CTLFireability-2024-01
Could not compute solution for formula : BlocksWorld-PT-07-CTLFireability-2024-02
Could not compute solution for formula : BlocksWorld-PT-07-CTLFireability-2024-03
Could not compute solution for formula : BlocksWorld-PT-07-CTLFireability-2024-04
Could not compute solution for formula : BlocksWorld-PT-07-CTLFireability-2024-05
Could not compute solution for formula : BlocksWorld-PT-07-CTLFireability-2024-06
Could not compute solution for formula : BlocksWorld-PT-07-CTLFireability-2024-07
Could not compute solution for formula : BlocksWorld-PT-07-CTLFireability-2024-08
Could not compute solution for formula : BlocksWorld-PT-07-CTLFireability-2024-09
Could not compute solution for formula : BlocksWorld-PT-07-CTLFireability-2024-10
Could not compute solution for formula : BlocksWorld-PT-07-CTLFireability-2024-11
Could not compute solution for formula : BlocksWorld-PT-07-CTLFireability-2024-12
Could not compute solution for formula : BlocksWorld-PT-07-CTLFireability-2024-13
Could not compute solution for formula : BlocksWorld-PT-07-CTLFireability-2024-14
Could not compute solution for formula : BlocksWorld-PT-07-CTLFireability-2024-15

BK_STOP 1717747918508

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name BlocksWorld-PT-07-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/652/ctl_0_
ctl formula name BlocksWorld-PT-07-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/652/ctl_1_
ctl formula name BlocksWorld-PT-07-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/652/ctl_2_
ctl formula name BlocksWorld-PT-07-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/652/ctl_3_
ctl formula name BlocksWorld-PT-07-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/652/ctl_4_
ctl formula name BlocksWorld-PT-07-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/652/ctl_5_
ctl formula name BlocksWorld-PT-07-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/652/ctl_6_
ctl formula name BlocksWorld-PT-07-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/652/ctl_7_
ctl formula name BlocksWorld-PT-07-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/652/ctl_8_
ctl formula name BlocksWorld-PT-07-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/652/ctl_9_
ctl formula name BlocksWorld-PT-07-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/652/ctl_10_
ctl formula name BlocksWorld-PT-07-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/652/ctl_11_
ctl formula name BlocksWorld-PT-07-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/652/ctl_12_
ctl formula name BlocksWorld-PT-07-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/652/ctl_13_
ctl formula name BlocksWorld-PT-07-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/652/ctl_14_
ctl formula name BlocksWorld-PT-07-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/652/ctl_15_
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="BlocksWorld-PT-07"
export BK_EXAMINATION="CTLFireability"
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 BlocksWorld-PT-07, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r605-tall-171774426800210"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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