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.r463-smll-171620117900140.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 ASLink-PT-09a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r463-smll-171620117900140
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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 3.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K 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.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:23 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 839K 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 ASLink-PT-09a-LTLFireability-00
FORMULA_NAME ASLink-PT-09a-LTLFireability-01
FORMULA_NAME ASLink-PT-09a-LTLFireability-02
FORMULA_NAME ASLink-PT-09a-LTLFireability-03
FORMULA_NAME ASLink-PT-09a-LTLFireability-04
FORMULA_NAME ASLink-PT-09a-LTLFireability-05
FORMULA_NAME ASLink-PT-09a-LTLFireability-06
FORMULA_NAME ASLink-PT-09a-LTLFireability-07
FORMULA_NAME ASLink-PT-09a-LTLFireability-08
FORMULA_NAME ASLink-PT-09a-LTLFireability-09
FORMULA_NAME ASLink-PT-09a-LTLFireability-10
FORMULA_NAME ASLink-PT-09a-LTLFireability-11
FORMULA_NAME ASLink-PT-09a-LTLFireability-12
FORMULA_NAME ASLink-PT-09a-LTLFireability-13
FORMULA_NAME ASLink-PT-09a-LTLFireability-14
FORMULA_NAME ASLink-PT-09a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717208706380

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

BK_STOP 1717210281636

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

