fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r483-smll-171624276100500
Last Updated
July 7, 2024

About the Execution of LTSMin for DNAwalker-PT-17redondantChoiceL

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
177.600 766506.00 3058188.00 43.10 FTTFFTFTFFFFFFTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r483-smll-171624276100500.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 ltsmin
Input is DNAwalker-PT-17redondantChoiceL, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r483-smll-171624276100500
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K 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.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 13:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 13 13:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 13:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 13 13:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 19 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 211K 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 DNAwalker-PT-17redondantChoiceL-LTLFireability-00
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-01
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-02
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-03
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-04
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-05
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-06
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-07
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-08
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-09
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-10
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-11
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-12
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-13
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-14
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717242374445

Invoking MCC driver with
BK_TOOL=ltsmin
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-17redondantChoiceL
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
FORMULA DNAwalker-PT-17redondantChoiceL-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLFireability-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLFireability-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLFireability-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLFireability-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLFireability-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLFireability-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717243140951

--------------------
content from stderr:

mcc2024
ltl formula name DNAwalker-PT-17redondantChoiceL-LTLFireability-00
ltl formula formula --ltl=/tmp/412/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 43 places, 490 transitions and 1438 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-17redondantChoiceL analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/412/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/412/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/412/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/412/ltl_0_
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 78 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 44, there are 498 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 ~16!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 53
pnml2lts-mc( 0/ 4): unique transitions count: 1016
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: 56
pnml2lts-mc( 0/ 4): - cum. max stack depth: 56
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 56 states 1092 transitions, fanout: 19.500
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5600, Transitions per second: 109200
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, 18.0 B/state, compr.: 10.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 501 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 DNAwalker-PT-17redondantChoiceL-LTLFireability-01
ltl formula formula --ltl=/tmp/412/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 43 places, 490 transitions and 1438 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-17redondantChoiceL analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/412/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/412/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/412/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/412/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4): There are 77 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 44, there are 512 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): ~39 levels ~10000 states ~23248 transitions
pnml2lts-mc( 0/ 4): ~39 levels ~20000 states ~48628 transitions
pnml2lts-mc( 0/ 4): ~39 levels ~40000 states ~95552 transitions
pnml2lts-mc( 0/ 4): ~39 levels ~80000 states ~209852 transitions
pnml2lts-mc( 0/ 4): ~39 levels ~160000 states ~456136 transitions
pnml2lts-mc( 2/ 4): ~37 levels ~320000 states ~1053960 transitions
pnml2lts-mc( 2/ 4): ~37 levels ~640000 states ~2224380 transitions
pnml2lts-mc( 2/ 4): ~37 levels ~1280000 states ~4637660 transitions
pnml2lts-mc( 2/ 4): ~37 levels ~2560000 states ~9471880 transitions
pnml2lts-mc( 2/ 4): ~37 levels ~5120000 states ~20289464 transitions
pnml2lts-mc( 0/ 4): ~39 levels ~10240000 states ~49365980 transitions
pnml2lts-mc( 0/ 4): ~39 levels ~20480000 states ~103083768 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33553203
pnml2lts-mc( 0/ 4): unique states count: 33553311
pnml2lts-mc( 0/ 4): unique transitions count: 173387444
pnml2lts-mc( 0/ 4): - self-loop count: 5183810
pnml2lts-mc( 0/ 4): - claim dead count: 134649148
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33553314
pnml2lts-mc( 0/ 4): - cum. max stack depth: 150
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33553314 states 173387518 transitions, fanout: 5.168
pnml2lts-mc( 0/ 4): Total exploration time 187.630 sec (187.610 sec minimum, 187.615 sec on average)
pnml2lts-mc( 0/ 4): States per second: 178827, Transitions per second: 924093
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 259.4MB, 8.1 B/state, compr.: 4.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/5.0%
pnml2lts-mc( 0/ 4): Stored 501 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 259.4MB (~256.0MB paged-in)
ltl formula name DNAwalker-PT-17redondantChoiceL-LTLFireability-02
ltl formula formula --ltl=/tmp/412/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 43 places, 490 transitions and 1438 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-17redondantChoiceL analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/412/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/412/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/412/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/412/ltl_2_
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 78 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 44, there are 492 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.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
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, 160.0 B/state, compr.: 89.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 501 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 DNAwalker-PT-17redondantChoiceL-LTLFireability-03
ltl formula formula --ltl=/tmp/412/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 43 places, 490 transitions and 1438 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-17redondantChoiceL analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/412/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/412/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/412/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/412/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 77 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 44, there are 494 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 ~16!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 62
pnml2lts-mc( 0/ 4): unique transitions count: 1250
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 65
pnml2lts-mc( 0/ 4): - cum. max stack depth: 65
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 65 states 1326 transitions, fanout: 20.400
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6500, Transitions per second: 132600
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, 17.5 B/state, compr.: 9.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 501 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 DNAwalker-PT-17redondantChoiceL-LTLFireability-04
ltl formula formula --ltl=/tmp/412/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 43 places, 490 transitions and 1438 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-17redondantChoiceL analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.030 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/412/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/412/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/412/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/412/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 77 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 44, there are 499 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 ~12!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 52
pnml2lts-mc( 0/ 4): unique transitions count: 1000
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: 55
pnml2lts-mc( 0/ 4): - cum. max stack depth: 55
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 55 states 1076 transitions, fanout: 19.564
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5500, Transitions per second: 107600
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, 18.0 B/state, compr.: 10.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 501 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 DNAwalker-PT-17redondantChoiceL-LTLFireability-05
ltl formula formula --ltl=/tmp/412/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 43 places, 490 transitions and 1438 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-17redondantChoiceL analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/412/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/412/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/412/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/412/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 77 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 44, there are 498 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): ~39 levels ~10000 states ~29500 transitions
pnml2lts-mc( 0/ 4): ~39 levels ~20000 states ~57060 transitions
pnml2lts-mc( 0/ 4): ~39 levels ~40000 states ~111460 transitions
pnml2lts-mc( 0/ 4): ~39 levels ~80000 states ~239300 transitions
pnml2lts-mc( 0/ 4): ~39 levels ~160000 states ~500820 transitions
pnml2lts-mc( 0/ 4): ~39 levels ~320000 states ~1048892 transitions
pnml2lts-mc( 0/ 4): ~39 levels ~640000 states ~2330324 transitions
pnml2lts-mc( 0/ 4): ~39 levels ~1280000 states ~4994404 transitions
pnml2lts-mc( 0/ 4): ~39 levels ~2560000 states ~10785900 transitions
pnml2lts-mc( 0/ 4): ~39 levels ~5120000 states ~23603804 transitions
pnml2lts-mc( 1/ 4): ~40 levels ~10240000 states ~53925404 transitions
pnml2lts-mc( 0/ 4): ~39 levels ~20480000 states ~109792268 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33551467
pnml2lts-mc( 0/ 4): unique states count: 33551577
pnml2lts-mc( 0/ 4): unique transitions count: 193348447
pnml2lts-mc( 0/ 4): - self-loop count: 2833903
pnml2lts-mc( 0/ 4): - claim dead count: 156960110
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33551580
pnml2lts-mc( 0/ 4): - cum. max stack depth: 155
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33551580 states 193348593 transitions, fanout: 5.763
pnml2lts-mc( 0/ 4): Total exploration time 199.380 sec (199.300 sec minimum, 199.337 sec on average)
pnml2lts-mc( 0/ 4): States per second: 168280, Transitions per second: 969749
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 257.6MB, 8.1 B/state, compr.: 4.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 501 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 257.6MB (~256.0MB paged-in)
ltl formula name DNAwalker-PT-17redondantChoiceL-LTLFireability-06
ltl formula formula --ltl=/tmp/412/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 43 places, 490 transitions and 1438 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-17redondantChoiceL analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/412/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/412/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/412/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/412/ltl_6_
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 78 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 44, there are 495 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 ~12!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 51
pnml2lts-mc( 0/ 4): unique transitions count: 960
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: 54
pnml2lts-mc( 0/ 4): - cum. max stack depth: 54
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 54 states 1036 transitions, fanout: 19.185
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5400, Transitions per second: 103600
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, 18.3 B/state, compr.: 10.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 501 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 DNAwalker-PT-17redondantChoiceL-LTLFireability-07
ltl formula formula --ltl=/tmp/412/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 43 places, 490 transitions and 1438 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-17redondantChoiceL analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/412/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/412/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/412/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/412/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 78 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 44, there are 497 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): ~35 levels ~10000 states ~23920 transitions
pnml2lts-mc( 1/ 4): ~35 levels ~20000 states ~49184 transitions
pnml2lts-mc( 1/ 4): ~35 levels ~40000 states ~105752 transitions
pnml2lts-mc( 1/ 4): ~35 levels ~80000 states ~223032 transitions
pnml2lts-mc( 1/ 4): ~35 levels ~160000 states ~483932 transitions
pnml2lts-mc( 1/ 4): ~35 levels ~320000 states ~977224 transitions
pnml2lts-mc( 1/ 4): ~35 levels ~640000 states ~2123444 transitions
pnml2lts-mc( 1/ 4): ~35 levels ~1280000 states ~4496624 transitions
pnml2lts-mc( 1/ 4): ~35 levels ~2560000 states ~9520108 transitions
pnml2lts-mc( 1/ 4): ~35 levels ~5120000 states ~20634184 transitions
pnml2lts-mc( 1/ 4): ~35 levels ~10240000 states ~44631880 transitions
pnml2lts-mc( 1/ 4): ~35 levels ~20480000 states ~94850348 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33553039
pnml2lts-mc( 0/ 4): unique states count: 33553135
pnml2lts-mc( 0/ 4): unique transitions count: 196645176
pnml2lts-mc( 0/ 4): - self-loop count: 4790967
pnml2lts-mc( 0/ 4): - claim dead count: 158299800
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33553138
pnml2lts-mc( 0/ 4): - cum. max stack depth: 145
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33553138 states 196645251 transitions, fanout: 5.861
pnml2lts-mc( 0/ 4): Total exploration time 190.410 sec (190.330 sec minimum, 190.363 sec on average)
pnml2lts-mc( 0/ 4): States per second: 176215, Transitions per second: 1032746
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 257.8MB, 8.1 B/state, compr.: 4.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 501 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 257.8MB (~256.0MB paged-in)
ltl formula name DNAwalker-PT-17redondantChoiceL-LTLFireability-08
ltl formula formula --ltl=/tmp/412/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 43 places, 490 transitions and 1438 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-17redondantChoiceL analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/412/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/412/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/412/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/412/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 78 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 44, there are 512 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 ~26!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 74
pnml2lts-mc( 0/ 4): unique states count: 182
pnml2lts-mc( 0/ 4): unique transitions count: 1765
pnml2lts-mc( 0/ 4): - self-loop count: 50
pnml2lts-mc( 0/ 4): - claim dead count: 27
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 185
pnml2lts-mc( 0/ 4): - cum. max stack depth: 115
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 185 states 1841 transitions, fanout: 9.951
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 18500, Transitions per second: 184100
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, 18.0 B/state, compr.: 10.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 501 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 DNAwalker-PT-17redondantChoiceL-LTLFireability-09
ltl formula formula --ltl=/tmp/412/ltl_9_
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 43 places, 490 transitions and 1438 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-17redondantChoiceL analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/412/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/412/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/412/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/412/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 77 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 44, there are 498 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 ~25!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 69
pnml2lts-mc( 0/ 4): unique states count: 158
pnml2lts-mc( 0/ 4): unique transitions count: 1669
pnml2lts-mc( 0/ 4): - self-loop count: 72
pnml2lts-mc( 0/ 4): - claim dead count: 76
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 161
pnml2lts-mc( 0/ 4): - cum. max stack depth: 94
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 161 states 1817 transitions, fanout: 11.286
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 16100, Transitions per second: 181700
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, 18.0 B/state, compr.: 10.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 501 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 DNAwalker-PT-17redondantChoiceL-LTLFireability-10
ltl formula formula --ltl=/tmp/412/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 43 places, 490 transitions and 1438 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-17redondantChoiceL analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/412/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/412/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/412/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/412/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 77 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 44, there are 496 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 ~12!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 38
pnml2lts-mc( 0/ 4): unique transitions count: 818
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: 41
pnml2lts-mc( 0/ 4): - cum. max stack depth: 41
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 41 states 894 transitions, fanout: 21.805
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
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, 18.4 B/state, compr.: 10.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 501 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 DNAwalker-PT-17redondantChoiceL-LTLFireability-11
ltl formula formula --ltl=/tmp/412/ltl_11_
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 43 places, 490 transitions and 1438 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-17redondantChoiceL analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.000 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/412/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/412/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/412/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/412/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 78 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 44, there are 499 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 ~17!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 55
pnml2lts-mc( 0/ 4): unique transitions count: 932
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 59
pnml2lts-mc( 0/ 4): - cum. max stack depth: 58
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 59 states 1030 transitions, fanout: 17.458
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5900, Transitions per second: 103000
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, 18.8 B/state, compr.: 10.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 501 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 DNAwalker-PT-17redondantChoiceL-LTLFireability-12
ltl formula formula --ltl=/tmp/412/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 43 places, 490 transitions and 1438 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-17redondantChoiceL analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.030 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/412/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/412/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/412/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/412/ltl_12_
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 78 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 44, there are 495 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 ~17!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 51
pnml2lts-mc( 0/ 4): unique transitions count: 988
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: 54
pnml2lts-mc( 0/ 4): - cum. max stack depth: 54
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 54 states 1064 transitions, fanout: 19.704
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5400, Transitions per second: 106400
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, 18.9 B/state, compr.: 10.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 501 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 DNAwalker-PT-17redondantChoiceL-LTLFireability-13
ltl formula formula --ltl=/tmp/412/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 43 places, 490 transitions and 1438 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-17redondantChoiceL analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/412/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/412/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/412/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/412/ltl_13_
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 78 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 44, there are 499 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 ~17!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 55
pnml2lts-mc( 0/ 4): unique transitions count: 943
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 59
pnml2lts-mc( 0/ 4): - cum. max stack depth: 59
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 59 states 1041 transitions, fanout: 17.644
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
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, 19.2 B/state, compr.: 10.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 501 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 DNAwalker-PT-17redondantChoiceL-LTLFireability-14
ltl formula formula --ltl=/tmp/412/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 43 places, 490 transitions and 1438 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-17redondantChoiceL analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/412/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/412/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/412/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/412/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 77 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 44, there are 494 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): ~36 levels ~10000 states ~24576 transitions
pnml2lts-mc( 0/ 4): ~36 levels ~20000 states ~53608 transitions
pnml2lts-mc( 0/ 4): ~36 levels ~40000 states ~120100 transitions
pnml2lts-mc( 0/ 4): ~36 levels ~80000 states ~245156 transitions
pnml2lts-mc( 0/ 4): ~36 levels ~160000 states ~522244 transitions
pnml2lts-mc( 0/ 4): ~36 levels ~320000 states ~1066252 transitions
pnml2lts-mc( 0/ 4): ~36 levels ~640000 states ~2248632 transitions
pnml2lts-mc( 0/ 4): ~36 levels ~1280000 states ~4854880 transitions
pnml2lts-mc( 0/ 4): ~36 levels ~2560000 states ~10221000 transitions
pnml2lts-mc( 0/ 4): ~36 levels ~5120000 states ~22250520 transitions
pnml2lts-mc( 0/ 4): ~36 levels ~10240000 states ~47424380 transitions
pnml2lts-mc( 1/ 4): ~37 levels ~20480000 states ~96659020 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33553129
pnml2lts-mc( 0/ 4): unique states count: 33553223
pnml2lts-mc( 0/ 4): unique transitions count: 190737383
pnml2lts-mc( 0/ 4): - self-loop count: 5021041
pnml2lts-mc( 0/ 4): - claim dead count: 152161945
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33553226
pnml2lts-mc( 0/ 4): - cum. max stack depth: 148
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33553226 states 190737457 transitions, fanout: 5.685
pnml2lts-mc( 0/ 4): Total exploration time 185.410 sec (185.310 sec minimum, 185.340 sec on average)
pnml2lts-mc( 0/ 4): States per second: 180968, Transitions per second: 1028733
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 258.1MB, 8.1 B/state, compr.: 4.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/3.0%
pnml2lts-mc( 0/ 4): Stored 501 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 258.1MB (~256.0MB paged-in)
ltl formula name DNAwalker-PT-17redondantChoiceL-LTLFireability-15
ltl formula formula --ltl=/tmp/412/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 43 places, 490 transitions and 1438 arcs
pnml2lts-mc( 0/ 4): Petri net DNAwalker-PT-17redondantChoiceL analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/412/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/412/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/412/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/412/ltl_15_
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 78 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 44, there are 495 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 ~10!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 40
pnml2lts-mc( 0/ 4): unique transitions count: 909
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: 43
pnml2lts-mc( 0/ 4): - cum. max stack depth: 43
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 43 states 985 transitions, fanout: 22.907
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
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, 18.0 B/state, compr.: 10.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 501 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="DNAwalker-PT-17redondantChoiceL"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsmin"
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 ltsmin"
echo " Input is DNAwalker-PT-17redondantChoiceL, 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 r483-smll-171624276100500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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