Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..........................
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 27K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 41K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 248K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool ltsmin
Input is Peterson-PT-3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r257-csrt-152732583500162
=====================================================================

--------------------
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 Peterson-PT-3-LTLFireability-00
FORMULA_NAME Peterson-PT-3-LTLFireability-01
FORMULA_NAME Peterson-PT-3-LTLFireability-02
FORMULA_NAME Peterson-PT-3-LTLFireability-03
FORMULA_NAME Peterson-PT-3-LTLFireability-04
FORMULA_NAME Peterson-PT-3-LTLFireability-05
FORMULA_NAME Peterson-PT-3-LTLFireability-06
FORMULA_NAME Peterson-PT-3-LTLFireability-07
FORMULA_NAME Peterson-PT-3-LTLFireability-08
FORMULA_NAME Peterson-PT-3-LTLFireability-09
FORMULA_NAME Peterson-PT-3-LTLFireability-10
FORMULA_NAME Peterson-PT-3-LTLFireability-11
FORMULA_NAME Peterson-PT-3-LTLFireability-12
FORMULA_NAME Peterson-PT-3-LTLFireability-13
FORMULA_NAME Peterson-PT-3-LTLFireability-14
FORMULA_NAME Peterson-PT-3-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1527450631407

FORMULA Peterson-PT-3-LTLFireability-00 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-LTLFireability-01 CANNOT_COMPUTE
FORMULA Peterson-PT-3-LTLFireability-02 CANNOT_COMPUTE
FORMULA Peterson-PT-3-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-LTLFireability-04 CANNOT_COMPUTE
FORMULA Peterson-PT-3-LTLFireability-05 CANNOT_COMPUTE
FORMULA Peterson-PT-3-LTLFireability-06 CANNOT_COMPUTE
FORMULA Peterson-PT-3-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-3-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1527451955606

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

