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-171774426900246.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r605-tall-171774426900246
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1717751966358

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
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:19:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-07 09:19:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 09:19:27] [INFO ] Load time of PNML (sax parser for PT used): 318 ms
[2024-06-07 09:19:27] [INFO ] Transformed 3421 places.
[2024-06-07 09:19:28] [INFO ] Transformed 6613 transitions.
[2024-06-07 09:19:28] [INFO ] Found NUPN structural information;
[2024-06-07 09:19:28] [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:19:28] [INFO ] Parsed PT model containing 3421 places and 6613 transitions and 33052 arcs in 466 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 210 ms.
Working with output stream class java.io.PrintStream
FORMULA BlocksWorld-PT-11-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 16026 ms. (2 steps per ms) remains 13/15 properties
FORMULA BlocksWorld-PT-11-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-11-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 2947 ms. (13 steps per ms) remains 12/13 properties
FORMULA BlocksWorld-PT-11-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 1490 ms. (26 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 728 ms. (54 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3027 ms. (13 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17901 ms. (2 steps per ms) remains 11/12 properties
FORMULA BlocksWorld-PT-11-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 6966 ms. (5 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17961 ms. (2 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1554 ms. (25 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1261 ms. (31 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1291 ms. (30 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1287 ms. (31 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1228 ms. (32 steps per ms) remains 11/11 properties
// Phase 1: matrix 6613 rows 3421 cols
[2024-06-07 09:19:48] [INFO ] Computed 115 invariants in 112 ms
[2024-06-07 09:19:48] [INFO ] State equation strengthened by 97 read => feed constraints.
Problem BlocksWorld-PT-11-ReachabilityCardinality-2024-01 is UNSAT
FORMULA BlocksWorld-PT-11-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-11-ReachabilityCardinality-2024-02 is UNSAT
FORMULA BlocksWorld-PT-11-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-11-ReachabilityCardinality-2024-03 is UNSAT
FORMULA BlocksWorld-PT-11-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-11-ReachabilityCardinality-2024-05 is UNSAT
FORMULA BlocksWorld-PT-11-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-11-ReachabilityCardinality-2024-07 is UNSAT
FORMULA BlocksWorld-PT-11-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-11-ReachabilityCardinality-2024-11 is UNSAT
FORMULA BlocksWorld-PT-11-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-11-ReachabilityCardinality-2024-12 is UNSAT
FORMULA BlocksWorld-PT-11-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-11-ReachabilityCardinality-2024-13 is UNSAT
FORMULA BlocksWorld-PT-11-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/3421 variables, 115/115 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3421 variables, 0/115 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 6612/10033 variables, 3421/3536 constraints. Problems are: Problem set: 8 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10033/10034 variables, and 3632 constraints, problems are : Problem set: 8 solved, 3 unsolved in 5056 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, State Equation: 3421/3421 constraints, ReadFeed: 96/97 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3421 variables, 115/115 constraints. Problems are: Problem set: 8 solved, 3 unsolved
[2024-06-07 09:20:07] [INFO ] Deduced a trap composed of 58 places in 4525 ms of which 176 ms to minimize.
SMT process timed out in 19424ms, After SMT, problems are : Problem set: 8 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3421 out of 3421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3421/3421 places, 6613/6613 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 3421 transition count 6612
Applied a total of 1 rules in 1103 ms. Remains 3421 /3421 variables (removed 0) and now considering 6612/6613 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1112 ms. Remains : 3421/3421 places, 6612/6613 transitions.
RANDOM walk for 40000 steps (8 resets) in 5954 ms. (6 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17177 ms. (2 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 632 ms. (63 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 622 ms. (64 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 257558 steps, run timeout after 18003 ms. (steps per millisecond=14 ) properties seen :0 out of 3
Probabilistic random walk after 257558 steps, saw 219697 distinct states, run finished after 18010 ms. (steps per millisecond=14 ) properties seen :0
// Phase 1: matrix 6612 rows 3421 cols
[2024-06-07 09:20:33] [INFO ] Computed 115 invariants in 45 ms
[2024-06-07 09:20:33] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3421 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3421 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 6612/10033 variables, 3421/3536 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10033 variables, 96/3632 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10033 variables, 0/3632 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/10033 variables, 0/3632 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10033/10033 variables, and 3632 constraints, problems are : Problem set: 0 solved, 3 unsolved in 9094 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, State Equation: 3421/3421 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3421 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 09:20:50] [INFO ] Deduced a trap composed of 58 places in 4317 ms of which 23 ms to minimize.
[2024-06-07 09:20:54] [INFO ] Deduced a trap composed of 58 places in 4354 ms of which 25 ms to minimize.
[2024-06-07 09:20:59] [INFO ] Deduced a trap composed of 58 places in 4328 ms of which 25 ms to minimize.
[2024-06-07 09:21:03] [INFO ] Deduced a trap composed of 114 places in 4344 ms of which 23 ms to minimize.
[2024-06-07 09:21:08] [INFO ] Deduced a trap composed of 408 places in 4386 ms of which 22 ms to minimize.
[2024-06-07 09:21:12] [INFO ] Deduced a trap composed of 828 places in 4205 ms of which 26 ms to minimize.
[2024-06-07 09:21:17] [INFO ] Deduced a trap composed of 168 places in 4459 ms of which 25 ms to minimize.
[2024-06-07 09:21:21] [INFO ] Deduced a trap composed of 58 places in 4353 ms of which 24 ms to minimize.
[2024-06-07 09:21:26] [INFO ] Deduced a trap composed of 168 places in 4428 ms of which 26 ms to minimize.
[2024-06-07 09:21:30] [INFO ] Deduced a trap composed of 58 places in 4372 ms of which 24 ms to minimize.
SMT process timed out in 57605ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3421 out of 3421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3421/3421 places, 6612/6612 transitions.
Applied a total of 0 rules in 972 ms. Remains 3421 /3421 variables (removed 0) and now considering 6612/6612 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 972 ms. Remains : 3421/3421 places, 6612/6612 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3421/3421 places, 6612/6612 transitions.
Applied a total of 0 rules in 880 ms. Remains 3421 /3421 variables (removed 0) and now considering 6612/6612 (removed 0) transitions.
[2024-06-07 09:21:32] [INFO ] Invariant cache hit.
[2024-06-07 09:21:32] [INFO ] Implicit Places using invariants in 476 ms returned []
[2024-06-07 09:21:32] [INFO ] Invariant cache hit.
[2024-06-07 09:21:36] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-07 09:21:36] [INFO ] Implicit Places using invariants and state equation in 3429 ms returned []
Implicit Place search using SMT with State Equation took 3930 ms to find 0 implicit places.
[2024-06-07 09:21:37] [INFO ] Redundant transitions in 691 ms returned []
Running 6603 sub problems to find dead transitions.
[2024-06-07 09:21:37] [INFO ] Invariant cache hit.
[2024-06-07 09:21:37] [INFO ] State equation strengthened by 96 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 TDEAD2202 is UNSAT
Problem TDEAD2260 is UNSAT
Problem TDEAD2318 is UNSAT
Problem TDEAD2434 is UNSAT
Problem TDEAD2492 is UNSAT
Problem TDEAD2550 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 TDEAD6150 is UNSAT
Problem TDEAD6192 is UNSAT
Problem TDEAD6232 is UNSAT
Problem TDEAD6306 is UNSAT
Problem TDEAD6340 is UNSAT
Problem TDEAD6372 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/3412 variables, 98/98 constraints. Problems are: Problem set: 98 solved, 6505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3412/10033 variables, and 98 constraints, problems are : Problem set: 98 solved, 6505 unsolved in 30137 ms.
Refiners :[Positive P Invariants (semi-flows): 98/115 constraints, State Equation: 0/3421 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 6554/3306 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 98 solved, 6505 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3363 variables, 9/9 constraints. Problems are: Problem set: 98 solved, 6505 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 1)
(s3 0)
(s4 1)
(s5 1)
(s6 0)
(s7 1)
(s8 1)
(s9 0)
(s10 1)
(s11 1)
(s12 0)
(s13 1)
(s14 1)
(s15 0)
(s16 1)
(s17 1)
(s18 0)
(s19 1)
(s20 1)
(s21 0)
(s22 1)
(s23 1)
(s24 0)
(s25 1)
(s26 1)
(s27 0)
(s28 1)
(s29 1)
(s30 0)
(s31 1)
(s32 1)
(s33 0)
(s34 1)
(s35 1)
(s36 0)
(s37 1)
(s38 1)
(s39 0)
(s40 1)
(s41 1)
(s42 0)
(s43 1)
(s44 1)
(s45 0)
(s46 1)
(s47 1)
(s48 0)
(s49 1)
(s50 1)
(s51 0)
(s52 1)
(s53 1)
(s54 0)
(s55 1)
(s56 1)
(s57 0)
(s58 1)
(s59 1)
(s60 0)
(s61 1)
(s62 1)
(s63 0)
(s64 1)
(s65 1)
(s66 0)
(s67 1)
(s68 1)
(s69 0)
(s70 1)
(s71 1)
(s72 0)
(s73 1)
(s74 1)
(s75 0)
(s76 1)
(s77 1)
(s78 0)
(s79 1)
(s80 1)
(s81 0)
(s82 1)
(s83 1)
(s84 0)
(s85 1)
(s86 1)
(s87 0)
(s88 1)
(s89 1)
(s90 0)
(s91 1)
(s92 1)
(s93 0)
(s94 1)
(s95 1)
(s96 0)
(s97 1)
(s98 1)
(s99 0)
(s100 1)
(s101 1)
(s102 0)
(s103 1)
(s104 1)
(s105 0)
(s106 1)
(s107 1)
(s108 0)
(s109 1)
(s110 1)
(s111 0)
(s112 1)
(s113 1)
(s114 0)
(s115 1)
(s116 1)
(s117 0)
(s118 1)
(s119 1)
(s120 0)
(s121 1)
(s122 1)
(s123 0)
(s124 1)
(s125 1)
(s126 0)
(s127 1)
(s128 1)
(s129 0)
(s130 1)
(s131 1)
(s132 0)
(s133 1)
(s134 1)
(s135 0)
(s136 1)
(s137 1)
(s138 0)
(s139 1)
(s140 1)
(s141 0)
(s142 1)
(s143 1)
(s144 0)
(s145 1)
(s146 1)
(s147 0)
(s148 1)
(s149 1)
(s150 0)
(s151 1)
(s152 1)
(s153 0)
(s154 1)
(s155 1)
(s156 0)
(s157 1)
(s158 1)
(s159 0)
(s160 1)
(s161 1)
(s162 0)
(s163 1)
(s164 1)
(s165 0)
(s166 1)
(s167 1)
(s168 0)
(s169 1)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3363/10033 variables, and 9 constraints, problems are : Problem set: 98 solved, 6505 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 9/115 constraints, State Equation: 0/3421 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 3248/3306 constraints, Known Traps: 0/0 constraints]
After SMT, in 121229ms problems are : Problem set: 98 solved, 6505 unsolved
Search for dead transitions found 98 dead transitions in 121367ms
Found 98 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 98 transitions
Dead transitions reduction (with SMT) removed 98 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 3421/3421 places, 6514/6612 transitions.
Deduced a syphon composed of 49 places in 3 ms
Applied a total of 0 rules in 935 ms. Remains 3421 /3421 variables (removed 0) and now considering 6514/6514 (removed 0) transitions.
[2024-06-07 09:23:39] [INFO ] Redundant transitions in 497 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 128363 ms. Remains : 3421/3421 places, 6514/6612 transitions.
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
RANDOM walk for 40000 steps (8 resets) in 5997 ms. (6 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16269 ms. (2 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 641 ms. (62 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 646 ms. (61 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 262450 steps, run timeout after 18003 ms. (steps per millisecond=14 ) properties seen :0 out of 3
Probabilistic random walk after 262450 steps, saw 224347 distinct states, run finished after 18004 ms. (steps per millisecond=14 ) properties seen :0
// Phase 1: matrix 6514 rows 3372 cols
[2024-06-07 09:24:04] [INFO ] Computed 115 invariants in 34 ms
[2024-06-07 09:24:04] [INFO ] State equation strengthened by 16 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3372 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3372 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 6514/9886 variables, 3372/3487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9886 variables, 16/3503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9886 variables, 0/3503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/9886 variables, 0/3503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9886/9886 variables, and 3503 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4832 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, State Equation: 3372/3372 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3372 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 09:24:15] [INFO ] Deduced a trap composed of 270 places in 4142 ms of which 20 ms to minimize.
[2024-06-07 09:24:20] [INFO ] Deduced a trap composed of 270 places in 3987 ms of which 24 ms to minimize.
[2024-06-07 09:24:24] [INFO ] Deduced a trap composed of 168 places in 4298 ms of which 25 ms to minimize.
[2024-06-07 09:24:28] [INFO ] Deduced a trap composed of 114 places in 4202 ms of which 22 ms to minimize.
[2024-06-07 09:24:33] [INFO ] Deduced a trap composed of 168 places in 4268 ms of which 23 ms to minimize.
[2024-06-07 09:24:37] [INFO ] Deduced a trap composed of 168 places in 4234 ms of which 22 ms to minimize.
[2024-06-07 09:24:42] [INFO ] Deduced a trap composed of 168 places in 4256 ms of which 23 ms to minimize.
[2024-06-07 09:24:46] [INFO ] Deduced a trap composed of 270 places in 4405 ms of which 25 ms to minimize.
[2024-06-07 09:24:50] [INFO ] Deduced a trap composed of 688 places in 4246 ms of which 23 ms to minimize.
[2024-06-07 09:24:55] [INFO ] Deduced a trap composed of 630 places in 4436 ms of which 22 ms to minimize.
[2024-06-07 09:25:00] [INFO ] Deduced a trap composed of 168 places in 4337 ms of which 25 ms to minimize.
[2024-06-07 09:25:04] [INFO ] Deduced a trap composed of 168 places in 4350 ms of which 25 ms to minimize.
[2024-06-07 09:25:08] [INFO ] Deduced a trap composed of 220 places in 4034 ms of which 20 ms to minimize.
[2024-06-07 09:25:13] [INFO ] Deduced a trap composed of 168 places in 4402 ms of which 25 ms to minimize.
[2024-06-07 09:25:17] [INFO ] Deduced a trap composed of 688 places in 4189 ms of which 22 ms to minimize.
[2024-06-07 09:25:21] [INFO ] Deduced a trap composed of 168 places in 4204 ms of which 23 ms to minimize.
[2024-06-07 09:25:26] [INFO ] Deduced a trap composed of 168 places in 4324 ms of which 24 ms to minimize.
SMT process timed out in 82324ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3372 out of 3372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3372/3372 places, 6514/6514 transitions.
Applied a total of 0 rules in 906 ms. Remains 3372 /3372 variables (removed 0) and now considering 6514/6514 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 907 ms. Remains : 3372/3372 places, 6514/6514 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3372/3372 places, 6514/6514 transitions.
Applied a total of 0 rules in 891 ms. Remains 3372 /3372 variables (removed 0) and now considering 6514/6514 (removed 0) transitions.
[2024-06-07 09:25:28] [INFO ] Invariant cache hit.
[2024-06-07 09:25:28] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-06-07 09:25:28] [INFO ] Invariant cache hit.
[2024-06-07 09:25:31] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-07 09:25:32] [INFO ] Implicit Places using invariants and state equation in 3485 ms returned []
Implicit Place search using SMT with State Equation took 3924 ms to find 0 implicit places.
[2024-06-07 09:25:32] [INFO ] Redundant transitions in 607 ms returned []
Running 6505 sub problems to find dead transitions.
[2024-06-07 09:25:32] [INFO ] Invariant cache hit.
[2024-06-07 09:25:32] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3363 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 6505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3363/9886 variables, and 98 constraints, problems are : Problem set: 0 solved, 6505 unsolved in 30111 ms.
Refiners :[Positive P Invariants (semi-flows): 98/115 constraints, State Equation: 0/3372 constraints, ReadFeed: 0/16 constraints, PredecessorRefiner: 6505/3257 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6505 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3363 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 6505 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3363/9886 variables, and 98 constraints, problems are : Problem set: 0 solved, 6505 unsolved in 30096 ms.
Refiners :[Positive P Invariants (semi-flows): 98/115 constraints, State Equation: 0/3372 constraints, ReadFeed: 0/16 constraints, PredecessorRefiner: 3248/3257 constraints, Known Traps: 0/0 constraints]
After SMT, in 117311ms problems are : Problem set: 0 solved, 6505 unsolved
Search for dead transitions found 0 dead transitions in 117370ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122821 ms. Remains : 3372/3372 places, 6514/6514 transitions.
[2024-06-07 09:27:30] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 18 ms.
[2024-06-07 09:27:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3372 places, 6514 transitions and 32456 arcs took 48 ms.
[2024-06-07 09:27:31] [INFO ] Flatten gal took : 450 ms
Total runtime 483462 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BlocksWorld-PT-11-ReachabilityCardinality-2024-04
Could not compute solution for formula : BlocksWorld-PT-11-ReachabilityCardinality-2024-08
Could not compute solution for formula : BlocksWorld-PT-11-ReachabilityCardinality-2024-09

BK_STOP 1717752451370

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name BlocksWorld-PT-11-ReachabilityCardinality-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/665/inv_0_
rfs formula name BlocksWorld-PT-11-ReachabilityCardinality-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/665/inv_1_
rfs formula name BlocksWorld-PT-11-ReachabilityCardinality-2024-09
rfs formula type EF
rfs formula formula --invariant=/tmp/665/inv_2_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-171774426900246"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;