mcc2024
ltl formula name ASLink-PT-09a-LTLFireability-00
ltl formula formula --ltl=/tmp/411/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 1991 places, 2919 transitions and 10953 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-09a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.380 real 0.080 user 0.150 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/411/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/411/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/411/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/411/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 1992 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1992, there are 2927 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, 88.0 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2976 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 ASLink-PT-09a-LTLFireability-01
ltl formula formula --ltl=/tmp/411/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 1991 places, 2919 transitions and 10953 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-09a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.360 real 0.090 user 0.140 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/411/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/411/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/411/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/411/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 1992 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1992, there are 2926 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): ~184 levels ~10000 states ~46520 transitions
pnml2lts-mc( 3/ 4): ~184 levels ~20000 states ~91224 transitions
pnml2lts-mc( 3/ 4): ~184 levels ~40000 states ~188892 transitions
pnml2lts-mc( 3/ 4): ~184 levels ~80000 states ~382888 transitions
pnml2lts-mc( 3/ 4): ~184 levels ~160000 states ~782244 transitions
pnml2lts-mc( 3/ 4): ~184 levels ~320000 states ~1629196 transitions
pnml2lts-mc( 3/ 4): ~216 levels ~640000 states ~3337572 transitions
ltl formula name ASLink-PT-09a-LTLFireability-02
ltl formula formula --ltl=/tmp/411/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 1991 places, 2919 transitions and 10953 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-09a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.430 real 0.130 user 0.120 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/411/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/411/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/411/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/411/ltl_2_
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 1993 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1992, there are 2922 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): ~229 levels ~10000 states ~39700 transitions
pnml2lts-mc( 0/ 4): ~229 levels ~20000 states ~81684 transitions
pnml2lts-mc( 0/ 4): ~229 levels ~40000 states ~163492 transitions
pnml2lts-mc( 0/ 4): ~229 levels ~80000 states ~363684 transitions
pnml2lts-mc( 1/ 4): ~16829 levels ~160000 states ~802664 transitions
pnml2lts-mc( 2/ 4): ~182 levels ~320000 states ~1606144 transitions
pnml2lts-mc( 1/ 4): ~48251 levels ~640000 states ~3105956 transitions
ltl formula name ASLink-PT-09a-LTLFireability-03
ltl formula formula --ltl=/tmp/411/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 1991 places, 2919 transitions and 10953 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-09a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.470 real 0.070 user 0.190 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/411/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/411/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/411/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/411/ltl_3_
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 1993 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1992, there are 2920 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 ~113!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 18
pnml2lts-mc( 0/ 4): unique states count: 448
pnml2lts-mc( 0/ 4): unique transitions count: 6553
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 11
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 454
pnml2lts-mc( 0/ 4): - cum. max stack depth: 439
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 454 states 6710 transitions, fanout: 14.780
pnml2lts-mc( 0/ 4): Total exploration time 0.130 sec (0.130 sec minimum, 0.130 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3492, Transitions per second: 51615
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 20.0 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2976 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name ASLink-PT-09a-LTLFireability-04
ltl formula formula --ltl=/tmp/411/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 1991 places, 2919 transitions and 10953 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-09a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.350 real 0.130 user 0.090 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/411/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/411/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/411/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/411/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 1992 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1992, there are 2934 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 ~99!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 369
pnml2lts-mc( 0/ 4): unique transitions count: 6044
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: 376
pnml2lts-mc( 0/ 4): - cum. max stack depth: 376
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 376 states 6248 transitions, fanout: 16.617
pnml2lts-mc( 0/ 4): Total exploration time 0.120 sec (0.120 sec minimum, 0.120 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3133, Transitions per second: 52067
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 20.7 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2976 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name ASLink-PT-09a-LTLFireability-05
ltl formula formula --ltl=/tmp/411/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 1991 places, 2919 transitions and 10953 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-09a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.350 real 0.090 user 0.120 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/411/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/411/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/411/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/411/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 1992 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1992, there are 2933 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 ~124!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 469
pnml2lts-mc( 0/ 4): unique transitions count: 16583
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: 475
pnml2lts-mc( 0/ 4): - cum. max stack depth: 475
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 475 states 16890 transitions, fanout: 35.558
pnml2lts-mc( 0/ 4): Total exploration time 0.190 sec (0.190 sec minimum, 0.190 sec on average)
pnml2lts-mc( 0/ 4): States per second: 2500, Transitions per second: 88895
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 15.2 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2976 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name ASLink-PT-09a-LTLFireability-06
ltl formula formula --ltl=/tmp/411/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 1991 places, 2919 transitions and 10953 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-09a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.330 real 0.090 user 0.140 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/411/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/411/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/411/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/411/ltl_6_
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 1993 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1992, there are 2923 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): ~125 levels ~10000 states ~44688 transitions
pnml2lts-mc( 0/ 4): ~125 levels ~20000 states ~90356 transitions
pnml2lts-mc( 0/ 4): ~125 levels ~40000 states ~195152 transitions
pnml2lts-mc( 0/ 4): ~125 levels ~80000 states ~418252 transitions
pnml2lts-mc( 0/ 4): ~125 levels ~160000 states ~904920 transitions
pnml2lts-mc( 0/ 4): ~125 levels ~320000 states ~1900180 transitions
pnml2lts-mc( 0/ 4): ~125 levels ~640000 states ~4114232 transitions
ltl formula name ASLink-PT-09a-LTLFireability-07
ltl formula formula --ltl=/tmp/411/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 1991 places, 2919 transitions and 10953 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-09a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.470 real 0.110 user 0.120 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/411/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/411/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/411/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/411/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 1992 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1992, there are 2925 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): ~274 levels ~10000 states ~58124 transitions
pnml2lts-mc( 2/ 4): ~274 levels ~20000 states ~100508 transitions
pnml2lts-mc( 2/ 4): ~274 levels ~40000 states ~198964 transitions
pnml2lts-mc( 2/ 4): ~274 levels ~80000 states ~399764 transitions
pnml2lts-mc( 3/ 4): ~210 levels ~160000 states ~736084 transitions
pnml2lts-mc( 3/ 4): ~210 levels ~320000 states ~1587660 transitions
pnml2lts-mc( 3/ 4): ~210 levels ~640000 states ~3445516 transitions
ltl formula name ASLink-PT-09a-LTLFireability-08
ltl formula formula --ltl=/tmp/411/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 1991 places, 2919 transitions and 10953 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-09a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.480 real 0.140 user 0.110 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/411/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/411/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/411/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/411/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 1992 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1992, there are 2930 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 ~137!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 581
pnml2lts-mc( 0/ 4): unique transitions count: 8093
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: 587
pnml2lts-mc( 0/ 4): - cum. max stack depth: 587
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 587 states 8250 transitions, fanout: 14.055
pnml2lts-mc( 0/ 4): Total exploration time 0.170 sec (0.170 sec minimum, 0.170 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3453, Transitions per second: 48529
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 21.1 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2976 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name ASLink-PT-09a-LTLFireability-09
ltl formula formula --ltl=/tmp/411/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 1991 places, 2919 transitions and 10953 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-09a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.340 real 0.100 user 0.110 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/411/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/411/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/411/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/411/ltl_9_
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 1993 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1992, there are 2922 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): ~309 levels ~10000 states ~42184 transitions
pnml2lts-mc( 1/ 4): ~309 levels ~20000 states ~86860 transitions
pnml2lts-mc( 1/ 4): ~309 levels ~40000 states ~187432 transitions
pnml2lts-mc( 1/ 4): ~309 levels ~80000 states ~380692 transitions
pnml2lts-mc( 1/ 4): ~309 levels ~160000 states ~755644 transitions
pnml2lts-mc( 1/ 4): ~328 levels ~320000 states ~1563544 transitions
pnml2lts-mc( 1/ 4): ~328 levels ~640000 states ~3135804 transitions
ltl formula name ASLink-PT-09a-LTLFireability-10
ltl formula formula --ltl=/tmp/411/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 1991 places, 2919 transitions and 10953 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-09a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.500 real 0.100 user 0.140 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/411/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/411/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/411/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/411/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 1992 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1992, there are 2937 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): ~261 levels ~10000 states ~40592 transitions
pnml2lts-mc( 1/ 4): ~261 levels ~20000 states ~77144 transitions
pnml2lts-mc( 3/ 4): ~290 levels ~40000 states ~166520 transitions
pnml2lts-mc( 1/ 4): ~261 levels ~80000 states ~321904 transitions
pnml2lts-mc( 0/ 4): ~304 levels ~160000 states ~751504 transitions
pnml2lts-mc( 1/ 4): ~261 levels ~320000 states ~1511208 transitions
pnml2lts-mc( 1/ 4): ~261 levels ~640000 states ~3319664 transitions
ltl formula name ASLink-PT-09a-LTLFireability-11
ltl formula formula --ltl=/tmp/411/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 1991 places, 2919 transitions and 10953 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-09a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.520 real 0.100 user 0.150 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/411/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/411/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/411/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/411/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 1992 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1992, there are 2929 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): ~2500 levels ~10000 states ~58452 transitions
pnml2lts-mc( 1/ 4): ~251 levels ~20000 states ~84912 transitions
pnml2lts-mc( 1/ 4): ~251 levels ~40000 states ~173464 transitions
pnml2lts-mc( 1/ 4): ~251 levels ~80000 states ~385812 transitions
pnml2lts-mc( 1/ 4): ~251 levels ~160000 states ~824580 transitions
pnml2lts-mc( 3/ 4): ~129 levels ~320000 states ~1986800 transitions
pnml2lts-mc( 1/ 4): ~251 levels ~640000 states ~3524776 transitions
ltl formula name ASLink-PT-09a-LTLFireability-12
ltl formula formula --ltl=/tmp/411/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 1991 places, 2919 transitions and 10953 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-09a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.490 real 0.120 user 0.120 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/411/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/411/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/411/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/411/ltl_12_
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 1993 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1992, there are 2926 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 ~126!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 501
pnml2lts-mc( 0/ 4): unique transitions count: 7356
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: 507
pnml2lts-mc( 0/ 4): - cum. max stack depth: 507
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 507 states 7513 transitions, fanout: 14.819
pnml2lts-mc( 0/ 4): Total exploration time 0.150 sec (0.150 sec minimum, 0.150 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3380, Transitions per second: 50087
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 21.3 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2976 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name ASLink-PT-09a-LTLFireability-13
ltl formula formula --ltl=/tmp/411/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 1991 places, 2919 transitions and 10953 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-09a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.340 real 0.130 user 0.090 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/411/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/411/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/411/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/411/ltl_13_
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 1993 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1992, there are 2922 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: 52
pnml2lts-mc( 0/ 4): unique states count: 52
pnml2lts-mc( 0/ 4): unique transitions count: 51
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 102
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 72
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 72 states 208 transitions, fanout: 2.889
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: 3600, Transitions per second: 10400
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, 93.5 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2976 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 ASLink-PT-09a-LTLFireability-14
ltl formula formula --ltl=/tmp/411/ltl_14_
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 1991 places, 2919 transitions and 10953 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-09a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.370 real 0.110 user 0.110 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/411/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/411/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/411/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/411/ltl_14_
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 1993 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1992, there are 2930 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 ~244!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 921
pnml2lts-mc( 0/ 4): unique transitions count: 10934
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: 927
pnml2lts-mc( 0/ 4): - cum. max stack depth: 927
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 927 states 11091 transitions, fanout: 11.964
pnml2lts-mc( 0/ 4): Total exploration time 0.270 sec (0.270 sec minimum, 0.270 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3433, Transitions per second: 41078
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 21.1 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2976 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name ASLink-PT-09a-LTLFireability-15
ltl formula formula --ltl=/tmp/411/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
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 1991 places, 2919 transitions and 10953 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-09a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.340 real 0.090 user 0.130 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/411/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/411/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/411/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/411/ltl_15_
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 1993 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1992, there are 2922 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 ~109!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 427
pnml2lts-mc( 0/ 4): unique transitions count: 5707
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: 433
pnml2lts-mc( 0/ 4): - cum. max stack depth: 433
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 433 states 5867 transitions, fanout: 13.550
pnml2lts-mc( 0/ 4): Total exploration time 0.140 sec (0.130 sec minimum, 0.132 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3093, Transitions per second: 41907
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 21.3 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2976 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~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="ASLink-PT-09a"
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 ASLink-PT-09a, 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 r463-smll-171620117900140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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