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

About the Execution of LTSMin+red for BlocksWorld-PT-17

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16092.823 1096917.00 1365408.00 1661.00 FTFTTFTTT???TTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r605-tall-171774427000294.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-17, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r605-tall-171774427000294
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 127M
-rw-r--r-- 1 mcc users 2.3M Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 11M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0M Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 21M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 49K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 152K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 6.2M Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 4.2M Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 338K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 812K 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 7.4M 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-17-ReachabilityCardinality-2024-00
FORMULA_NAME BlocksWorld-PT-17-ReachabilityCardinality-2024-01
FORMULA_NAME BlocksWorld-PT-17-ReachabilityCardinality-2024-02
FORMULA_NAME BlocksWorld-PT-17-ReachabilityCardinality-2024-03
FORMULA_NAME BlocksWorld-PT-17-ReachabilityCardinality-2024-04
FORMULA_NAME BlocksWorld-PT-17-ReachabilityCardinality-2024-05
FORMULA_NAME BlocksWorld-PT-17-ReachabilityCardinality-2024-06
FORMULA_NAME BlocksWorld-PT-17-ReachabilityCardinality-2024-07
FORMULA_NAME BlocksWorld-PT-17-ReachabilityCardinality-2024-08
FORMULA_NAME BlocksWorld-PT-17-ReachabilityCardinality-2024-09
FORMULA_NAME BlocksWorld-PT-17-ReachabilityCardinality-2024-10
FORMULA_NAME BlocksWorld-PT-17-ReachabilityCardinality-2024-11
FORMULA_NAME BlocksWorld-PT-17-ReachabilityCardinality-2024-12
FORMULA_NAME BlocksWorld-PT-17-ReachabilityCardinality-2024-13
FORMULA_NAME BlocksWorld-PT-17-ReachabilityCardinality-2024-14
FORMULA_NAME BlocksWorld-PT-17-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717756965689

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-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-07 10:42:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-07 10:42:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 10:42:47] [INFO ] Load time of PNML (sax parser for PT used): 621 ms
[2024-06-07 10:42:47] [INFO ] Transformed 7831 places.
[2024-06-07 10:42:47] [INFO ] Transformed 15313 transitions.
[2024-06-07 10:42:47] [INFO ] Found NUPN structural information;
[2024-06-07 10:42:47] [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, pred_on_table_57, pred_on_table_58, pred_on_table_59, pred_on_table_60, pred_on_table_61, pred_on_table_62, pred_on_table_63, pred_on_table_64, pred_on_table_65, pred_on_table_66, pred_on_table_67, pred_on_table_68, pred_on_table_69, pred_on_table_70, pred_on_table_71, pred_on_table_72, pred_on_table_73, pred_on_table_74, pred_on_table_75, pred_on_table_76, pred_on_table_77, pred_on_table_78, pred_on_table_79, pred_on_table_80, pred_on_table_81, pred_on_table_82, pred_on_table_83, pred_on_table_84, pred_on_table_85, pred_on_table_86]
[2024-06-07 10:42:47] [INFO ] Parsed PT model containing 7831 places and 15313 transitions and 76536 arcs in 868 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 466 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 50445 ms. (0 steps per ms) remains 13/16 properties
FORMULA BlocksWorld-PT-17-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-17-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-17-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 12389 steps (0 resets) in 20097 ms. (0 steps per ms) remains 11/13 properties
FORMULA BlocksWorld-PT-17-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-17-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 5572 ms. (7 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 15911 ms. (2 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 5475 ms. (7 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 13881 ms. (2 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1860 ms. (21 steps per ms) remains 10/11 properties
FORMULA BlocksWorld-PT-17-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10314 steps (0 resets) in 20034 ms. (0 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5682 ms. (7 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5774 ms. (6 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5386 ms. (7 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 5777 ms. (6 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 5774 ms. (6 steps per ms) remains 10/10 properties
// Phase 1: matrix 15313 rows 7831 cols
[2024-06-07 10:43:30] [INFO ] Computed 175 invariants in 249 ms
[2024-06-07 10:43:30] [INFO ] State equation strengthened by 161 read => feed constraints.
Problem BlocksWorld-PT-17-ReachabilityCardinality-2024-01 is UNSAT
FORMULA BlocksWorld-PT-17-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-17-ReachabilityCardinality-2024-02 is UNSAT
FORMULA BlocksWorld-PT-17-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-17-ReachabilityCardinality-2024-04 is UNSAT
FORMULA BlocksWorld-PT-17-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-17-ReachabilityCardinality-2024-05 is UNSAT
FORMULA BlocksWorld-PT-17-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-17-ReachabilityCardinality-2024-07 is UNSAT
FORMULA BlocksWorld-PT-17-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-17-ReachabilityCardinality-2024-13 is UNSAT
FORMULA BlocksWorld-PT-17-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-17-ReachabilityCardinality-2024-14 is UNSAT
FORMULA BlocksWorld-PT-17-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7831 variables, 175/175 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7831 variables, 0/175 constraints. Problems are: Problem set: 7 solved, 3 unsolved
SMT process timed out in 21173ms, After SMT, problems are : Problem set: 7 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 27 out of 7831 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7831/7831 places, 15313/15313 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 7831 transition count 15312
Applied a total of 1 rules in 230188 ms. Remains 7831 /7831 variables (removed 0) and now considering 15312/15313 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230202 ms. Remains : 7831/7831 places, 15312/15313 transitions.
RANDOM walk for 40000 steps (8 resets) in 7088 ms. (5 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1054 ms. (37 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1001 ms. (39 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 915 ms. (43 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 256961 steps, run timeout after 6001 ms. (steps per millisecond=42 ) properties seen :0 out of 3
Probabilistic random walk after 256961 steps, saw 228976 distinct states, run finished after 6008 ms. (steps per millisecond=42 ) properties seen :0
// Phase 1: matrix 15312 rows 7831 cols
[2024-06-07 10:47:50] [INFO ] Computed 175 invariants in 128 ms
[2024-06-07 10:47:50] [INFO ] State equation strengthened by 160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3333/3360 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3360 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4471/7831 variables, 132/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7831 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 15312/23143 variables, 7831/8006 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23143 variables, 160/8166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23143 variables, 0/8166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/23143 variables, 0/8166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23143/23143 variables, and 8166 constraints, problems are : Problem set: 0 solved, 3 unsolved in 11393 ms.
Refiners :[Positive P Invariants (semi-flows): 175/175 constraints, State Equation: 7831/7831 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3333/3360 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3360 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4471/7831 variables, 132/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7831 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 15312/23143 variables, 7831/8006 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23143 variables, 160/8166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23143 variables, 3/8169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23143 variables, 0/8169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 10:48:26] [INFO ] Deduced a trap composed of 720 places in 1159 ms of which 77 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/23143 variables, 1/8170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/23143 variables, 0/8170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 10:48:37] [INFO ] Deduced a trap composed of 720 places in 1178 ms of which 13 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/23143 variables, 1/8171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 10:48:43] [INFO ] Deduced a trap composed of 858 places in 1440 ms of which 12 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/23143 variables, 1/8172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 23143/23143 variables, and 8172 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45074 ms.
Refiners :[Positive P Invariants (semi-flows): 175/175 constraints, State Equation: 7831/7831 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 56671ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 27 out of 7831 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7831/7831 places, 15312/15312 transitions.
Applied a total of 0 rules in 165416 ms. Remains 7831 /7831 variables (removed 0) and now considering 15312/15312 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165417 ms. Remains : 7831/7831 places, 15312/15312 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7831/7831 places, 15312/15312 transitions.
Applied a total of 0 rules in 168136 ms. Remains 7831 /7831 variables (removed 0) and now considering 15312/15312 (removed 0) transitions.
[2024-06-07 10:54:20] [INFO ] Invariant cache hit.
[2024-06-07 10:54:32] [INFO ] Implicit Places using invariants in 11563 ms returned []
Implicit Place search using SMT only with invariants took 11574 ms to find 0 implicit places.
Running 15305 sub problems to find dead transitions.
[2024-06-07 10:54:32] [INFO ] Invariant cache hit.
[2024-06-07 10:54:32] [INFO ] State equation strengthened by 160 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1758 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD2110 is UNSAT
Problem TDEAD2198 is UNSAT
Problem TDEAD2286 is UNSAT
Problem TDEAD2374 is UNSAT
Problem TDEAD2462 is UNSAT
Problem TDEAD2550 is UNSAT
Problem TDEAD2638 is UNSAT
Problem TDEAD2726 is UNSAT
Problem TDEAD2814 is UNSAT
Problem TDEAD2902 is UNSAT
Problem TDEAD2990 is UNSAT
Problem TDEAD3078 is UNSAT
Problem TDEAD3166 is UNSAT
Problem TDEAD3254 is UNSAT
Problem TDEAD3342 is UNSAT
Problem TDEAD3430 is UNSAT
Problem TDEAD3606 is UNSAT
Problem TDEAD3694 is UNSAT
Problem TDEAD3782 is UNSAT
Problem TDEAD3870 is UNSAT
Problem TDEAD3958 is UNSAT
Problem TDEAD4046 is UNSAT
Problem TDEAD4134 is UNSAT
Problem TDEAD4222 is UNSAT
Problem TDEAD4310 is UNSAT
Problem TDEAD4398 is UNSAT
Problem TDEAD4486 is UNSAT
Problem TDEAD4662 is UNSAT
Problem TDEAD4750 is UNSAT
Problem TDEAD4838 is UNSAT
Problem TDEAD4926 is UNSAT
Problem TDEAD5014 is UNSAT
Problem TDEAD5102 is UNSAT
Problem TDEAD5190 is UNSAT
Problem TDEAD5278 is UNSAT
Problem TDEAD5366 is UNSAT
Problem TDEAD5454 is UNSAT
Problem TDEAD5542 is UNSAT
Problem TDEAD5630 is UNSAT
Problem TDEAD5718 is UNSAT
Problem TDEAD5806 is UNSAT
Problem TDEAD5894 is UNSAT
Problem TDEAD5982 is UNSAT
Problem TDEAD6070 is UNSAT
Problem TDEAD6158 is UNSAT
Problem TDEAD6246 is UNSAT
Problem TDEAD6334 is UNSAT
Problem TDEAD6422 is UNSAT
Problem TDEAD6510 is UNSAT
Problem TDEAD6598 is UNSAT
Problem TDEAD6686 is UNSAT
Problem TDEAD6774 is UNSAT
Problem TDEAD6862 is UNSAT
Problem TDEAD6950 is UNSAT
Problem TDEAD7038 is UNSAT
Problem TDEAD7126 is UNSAT
Problem TDEAD7302 is UNSAT
Problem TDEAD7390 is UNSAT
Problem TDEAD7478 is UNSAT
Problem TDEAD7566 is UNSAT
Problem TDEAD7654 is UNSAT
Problem TDEAD7742 is UNSAT
Problem TDEAD7830 is UNSAT
Problem TDEAD8002 is UNSAT
Problem TDEAD8172 is UNSAT
Problem TDEAD8340 is UNSAT
Problem TDEAD8506 is UNSAT
Problem TDEAD8670 is UNSAT
Problem TDEAD8832 is UNSAT
Problem TDEAD8992 is UNSAT
Problem TDEAD9150 is UNSAT
Problem TDEAD9306 is UNSAT
Problem TDEAD9460 is UNSAT
Problem TDEAD9612 is UNSAT
Problem TDEAD9910 is UNSAT
Problem TDEAD10056 is UNSAT
Problem TDEAD10200 is UNSAT
Problem TDEAD10342 is UNSAT
Problem TDEAD10482 is UNSAT
Problem TDEAD10620 is UNSAT
Problem TDEAD10756 is UNSAT
Problem TDEAD11022 is UNSAT
Problem TDEAD11152 is UNSAT
Problem TDEAD11280 is UNSAT
Problem TDEAD11406 is UNSAT
Problem TDEAD11530 is UNSAT
Problem TDEAD11652 is UNSAT
Problem TDEAD11772 is UNSAT
Problem TDEAD11890 is UNSAT
Problem TDEAD12006 is UNSAT
Problem TDEAD12120 is UNSAT
Problem TDEAD12232 is UNSAT
Problem TDEAD12342 is UNSAT
Problem TDEAD12450 is UNSAT
Problem TDEAD12556 is UNSAT
Problem TDEAD12660 is UNSAT
Problem TDEAD12762 is UNSAT
Problem TDEAD12960 is UNSAT
Problem TDEAD13056 is UNSAT
Problem TDEAD13150 is UNSAT
Problem TDEAD13242 is UNSAT
Problem TDEAD13332 is UNSAT
Problem TDEAD13420 is UNSAT
Problem TDEAD13506 is UNSAT
Problem TDEAD13590 is UNSAT
Problem TDEAD13672 is UNSAT
Problem TDEAD13752 is UNSAT
Problem TDEAD13830 is UNSAT
Problem TDEAD13980 is UNSAT
Problem TDEAD14052 is UNSAT
Problem TDEAD14122 is UNSAT
Problem TDEAD14190 is UNSAT
Problem TDEAD14256 is UNSAT
Problem TDEAD14320 is UNSAT
Problem TDEAD14382 is UNSAT
Problem TDEAD14442 is UNSAT
Problem TDEAD14500 is UNSAT
Problem TDEAD14556 is UNSAT
Problem TDEAD14610 is UNSAT
Problem TDEAD14662 is UNSAT
Problem TDEAD14712 is UNSAT
Problem TDEAD14760 is UNSAT
Problem TDEAD14806 is UNSAT
Problem TDEAD14850 is UNSAT
Problem TDEAD14892 is UNSAT
Problem TDEAD14932 is UNSAT
Problem TDEAD14970 is UNSAT
Problem TDEAD15006 is UNSAT
Problem TDEAD15040 is UNSAT
Problem TDEAD15072 is UNSAT
Problem TDEAD15102 is UNSAT
Problem TDEAD15130 is UNSAT
Problem TDEAD15156 is UNSAT
Problem TDEAD15180 is UNSAT
Problem TDEAD15202 is UNSAT
Problem TDEAD15222 is UNSAT
Problem TDEAD15240 is UNSAT
Problem TDEAD15270 is UNSAT
Problem TDEAD15282 is UNSAT
Problem TDEAD15292 is UNSAT
Problem TDEAD15300 is UNSAT
Problem TDEAD15306 is UNSAT
Problem TDEAD15310 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/7824 variables, 163/163 constraints. Problems are: Problem set: 164 solved, 15141 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7824/23143 variables, and 163 constraints, problems are : Problem set: 164 solved, 15141 unsolved in 30241 ms.
Refiners :[Positive P Invariants (semi-flows): 163/175 constraints, State Equation: 0/7831 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 15223/7656 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 164 solved, 15141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7742 variables, 6/6 constraints. Problems are: Problem set: 164 solved, 15141 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7742/23143 variables, and 6 constraints, problems are : Problem set: 164 solved, 15141 unsolved in 30221 ms.
Refiners :[Positive P Invariants (semi-flows): 6/175 constraints, State Equation: 0/7831 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 7567/7656 constraints, Known Traps: 0/0 constraints]
After SMT, in 220155ms problems are : Problem set: 164 solved, 15141 unsolved
Search for dead transitions found 164 dead transitions in 220303ms
Found 164 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 164 transitions
Dead transitions reduction (with SMT) removed 164 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 7831/7831 places, 15148/15312 transitions.
Graph (complete) has 38121 edges and 7831 vertex of which 7749 are kept as prefixes of interest. Removing 82 places using SCC suffix rule.10 ms
Discarding 82 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 159281 ms. Remains 7749 /7831 variables (removed 82) and now considering 15148/15148 (removed 0) transitions.
// Phase 1: matrix 15148 rows 7749 cols
[2024-06-07 11:00:51] [INFO ] Computed 175 invariants in 99 ms
[2024-06-07 11:01:00] [INFO ] Implicit Places using invariants in 9135 ms returned []
Implicit Place search using SMT only with invariants took 9137 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 7749/7831 places, 15148/15312 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 568504 ms. Remains : 7749/7831 places, 15148/15312 transitions.
[2024-06-07 11:01:00] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-06-07 11:01:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 7749 places, 15148 transitions and 75566 arcs took 66 ms.
[2024-06-07 11:01:02] [INFO ] Flatten gal took : 919 ms
Total runtime 1095322 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-17-ReachabilityCardinality-2024-09
Could not compute solution for formula : BlocksWorld-PT-17-ReachabilityCardinality-2024-10
Could not compute solution for formula : BlocksWorld-PT-17-ReachabilityCardinality-2024-11

BK_STOP 1717758062606

--------------------
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-17-ReachabilityCardinality-2024-09
rfs formula type EF
rfs formula formula --invariant=/tmp/568/inv_0_
rfs formula name BlocksWorld-PT-17-ReachabilityCardinality-2024-10
rfs formula type AG
rfs formula formula --invariant=/tmp/568/inv_1_
rfs formula name BlocksWorld-PT-17-ReachabilityCardinality-2024-11
rfs formula type AG
rfs formula formula --invariant=/tmp/568/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-17"
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-17, 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-171774427000294"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-17.tgz
mv BlocksWorld-PT-17 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 ;