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.r488-tall-171631133000580.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 DoubleExponent-PT-200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631133000580
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.5M May 18 16:42 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 DoubleExponent-PT-200-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717198867183

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-200
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:41:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 23:41:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:41:08] [INFO ] Load time of PNML (sax parser for PT used): 323 ms
[2024-05-31 23:41:08] [INFO ] Transformed 10604 places.
[2024-05-31 23:41:08] [INFO ] Transformed 9998 transitions.
[2024-05-31 23:41:08] [INFO ] Parsed PT model containing 10604 places and 9998 transitions and 28194 arcs in 454 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DoubleExponent-PT-200-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-200-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 10604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10604/10604 places, 9998/9998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 10600 transition count 9998
Applied a total of 4 rules in 3900 ms. Remains 10600 /10604 variables (removed 4) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-31 23:41:16] [INFO ] Invariants computation overflowed in 338 ms
[2024-05-31 23:41:21] [INFO ] Implicit Places using invariants in 5396 ms returned []
Implicit Place search using SMT only with invariants took 5427 ms to find 0 implicit places.
Running 9997 sub problems to find dead transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-31 23:41:22] [INFO ] Invariants computation overflowed in 302 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10599/20598 variables, and 0 constraints, problems are : Problem set: 0 solved, 9997 unsolved in 30202 ms.
Refiners :[State Equation: 0/10600 constraints, PredecessorRefiner: 9997/9997 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9997 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10599/20598 variables, and 0 constraints, problems are : Problem set: 0 solved, 9997 unsolved in 30128 ms.
Refiners :[State Equation: 0/10600 constraints, PredecessorRefiner: 0/9997 constraints, Known Traps: 0/0 constraints]
After SMT, in 69148ms problems are : Problem set: 0 solved, 9997 unsolved
Search for dead transitions found 0 dead transitions in 69270ms
Starting structural reductions in LTL mode, iteration 1 : 10600/10604 places, 9998/9998 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78665 ms. Remains : 10600/10604 places, 9998/9998 transitions.
Support contains 42 out of 10600 places after structural reductions.
[2024-05-31 23:42:33] [INFO ] Flatten gal took : 455 ms
[2024-05-31 23:42:33] [INFO ] Flatten gal took : 327 ms
[2024-05-31 23:42:34] [INFO ] Input system was already deterministic with 9998 transitions.
Support contains 41 out of 10600 places (down from 42) after GAL structural reductions.
RANDOM walk for 40000 steps (1336 resets) in 2023 ms. (19 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (116 resets) in 231 ms. (17 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (112 resets) in 61 ms. (64 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (111 resets) in 62 ms. (63 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (111 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (109 resets) in 36 ms. (108 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (114 resets) in 39 ms. (100 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (115 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (110 resets) in 36 ms. (108 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (111 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (106 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (113 resets) in 176 ms. (22 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (109 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (118 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (110 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (104 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (107 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (115 resets) in 31 ms. (125 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (116 resets) in 37 ms. (105 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (114 resets) in 45 ms. (87 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (114 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (118 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (116 resets) in 44 ms. (88 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (108 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (117 resets) in 38 ms. (102 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (118 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (117 resets) in 43 ms. (90 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (113 resets) in 43 ms. (90 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (108 resets) in 36 ms. (108 steps per ms) remains 28/28 properties
Interrupted probabilistic random walk after 25753 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 28
Probabilistic random walk after 25753 steps, saw 12881 distinct states, run finished after 3018 ms. (steps per millisecond=8 ) properties seen :0
// Phase 1: matrix 9998 rows 10600 cols
[2024-05-31 23:42:41] [INFO ] Invariants computation overflowed in 296 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 124/165 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 507/672 variables, 206/247 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1109/1781 variables, 473/720 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1781 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 1768/3549 variables, 846/1566 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3549 variables, 0/1566 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 2160/5709 variables, 1078/2644 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5709 variables, 0/2644 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7835/20598 variables, and 3768 constraints, problems are : Problem set: 0 solved, 28 unsolved in 5013 ms.
Refiners :[State Equation: 3768/10600 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 124/165 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 507/672 variables, 206/247 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 28/275 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/672 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 1109/1781 variables, 473/748 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1781 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 1768/3549 variables, 846/1594 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3549 variables, 0/1594 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 2160/5709 variables, 1078/2672 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5709 variables, 0/2672 constraints. Problems are: Problem set: 0 solved, 28 unsolved
SMT process timed out in 10409ms, After SMT, problems are : Problem set: 0 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 41 out of 10600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.21 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2346 transitions
Trivial Post-agglo rules discarded 2346 transitions
Performed 2346 trivial Post agglomeration. Transition count delta: 2346
Iterating post reduction 0 with 2349 rules applied. Total rules applied 2350 place count 10597 transition count 7650
Reduce places removed 2346 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 2364 rules applied. Total rules applied 4714 place count 8251 transition count 7632
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 4732 place count 8233 transition count 7632
Performed 404 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 404 Pre rules applied. Total rules applied 4732 place count 8233 transition count 7228
Deduced a syphon composed of 404 places in 671 ms
Reduce places removed 404 places and 0 transitions.
Iterating global reduction 3 with 808 rules applied. Total rules applied 5540 place count 7829 transition count 7228
Performed 1781 Post agglomeration using F-continuation condition.Transition count delta: 1781
Deduced a syphon composed of 1781 places in 321 ms
Reduce places removed 1781 places and 0 transitions.
Iterating global reduction 3 with 3562 rules applied. Total rules applied 9102 place count 6048 transition count 5447
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 378 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9304 place count 5947 transition count 5447
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 223 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9506 place count 5846 transition count 5447
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 217 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9708 place count 5745 transition count 5447
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 87 places in 208 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 9882 place count 5658 transition count 5447
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9883 place count 5658 transition count 5446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 9884 place count 5657 transition count 5446
Free-agglomeration rule (complex) applied 815 times.
Iterating global reduction 4 with 815 rules applied. Total rules applied 10699 place count 5657 transition count 4631
Reduce places removed 815 places and 0 transitions.
Iterating post reduction 4 with 815 rules applied. Total rules applied 11514 place count 4842 transition count 4631
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 808 times.
Drop transitions (Partial Free agglomeration) removed 808 transitions
Iterating global reduction 5 with 808 rules applied. Total rules applied 12322 place count 4842 transition count 4631
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 12323 place count 4841 transition count 4630
Applied a total of 12323 rules in 9893 ms. Remains 4841 /10600 variables (removed 5759) and now considering 4630/9998 (removed 5368) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9897 ms. Remains : 4841/10600 places, 4630/9998 transitions.
RANDOM walk for 40000 steps (5081 resets) in 833 ms. (47 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (343 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (342 resets) in 22 ms. (173 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (307 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (338 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (321 resets) in 22 ms. (173 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (313 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (353 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (340 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (345 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (329 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (323 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (336 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (339 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (343 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (352 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (351 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (338 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (358 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (342 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (341 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (338 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4000 steps (345 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (332 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (335 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (318 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (346 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (332 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (320 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
Interrupted probabilistic random walk after 54406 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 28
Probabilistic random walk after 54406 steps, saw 27218 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
// Phase 1: matrix 4630 rows 4841 cols
[2024-05-31 23:43:05] [INFO ] Invariants computation overflowed in 89 ms
[2024-05-31 23:43:05] [INFO ] State equation strengthened by 785 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 178/219 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 2457/2676 variables, 699/750 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2676 variables, 49/799 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2676 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8001/9471 variables, and 3712 constraints, problems are : Problem set: 0 solved, 28 unsolved in 45044 ms.
Refiners :[State Equation: 3653/4841 constraints, ReadFeed: 59/785 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 178/219 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 2457/2676 variables, 699/750 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2676 variables, 49/799 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2676 variables, 27/826 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2676 variables, 0/826 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8001/9471 variables, and 3739 constraints, problems are : Problem set: 0 solved, 28 unsolved in 45038 ms.
Refiners :[State Equation: 3653/4841 constraints, ReadFeed: 59/785 constraints, PredecessorRefiner: 27/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 90256ms problems are : Problem set: 0 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 41 out of 4841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4841/4841 places, 4630/4630 transitions.
Applied a total of 0 rules in 1035 ms. Remains 4841 /4841 variables (removed 0) and now considering 4630/4630 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1035 ms. Remains : 4841/4841 places, 4630/4630 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4841/4841 places, 4630/4630 transitions.
Applied a total of 0 rules in 1067 ms. Remains 4841 /4841 variables (removed 0) and now considering 4630/4630 (removed 0) transitions.
// Phase 1: matrix 4630 rows 4841 cols
[2024-05-31 23:44:38] [INFO ] Invariants computation overflowed in 93 ms
[2024-05-31 23:45:08] [INFO ] Performed 1081/4841 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:45:39] [INFO ] Performed 2045/4841 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 23:46:09] [INFO ] Performed 3172/4841 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-31 23:46:34] [INFO ] Implicit Places using invariants in 116547 ms returned []
// Phase 1: matrix 4630 rows 4841 cols
[2024-05-31 23:46:34] [INFO ] Invariants computation overflowed in 86 ms
[2024-05-31 23:46:38] [INFO ] State equation strengthened by 785 read => feed constraints.
[2024-05-31 23:49:14] [INFO ] Performed 2/4841 implicitness test of which 0 returned IMPLICIT in 156 seconds.
[2024-05-31 23:49:14] [INFO ] Timeout of Implicit test with SMT after 156 seconds.
[2024-05-31 23:49:14] [INFO ] Implicit Places using invariants and state equation in 160204 ms returned []
Implicit Place search using SMT with State Equation took 276753 ms to find 0 implicit places.
[2024-05-31 23:49:15] [INFO ] Redundant transitions in 577 ms returned []
Running 4629 sub problems to find dead transitions.
// Phase 1: matrix 4630 rows 4841 cols
[2024-05-31 23:49:15] [INFO ] Invariants computation overflowed in 83 ms
[2024-05-31 23:49:15] [INFO ] State equation strengthened by 785 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4840/9471 variables, and 0 constraints, problems are : Problem set: 0 solved, 4629 unsolved in 30068 ms.
Refiners :[State Equation: 0/4841 constraints, ReadFeed: 0/785 constraints, PredecessorRefiner: 4629/3966 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4629 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4840/9471 variables, and 0 constraints, problems are : Problem set: 0 solved, 4629 unsolved in 30063 ms.
Refiners :[State Equation: 0/4841 constraints, ReadFeed: 0/785 constraints, PredecessorRefiner: 663/3966 constraints, Known Traps: 0/0 constraints]
After SMT, in 140476ms problems are : Problem set: 0 solved, 4629 unsolved
Search for dead transitions found 0 dead transitions in 140553ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 418993 ms. Remains : 4841/4841 places, 4630/4630 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.47 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2400 transitions
Trivial Post-agglo rules discarded 2400 transitions
Performed 2400 trivial Post agglomeration. Transition count delta: 2400
Iterating post reduction 0 with 2400 rules applied. Total rules applied 2400 place count 10599 transition count 7597
Reduce places removed 2400 places and 0 transitions.
Iterating post reduction 1 with 2400 rules applied. Total rules applied 4800 place count 8199 transition count 7597
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 4800 place count 8199 transition count 7197
Deduced a syphon composed of 400 places in 711 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 5600 place count 7799 transition count 7197
Performed 1802 Post agglomeration using F-continuation condition.Transition count delta: 1802
Deduced a syphon composed of 1802 places in 300 ms
Reduce places removed 1802 places and 0 transitions.
Iterating global reduction 2 with 3604 rules applied. Total rules applied 9204 place count 5997 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 275 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9406 place count 5896 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 254 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9608 place count 5795 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 242 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9810 place count 5694 transition count 5395
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 231 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 10000 place count 5599 transition count 5395
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 10001 place count 5599 transition count 5395
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10002 place count 5598 transition count 5394
Applied a total of 10002 rules in 6492 ms. Remains 5598 /10600 variables (removed 5002) and now considering 5394/9998 (removed 4604) transitions.
// Phase 1: matrix 5394 rows 5598 cols
[2024-05-31 23:51:43] [INFO ] Invariants computation overflowed in 135 ms
[2024-05-31 23:51:46] [INFO ] Implicit Places using invariants in 3292 ms returned []
// Phase 1: matrix 5394 rows 5598 cols
[2024-05-31 23:51:46] [INFO ] Invariants computation overflowed in 132 ms
[2024-05-31 23:51:49] [INFO ] State equation strengthened by 398 read => feed constraints.
FORMULA DoubleExponent-PT-200-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : DoubleExponent-PT-200-LTLFireability-01
Could not compute solution for formula : DoubleExponent-PT-200-LTLFireability-02
Could not compute solution for formula : DoubleExponent-PT-200-LTLFireability-03
FORMULA DoubleExponent-PT-200-LTLFireability-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : DoubleExponent-PT-200-LTLFireability-05
FORMULA DoubleExponent-PT-200-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-200-LTLFireability-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-200-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-200-LTLFireability-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-200-LTLFireability-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-200-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-200-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-200-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-200-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-200-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717200655701

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name DoubleExponent-PT-200-LTLFireability-00
ltl formula formula --ltl=/tmp/573/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 10604 places, 9998 transitions and 28194 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-200 analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/573/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/573/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/573/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 2.320 real 0.280 user 0.530 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/573/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 10602 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 10605, there are 10001 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~23!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 28
pnml2lts-mc( 0/ 4): unique transitions count: 31
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 87
pnml2lts-mc( 0/ 4): - cum. max stack depth: 87
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 87 states 100 transitions, fanout: 1.149
pnml2lts-mc( 0/ 4): Total exploration time 0.430 sec (0.420 sec minimum, 0.425 sec on average)
pnml2lts-mc( 0/ 4): States per second: 202, Transitions per second: 233
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 106.6 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10220 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DoubleExponent-PT-200-LTLFireability-01
ltl formula formula --ltl=/tmp/573/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 10604 places, 9998 transitions and 28194 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/573/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 1.140 real 0.270 user 0.300 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/573/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/573/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/573/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 10602 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 10605, there are 10003 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~1018 levels ~10000 states ~11116 transitions
pnml2lts-mc( 0/ 4): ~1218 levels ~20000 states ~22264 transitions
pnml2lts-mc( 0/ 4): ~1406 levels ~40000 states ~44480 transitions
ltl formula name DoubleExponent-PT-200-LTLFireability-02
ltl formula formula --ltl=/tmp/573/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 10604 places, 9998 transitions and 28194 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.000 real 0.350 user 0.390 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/573/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/573/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/573/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/573/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 10602 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 10605, there are 10013 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~1034 levels ~10000 states ~11144 transitions
pnml2lts-mc( 3/ 4): ~1139 levels ~20000 states ~22248 transitions
pnml2lts-mc( 0/ 4): ~1390 levels ~40000 states ~44516 transitions
ltl formula name DoubleExponent-PT-200-LTLFireability-03
ltl formula formula --ltl=/tmp/573/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 10604 places, 9998 transitions and 28194 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.030 real 0.310 user 0.450 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/573/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/573/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/573/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/573/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 10602 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 10605, there are 10010 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~1144 levels ~10000 states ~11180 transitions
pnml2lts-mc( 3/ 4): ~1328 levels ~20000 states ~22212 transitions
pnml2lts-mc( 3/ 4): ~1483 levels ~40000 states ~44352 transitions
ltl formula name DoubleExponent-PT-200-LTLFireability-04
ltl formula formula --ltl=/tmp/573/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 10604 places, 9998 transitions and 28194 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.060 real 0.370 user 0.350 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/573/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/573/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/573/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/573/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 10601 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 10605, there are 10005 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~23!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 30
pnml2lts-mc( 0/ 4): unique transitions count: 33
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 94
pnml2lts-mc( 0/ 4): - cum. max stack depth: 94
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 94 states 107 transitions, fanout: 1.138
pnml2lts-mc( 0/ 4): Total exploration time 0.400 sec (0.380 sec minimum, 0.390 sec on average)
pnml2lts-mc( 0/ 4): States per second: 235, Transitions per second: 268
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 107.4 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10220 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DoubleExponent-PT-200-LTLFireability-05
ltl formula formula --ltl=/tmp/573/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 10604 places, 9998 transitions and 28194 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.040 real 0.300 user 0.400 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/573/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/573/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/573/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/573/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 10601 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 10605, there are 10015 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~1042 levels ~10000 states ~11164 transitions
pnml2lts-mc( 1/ 4): ~1169 levels ~20000 states ~22260 transitions
pnml2lts-mc( 1/ 4): ~1260 levels ~40000 states ~44504 transitions
ltl formula name DoubleExponent-PT-200-LTLFireability-06
ltl formula formula --ltl=/tmp/573/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 10604 places, 9998 transitions and 28194 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.010 real 0.320 user 0.370 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/573/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/573/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/573/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/573/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 10602 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 10605, there are 9999 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~23!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 29
pnml2lts-mc( 0/ 4): unique transitions count: 31
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 92
pnml2lts-mc( 0/ 4): - cum. max stack depth: 92
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 92 states 101 transitions, fanout: 1.098
pnml2lts-mc( 0/ 4): Total exploration time 0.490 sec (0.480 sec minimum, 0.483 sec on average)
pnml2lts-mc( 0/ 4): States per second: 188, Transitions per second: 206
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 106.8 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10220 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DoubleExponent-PT-200-LTLFireability-07
ltl formula formula --ltl=/tmp/573/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 10604 places, 9998 transitions and 28194 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.970 real 0.360 user 0.370 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/573/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/573/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/573/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/573/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 10602 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 10605, there are 10004 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 200, Transitions per second: 200
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 112.0 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10220 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DoubleExponent-PT-200-LTLFireability-08
ltl formula formula --ltl=/tmp/573/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 10604 places, 9998 transitions and 28194 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.980 real 0.350 user 0.330 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/573/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/573/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/573/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/573/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 10602 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 10605, there are 10005 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~29!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 50
pnml2lts-mc( 0/ 4): unique transitions count: 86
pnml2lts-mc( 0/ 4): - self-loop count: 4
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 116
pnml2lts-mc( 0/ 4): - cum. max stack depth: 116
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 116 states 188 transitions, fanout: 1.621
pnml2lts-mc( 0/ 4): Total exploration time 0.480 sec (0.480 sec minimum, 0.480 sec on average)
pnml2lts-mc( 0/ 4): States per second: 242, Transitions per second: 392
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 64.8 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10220 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DoubleExponent-PT-200-LTLFireability-09
ltl formula formula --ltl=/tmp/573/ltl_9_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 10604 places, 9998 transitions and 28194 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.980 real 0.260 user 0.400 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/573/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/573/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/573/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/573/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 10602 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 10605, there are 10002 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3
pnml2lts-mc( 0/ 4): unique states count: 3
pnml2lts-mc( 0/ 4): unique transitions count: 2
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 10
pnml2lts-mc( 0/ 4): - cum. max stack depth: 10
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10 states 12 transitions, fanout: 1.200
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.050 sec minimum, 0.053 sec on average)
pnml2lts-mc( 0/ 4): States per second: 167, Transitions per second: 200
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 192.0 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10220 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DoubleExponent-PT-200-LTLFireability-10
ltl formula formula --ltl=/tmp/573/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 10604 places, 9998 transitions and 28194 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.010 real 0.300 user 0.370 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/573/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/573/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/573/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/573/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 10602 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 10605, there are 10000 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2
pnml2lts-mc( 0/ 4): unique states count: 2
pnml2lts-mc( 0/ 4): unique transitions count: 1
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8 states 8 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.030 sec minimum, 0.032 sec on average)
pnml2lts-mc( 0/ 4): States per second: 200, Transitions per second: 200
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 192.0 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10220 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DoubleExponent-PT-200-LTLFireability-11
ltl formula formula --ltl=/tmp/573/ltl_11_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 10604 places, 9998 transitions and 28194 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.950 real 0.290 user 0.380 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/573/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/573/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/573/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/573/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 10602 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 10605, there are 10005 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~23!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 30
pnml2lts-mc( 0/ 4): unique transitions count: 32
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 92
pnml2lts-mc( 0/ 4): - cum. max stack depth: 92
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 92 states 102 transitions, fanout: 1.109
pnml2lts-mc( 0/ 4): Total exploration time 0.380 sec (0.370 sec minimum, 0.377 sec on average)
pnml2lts-mc( 0/ 4): States per second: 242, Transitions per second: 268
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 105.8 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10220 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DoubleExponent-PT-200-LTLFireability-12
ltl formula formula --ltl=/tmp/573/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 10604 places, 9998 transitions and 28194 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.980 real 0.320 user 0.380 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/573/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/573/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/573/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/573/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 10602 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 10605, there are 10005 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~23!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 31
pnml2lts-mc( 0/ 4): unique transitions count: 33
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 93
pnml2lts-mc( 0/ 4): - cum. max stack depth: 93
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 93 states 103 transitions, fanout: 1.108
pnml2lts-mc( 0/ 4): Total exploration time 0.390 sec (0.380 sec minimum, 0.382 sec on average)
pnml2lts-mc( 0/ 4): States per second: 238, Transitions per second: 264
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 106.9 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10220 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DoubleExponent-PT-200-LTLFireability-13
ltl formula formula --ltl=/tmp/573/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 10604 places, 9998 transitions and 28194 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.040 real 0.340 user 0.360 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/573/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/573/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/573/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/573/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 10601 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 10605, there are 10004 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~23!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 47
pnml2lts-mc( 0/ 4): unique transitions count: 69
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 84
pnml2lts-mc( 0/ 4): - cum. max stack depth: 84
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 84 states 115 transitions, fanout: 1.369
pnml2lts-mc( 0/ 4): Total exploration time 0.390 sec (0.350 sec minimum, 0.375 sec on average)
pnml2lts-mc( 0/ 4): States per second: 215, Transitions per second: 295
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 78.4 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10220 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DoubleExponent-PT-200-LTLFireability-14
ltl formula formula --ltl=/tmp/573/ltl_14_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 10604 places, 9998 transitions and 28194 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.980 real 0.390 user 0.340 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/573/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/573/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/573/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/573/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 10602 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 10605, there are 10007 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~23!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 29
pnml2lts-mc( 0/ 4): unique transitions count: 31
pnml2lts-mc( 0/ 4): - self-loop count: 3
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 92
pnml2lts-mc( 0/ 4): - cum. max stack depth: 92
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 92 states 103 transitions, fanout: 1.120
pnml2lts-mc( 0/ 4): Total exploration time 0.390 sec (0.380 sec minimum, 0.385 sec on average)
pnml2lts-mc( 0/ 4): States per second: 236, Transitions per second: 264
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 114.3 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10220 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DoubleExponent-PT-200-LTLFireability-15
ltl formula formula --ltl=/tmp/573/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 10604 places, 9998 transitions and 28194 arcs
pnml2lts-mc( 0/ 4): Petri net DoubleExponent-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.000 real 0.300 user 0.390 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/573/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/573/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/573/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/573/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): There are 10601 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 10605, there are 10022 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~29!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 29
pnml2lts-mc( 0/ 4): unique transitions count: 33
pnml2lts-mc( 0/ 4): - self-loop count: 4
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 116
pnml2lts-mc( 0/ 4): - cum. max stack depth: 116
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 116 states 136 transitions, fanout: 1.172
pnml2lts-mc( 0/ 4): Total exploration time 0.470 sec (0.470 sec minimum, 0.470 sec on average)
pnml2lts-mc( 0/ 4): States per second: 247, Transitions per second: 289
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 104.0 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10220 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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="DoubleExponent-PT-200"
export BK_EXAMINATION="LTLFireability"
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 DoubleExponent-PT-200, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r488-tall-171631133000580"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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