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.r605-tall-171774426900243.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 BlocksWorld-PT-11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r605-tall-171774426900243
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 50M
-rw-r--r-- 1 mcc users 1.6M Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 7.0M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 7.3M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 43K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 134K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 472K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.9M Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 1.7M Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.2M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 101K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 243K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 3.2M Jun 7 06:26 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 BlocksWorld-PT-11-LTLCardinality-00
FORMULA_NAME BlocksWorld-PT-11-LTLCardinality-01
FORMULA_NAME BlocksWorld-PT-11-LTLCardinality-02
FORMULA_NAME BlocksWorld-PT-11-LTLCardinality-03
FORMULA_NAME BlocksWorld-PT-11-LTLCardinality-04
FORMULA_NAME BlocksWorld-PT-11-LTLCardinality-05
FORMULA_NAME BlocksWorld-PT-11-LTLCardinality-06
FORMULA_NAME BlocksWorld-PT-11-LTLCardinality-07
FORMULA_NAME BlocksWorld-PT-11-LTLCardinality-08
FORMULA_NAME BlocksWorld-PT-11-LTLCardinality-09
FORMULA_NAME BlocksWorld-PT-11-LTLCardinality-10
FORMULA_NAME BlocksWorld-PT-11-LTLCardinality-11
FORMULA_NAME BlocksWorld-PT-11-LTLCardinality-12
FORMULA_NAME BlocksWorld-PT-11-LTLCardinality-13
FORMULA_NAME BlocksWorld-PT-11-LTLCardinality-14
FORMULA_NAME BlocksWorld-PT-11-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717751890292

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-07 09:18:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-07 09:18:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 09:18:11] [INFO ] Load time of PNML (sax parser for PT used): 359 ms
[2024-06-07 09:18:11] [INFO ] Transformed 3421 places.
[2024-06-07 09:18:12] [INFO ] Transformed 6613 transitions.
[2024-06-07 09:18:12] [INFO ] Found NUPN structural information;
[2024-06-07 09:18:12] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27, pred_on_table_28, pred_on_table_29, pred_on_table_30, pred_on_table_31, pred_on_table_32, pred_on_table_33, pred_on_table_34, pred_on_table_35, pred_on_table_36, pred_on_table_37, pred_on_table_38, pred_on_table_39, pred_on_table_40, pred_on_table_41, pred_on_table_42, pred_on_table_43, pred_on_table_44, pred_on_table_45, pred_on_table_46, pred_on_table_47, pred_on_table_48, pred_on_table_49, pred_on_table_50, pred_on_table_51, pred_on_table_52, pred_on_table_53, pred_on_table_54, pred_on_table_55, pred_on_table_56]
[2024-06-07 09:18:12] [INFO ] Parsed PT model containing 3421 places and 6613 transitions and 33052 arcs in 570 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA BlocksWorld-PT-11-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-11-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-11-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-11-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 172 out of 3421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3421/3421 places, 6613/6613 transitions.
Applied a total of 0 rules in 397 ms. Remains 3421 /3421 variables (removed 0) and now considering 6613/6613 (removed 0) transitions.
// Phase 1: matrix 6613 rows 3421 cols
[2024-06-07 09:18:12] [INFO ] Computed 115 invariants in 95 ms
[2024-06-07 09:18:15] [INFO ] Implicit Places using invariants in 2726 ms returned []
[2024-06-07 09:18:15] [INFO ] Invariant cache hit.
[2024-06-07 09:18:18] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-06-07 09:18:26] [INFO ] Implicit Places using invariants and state equation in 11061 ms returned []
Implicit Place search using SMT with State Equation took 13838 ms to find 0 implicit places.
Running 6604 sub problems to find dead transitions.
[2024-06-07 09:18:26] [INFO ] Invariant cache hit.
[2024-06-07 09:18:26] [INFO ] State equation strengthened by 97 read => feed constraints.
Problem TDEAD172 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1970 is UNSAT
Problem TDEAD2028 is UNSAT
Problem TDEAD2144 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2260 is UNSAT
Problem TDEAD2318 is UNSAT
Problem TDEAD2434 is UNSAT
Problem TDEAD2492 is UNSAT
Problem TDEAD2550 is UNSAT
Problem TDEAD2608 is UNSAT
Problem TDEAD2666 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2840 is UNSAT
Problem TDEAD2898 is UNSAT
Problem TDEAD2956 is UNSAT
Problem TDEAD3014 is UNSAT
Problem TDEAD3072 is UNSAT
Problem TDEAD3130 is UNSAT
Problem TDEAD3188 is UNSAT
Problem TDEAD3246 is UNSAT
Problem TDEAD3304 is UNSAT
Problem TDEAD3362 is UNSAT
Problem TDEAD3420 is UNSAT
Problem TDEAD3532 is UNSAT
Problem TDEAD3642 is UNSAT
Problem TDEAD3750 is UNSAT
Problem TDEAD3856 is UNSAT
Problem TDEAD3960 is UNSAT
Problem TDEAD4062 is UNSAT
Problem TDEAD4162 is UNSAT
Problem TDEAD4260 is UNSAT
Problem TDEAD4356 is UNSAT
Problem TDEAD4542 is UNSAT
Problem TDEAD4632 is UNSAT
Problem TDEAD4720 is UNSAT
Problem TDEAD4806 is UNSAT
Problem TDEAD4890 is UNSAT
Problem TDEAD4972 is UNSAT
Problem TDEAD5052 is UNSAT
Problem TDEAD5130 is UNSAT
Problem TDEAD5206 is UNSAT
Problem TDEAD5280 is UNSAT
Problem TDEAD5422 is UNSAT
Problem TDEAD5490 is UNSAT
Problem TDEAD5556 is UNSAT
Problem TDEAD5620 is UNSAT
Problem TDEAD5682 is UNSAT
Problem TDEAD5742 is UNSAT
Problem TDEAD5800 is UNSAT
Problem TDEAD5856 is UNSAT
Problem TDEAD5910 is UNSAT
Problem TDEAD5962 is UNSAT
Problem TDEAD6012 is UNSAT
Problem TDEAD6106 is UNSAT
Problem TDEAD6150 is UNSAT
Problem TDEAD6192 is UNSAT
Problem TDEAD6232 is UNSAT
Problem TDEAD6306 is UNSAT
Problem TDEAD6340 is UNSAT
Problem TDEAD6372 is UNSAT
Problem TDEAD6402 is UNSAT
Problem TDEAD6430 is UNSAT
Problem TDEAD6480 is UNSAT
Problem TDEAD6502 is UNSAT
Problem TDEAD6522 is UNSAT
Problem TDEAD6540 is UNSAT
Problem TDEAD6556 is UNSAT
Problem TDEAD6570 is UNSAT
Problem TDEAD6582 is UNSAT
Problem TDEAD6592 is UNSAT
Problem TDEAD6600 is UNSAT
Problem TDEAD6606 is UNSAT
Problem TDEAD6610 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3414 variables, 102/102 constraints. Problems are: Problem set: 102 solved, 6502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3414/10034 variables, and 102 constraints, problems are : Problem set: 102 solved, 6502 unsolved in 30266 ms.
Refiners :[Positive P Invariants (semi-flows): 102/115 constraints, State Equation: 0/3421 constraints, ReadFeed: 0/97 constraints, PredecessorRefiner: 6553/3307 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 102 solved, 6502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3363 variables, 7/7 constraints. Problems are: Problem set: 102 solved, 6502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3363/10034 variables, and 7 constraints, problems are : Problem set: 102 solved, 6502 unsolved in 30124 ms.
Refiners :[Positive P Invariants (semi-flows): 7/115 constraints, State Equation: 0/3421 constraints, ReadFeed: 0/97 constraints, PredecessorRefiner: 3246/3307 constraints, Known Traps: 0/0 constraints]
After SMT, in 117615ms problems are : Problem set: 102 solved, 6502 unsolved
Search for dead transitions found 102 dead transitions in 117713ms
Found 102 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 102 transitions
Dead transitions reduction (with SMT) removed 102 transitions
Starting structural reductions in LTL mode, iteration 1 : 3421/3421 places, 6511/6613 transitions.
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 3370 transition count 6511
Applied a total of 51 rules in 320 ms. Remains 3370 /3421 variables (removed 51) and now considering 6511/6511 (removed 0) transitions.
// Phase 1: matrix 6511 rows 3370 cols
[2024-06-07 09:20:24] [INFO ] Computed 115 invariants in 46 ms
[2024-06-07 09:20:26] [INFO ] Implicit Places using invariants in 2038 ms returned []
[2024-06-07 09:20:26] [INFO ] Invariant cache hit.
[2024-06-07 09:20:30] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-07 09:20:35] [INFO ] Implicit Places using invariants and state equation in 8969 ms returned []
Implicit Place search using SMT with State Equation took 11010 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3370/3421 places, 6511/6613 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 143332 ms. Remains : 3370/3421 places, 6511/6613 transitions.
Support contains 172 out of 3370 places after structural reductions.
[2024-06-07 09:20:36] [INFO ] Flatten gal took : 467 ms
[2024-06-07 09:20:36] [INFO ] Flatten gal took : 284 ms
[2024-06-07 09:20:37] [INFO ] Input system was already deterministic with 6511 transitions.
RANDOM walk for 40000 steps (8 resets) in 5990 ms. (6 steps per ms) remains 14/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 567 ms. (70 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 796 ms. (50 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 734 ms. (54 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 831 ms. (48 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 591 ms. (67 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 671 ms. (59 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 525 ms. (76 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 700 ms. (57 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 662 ms. (60 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 469 ms. (85 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 497 ms. (80 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 414 ms. (96 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 394 ms. (101 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 377 ms. (105 steps per ms) remains 14/14 properties
[2024-06-07 09:20:41] [INFO ] Invariant cache hit.
[2024-06-07 09:20:41] [INFO ] State equation strengthened by 13 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp24 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 11 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 2 (OVERLAPS) 3198/3370 variables, 114/115 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3370 variables, 0/115 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 6510/9880 variables, 3370/3485 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9880 variables, 12/3497 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9880 variables, 0/3497 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/9881 variables, 1/3498 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/9881 variables, 0/3498 constraints. Problems are: Problem set: 8 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9881/9881 variables, and 3498 constraints, problems are : Problem set: 8 solved, 6 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, State Equation: 3370/3370 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 12/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 1/1 constraints. Problems are: Problem set: 8 solved, 6 unsolved
[2024-06-07 09:20:47] [INFO ] Deduced a trap composed of 114 places in 581 ms of which 13 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 1/2 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 6 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 3 (OVERLAPS) 3198/3370 variables, 114/116 constraints. Problems are: Problem set: 9 solved, 5 unsolved
[2024-06-07 09:20:52] [INFO ] Deduced a trap composed of 168 places in 4445 ms of which 33 ms to minimize.
SMT process timed out in 11075ms, After SMT, problems are : Problem set: 9 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 172 out of 3370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3370/3370 places, 6511/6511 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3370 transition count 6510
Applied a total of 1 rules in 24368 ms. Remains 3370 /3370 variables (removed 0) and now considering 6510/6511 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24369 ms. Remains : 3370/3370 places, 6510/6511 transitions.
RANDOM walk for 40000 steps (8 resets) in 3322 ms. (12 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 641 ms. (62 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 609 ms. (65 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 639 ms. (62 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 512 ms. (77 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 501 ms. (79 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 95173 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 5
Probabilistic random walk after 95173 steps, saw 83319 distinct states, run finished after 3005 ms. (steps per millisecond=31 ) properties seen :0
// Phase 1: matrix 6510 rows 3370 cols
[2024-06-07 09:21:21] [INFO ] Computed 115 invariants in 38 ms
[2024-06-07 09:21:21] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 3198/3370 variables, 114/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3370 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6510/9880 variables, 3370/3485 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9880 variables, 12/3497 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9880 variables, 0/3497 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/9880 variables, 0/3497 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9880/9880 variables, and 3497 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3869 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, State Equation: 3370/3370 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 5/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-07 09:21:26] [INFO ] Deduced a trap composed of 114 places in 537 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3198/3370 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-07 09:21:31] [INFO ] Deduced a trap composed of 408 places in 4330 ms of which 23 ms to minimize.
[2024-06-07 09:21:35] [INFO ] Deduced a trap composed of 318 places in 4231 ms of which 26 ms to minimize.
[2024-06-07 09:21:39] [INFO ] Deduced a trap composed of 168 places in 4343 ms of which 24 ms to minimize.
[2024-06-07 09:21:44] [INFO ] Deduced a trap composed of 168 places in 4271 ms of which 22 ms to minimize.
[2024-06-07 09:21:48] [INFO ] Deduced a trap composed of 364 places in 4278 ms of which 24 ms to minimize.
[2024-06-07 09:21:52] [INFO ] Deduced a trap composed of 220 places in 4297 ms of which 23 ms to minimize.
[2024-06-07 09:21:57] [INFO ] Deduced a trap composed of 738 places in 4218 ms of which 24 ms to minimize.
[2024-06-07 09:22:01] [INFO ] Deduced a trap composed of 220 places in 4225 ms of which 24 ms to minimize.
[2024-06-07 09:22:05] [INFO ] Deduced a trap composed of 168 places in 4218 ms of which 24 ms to minimize.
[2024-06-07 09:22:10] [INFO ] Deduced a trap composed of 168 places in 4323 ms of which 25 ms to minimize.
[2024-06-07 09:22:14] [INFO ] Deduced a trap composed of 168 places in 4402 ms of which 24 ms to minimize.
SMT process timed out in 52880ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 172 out of 3370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3370/3370 places, 6510/6510 transitions.
Applied a total of 0 rules in 18442 ms. Remains 3370 /3370 variables (removed 0) and now considering 6510/6510 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18442 ms. Remains : 3370/3370 places, 6510/6510 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3370/3370 places, 6510/6510 transitions.
Applied a total of 0 rules in 18504 ms. Remains 3370 /3370 variables (removed 0) and now considering 6510/6510 (removed 0) transitions.
[2024-06-07 09:22:51] [INFO ] Invariant cache hit.
[2024-06-07 09:22:53] [INFO ] Implicit Places using invariants in 2013 ms returned []
[2024-06-07 09:22:53] [INFO ] Invariant cache hit.
[2024-06-07 09:22:57] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-07 09:23:00] [INFO ] Implicit Places using invariants and state equation in 7137 ms returned []
Implicit Place search using SMT with State Equation took 9154 ms to find 0 implicit places.
[2024-06-07 09:23:01] [INFO ] Redundant transitions in 578 ms returned []
Running 6501 sub problems to find dead transitions.
[2024-06-07 09:23:01] [INFO ] Invariant cache hit.
[2024-06-07 09:23:01] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3361 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 6501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3361/9880 variables, and 98 constraints, problems are : Problem set: 0 solved, 6501 unsolved in 30105 ms.
Refiners :[Positive P Invariants (semi-flows): 98/115 constraints, State Equation: 0/3370 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 6501/3255 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6501 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3361 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 6501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3361/9880 variables, and 98 constraints, problems are : Problem set: 0 solved, 6501 unsolved in 30098 ms.
Refiners :[Positive P Invariants (semi-flows): 98/115 constraints, State Equation: 0/3370 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 3246/3255 constraints, Known Traps: 0/0 constraints]
After SMT, in 119741ms problems are : Problem set: 0 solved, 6501 unsolved
Search for dead transitions found 0 dead transitions in 119805ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148082 ms. Remains : 3370/3370 places, 6510/6510 transitions.
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
FORMULA BlocksWorld-PT-11-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-11-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-11-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-11-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-11-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA BlocksWorld-PT-11-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(F(p0))&&F((p1&&(p2||X(p2))))))'
Support contains 115 out of 3370 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3370/3370 places, 6511/6511 transitions.
Applied a total of 0 rules in 1746 ms. Remains 3370 /3370 variables (removed 0) and now considering 6511/6511 (removed 0) transitions.
// Phase 1: matrix 6511 rows 3370 cols
[2024-06-07 09:25:03] [INFO ] Computed 115 invariants in 37 ms
[2024-06-07 09:25:05] [INFO ] Implicit Places using invariants in 2430 ms returned []
[2024-06-07 09:25:05] [INFO ] Invariant cache hit.
[2024-06-07 09:25:09] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-07 09:25:14] [INFO ] Implicit Places using invariants and state equation in 8595 ms returned []
Implicit Place search using SMT with State Equation took 11029 ms to find 0 implicit places.
[2024-06-07 09:25:14] [INFO ] Redundant transitions in 619 ms returned []
Running 6502 sub problems to find dead transitions.
[2024-06-07 09:25:15] [INFO ] Invariant cache hit.
[2024-06-07 09:25:15] [INFO ] State equation strengthened by 13 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3363 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 6502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3363/9881 variables, and 102 constraints, problems are : Problem set: 0 solved, 6502 unsolved in 30103 ms.
Refiners :[Positive P Invariants (semi-flows): 102/115 constraints, State Equation: 0/3370 constraints, ReadFeed: 0/13 constraints, PredecessorRefiner: 6502/3256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3363 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 6502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3363/9881 variables, and 102 constraints, problems are : Problem set: 0 solved, 6502 unsolved in 30102 ms.
Refiners :[Positive P Invariants (semi-flows): 102/115 constraints, State Equation: 0/3370 constraints, ReadFeed: 0/13 constraints, PredecessorRefiner: 3246/3256 constraints, Known Traps: 0/0 constraints]
After SMT, in 120682ms problems are : Problem set: 0 solved, 6502 unsolved
Search for dead transitions found 0 dead transitions in 120740ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 134174 ms. Remains : 3370/3370 places, 6511/6511 transitions.
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : BlocksWorld-PT-11-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 7036 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 2 ms.
FORMULA BlocksWorld-PT-11-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-11-LTLCardinality-01 finished in 141701 ms.
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' '!(X(F(p0)))'
Support contains 172 out of 3370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3370/3370 places, 6511/6511 transitions.
Applied a total of 0 rules in 181 ms. Remains 3370 /3370 variables (removed 0) and now considering 6511/6511 (removed 0) transitions.
[2024-06-07 09:27:23] [INFO ] Invariant cache hit.
[2024-06-07 09:27:25] [INFO ] Implicit Places using invariants in 2039 ms returned []
[2024-06-07 09:27:25] [INFO ] Invariant cache hit.
[2024-06-07 09:27:28] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-07 09:27:33] [INFO ] Implicit Places using invariants and state equation in 8054 ms returned []
Implicit Place search using SMT with State Equation took 10114 ms to find 0 implicit places.
Running 6502 sub problems to find dead transitions.
[2024-06-07 09:27:33] [INFO ] Invariant cache hit.
[2024-06-07 09:27:33] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3363 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 6502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3363/9881 variables, and 102 constraints, problems are : Problem set: 0 solved, 6502 unsolved in 30112 ms.
Refiners :[Positive P Invariants (semi-flows): 102/115 constraints, State Equation: 0/3370 constraints, ReadFeed: 0/13 constraints, PredecessorRefiner: 6502/3256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3363 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 6502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3363/9881 variables, and 102 constraints, problems are : Problem set: 0 solved, 6502 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 102/115 constraints, State Equation: 0/3370 constraints, ReadFeed: 0/13 constraints, PredecessorRefiner: 3246/3256 constraints, Known Traps: 0/0 constraints]
After SMT, in 113812ms problems are : Problem set: 0 solved, 6502 unsolved
Search for dead transitions found 0 dead transitions in 113865ms
Finished structural reductions in LTL mode , in 1 iterations and 124186 ms. Remains : 3370/3370 places, 6511/6511 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-11-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 7012 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 2 ms.
FORMULA BlocksWorld-PT-11-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-11-LTLCardinality-02 finished in 131345 ms.
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' '!(F(G(p0)))'
Support contains 58 out of 3370 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3370/3370 places, 6511/6511 transitions.
Applied a total of 0 rules in 1107 ms. Remains 3370 /3370 variables (removed 0) and now considering 6511/6511 (removed 0) transitions.
[2024-06-07 09:29:35] [INFO ] Invariant cache hit.
[2024-06-07 09:29:37] [INFO ] Implicit Places using invariants in 2296 ms returned []
[2024-06-07 09:29:37] [INFO ] Invariant cache hit.
[2024-06-07 09:29:41] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-07 09:29:46] [INFO ] Implicit Places using invariants and state equation in 8414 ms returned []
Implicit Place search using SMT with State Equation took 10714 ms to find 0 implicit places.
[2024-06-07 09:29:46] [INFO ] Redundant transitions in 402 ms returned []
Running 6502 sub problems to find dead transitions.
[2024-06-07 09:29:46] [INFO ] Invariant cache hit.
[2024-06-07 09:29:46] [INFO ] State equation strengthened by 13 read => feed constraints.
Could not compute solution for formula : BlocksWorld-PT-11-LTLCardinality-00
Could not compute solution for formula : BlocksWorld-PT-11-LTLCardinality-01
Could not compute solution for formula : BlocksWorld-PT-11-LTLCardinality-02
Could not compute solution for formula : BlocksWorld-PT-11-LTLCardinality-03
Could not compute solution for formula : BlocksWorld-PT-11-LTLCardinality-04
Could not compute solution for formula : BlocksWorld-PT-11-LTLCardinality-05
Could not compute solution for formula : BlocksWorld-PT-11-LTLCardinality-06
FORMULA BlocksWorld-PT-11-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BlocksWorld-PT-11-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : BlocksWorld-PT-11-LTLCardinality-09
Could not compute solution for formula : BlocksWorld-PT-11-LTLCardinality-10
FORMULA BlocksWorld-PT-11-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BlocksWorld-PT-11-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BlocksWorld-PT-11-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BlocksWorld-PT-11-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BlocksWorld-PT-11-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717754684208

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name BlocksWorld-PT-11-LTLCardinality-00
ltl formula formula --ltl=/tmp/706/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 3421 places, 6613 transitions and 33052 arcs
pnml2lts-mc( 0/ 4): Petri net BlocksWorld-PT-11 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.700 real 0.280 user 0.210 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/706/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/706/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/706/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/706/ltl_0_
ltl formula name BlocksWorld-PT-11-LTLCardinality-01
ltl formula formula --ltl=/tmp/706/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 3421 places, 6613 transitions and 33052 arcs
pnml2lts-mc( 0/ 4): Petri net BlocksWorld-PT-11 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.710 real 0.250 user 0.250 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/706/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/706/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/706/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/706/ltl_1_
ltl formula name BlocksWorld-PT-11-LTLCardinality-02
ltl formula formula --ltl=/tmp/706/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 3421 places, 6613 transitions and 33052 arcs
pnml2lts-mc( 0/ 4): Petri net BlocksWorld-PT-11 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.690 real 0.260 user 0.230 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/706/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/706/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/706/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/706/ltl_2_
ltl formula name BlocksWorld-PT-11-LTLCardinality-03
ltl formula formula --ltl=/tmp/706/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 3421 places, 6613 transitions and 33052 arcs
pnml2lts-mc( 0/ 4): Petri net BlocksWorld-PT-11 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.680 real 0.260 user 0.220 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/706/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/706/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/706/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/706/ltl_3_
ltl formula name BlocksWorld-PT-11-LTLCardinality-04
ltl formula formula --ltl=/tmp/706/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 3421 places, 6613 transitions and 33052 arcs
pnml2lts-mc( 0/ 4): Petri net BlocksWorld-PT-11 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.820 real 0.300 user 0.280 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/706/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/706/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/706/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/706/ltl_4_
ltl formula name BlocksWorld-PT-11-LTLCardinality-05
ltl formula formula --ltl=/tmp/706/ltl_5_
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 3421 places, 6613 transitions and 33052 arcs
pnml2lts-mc( 0/ 4): Petri net BlocksWorld-PT-11 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.710 real 0.270 user 0.220 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/706/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/706/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/706/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/706/ltl_5_
ltl formula name BlocksWorld-PT-11-LTLCardinality-06
ltl formula formula --ltl=/tmp/706/ltl_6_
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 3421 places, 6613 transitions and 33052 arcs
pnml2lts-mc( 0/ 4): Petri net BlocksWorld-PT-11 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.260 real 0.340 user 0.350 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/706/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/706/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/706/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/706/ltl_6_
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 3423 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3422, there are 6616 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 ~73924 transitions
pnml2lts-mc( 3/ 4): ~5000 levels ~20000 states ~159468 transitions
pnml2lts-mc( 2/ 4): ~10000 levels ~40000 states ~331184 transitions
pnml2lts-mc( 1/ 4): ~20000 levels ~80000 states ~815460 transitions
pnml2lts-mc( 1/ 4): ~40000 levels ~160000 states ~1483724 transitions
ltl formula name BlocksWorld-PT-11-LTLCardinality-07
ltl formula formula --ltl=/tmp/706/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 3421 places, 6613 transitions and 33052 arcs
pnml2lts-mc( 0/ 4): Petri net BlocksWorld-PT-11 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.130 real 0.260 user 0.240 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/706/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/706/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/706/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/706/ltl_7_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 3423 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3422, there are 6615 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, 1336.0 B/state, compr.: 9.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 6729 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name BlocksWorld-PT-11-LTLCardinality-08
ltl formula formula --ltl=/tmp/706/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 3421 places, 6613 transitions and 33052 arcs
pnml2lts-mc( 0/ 4): Petri net BlocksWorld-PT-11 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.690 real 0.260 user 0.230 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/706/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/706/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/706/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/706/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 3423 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3422, there are 6623 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, 1336.0 B/state, compr.: 9.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 6729 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name BlocksWorld-PT-11-LTLCardinality-09
ltl formula formula --ltl=/tmp/706/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 3421 places, 6613 transitions and 33052 arcs
pnml2lts-mc( 0/ 4): Petri net BlocksWorld-PT-11 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.730 real 0.250 user 0.230 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/706/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/706/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/706/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/706/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 3422 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3422, there are 6625 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 ~61636 transitions
pnml2lts-mc( 1/ 4): ~5000 levels ~20000 states ~116936 transitions
pnml2lts-mc( 2/ 4): ~10000 levels ~40000 states ~355800 transitions
pnml2lts-mc( 3/ 4): ~20000 levels ~80000 states ~561444 transitions
pnml2lts-mc( 3/ 4): ~40000 levels ~160000 states ~1135912 transitions
pnml2lts-mc( 3/ 4): ~80000 levels ~320000 states ~2309084 transitions
ltl formula name BlocksWorld-PT-11-LTLCardinality-10
ltl formula formula --ltl=/tmp/706/ltl_10_
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 3421 places, 6613 transitions and 33052 arcs
pnml2lts-mc( 0/ 4): Petri net BlocksWorld-PT-11 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.320 real 0.250 user 0.320 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/706/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/706/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/706/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/706/ltl_10_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 3423 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3422, there are 6620 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 ~93452 transitions
pnml2lts-mc( 3/ 4): ~5000 levels ~20000 states ~177236 transitions
pnml2lts-mc( 3/ 4): ~10000 levels ~40000 states ~352876 transitions
pnml2lts-mc( 3/ 4): ~20000 levels ~80000 states ~708728 transitions
pnml2lts-mc( 3/ 4): ~40000 levels ~160000 states ~1411984 transitions
ltl formula name BlocksWorld-PT-11-LTLCardinality-11
ltl formula formula --ltl=/tmp/706/ltl_11_
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 3421 places, 6613 transitions and 33052 arcs
pnml2lts-mc( 0/ 4): Petri net BlocksWorld-PT-11 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.770 real 0.290 user 0.250 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/706/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/706/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/706/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/706/ltl_11_
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 3423 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3422, there are 6619 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 ~5!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 12
pnml2lts-mc( 0/ 4): unique transitions count: 114
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 155 transitions, fanout: 9.688
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: 1600, Transitions per second: 15500
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, 87.2 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 6729 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name BlocksWorld-PT-11-LTLCardinality-12
ltl formula formula --ltl=/tmp/706/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 3421 places, 6613 transitions and 33052 arcs
pnml2lts-mc( 0/ 4): Petri net BlocksWorld-PT-11 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.050 real 0.290 user 0.240 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/706/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/706/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/706/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/706/ltl_12_
pnml2lts-mc( 0/ 4): There are 3422 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3422, there are 6627 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):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~2!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 4
pnml2lts-mc( 0/ 4): unique transitions count: 28
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: 7
pnml2lts-mc( 0/ 4): - cum. max stack depth: 6
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7 states 86 transitions, fanout: 12.286
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: 700, Transitions per second: 8600
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, 139.7 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 6729 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name BlocksWorld-PT-11-LTLCardinality-13
ltl formula formula --ltl=/tmp/706/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 3421 places, 6613 transitions and 33052 arcs
pnml2lts-mc( 0/ 4): Petri net BlocksWorld-PT-11 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.030 real 0.260 user 0.200 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/706/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/706/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/706/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/706/ltl_13_
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 3423 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3422, there are 6622 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: 7
pnml2lts-mc( 0/ 4): unique transitions count: 84
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: 10
pnml2lts-mc( 0/ 4): - cum. max stack depth: 10
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10 states 115 transitions, fanout: 11.500
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.007 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1000, Transitions per second: 11500
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, 109.8 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 6729 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name BlocksWorld-PT-11-LTLCardinality-14
ltl formula formula --ltl=/tmp/706/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 3421 places, 6613 transitions and 33052 arcs
pnml2lts-mc( 0/ 4): Petri net BlocksWorld-PT-11 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.980 real 0.230 user 0.190 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/706/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/706/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/706/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/706/ltl_14_
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 3423 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3422, there are 6629 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.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 1336.0 B/state, compr.: 9.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 6729 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name BlocksWorld-PT-11-LTLCardinality-15
ltl formula formula --ltl=/tmp/706/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 3421 places, 6613 transitions and 33052 arcs
pnml2lts-mc( 0/ 4): Petri net BlocksWorld-PT-11 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.870 real 0.240 user 0.150 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/706/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/706/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/706/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/706/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 14 states
pnml2lts-mc( 0/ 4): There are 3422 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3422, there are 6668 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: 76
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 107 transitions, fanout: 9.727
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.010 sec minimum, 0.015 sec on average)
pnml2lts-mc( 0/ 4): States per second: 550, Transitions per second: 5350
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, 108.4 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 6729 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.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="BlocksWorld-PT-11"
export BK_EXAMINATION="LTLCardinality"
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 BlocksWorld-PT-11, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r605-tall-171774426900243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-11.tgz
mv BlocksWorld-PT-11 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;