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 6.8M
-rw-r--r-- 1 mcc users 176K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 616K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 236K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M 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.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 94K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 318K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 65K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 281K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 184K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 618K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 163K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 735K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 50K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 130K 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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 2.1M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool ltsmin
Input is Philosophers-PT-000500, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r257-csrt-152732583600230
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527451979876

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

BK_STOP 1527453601078

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

mcc2018
ltl formula name Philosophers-PT-000500-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 2500 places, 2500 transitions and 8000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000500 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.440 real 0.330 user 0.240 sys
ltl formula name Philosophers-PT-000500-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 2500 places, 2500 transitions and 8000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000500 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 1.350 real 0.450 user 2.590 sys
ltl formula name Philosophers-PT-000500-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 2500 places, 2500 transitions and 8000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000500 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.020 real 0.250 user 1.600 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_2_
ltl formula name Philosophers-PT-000500-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 2500 places, 2500 transitions and 8000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000500 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/ltl_3_
pnml2lts-mc( 0/ 4): Loading Petri net took 1.750 real 0.710 user 3.190 sys
ltl formula name Philosophers-PT-000500-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 2500 places, 2500 transitions and 8000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000500 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/ltl_4_
pnml2lts-mc( 0/ 4): Loading Petri net took 1.990 real 1.030 user 3.970 sys
ltl formula name Philosophers-PT-000500-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 2500 places, 2500 transitions and 8000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000500 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.120 real 0.300 user 1.940 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_5_
ltl formula name Philosophers-PT-000500-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 2500 places, 2500 transitions and 8000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000500 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.040 real 0.230 user 1.750 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_6_
ltl formula name Philosophers-PT-000500-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 2500 places, 2500 transitions and 8000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000500 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/ltl_7_
pnml2lts-mc( 0/ 4): Loading Petri net took 1.250 real 0.420 user 2.670 sys
terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
ltl formula name Philosophers-PT-000500-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 2500 places, 2500 transitions and 8000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000500 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/ltl_8_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.640 real 0.200 user 1.070 sys
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 2502 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 2501, there are 2502 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.020 sec (0.000 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 200, Transitions per second: 200
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 304.0 B/state, compr.: 3.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2553 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 Philosophers-PT-000500-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 2500 places, 2500 transitions and 8000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000500 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.860 real 0.280 user 1.280 sys
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 2502 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 2501, there are 2509 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 ~113!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 553
pnml2lts-mc( 0/ 4): unique transitions count: 901976
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 235
pnml2lts-mc( 0/ 4): - claim success count: 556
pnml2lts-mc( 0/ 4): - cum. max stack depth: 556
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 556 states 904980 transitions, fanout: 1627.662
pnml2lts-mc( 0/ 4): Total exploration time 8.620 sec (8.590 sec minimum, 8.610 sec on average)
pnml2lts-mc( 0/ 4): States per second: 65, Transitions per second: 104986
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 19.7MB, 42.0 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2553 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 19.7MB (~8192.0MB paged-in)
ltl formula name Philosophers-PT-000500-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 2500 places, 2500 transitions and 8000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000500 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/ltl_10_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.780 real 0.240 user 1.490 sys
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 2502 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 2501, there are 2501 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 ~45!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 172
pnml2lts-mc( 0/ 4): unique transitions count: 164576
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: 175
pnml2lts-mc( 0/ 4): - cum. max stack depth: 175
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 175 states 167580 transitions, fanout: 957.600
pnml2lts-mc( 0/ 4): Total exploration time 2.650 sec (2.630 sec minimum, 2.638 sec on average)
pnml2lts-mc( 0/ 4): States per second: 66, Transitions per second: 63238
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 7.3MB, 46.6 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2553 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 7.3MB (~8192.0MB paged-in)
ltl formula name Philosophers-PT-000500-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 2500 places, 2500 transitions and 8000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000500 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 1.270 real 0.190 user 2.540 sys
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 2502 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 2501, there are 2504 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 ~12!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1377
pnml2lts-mc( 0/ 4): unique states count: 1412
pnml2lts-mc( 0/ 4): unique transitions count: 34661
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 1415
pnml2lts-mc( 0/ 4): - cum. max stack depth: 38
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1415 states 37665 transitions, fanout: 26.618
pnml2lts-mc( 0/ 4): Total exploration time 2.930 sec (2.890 sec minimum, 2.913 sec on average)
pnml2lts-mc( 0/ 4): States per second: 483, Transitions per second: 12855
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.5MB, 46.7 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2553 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.5MB (~8192.0MB paged-in)
ltl formula name Philosophers-PT-000500-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 2500 places, 2500 transitions and 8000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000500 analyzed
pnml2lts-mc( 2/ 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.960 real 0.380 user 1.790 sys
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 2502 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 2501, there are 2503 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 ~32!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 90
pnml2lts-mc( 0/ 4): unique transitions count: 172798
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: 93
pnml2lts-mc( 0/ 4): - cum. max stack depth: 93
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 93 states 178802 transitions, fanout: 1922.602
pnml2lts-mc( 0/ 4): Total exploration time 4.030 sec (3.930 sec minimum, 3.993 sec on average)
pnml2lts-mc( 0/ 4): States per second: 23, Transitions per second: 44368
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 5.2MB, 32.2 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2553 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 5.2MB (~8192.0MB paged-in)
ltl formula name Philosophers-PT-000500-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 2500 places, 2500 transitions and 8000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000500 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.330 real 0.230 user 0.300 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_13_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 2502 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 2501, there are 2501 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, 304.0 B/state, compr.: 3.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2553 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 Philosophers-PT-000500-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 2500 places, 2500 transitions and 8000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000500 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.210 real 0.220 user 0.270 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/ltl_14_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 2502 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 2501, there are 2502 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 ~40!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 151
pnml2lts-mc( 0/ 4): unique transitions count: 145232
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: 154
pnml2lts-mc( 0/ 4): - cum. max stack depth: 154
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 154 states 148236 transitions, fanout: 962.571
pnml2lts-mc( 0/ 4): Total exploration time 1.890 sec (1.880 sec minimum, 1.883 sec on average)
pnml2lts-mc( 0/ 4): States per second: 81, Transitions per second: 78432
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 6.4MB, 46.4 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2553 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 6.4MB (~8192.0MB paged-in)
ltl formula name Philosophers-PT-000500-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 2500 places, 2500 transitions and 8000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000500 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.680 real 0.110 user 1.230 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_15_
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 2502 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 2501, there are 2501 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.010 sec (0.000 sec minimum, 0.007 sec on average)
pnml2lts-mc( 0/ 4): States per second: 400, Transitions per second: 400
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, 304.0 B/state, compr.: 3.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2553 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="Philosophers-PT-000500"
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/Philosophers-PT-000500.tgz
mv Philosophers-PT-000500 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 Philosophers-PT-000500, 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-152732583600230"
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 ;