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-171774426700183.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-03, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r605-tall-171774426700183
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 83K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 410K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 176K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 991K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 13K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 43K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 186K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 89K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 444K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 91K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 510K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 16K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 39K 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 330K 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-03-ReachabilityFireability-2024-00
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2024-01
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2024-02
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2024-03
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2024-04
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2024-05
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2024-06
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2024-07
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2024-08
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2024-09
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2024-10
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2024-11
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2024-12
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2024-13
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2024-14
FORMULA_NAME BlocksWorld-PT-03-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717745938192

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-07 07:38:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-07 07:38:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:38:59] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-06-07 07:38:59] [INFO ] Transformed 379 places.
[2024-06-07 07:38:59] [INFO ] Transformed 685 transitions.
[2024-06-07 07:38:59] [INFO ] Found NUPN structural information;
[2024-06-07 07:38:59] [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]
[2024-06-07 07:38:59] [INFO ] Parsed PT model containing 379 places and 685 transitions and 3412 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 42 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 3295 ms. (12 steps per ms) remains 8/13 properties
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1061 ms. (37 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1221 ms. (32 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1517 ms. (26 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 2052 ms. (19 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 343 ms. (116 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 392 ms. (101 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 270 ms. (147 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 8/8 properties
// Phase 1: matrix 685 rows 379 cols
[2024-06-07 07:39:02] [INFO ] Computed 37 invariants in 24 ms
[2024-06-07 07:39:02] [INFO ] State equation strengthened by 27 read => feed constraints.
Problem BlocksWorld-PT-03-ReachabilityFireability-2024-01 is UNSAT
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-03-ReachabilityFireability-2024-05 is UNSAT
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-03-ReachabilityFireability-2024-02 is UNSAT
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-03-ReachabilityFireability-2024-03 is UNSAT
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-03-ReachabilityFireability-2024-08 is UNSAT
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-03-ReachabilityFireability-2024-09 is UNSAT
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-03-ReachabilityFireability-2024-14 is UNSAT
FORMULA BlocksWorld-PT-03-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/379 variables, 37/37 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/379 variables, 0/37 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 684/1063 variables, 379/416 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1063 variables, 26/442 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1063 variables, 0/442 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/1064 variables, 1/443 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1064 variables, 0/443 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1064 variables, 0/443 constraints. Problems are: Problem set: 7 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1064/1064 variables, and 443 constraints, problems are : Problem set: 7 solved, 1 unsolved in 695 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 379/379 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 339/353 variables, 28/28 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/28 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/379 variables, 9/37 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/37 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 684/1063 variables, 379/416 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1063 variables, 26/442 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1063 variables, 1/443 constraints. Problems are: Problem set: 7 solved, 1 unsolved
[2024-06-07 07:39:05] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1063 variables, 1/444 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1063 variables, 0/444 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1064 variables, 1/445 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1064 variables, 0/445 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1064 variables, 0/445 constraints. Problems are: Problem set: 7 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1064/1064 variables, and 445 constraints, problems are : Problem set: 7 solved, 1 unsolved in 543 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 379/379 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 3364ms problems are : Problem set: 7 solved, 1 unsolved
Parikh walk visited 0 properties in 44 ms.
Support contains 14 out of 379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 685/685 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 379 transition count 684
Applied a total of 1 rules in 712 ms. Remains 379 /379 variables (removed 0) and now considering 684/685 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 725 ms. Remains : 379/379 places, 684/685 transitions.
RANDOM walk for 40000 steps (8 resets) in 562 ms. (71 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 907798 steps, run timeout after 3001 ms. (steps per millisecond=302 ) properties seen :0 out of 1
Probabilistic random walk after 907798 steps, saw 705453 distinct states, run finished after 3007 ms. (steps per millisecond=301 ) properties seen :0
// Phase 1: matrix 684 rows 379 cols
[2024-06-07 07:39:10] [INFO ] Computed 37 invariants in 13 ms
[2024-06-07 07:39:10] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 339/353 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/379 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 684/1063 variables, 379/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1063 variables, 26/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1063 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1063 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1063/1063 variables, and 442 constraints, problems are : Problem set: 0 solved, 1 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 379/379 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 339/353 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/379 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 684/1063 variables, 379/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1063 variables, 26/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1063 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 07:39:10] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1063 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1063 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1063 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1063/1063 variables, and 444 constraints, problems are : Problem set: 0 solved, 1 unsolved in 434 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 379/379 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 795ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 14 out of 379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 684/684 transitions.
Applied a total of 0 rules in 307 ms. Remains 379 /379 variables (removed 0) and now considering 684/684 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 379/379 places, 684/684 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 684/684 transitions.
Applied a total of 0 rules in 315 ms. Remains 379 /379 variables (removed 0) and now considering 684/684 (removed 0) transitions.
[2024-06-07 07:39:11] [INFO ] Invariant cache hit.
[2024-06-07 07:39:11] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-06-07 07:39:11] [INFO ] Invariant cache hit.
[2024-06-07 07:39:11] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-07 07:39:12] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
[2024-06-07 07:39:12] [INFO ] Redundant transitions in 37 ms returned []
Running 679 sub problems to find dead transitions.
[2024-06-07 07:39:12] [INFO ] Invariant cache hit.
[2024-06-07 07:39:12] [INFO ] State equation strengthened by 26 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD682 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 27/27 constraints. Problems are: Problem set: 26 solved, 653 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 0/27 constraints. Problems are: Problem set: 26 solved, 653 unsolved
Problem TDEAD93 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD678 is UNSAT
At refinement iteration 2 (OVERLAPS) 5/379 variables, 10/37 constraints. Problems are: Problem set: 36 solved, 643 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 0/37 constraints. Problems are: Problem set: 36 solved, 643 unsolved
At refinement iteration 4 (OVERLAPS) 684/1063 variables, 379/416 constraints. Problems are: Problem set: 36 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1063 variables, 26/442 constraints. Problems are: Problem set: 36 solved, 643 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1063 variables, 0/442 constraints. Problems are: Problem set: 36 solved, 643 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 Real declared 1063/1063 variables, and 442 constraints, problems are : Problem set: 36 solved, 643 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 379/379 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 679/679 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 36 solved, 643 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 1/1 constraints. Problems are: Problem set: 36 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/1 constraints. Problems are: Problem set: 36 solved, 643 unsolved
At refinement iteration 2 (OVERLAPS) 23/379 variables, 36/37 constraints. Problems are: Problem set: 36 solved, 643 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 0/37 constraints. Problems are: Problem set: 36 solved, 643 unsolved
At refinement iteration 4 (OVERLAPS) 684/1063 variables, 379/416 constraints. Problems are: Problem set: 36 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1063 variables, 26/442 constraints. Problems are: Problem set: 36 solved, 643 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1063 variables, 643/1085 constraints. Problems are: Problem set: 36 solved, 643 unsolved
[2024-06-07 07:40:10] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
[2024-06-07 07:40:10] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 2 ms to minimize.
[2024-06-07 07:40:10] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 2 ms to minimize.
[2024-06-07 07:40:10] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:40:10] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:40:11] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:40:11] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2024-06-07 07:40:11] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:40:12] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:40:12] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:40:13] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:40:14] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 2 ms to minimize.
[2024-06-07 07:40:14] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:40:15] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1063/1063 variables, and 1099 constraints, problems are : Problem set: 36 solved, 643 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 379/379 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 643/679 constraints, Known Traps: 14/14 constraints]
After SMT, in 64119ms problems are : Problem set: 36 solved, 643 unsolved
Search for dead transitions found 36 dead transitions in 64127ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 379/379 places, 648/684 transitions.
Graph (complete) has 1674 edges and 379 vertex of which 361 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 268 ms. Remains 361 /379 variables (removed 18) and now considering 648/648 (removed 0) transitions.
// Phase 1: matrix 648 rows 361 cols
[2024-06-07 07:40:16] [INFO ] Computed 37 invariants in 9 ms
[2024-06-07 07:40:16] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-06-07 07:40:16] [INFO ] Invariant cache hit.
[2024-06-07 07:40:17] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 361/379 places, 648/684 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 66097 ms. Remains : 361/379 places, 648/684 transitions.
RANDOM walk for 40000 steps (8 resets) in 427 ms. (93 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 969376 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :0 out of 1
Probabilistic random walk after 969376 steps, saw 754251 distinct states, run finished after 3001 ms. (steps per millisecond=323 ) properties seen :0
[2024-06-07 07:40:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 322/336 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/361 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1009/1009 variables, and 398 constraints, problems are : Problem set: 0 solved, 1 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 322/336 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/361 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1009 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1009 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1009 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1009/1009 variables, and 399 constraints, problems are : Problem set: 0 solved, 1 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 495ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 14 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 648/648 transitions.
Applied a total of 0 rules in 259 ms. Remains 361 /361 variables (removed 0) and now considering 648/648 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 259 ms. Remains : 361/361 places, 648/648 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 648/648 transitions.
Applied a total of 0 rules in 255 ms. Remains 361 /361 variables (removed 0) and now considering 648/648 (removed 0) transitions.
[2024-06-07 07:40:21] [INFO ] Invariant cache hit.
[2024-06-07 07:40:21] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-06-07 07:40:21] [INFO ] Invariant cache hit.
[2024-06-07 07:40:22] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2024-06-07 07:40:22] [INFO ] Redundant transitions in 4 ms returned []
Running 643 sub problems to find dead transitions.
[2024-06-07 07:40:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 6 (OVERLAPS) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 643 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1009/1009 variables, and 398 constraints, problems are : Problem set: 0 solved, 643 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, PredecessorRefiner: 643/643 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 643 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 643/1041 constraints. Problems are: Problem set: 0 solved, 643 unsolved
[2024-06-07 07:41:18] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:41:18] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:41:18] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:41:18] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:41:18] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:41:19] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:41:19] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 0 ms to minimize.
[2024-06-07 07:41:20] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:41:20] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:41:24] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:41:24] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:41:25] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1009 variables, and 1053 constraints, problems are : Problem set: 0 solved, 643 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, PredecessorRefiner: 643/643 constraints, Known Traps: 12/12 constraints]
After SMT, in 64049ms problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 64057ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64894 ms. Remains : 361/361 places, 648/648 transitions.
[2024-06-07 07:41:26] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-06-07 07:41:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 361 places, 648 transitions and 3204 arcs took 8 ms.
[2024-06-07 07:41:26] [INFO ] Flatten gal took : 89 ms
Total runtime 147075 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-03-ReachabilityFireability-2024-06

BK_STOP 1717746086612

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name BlocksWorld-PT-03-ReachabilityFireability-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/654/inv_0_
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-03"
export BK_EXAMINATION="ReachabilityFireability"
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-03, examination is ReachabilityFireability"
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-171774426700183"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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