fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution of r183kn-smll-146444119700276
Last Updated
June 30, 2016

About the Execution of LTSMin for S_ResAllocation-PT-R003C002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
107.700 750.00 40.00 0.00 FFFFFFTFFFFFTFFF normal

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)
..............
=====================================================================
Generated by BenchKit 2-2979
Executing tool ltsmin
Input is S_ResAllocation-PT-R003C002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r183kn-smll-146444119700276
=====================================================================


--------------------
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 ResAllocation-PT-R003C002-LTLFireability-0
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-1
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-10
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-11
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-12
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-13
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-14
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-15
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-2
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-3
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-4
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-5
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-6
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-7
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-8
FORMULA_NAME ResAllocation-PT-R003C002-LTLFireability-9

=== Now, execution of the tool begins

BK_START 1464533292709

FORMULA ResAllocation-PT-R003C002-LTLFireability-0 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA ResAllocation-PT-R003C002-LTLFireability-1 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA ResAllocation-PT-R003C002-LTLFireability-2 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA ResAllocation-PT-R003C002-LTLFireability-3 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA ResAllocation-PT-R003C002-LTLFireability-4 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA ResAllocation-PT-R003C002-LTLFireability-5 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA ResAllocation-PT-R003C002-LTLFireability-6 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA ResAllocation-PT-R003C002-LTLFireability-7 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA ResAllocation-PT-R003C002-LTLFireability-8 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA ResAllocation-PT-R003C002-LTLFireability-9 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA ResAllocation-PT-R003C002-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA ResAllocation-PT-R003C002-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA ResAllocation-PT-R003C002-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA ResAllocation-PT-R003C002-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA ResAllocation-PT-R003C002-LTLFireability-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA ResAllocation-PT-R003C002-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING

BK_STOP 1464533293459

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

