About the Execution of LTSMin+red for Dekker-PT-200
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16095.871 | 416518.00 | 1264983.00 | 671.00 | FTF?FFFFF?FFFTF? | 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.r488-tall-171631132000124.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 Dekker-PT-200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132000124
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 04:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 12 04:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 25M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Dekker-PT-200-LTLFireability-00
FORMULA_NAME Dekker-PT-200-LTLFireability-01
FORMULA_NAME Dekker-PT-200-LTLFireability-02
FORMULA_NAME Dekker-PT-200-LTLFireability-03
FORMULA_NAME Dekker-PT-200-LTLFireability-04
FORMULA_NAME Dekker-PT-200-LTLFireability-05
FORMULA_NAME Dekker-PT-200-LTLFireability-06
FORMULA_NAME Dekker-PT-200-LTLFireability-07
FORMULA_NAME Dekker-PT-200-LTLFireability-08
FORMULA_NAME Dekker-PT-200-LTLFireability-09
FORMULA_NAME Dekker-PT-200-LTLFireability-10
FORMULA_NAME Dekker-PT-200-LTLFireability-11
FORMULA_NAME Dekker-PT-200-LTLFireability-12
FORMULA_NAME Dekker-PT-200-LTLFireability-13
FORMULA_NAME Dekker-PT-200-LTLFireability-14
FORMULA_NAME Dekker-PT-200-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717186585283
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-200
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:16:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 20:16:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:16:27] [INFO ] Load time of PNML (sax parser for PT used): 1027 ms
[2024-05-31 20:16:27] [INFO ] Transformed 1000 places.
[2024-05-31 20:16:27] [INFO ] Transformed 40400 transitions.
[2024-05-31 20:16:27] [INFO ] Found NUPN structural information;
[2024-05-31 20:16:27] [INFO ] Parsed PT model containing 1000 places and 40400 transitions and 320400 arcs in 1386 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Dekker-PT-200-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 84 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 924 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-31 20:16:29] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 1000 cols
[2024-05-31 20:16:29] [INFO ] Computed 600 invariants in 34 ms
[2024-05-31 20:16:59] [INFO ] Performed 996/1000 implicitness test of which 199 returned IMPLICIT in 30 seconds.
[2024-05-31 20:16:59] [INFO ] Implicit Places using invariants in 30496 ms returned [400, 403, 406, 409, 412, 415, 418, 421, 424, 427, 430, 433, 436, 439, 442, 445, 448, 451, 454, 457, 460, 463, 466, 469, 472, 475, 478, 481, 484, 487, 490, 493, 496, 499, 502, 505, 508, 511, 514, 517, 520, 523, 526, 529, 532, 535, 538, 541, 544, 547, 550, 553, 556, 559, 562, 565, 568, 571, 574, 577, 580, 583, 586, 589, 592, 595, 598, 601, 604, 607, 610, 613, 616, 619, 622, 625, 628, 631, 634, 637, 640, 643, 646, 649, 652, 655, 658, 661, 664, 667, 670, 673, 676, 679, 682, 685, 688, 691, 694, 697, 700, 703, 706, 709, 712, 715, 718, 721, 724, 727, 730, 733, 736, 739, 742, 745, 748, 751, 754, 757, 760, 763, 766, 769, 772, 775, 778, 781, 784, 787, 790, 793, 796, 799, 802, 805, 808, 811, 814, 817, 820, 823, 826, 829, 832, 835, 838, 841, 844, 847, 850, 853, 856, 859, 862, 865, 868, 871, 874, 877, 880, 883, 886, 889, 892, 895, 898, 901, 904, 907, 910, 913, 916, 919, 922, 925, 928, 931, 934, 937, 940, 943, 946, 949, 952, 955, 958, 961, 964, 967, 970, 973, 976, 979, 982, 985, 988, 991, 994, 997]
Discarding 200 places :
Implicit Place search using SMT only with invariants took 30573 ms to find 200 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 800/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 536 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32057 ms. Remains : 800/1000 places, 40400/40400 transitions.
Support contains 84 out of 800 places after structural reductions.
[2024-05-31 20:17:02] [INFO ] Flatten gal took : 1587 ms
[2024-05-31 20:17:03] [INFO ] Flatten gal took : 1331 ms
[2024-05-31 20:17:06] [INFO ] Input system was already deterministic with 40400 transitions.
Support contains 73 out of 800 places (down from 84) after GAL structural reductions.
RANDOM walk for 4946 steps (0 resets) in 1544 ms. (3 steps per ms) remains 0/28 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U X(p1)))'
Support contains 6 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 824 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-31 20:17:08] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2024-05-31 20:17:08] [INFO ] Computed 400 invariants in 4 ms
[2024-05-31 20:17:14] [INFO ] Implicit Places using invariants in 6346 ms returned []
Implicit Place search using SMT only with invariants took 6352 ms to find 0 implicit places.
Running 40200 sub problems to find dead transitions.
[2024-05-31 20:17:15] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-31 20:17:15] [INFO ] Invariant cache hit.
[2024-05-31 20:17:15] [INFO ] State equation strengthened by 200 read => feed constraints.
FORMULA Dekker-PT-200-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-200-LTLFireability-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-200-LTLFireability-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Dekker-PT-200-LTLFireability-03
FORMULA Dekker-PT-200-LTLFireability-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-200-LTLFireability-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-200-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-200-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-200-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Dekker-PT-200-LTLFireability-09
FORMULA Dekker-PT-200-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-200-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-200-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-200-LTLFireability-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-200-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Dekker-PT-200-LTLFireability-15
BK_STOP 1717187001801
--------------------
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 Dekker-PT-200-LTLFireability-00
ltl formula formula --ltl=/tmp/541/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 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.270 real 1.470 user 0.920 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/541/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/541/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/541/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/541/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 1001 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40411 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~4!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 13
pnml2lts-mc( 0/ 4): unique transitions count: 2612
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: 16
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 16 states 3216 transitions, fanout: 201.000
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.040 sec minimum, 0.042 sec on average)
pnml2lts-mc( 0/ 4): States per second: 320, Transitions per second: 64320
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 39.5 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.1MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLFireability-01
ltl formula formula --ltl=/tmp/541/ltl_1_
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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.370 real 1.430 user 1.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/541/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/541/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/541/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/541/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40414 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: 201
pnml2lts-mc( 0/ 4): unique states count: 201
pnml2lts-mc( 0/ 4): unique transitions count: 200
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 474
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 218
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 218 states 804 transitions, fanout: 3.688
pnml2lts-mc( 0/ 4): Total exploration time 0.270 sec (0.270 sec minimum, 0.270 sec on average)
pnml2lts-mc( 0/ 4): States per second: 807, Transitions per second: 2978
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, 63.2 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.0MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLFireability-02
ltl formula formula --ltl=/tmp/541/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.300 real 1.430 user 1.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/541/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/541/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/541/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/541/ltl_2_
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 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40411 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~4!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 13
pnml2lts-mc( 0/ 4): unique transitions count: 8236
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: 16
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 16 states 8840 transitions, fanout: 552.500
pnml2lts-mc( 0/ 4): Total exploration time 0.070 sec (0.060 sec minimum, 0.067 sec on average)
pnml2lts-mc( 0/ 4): States per second: 229, Transitions per second: 126286
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 22.7 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.2MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLFireability-03
ltl formula formula --ltl=/tmp/541/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 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.330 real 1.520 user 0.940 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/541/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/541/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/541/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/541/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40404 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 ~2738928 transitions
pnml2lts-mc( 1/ 4): ~5000 levels ~20000 states ~5368392 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: 34328
pnml2lts-mc( 0/ 4): unique transitions count: 9990564
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 977359
pnml2lts-mc( 0/ 4): - claim success count: 34331
pnml2lts-mc( 0/ 4): - cum. max stack depth: 34331
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 34331 states 9990674 transitions, fanout: 291.010
pnml2lts-mc( 0/ 4): Total exploration time 48.770 sec (47.430 sec minimum, 48.170 sec on average)
pnml2lts-mc( 0/ 4): States per second: 704, Transitions per second: 204853
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 113.2MB, 18.4 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 19.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 116.2MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLFireability-04
ltl formula formula --ltl=/tmp/541/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 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.460 real 1.490 user 1.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/541/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/541/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/541/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/541/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 1001 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40412 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~3!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 9
pnml2lts-mc( 0/ 4): unique transitions count: 1800
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: 12
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12 states 2404 transitions, fanout: 200.333
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.030 sec minimum, 0.035 sec on average)
pnml2lts-mc( 0/ 4): States per second: 300, Transitions per second: 60100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 39.7 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.1MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLFireability-05
ltl formula formula --ltl=/tmp/541/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 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.420 real 1.520 user 0.940 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/541/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/541/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/541/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/541/ltl_5_
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 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40403 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~3!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 9
pnml2lts-mc( 0/ 4): unique transitions count: 1800
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: 12
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12 states 2404 transitions, fanout: 200.333
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.040 sec minimum, 0.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 300, Transitions per second: 60100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 39.8 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.1MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLFireability-06
ltl formula formula --ltl=/tmp/541/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 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.340 real 1.520 user 0.910 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/541/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/541/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/541/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/541/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 1001 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40411 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~6!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 21
pnml2lts-mc( 0/ 4): unique transitions count: 5304
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: 24
pnml2lts-mc( 0/ 4): - cum. max stack depth: 24
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 24 states 6508 transitions, fanout: 271.167
pnml2lts-mc( 0/ 4): Total exploration time 0.070 sec (0.070 sec minimum, 0.070 sec on average)
pnml2lts-mc( 0/ 4): States per second: 343, Transitions per second: 92971
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 34.3 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.2MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLFireability-07
ltl formula formula --ltl=/tmp/541/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.320 real 1.400 user 1.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/541/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/541/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/541/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/541/ltl_7_
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 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40402 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~3!
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: 1600
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: 11
pnml2lts-mc( 0/ 4): - cum. max stack depth: 11
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 11 states 2204 transitions, fanout: 200.364
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.030 sec minimum, 0.035 sec on average)
pnml2lts-mc( 0/ 4): States per second: 275, Transitions per second: 55100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 40.1 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.1MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLFireability-08
ltl formula formula --ltl=/tmp/541/ltl_8_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.490 real 1.490 user 1.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/541/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/541/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/541/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/541/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 1001 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40409 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~5!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 17
pnml2lts-mc( 0/ 4): unique transitions count: 4236
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: 20
pnml2lts-mc( 0/ 4): - cum. max stack depth: 20
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 20 states 4840 transitions, fanout: 242.000
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 333, Transitions per second: 80667
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 34.2 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.1MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLFireability-09
ltl formula formula --ltl=/tmp/541/ltl_9_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.200 real 1.380 user 0.950 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/541/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/541/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/541/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/541/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 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40407 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 ~2693216 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~5509912 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: 35892
pnml2lts-mc( 0/ 4): unique transitions count: 10309461
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1342379
pnml2lts-mc( 0/ 4): - claim success count: 35895
pnml2lts-mc( 0/ 4): - cum. max stack depth: 35895
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 35895 states 10309542 transitions, fanout: 287.214
pnml2lts-mc( 0/ 4): Total exploration time 59.450 sec (57.920 sec minimum, 58.912 sec on average)
pnml2lts-mc( 0/ 4): States per second: 604, Transitions per second: 173415
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 115.4MB, 18.0 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 20.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 118.4MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLFireability-10
ltl formula formula --ltl=/tmp/541/ltl_10_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.310 real 1.560 user 0.890 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/541/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/541/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/541/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/541/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 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40402 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~3!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 9
pnml2lts-mc( 0/ 4): unique transitions count: 1800
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: 12
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12 states 2404 transitions, fanout: 200.333
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 400, Transitions per second: 80133
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 40.2 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.1MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLFireability-11
ltl formula formula --ltl=/tmp/541/ltl_11_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.270 real 1.490 user 0.910 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/541/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/541/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/541/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/541/ltl_11_
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 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40402 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~3!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 9
pnml2lts-mc( 0/ 4): unique transitions count: 1800
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: 12
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12 states 2404 transitions, fanout: 200.333
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.040 sec minimum, 0.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 300, Transitions per second: 60100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 39.2 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.1MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLFireability-12
ltl formula formula --ltl=/tmp/541/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 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.310 real 1.460 user 0.940 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/541/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/541/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/541/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/541/ltl_12_
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 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40402 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~3!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 9
pnml2lts-mc( 0/ 4): unique transitions count: 1800
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: 12
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12 states 2404 transitions, fanout: 200.333
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.040 sec minimum, 0.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 300, Transitions per second: 60100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 40.7 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.1MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLFireability-13
ltl formula formula --ltl=/tmp/541/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 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.280 real 1.460 user 0.940 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/541/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/541/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/541/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/541/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 1001 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40406 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.010 sec minimum, 0.010 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, 344.0 B/state, compr.: 8.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.0MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLFireability-14
ltl formula formula --ltl=/tmp/541/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.260 real 1.380 user 1.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/541/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/541/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/541/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/541/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 1001 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40406 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~3!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 9
pnml2lts-mc( 0/ 4): unique transitions count: 2000
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: 12
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12 states 3204 transitions, fanout: 267.000
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 400, Transitions per second: 106800
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 37.5 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.1MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLFireability-15
ltl formula formula --ltl=/tmp/541/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 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.290 real 1.440 user 0.990 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/541/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/541/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/541/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/541/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40403 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 ~2789504 transitions
pnml2lts-mc( 1/ 4): ~5000 levels ~20000 states ~5753352 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: 32139
pnml2lts-mc( 0/ 4): unique transitions count: 10392598
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1151146
pnml2lts-mc( 0/ 4): - claim success count: 32142
pnml2lts-mc( 0/ 4): - cum. max stack depth: 32142
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 32142 states 10392706 transitions, fanout: 323.337
pnml2lts-mc( 0/ 4): Total exploration time 55.270 sec (54.080 sec minimum, 54.805 sec on average)
pnml2lts-mc( 0/ 4): States per second: 582, Transitions per second: 188035
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 110.1MB, 19.1 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 17.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 113.1MB (~259.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="Dekker-PT-200"
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 Dekker-PT-200, 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 r488-tall-171631132000124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-200.tgz
mv Dekker-PT-200 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 '
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 ;