fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r520-tall-171662337900132
Last Updated
July 7, 2024

About the Execution of LTSMin+red for RERS17pb113-PT-3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15840.451 1150211.00 4201390.00 714.80 FFFFF?FTF?F?F?FF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r520-tall-171662337900132.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is RERS17pb113-PT-3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337900132
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 15M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RERS17pb113-PT-3-LTLFireability-00
FORMULA_NAME RERS17pb113-PT-3-LTLFireability-01
FORMULA_NAME RERS17pb113-PT-3-LTLFireability-02
FORMULA_NAME RERS17pb113-PT-3-LTLFireability-03
FORMULA_NAME RERS17pb113-PT-3-LTLFireability-04
FORMULA_NAME RERS17pb113-PT-3-LTLFireability-05
FORMULA_NAME RERS17pb113-PT-3-LTLFireability-06
FORMULA_NAME RERS17pb113-PT-3-LTLFireability-07
FORMULA_NAME RERS17pb113-PT-3-LTLFireability-08
FORMULA_NAME RERS17pb113-PT-3-LTLFireability-09
FORMULA_NAME RERS17pb113-PT-3-LTLFireability-10
FORMULA_NAME RERS17pb113-PT-3-LTLFireability-11
FORMULA_NAME RERS17pb113-PT-3-LTLFireability-12
FORMULA_NAME RERS17pb113-PT-3-LTLFireability-13
FORMULA_NAME RERS17pb113-PT-3-LTLFireability-14
FORMULA_NAME RERS17pb113-PT-3-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717223687221

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb113-PT-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:34:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:34:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:34:49] [INFO ] Load time of PNML (sax parser for PT used): 823 ms
[2024-06-01 06:34:49] [INFO ] Transformed 639 places.
[2024-06-01 06:34:49] [INFO ] Transformed 31353 transitions.
[2024-06-01 06:34:49] [INFO ] Parsed PT model containing 639 places and 31353 transitions and 125418 arcs in 1255 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 165 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA RERS17pb113-PT-3-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS17pb113-PT-3-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS17pb113-PT-3-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS17pb113-PT-3-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS17pb113-PT-3-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 639 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 639/639 places, 31353/31353 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 627 transition count 31353
Applied a total of 12 rules in 297 ms. Remains 627 /639 variables (removed 12) and now considering 31353/31353 (removed 0) transitions.
[2024-06-01 06:34:50] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2024-06-01 06:34:50] [INFO ] Computed 13 invariants in 121 ms
[2024-06-01 06:34:53] [INFO ] Implicit Places using invariants in 2406 ms returned []
Implicit Place search using SMT only with invariants took 2609 ms to find 0 implicit places.
Running 31352 sub problems to find dead transitions.
[2024-06-01 06:34:53] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2024-06-01 06:34:53] [INFO ] Invariant cache hit.
[2024-06-01 06:34:54] [INFO ] State equation strengthened by 829 read => feed constraints.
FORMULA RERS17pb113-PT-3-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA RERS17pb113-PT-3-LTLFireability-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA RERS17pb113-PT-3-LTLFireability-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA RERS17pb113-PT-3-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA RERS17pb113-PT-3-LTLFireability-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : RERS17pb113-PT-3-LTLFireability-05
FORMULA RERS17pb113-PT-3-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA RERS17pb113-PT-3-LTLFireability-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA RERS17pb113-PT-3-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : RERS17pb113-PT-3-LTLFireability-09
FORMULA RERS17pb113-PT-3-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : RERS17pb113-PT-3-LTLFireability-11
FORMULA RERS17pb113-PT-3-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : RERS17pb113-PT-3-LTLFireability-13
FORMULA RERS17pb113-PT-3-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA RERS17pb113-PT-3-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717224837432

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name RERS17pb113-PT-3-LTLFireability-00
ltl formula formula --ltl=/tmp/487/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 639 places, 31353 transitions and 125418 arcs
pnml2lts-mc( 0/ 4): Petri net RERS17pb113-PT-3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.280 real 1.150 user 1.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/487/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/487/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/487/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/487/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 641 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 640, there are 31358 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2500 levels ~10000 states ~149452 transitions
pnml2lts-mc( 2/ 4): ~5000 levels ~20000 states ~257188 transitions
pnml2lts-mc( 2/ 4): ~10000 levels ~40000 states ~465952 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~15645!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 58312
pnml2lts-mc( 0/ 4): unique transitions count: 796196
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: 58323
pnml2lts-mc( 0/ 4): - cum. max stack depth: 58323
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 58323 states 796222 transitions, fanout: 13.652
pnml2lts-mc( 0/ 4): Total exploration time 41.980 sec (41.980 sec minimum, 41.980 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1389, Transitions per second: 18967
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 30.3MB, 39.9 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 2.0%/37.0%
pnml2lts-mc( 0/ 4): Stored 32381 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 32.3MB (~258.0MB paged-in)
ltl formula name RERS17pb113-PT-3-LTLFireability-01
ltl formula formula --ltl=/tmp/487/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 639 places, 31353 transitions and 125418 arcs
pnml2lts-mc( 0/ 4): Petri net RERS17pb113-PT-3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.300 real 1.190 user 1.190 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/487/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/487/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/487/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/487/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 640 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 640, there are 31360 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2500 levels ~10000 states ~132660 transitions
pnml2lts-mc( 2/ 4): ~5000 levels ~20000 states ~179796 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~5358!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 21041
pnml2lts-mc( 0/ 4): unique transitions count: 316986
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: 21057
pnml2lts-mc( 0/ 4): - cum. max stack depth: 21057
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 21057 states 317026 transitions, fanout: 15.056
pnml2lts-mc( 0/ 4): Total exploration time 14.430 sec (14.430 sec minimum, 14.430 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1459, Transitions per second: 21970
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 12.3MB, 40.6 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/15.0%
pnml2lts-mc( 0/ 4): Stored 32381 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 14.3MB (~258.0MB paged-in)
ltl formula name RERS17pb113-PT-3-LTLFireability-02
ltl formula formula --ltl=/tmp/487/ltl_2_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 639 places, 31353 transitions and 125418 arcs
pnml2lts-mc( 0/ 4): Petri net RERS17pb113-PT-3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.190 real 1.210 user 0.960 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/487/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/487/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/487/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/487/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 640 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 640, there are 31364 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2500 levels ~10000 states ~166436 transitions
pnml2lts-mc( 1/ 4): ~5000 levels ~20000 states ~230408 transitions
pnml2lts-mc( 1/ 4): ~10000 levels ~40000 states ~347876 transitions
pnml2lts-mc( 1/ 4): ~20000 levels ~80000 states ~578668 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~33227!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 133740
pnml2lts-mc( 0/ 4): unique transitions count: 1649463
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 270
pnml2lts-mc( 0/ 4): - claim success count: 133751
pnml2lts-mc( 0/ 4): - cum. max stack depth: 133751
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 133751 states 1649489 transitions, fanout: 12.333
pnml2lts-mc( 0/ 4): Total exploration time 89.020 sec (89.010 sec minimum, 89.015 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1502, Transitions per second: 18529
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 60.3MB, 38.4 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 4.0%/74.0%
pnml2lts-mc( 0/ 4): Stored 32381 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 62.3MB (~258.0MB paged-in)
ltl formula name RERS17pb113-PT-3-LTLFireability-03
ltl formula formula --ltl=/tmp/487/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 639 places, 31353 transitions and 125418 arcs
pnml2lts-mc( 0/ 4): Petri net RERS17pb113-PT-3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.100 real 1.120 user 1.060 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/487/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/487/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/487/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/487/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 640 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 640, there are 31368 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2500 levels ~10000 states ~112148 transitions
pnml2lts-mc( 2/ 4): ~5000 levels ~20000 states ~246432 transitions
pnml2lts-mc( 2/ 4): ~10000 levels ~40000 states ~452124 transitions
pnml2lts-mc( 0/ 4): ~20000 levels ~80000 states ~1110112 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~26630!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 93319
pnml2lts-mc( 0/ 4): unique transitions count: 1187120
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: 93329
pnml2lts-mc( 0/ 4): - cum. max stack depth: 93329
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 93329 states 1187140 transitions, fanout: 12.720
pnml2lts-mc( 0/ 4): Total exploration time 71.990 sec (71.980 sec minimum, 71.985 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1296, Transitions per second: 16490
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 44.1MB, 39.0 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 3.0%/54.0%
pnml2lts-mc( 0/ 4): Stored 32381 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 46.1MB (~258.0MB paged-in)
ltl formula name RERS17pb113-PT-3-LTLFireability-04
ltl formula formula --ltl=/tmp/487/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 639 places, 31353 transitions and 125418 arcs
pnml2lts-mc( 0/ 4): Petri net RERS17pb113-PT-3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.520 real 1.170 user 1.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/487/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/487/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/487/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/487/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 640 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 640, there are 31361 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2500 levels ~10000 states ~81980 transitions
pnml2lts-mc( 3/ 4): ~5000 levels ~20000 states ~156964 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~6810!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 11
pnml2lts-mc( 0/ 4): unique states count: 26604
pnml2lts-mc( 0/ 4): unique transitions count: 323795
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: 26615
pnml2lts-mc( 0/ 4): - cum. max stack depth: 26604
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 26615 states 323824 transitions, fanout: 12.167
pnml2lts-mc( 0/ 4): Total exploration time 17.870 sec (17.870 sec minimum, 17.870 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1489, Transitions per second: 18121
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 12.2MB, 39.7 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/15.0%
pnml2lts-mc( 0/ 4): Stored 32381 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 14.2MB (~258.0MB paged-in)
ltl formula name RERS17pb113-PT-3-LTLFireability-05
ltl formula formula --ltl=/tmp/487/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 639 places, 31353 transitions and 125418 arcs
pnml2lts-mc( 0/ 4): Petri net RERS17pb113-PT-3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.290 real 1.130 user 1.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/487/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/487/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/487/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/487/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 641 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 640, there are 31361 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2500 levels ~10000 states ~118652 transitions
pnml2lts-mc( 1/ 4): ~5000 levels ~20000 states ~238672 transitions
pnml2lts-mc( 3/ 4): ~10000 levels ~40000 states ~390184 transitions
pnml2lts-mc( 3/ 4): ~20000 levels ~80000 states ~746500 transitions
pnml2lts-mc( 3/ 4): ~40000 levels ~160000 states ~1463688 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 163659
pnml2lts-mc( 0/ 4): unique transitions count: 2285773
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 24
pnml2lts-mc( 0/ 4): - claim success count: 163670
pnml2lts-mc( 0/ 4): - cum. max stack depth: 163670
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 163670 states 2285776 transitions, fanout: 13.966
pnml2lts-mc( 0/ 4): Total exploration time 109.430 sec (109.220 sec minimum, 109.312 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1496, Transitions per second: 20888
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 81.4MB, 37.4 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 6.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 32381 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 83.4MB (~258.0MB paged-in)
ltl formula name RERS17pb113-PT-3-LTLFireability-06
ltl formula formula --ltl=/tmp/487/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 639 places, 31353 transitions and 125418 arcs
pnml2lts-mc( 0/ 4): Petri net RERS17pb113-PT-3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.110 real 1.060 user 1.090 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/487/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/487/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/487/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/487/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 641 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 640, there are 31361 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2500 levels ~10000 states ~45664 transitions
pnml2lts-mc( 1/ 4): ~5000 levels ~20000 states ~86000 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~6871!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 26476
pnml2lts-mc( 0/ 4): unique transitions count: 349624
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: 26486
pnml2lts-mc( 0/ 4): - cum. max stack depth: 26486
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 26486 states 349644 transitions, fanout: 13.201
pnml2lts-mc( 0/ 4): Total exploration time 17.790 sec (17.790 sec minimum, 17.790 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1489, Transitions per second: 19654
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 13.6MB, 40.9 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 1.0%/17.0%
pnml2lts-mc( 0/ 4): Stored 32381 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 15.6MB (~258.0MB paged-in)
ltl formula name RERS17pb113-PT-3-LTLFireability-07
ltl formula formula --ltl=/tmp/487/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 639 places, 31353 transitions and 125418 arcs
pnml2lts-mc( 0/ 4): Petri net RERS17pb113-PT-3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.120 real 1.210 user 1.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/487/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/487/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/487/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/487/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 640 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 640, there are 31361 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.002 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, 400.0 B/state, compr.: 15.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 32381 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.0MB (~258.0MB paged-in)
ltl formula name RERS17pb113-PT-3-LTLFireability-08
ltl formula formula --ltl=/tmp/487/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 639 places, 31353 transitions and 125418 arcs
pnml2lts-mc( 0/ 4): Petri net RERS17pb113-PT-3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.120 real 1.210 user 0.980 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/487/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/487/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/487/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/487/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 641 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 640, there are 31361 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2500 levels ~10000 states ~131916 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~281068 transitions
pnml2lts-mc( 2/ 4): ~10000 levels ~40000 states ~965908 transitions
pnml2lts-mc( 0/ 4): ~20000 levels ~80000 states ~1156852 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~32343!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 129476
pnml2lts-mc( 0/ 4): unique transitions count: 3114225
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: 129485
pnml2lts-mc( 0/ 4): - cum. max stack depth: 129485
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 129485 states 3114244 transitions, fanout: 24.051
pnml2lts-mc( 0/ 4): Total exploration time 93.680 sec (93.680 sec minimum, 93.680 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1382, Transitions per second: 33243
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 65.5MB, 39.0 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 5.0%/81.0%
pnml2lts-mc( 0/ 4): Stored 32381 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 67.5MB (~258.0MB paged-in)
ltl formula name RERS17pb113-PT-3-LTLFireability-09
ltl formula formula --ltl=/tmp/487/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 639 places, 31353 transitions and 125418 arcs
pnml2lts-mc( 0/ 4): Petri net RERS17pb113-PT-3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.260 real 1.230 user 0.870 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/487/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/487/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/487/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/487/ltl_9_
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 641 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 640, there are 31366 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2500 levels ~10000 states ~137992 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~266144 transitions
pnml2lts-mc( 0/ 4): ~10000 levels ~40000 states ~533460 transitions
pnml2lts-mc( 0/ 4): ~20000 levels ~80000 states ~1043316 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 142920
pnml2lts-mc( 0/ 4): unique transitions count: 2140223
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: 142929
pnml2lts-mc( 0/ 4): - cum. max stack depth: 142929
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 142929 states 2140211 transitions, fanout: 14.974
pnml2lts-mc( 0/ 4): Total exploration time 101.290 sec (101.180 sec minimum, 101.245 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1411, Transitions per second: 21130
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 80.3MB, 39.4 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 6.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 32381 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 82.3MB (~258.0MB paged-in)
ltl formula name RERS17pb113-PT-3-LTLFireability-10
ltl formula formula --ltl=/tmp/487/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 639 places, 31353 transitions and 125418 arcs
pnml2lts-mc( 0/ 4): Petri net RERS17pb113-PT-3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.210 real 1.150 user 0.960 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/487/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/487/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/487/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/487/ltl_10_
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 641 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 640, there are 31356 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2500 levels ~10000 states ~46848 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~2795!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 10716
pnml2lts-mc( 0/ 4): unique transitions count: 142244
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: 10730
pnml2lts-mc( 0/ 4): - cum. max stack depth: 10730
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10730 states 142276 transitions, fanout: 13.260
pnml2lts-mc( 0/ 4): Total exploration time 7.440 sec (7.440 sec minimum, 7.440 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1442, Transitions per second: 19123
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 5.5MB, 40.2 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/6.0%
pnml2lts-mc( 0/ 4): Stored 32381 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 7.5MB (~258.0MB paged-in)
ltl formula name RERS17pb113-PT-3-LTLFireability-11
ltl formula formula --ltl=/tmp/487/ltl_11_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 639 places, 31353 transitions and 125418 arcs
pnml2lts-mc( 0/ 4): Petri net RERS17pb113-PT-3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.170 real 1.170 user 1.120 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/487/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/487/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/487/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/487/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 640 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 640, there are 31365 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2500 levels ~10000 states ~166040 transitions
pnml2lts-mc( 2/ 4): ~5000 levels ~20000 states ~331892 transitions
pnml2lts-mc( 2/ 4): ~10000 levels ~40000 states ~612580 transitions
pnml2lts-mc( 2/ 4): ~20000 levels ~80000 states ~1199632 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 133045
pnml2lts-mc( 0/ 4): unique transitions count: 2140463
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: 133056
pnml2lts-mc( 0/ 4): - cum. max stack depth: 133056
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 133056 states 2140455 transitions, fanout: 16.087
pnml2lts-mc( 0/ 4): Total exploration time 90.280 sec (90.060 sec minimum, 90.167 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1474, Transitions per second: 23709
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 80.3MB, 39.4 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 6.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 32381 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 82.3MB (~258.0MB paged-in)
ltl formula name RERS17pb113-PT-3-LTLFireability-12
ltl formula formula --ltl=/tmp/487/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 639 places, 31353 transitions and 125418 arcs
pnml2lts-mc( 0/ 4): Petri net RERS17pb113-PT-3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.060 real 1.050 user 1.130 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/487/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/487/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/487/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/487/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 641 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 640, there are 31359 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2500 levels ~10000 states ~133468 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~253388 transitions
pnml2lts-mc( 2/ 4): ~10000 levels ~40000 states ~566364 transitions
pnml2lts-mc( 0/ 4): ~20000 levels ~80000 states ~900416 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~31778!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 125822
pnml2lts-mc( 0/ 4): unique transitions count: 1828079
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: 125831
pnml2lts-mc( 0/ 4): - cum. max stack depth: 125831
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 125831 states 1828099 transitions, fanout: 14.528
pnml2lts-mc( 0/ 4): Total exploration time 84.920 sec (84.900 sec minimum, 84.912 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1482, Transitions per second: 21527
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 68.4MB, 39.3 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 5.0%/85.0%
pnml2lts-mc( 0/ 4): Stored 32381 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 70.4MB (~258.0MB paged-in)
ltl formula name RERS17pb113-PT-3-LTLFireability-13
ltl formula formula --ltl=/tmp/487/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 639 places, 31353 transitions and 125418 arcs
pnml2lts-mc( 0/ 4): Petri net RERS17pb113-PT-3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.160 real 1.160 user 1.090 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/487/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/487/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/487/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/487/ltl_13_
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 641 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 640, there are 31356 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2500 levels ~10000 states ~283020 transitions
pnml2lts-mc( 2/ 4): ~5000 levels ~20000 states ~547592 transitions
pnml2lts-mc( 1/ 4): ~10000 levels ~40000 states ~1168632 transitions
pnml2lts-mc( 1/ 4): ~20000 levels ~80000 states ~2392716 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 138144
pnml2lts-mc( 0/ 4): unique transitions count: 4353255
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: 138161
pnml2lts-mc( 0/ 4): - cum. max stack depth: 138161
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 138161 states 4353270 transitions, fanout: 31.509
pnml2lts-mc( 0/ 4): Total exploration time 94.960 sec (94.670 sec minimum, 94.822 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1455, Transitions per second: 45843
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 80.6MB, 38.8 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 6.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 32381 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 82.6MB (~258.0MB paged-in)
ltl formula name RERS17pb113-PT-3-LTLFireability-14
ltl formula formula --ltl=/tmp/487/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 639 places, 31353 transitions and 125418 arcs
pnml2lts-mc( 0/ 4): Petri net RERS17pb113-PT-3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.170 real 1.100 user 1.160 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/487/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/487/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/487/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/487/ltl_14_
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 641 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 640, there are 31355 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2500 levels ~10000 states ~101564 transitions
pnml2lts-mc( 3/ 4): ~5000 levels ~20000 states ~256196 transitions
pnml2lts-mc( 3/ 4): ~10000 levels ~40000 states ~491576 transitions
pnml2lts-mc( 1/ 4): ~20000 levels ~80000 states ~736028 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~27492!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 109470
pnml2lts-mc( 0/ 4): unique transitions count: 1344754
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: 109481
pnml2lts-mc( 0/ 4): - cum. max stack depth: 109481
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 109481 states 1344777 transitions, fanout: 12.283
pnml2lts-mc( 0/ 4): Total exploration time 72.230 sec (72.230 sec minimum, 72.230 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1516, Transitions per second: 18618
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 49.5MB, 38.6 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 4.0%/61.0%
pnml2lts-mc( 0/ 4): Stored 32381 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 51.5MB (~258.0MB paged-in)
ltl formula name RERS17pb113-PT-3-LTLFireability-15
ltl formula formula --ltl=/tmp/487/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 639 places, 31353 transitions and 125418 arcs
pnml2lts-mc( 0/ 4): Petri net RERS17pb113-PT-3 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.140 real 1.160 user 0.950 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/487/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/487/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/487/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/487/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 641 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 640, there are 31354 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2500 levels ~10000 states ~100656 transitions
pnml2lts-mc( 1/ 4): ~5000 levels ~20000 states ~203740 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~9750!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 38351
pnml2lts-mc( 0/ 4): unique transitions count: 535813
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: 38363
pnml2lts-mc( 0/ 4): - cum. max stack depth: 38363
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 38363 states 535838 transitions, fanout: 13.968
pnml2lts-mc( 0/ 4): Total exploration time 26.000 sec (26.000 sec minimum, 26.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1476, Transitions per second: 20609
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 20.6MB, 40.3 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 1.0%/25.0%
pnml2lts-mc( 0/ 4): Stored 32381 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 2MB
pnml2lts-mc( 0/ 4): Est. total memory use: 22.6MB (~258.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="RERS17pb113-PT-3"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is RERS17pb113-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 r520-tall-171662337900132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb113-PT-3.tgz
mv RERS17pb113-PT-3 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;