ltl formula name ResAllocation-PT-R003C002-LTLFireability-0
ltl formula formula --ltl=/tmp/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 1/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Loading Petri net took 0.000 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_0_
pnml2lts-mc( 3/ 4): Loading Petri net took 0.000 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): Loading Petri net took 0.000 real 0.000 user 0.020 sys
pnml2lts-mc( 1/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 13 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 13, there are 22 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 ~5!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2
pnml2lts-mc( 0/ 4): unique states count: 13
pnml2lts-mc( 0/ 4): unique transitions count: 27
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 22
pnml2lts-mc( 0/ 4): - cum. max stack depth: 19
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 22 states 53 transitions, fanout: 2.409
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 19.5 B/state, compr.: 36.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 13 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)
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name ResAllocation-PT-R003C002-LTLFireability-1
ltl formula formula --ltl=/tmp/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 1/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_1_
pnml2lts-mc( 0/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Loading Petri net took 0.020 real 0.030 user 0.000 sys
pnml2lts-mc( 1/ 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 14 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 13, there are 10 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 ~5!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 8
pnml2lts-mc( 0/ 4): unique transitions count: 15
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: 14
pnml2lts-mc( 0/ 4): - cum. max stack depth: 14
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 14 states 32 transitions, fanout: 2.286
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, 25.3 B/state, compr.: 46.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 13 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)
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name ResAllocation-PT-R003C002-LTLFireability-2
ltl formula formula --ltl=/tmp/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 1/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/ltl_2_
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 13 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 13, there are 12 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 ~5!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 7
pnml2lts-mc( 0/ 4): unique transitions count: 12
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 17
pnml2lts-mc( 0/ 4): - cum. max stack depth: 17
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 17 states 34 transitions, fanout: 2.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, 25.3 B/state, compr.: 46.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 13 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)
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name ResAllocation-PT-R003C002-LTLFireability-3
ltl formula formula --ltl=/tmp/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 1/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_3_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 13 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 13, there are 32 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 ~6!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 14
pnml2lts-mc( 0/ 4): unique transitions count: 32
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 22
pnml2lts-mc( 0/ 4): - cum. max stack depth: 22
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 22 states 54 transitions, fanout: 2.455
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, 21.8 B/state, compr.: 40.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 13 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)
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name ResAllocation-PT-R003C002-LTLFireability-4
ltl formula formula --ltl=/tmp/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 3/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 1/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/ltl_4_
pnml2lts-mc( 1/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 14 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 13, there are 15 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 ~6!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 12
pnml2lts-mc( 0/ 4): unique transitions count: 22
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 23
pnml2lts-mc( 0/ 4): - cum. max stack depth: 21
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 23 states 46 transitions, fanout: 2.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, 21.1 B/state, compr.: 39.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 13 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)
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name ResAllocation-PT-R003C002-LTLFireability-5
ltl formula formula --ltl=/tmp/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 1/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/ltl_5_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 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 14 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 13, there are 10 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 ~5!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 8
pnml2lts-mc( 0/ 4): unique transitions count: 16
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: 20
pnml2lts-mc( 0/ 4): - cum. max stack depth: 20
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 20 states 47 transitions, fanout: 2.350
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, 24.7 B/state, compr.: 45.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 13 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)
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name ResAllocation-PT-R003C002-LTLFireability-6
ltl formula formula --ltl=/tmp/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 1/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_6_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 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 14 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 13, there are 9 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, 48.0 B/state, compr.: 88.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 13 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)
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name ResAllocation-PT-R003C002-LTLFireability-7
ltl formula formula --ltl=/tmp/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 1/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/ltl_7_
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): Loading Petri net took 0.000 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 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 14 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 13, there are 11 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 ~5!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2
pnml2lts-mc( 0/ 4): unique states count: 13
pnml2lts-mc( 0/ 4): unique transitions count: 30
pnml2lts-mc( 0/ 4): - self-loop count: 5
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 24
pnml2lts-mc( 0/ 4): - cum. max stack depth: 21
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 24 states 53 transitions, fanout: 2.208
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 18.8 B/state, compr.: 34.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 13 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)
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name ResAllocation-PT-R003C002-LTLFireability-8
ltl formula formula --ltl=/tmp/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 3/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 1/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_8_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 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 14 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 13, there are 9 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 ~5!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2
pnml2lts-mc( 0/ 4): unique states count: 10
pnml2lts-mc( 0/ 4): unique transitions count: 15
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 2
pnml2lts-mc( 0/ 4): - claim success count: 22
pnml2lts-mc( 0/ 4): - cum. max stack depth: 18
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 22 states 42 transitions, fanout: 1.909
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, 24.7 B/state, compr.: 45.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 13 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)
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name ResAllocation-PT-R003C002-LTLFireability-9
ltl formula formula --ltl=/tmp/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 1/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_9_
pnml2lts-mc( 2/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Loading Petri net took 0.020 real 0.020 user 0.000 sys
pnml2lts-mc( 1/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 14 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 13, there are 14 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 ~5!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 11
pnml2lts-mc( 0/ 4): unique transitions count: 19
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 20
pnml2lts-mc( 0/ 4): - cum. max stack depth: 20
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 20 states 42 transitions, fanout: 2.100
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, 23.5 B/state, compr.: 43.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 13 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)
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name ResAllocation-PT-R003C002-LTLFireability-10
ltl formula formula --ltl=/tmp/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 1/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_10_
pnml2lts-mc( 1/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): Loading Petri net took 0.010 real 0.010 user 0.000 sys
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 14 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 13, there are 11 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 ~6!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3
pnml2lts-mc( 0/ 4): unique states count: 16
pnml2lts-mc( 0/ 4): unique transitions count: 34
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 23
pnml2lts-mc( 0/ 4): - cum. max stack depth: 19
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 23 states 53 transitions, fanout: 2.304
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 18.6 B/state, compr.: 34.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 13 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)
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name ResAllocation-PT-R003C002-LTLFireability-11
ltl formula formula --ltl=/tmp/ltl_11_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 1/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_11_
pnml2lts-mc( 3/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): Loading Petri net took 0.000 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 13 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 13, there are 20 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 ~7!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 12
pnml2lts-mc( 0/ 4): unique transitions count: 25
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: 28
pnml2lts-mc( 0/ 4): - cum. max stack depth: 28
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 28 states 61 transitions, fanout: 2.179
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, 22.3 B/state, compr.: 41.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 13 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)
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name ResAllocation-PT-R003C002-LTLFireability-12
ltl formula formula --ltl=/tmp/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 1/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_12_
pnml2lts-mc( 3/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Loading Petri net took 0.010 real 0.020 user 0.000 sys
pnml2lts-mc( 1/ 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 14 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 13, there are 11 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 ~5!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 10
pnml2lts-mc( 0/ 4): unique transitions count: 17
pnml2lts-mc( 0/ 4): - self-loop count: 3
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 18
pnml2lts-mc( 0/ 4): - cum. max stack depth: 18
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 18 states 35 transitions, fanout: 1.944
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1800, Transitions per second: 3500
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, 23.4 B/state, compr.: 43.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 13 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)
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name ResAllocation-PT-R003C002-LTLFireability-13
ltl formula formula --ltl=/tmp/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 1/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_13_
pnml2lts-mc( 3/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 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 14 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 13, there are 9 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 ~5!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 10
pnml2lts-mc( 0/ 4): unique transitions count: 17
pnml2lts-mc( 0/ 4): - self-loop count: 3
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 19
pnml2lts-mc( 0/ 4): - cum. max stack depth: 19
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 19 states 37 transitions, fanout: 1.947
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, 20.3 B/state, compr.: 37.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 13 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)
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name ResAllocation-PT-R003C002-LTLFireability-14
ltl formula formula --ltl=/tmp/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 3/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 1/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_14_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 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 14 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 13, there are 9 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, 48.0 B/state, compr.: 88.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 13 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)
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name ResAllocation-PT-R003C002-LTLFireability-15
ltl formula formula --ltl=/tmp/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 1/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_15_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): Petri net has 12 places, 8 transitions and 30 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Loading Petri net took 0.000 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 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 14 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 13, there are 19 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 ~5!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 11
pnml2lts-mc( 0/ 4): unique transitions count: 18
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 21
pnml2lts-mc( 0/ 4): - cum. max stack depth: 19
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 21 states 41 transitions, fanout: 1.952
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, 22.4 B/state, compr.: 41.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 13 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)
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1

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="S_ResAllocation-PT-R003C002"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsmin"
export BK_RESULT_DIR="/root/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/S_ResAllocation-PT-R003C002.tgz
mv S_ResAllocation-PT-R003C002 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool ltsmin"
echo " Input is S_ResAllocation-PT-R003C002, 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 r183kn-smll-146444119700276"
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 ;