mcc2018
ltl formula name Peterson-PT-3-LTLFireability-00
ltl formula formula --ltl=/tmp/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 244 places, 332 transitions and 1016 arcs
pnml2lts-mc( 0/ 4): Petri net Peterson-PT-3 analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.080 sys
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 246 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 245, there are 334 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 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): 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, 168.0 B/state, compr.: 17.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 337 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 (~8192.0MB paged-in)
ltl formula name Peterson-PT-3-LTLFireability-01
ltl formula formula --ltl=/tmp/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 244 places, 332 transitions and 1016 arcs
pnml2lts-mc( 0/ 4): Petri net Peterson-PT-3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.040 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/ltl_1_
ltl formula name Peterson-PT-3-LTLFireability-02
ltl formula formula --ltl=/tmp/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 244 places, 332 transitions and 1016 arcs
pnml2lts-mc( 0/ 4): Petri net Peterson-PT-3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/ltl_2_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.190 user 0.080 sys
ltl formula name Peterson-PT-3-LTLFireability-03
ltl formula formula --ltl=/tmp/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 244 places, 332 transitions and 1016 arcs
pnml2lts-mc( 0/ 4): Petri net Peterson-PT-3 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.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_3_
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 246 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 245, there are 335 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~23!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 44
pnml2lts-mc( 0/ 4): unique transitions count: 336
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 2
pnml2lts-mc( 0/ 4): - claim success count: 47
pnml2lts-mc( 0/ 4): - cum. max stack depth: 47
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 47 states 364 transitions, fanout: 7.745
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.000 sec minimum, 0.007 sec on average)
pnml2lts-mc( 0/ 4): States per second: 2350, Transitions per second: 18200
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, 29.6 B/state, compr.: 3.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 337 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 (~8192.0MB paged-in)
ltl formula name Peterson-PT-3-LTLFireability-04
ltl formula formula --ltl=/tmp/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 244 places, 332 transitions and 1016 arcs
pnml2lts-mc( 0/ 4): Petri net Peterson-PT-3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_4_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.020 user 0.160 sys
ltl formula name Peterson-PT-3-LTLFireability-05
ltl formula formula --ltl=/tmp/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 244 places, 332 transitions and 1016 arcs
pnml2lts-mc( 0/ 4): Petri net Peterson-PT-3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.040 user 0.140 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/ltl_5_
ltl formula name Peterson-PT-3-LTLFireability-06
ltl formula formula --ltl=/tmp/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 244 places, 332 transitions and 1016 arcs
pnml2lts-mc( 0/ 4): Petri net Peterson-PT-3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.080 user 0.130 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_6_
ltl formula name Peterson-PT-3-LTLFireability-07
ltl formula formula --ltl=/tmp/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 244 places, 332 transitions and 1016 arcs
pnml2lts-mc( 0/ 4): Petri net Peterson-PT-3 analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_7_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.040 user 0.180 sys
pnml2lts-mc( 0/ 4): There are 245 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 245, there are 362 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 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 ~10!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 30
pnml2lts-mc( 0/ 4): unique transitions count: 232
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 36
pnml2lts-mc( 0/ 4): - cum. max stack depth: 36
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 36 states 272 transitions, fanout: 7.556
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.020 sec minimum, 0.025 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1200, Transitions per second: 9067
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, 33.6 B/state, compr.: 3.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 337 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 (~8192.0MB paged-in)
ltl formula name Peterson-PT-3-LTLFireability-08
ltl formula formula --ltl=/tmp/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 244 places, 332 transitions and 1016 arcs
pnml2lts-mc( 0/ 4): Petri net Peterson-PT-3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.030 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_8_
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 246 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 245, there are 333 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 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 ~21!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 41
pnml2lts-mc( 0/ 4): unique transitions count: 164
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 45
pnml2lts-mc( 0/ 4): - cum. max stack depth: 45
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 45 states 184 transitions, fanout: 4.089
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, 38.5 B/state, compr.: 3.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 337 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 (~8192.0MB paged-in)
ltl formula name Peterson-PT-3-LTLFireability-09
ltl formula formula --ltl=/tmp/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 244 places, 332 transitions and 1016 arcs
pnml2lts-mc( 0/ 4): Petri net Peterson-PT-3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_9_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.030 user 0.040 sys
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 246 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 245, there are 334 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 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 ~14!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 49
pnml2lts-mc( 0/ 4): unique transitions count: 196
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
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 224 transitions, fanout: 4.073
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.030 sec minimum, 0.035 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1375, Transitions per second: 5600
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, 38.2 B/state, compr.: 3.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 337 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 (~8192.0MB paged-in)
ltl formula name Peterson-PT-3-LTLFireability-10
ltl formula formula --ltl=/tmp/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 244 places, 332 transitions and 1016 arcs
pnml2lts-mc( 0/ 4): Petri net Peterson-PT-3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/ltl_10_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.100 user 0.100 sys
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 246 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 245, there are 334 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 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 ~10!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4
pnml2lts-mc( 0/ 4): unique states count: 37
pnml2lts-mc( 0/ 4): unique transitions count: 132
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 43
pnml2lts-mc( 0/ 4): - cum. max stack depth: 39
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 43 states 160 transitions, fanout: 3.721
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.010 sec minimum, 0.017 sec on average)
pnml2lts-mc( 0/ 4): States per second: 2150, Transitions per second: 8000
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, 41.0 B/state, compr.: 4.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 337 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 (~8192.0MB paged-in)
ltl formula name Peterson-PT-3-LTLFireability-11
ltl formula formula --ltl=/tmp/ltl_11_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 244 places, 332 transitions and 1016 arcs
pnml2lts-mc( 0/ 4): Petri net Peterson-PT-3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/ltl_11_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.240 real 0.540 user 0.160 sys
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 246 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 245, there are 336 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 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 ~10!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 36
pnml2lts-mc( 0/ 4): unique transitions count: 144
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 40
pnml2lts-mc( 0/ 4): - cum. max stack depth: 40
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 40 states 164 transitions, fanout: 4.100
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.020 sec minimum, 0.032 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1000, Transitions per second: 4100
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, 42.6 B/state, compr.: 4.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 337 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 (~8192.0MB paged-in)
ltl formula name Peterson-PT-3-LTLFireability-12
ltl formula formula --ltl=/tmp/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 244 places, 332 transitions and 1016 arcs
pnml2lts-mc( 0/ 4): Petri net Peterson-PT-3 analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/ltl_12_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.360 real 1.100 user 0.110 sys
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 246 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 245, there are 334 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 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 ~13!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 47
pnml2lts-mc( 0/ 4): unique transitions count: 188
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 50
pnml2lts-mc( 0/ 4): - cum. max stack depth: 50
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 50 states 204 transitions, fanout: 4.080
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.020 sec minimum, 0.032 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1000, Transitions per second: 4080
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, 40.2 B/state, compr.: 4.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 337 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 (~8192.0MB paged-in)
ltl formula name Peterson-PT-3-LTLFireability-13
ltl formula formula --ltl=/tmp/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 244 places, 332 transitions and 1016 arcs
pnml2lts-mc( 0/ 4): Petri net Peterson-PT-3 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.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/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 246 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 245, there are 345 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 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 ~21!
pnml2lts-mc( 0/ 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: 476
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 2
pnml2lts-mc( 0/ 4): - claim success count: 66
pnml2lts-mc( 0/ 4): - cum. max stack depth: 66
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 66 states 512 transitions, fanout: 7.758
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.030 sec minimum, 0.038 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1650, Transitions per second: 12800
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, 27.8 B/state, compr.: 2.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 337 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 (~8192.0MB paged-in)
ltl formula name Peterson-PT-3-LTLFireability-14
ltl formula formula --ltl=/tmp/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 244 places, 332 transitions and 1016 arcs
pnml2lts-mc( 0/ 4): Petri net Peterson-PT-3 analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/ltl_14_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.070 sys
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 246 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 245, there are 335 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 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 ~19!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 66
pnml2lts-mc( 0/ 4): unique transitions count: 512
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 2
pnml2lts-mc( 0/ 4): - claim success count: 72
pnml2lts-mc( 0/ 4): - cum. max stack depth: 72
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 72 states 564 transitions, fanout: 7.833
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.030 sec minimum, 0.045 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1200, Transitions per second: 9400
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, 27.0 B/state, compr.: 2.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 337 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 (~8192.0MB paged-in)
ltl formula name Peterson-PT-3-LTLFireability-15
ltl formula formula --ltl=/tmp/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 244 places, 332 transitions and 1016 arcs
pnml2lts-mc( 0/ 4): Petri net Peterson-PT-3 analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_15_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.240 real 0.610 user 0.130 sys
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 246 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 245, there are 334 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 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 ~10!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 35
pnml2lts-mc( 0/ 4): unique transitions count: 140
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 40
pnml2lts-mc( 0/ 4): - cum. max stack depth: 40
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 40 states 164 transitions, fanout: 4.100
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.020 sec minimum, 0.035 sec on average)
pnml2lts-mc( 0/ 4): States per second: 800, Transitions per second: 3280
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, 43.5 B/state, compr.: 4.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 337 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 (~8192.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="Peterson-PT-3"
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"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-3.tgz
mv Peterson-PT-3 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool ltsmin"
echo " Input is Peterson-PT-3, 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 r257-csrt-152732583500162"
echo "====================================================================="
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
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 ;