fond

jQuery Multi Level CSS Menu Css3Menu.com

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

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

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15070.231 582280.00 760570.00 1173.20 FFFFFFTTTFTFFT?F 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-171774426900254.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-12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r605-tall-171774426900254
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 59M
-rw-r--r-- 1 mcc users 885K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.9M 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.2M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 37K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 119K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 989K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.7M 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.1M Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 4.3M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.0M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 27M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 119K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 286K 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.8M 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-12-ReachabilityCardinality-2024-00
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-01
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-02
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-03
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-04
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-05
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-06
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-07
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-08
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-09
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-10
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-11
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-12
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-13
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-14
FORMULA_NAME BlocksWorld-PT-12-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717752789408

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-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-07 09:33:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-07 09:33:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 09:33:11] [INFO ] Load time of PNML (sax parser for PT used): 355 ms
[2024-06-07 09:33:11] [INFO ] Transformed 4031 places.
[2024-06-07 09:33:11] [INFO ] Transformed 7813 transitions.
[2024-06-07 09:33:11] [INFO ] Found NUPN structural information;
[2024-06-07 09:33:11] [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]
[2024-06-07 09:33:11] [INFO ] Parsed PT model containing 4031 places and 7813 transitions and 39042 arcs in 522 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 154 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 12451 ms. (3 steps per ms) remains 10/16 properties
FORMULA BlocksWorld-PT-12-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-12-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-12-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-12-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-12-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-12-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 1285 ms. (31 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2451 ms. (16 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 11304 ms. (3 steps per ms) remains 9/10 properties
FORMULA BlocksWorld-PT-12-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 8554 ms. (4 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1155 ms. (34 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 13744 ms. (2 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2668 ms. (14 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1221 ms. (32 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1134 ms. (35 steps per ms) remains 9/9 properties
// Phase 1: matrix 7813 rows 4031 cols
[2024-06-07 09:33:26] [INFO ] Computed 125 invariants in 115 ms
[2024-06-07 09:33:26] [INFO ] State equation strengthened by 113 read => feed constraints.
Problem BlocksWorld-PT-12-ReachabilityCardinality-2024-02 is UNSAT
FORMULA BlocksWorld-PT-12-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-12-ReachabilityCardinality-2024-00 is UNSAT
FORMULA BlocksWorld-PT-12-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-12-ReachabilityCardinality-2024-04 is UNSAT
FORMULA BlocksWorld-PT-12-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-12-ReachabilityCardinality-2024-05 is UNSAT
FORMULA BlocksWorld-PT-12-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-12-ReachabilityCardinality-2024-06 is UNSAT
FORMULA BlocksWorld-PT-12-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-12-ReachabilityCardinality-2024-07 is UNSAT
FORMULA BlocksWorld-PT-12-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4031 variables, 125/125 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4031 variables, 0/125 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 7812/11843 variables, 4031/4156 constraints. Problems are: Problem set: 6 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11843/11844 variables, and 4268 constraints, problems are : Problem set: 6 solved, 3 unsolved in 5075 ms.
Refiners :[Positive P Invariants (semi-flows): 125/125 constraints, State Equation: 4031/4031 constraints, ReadFeed: 112/113 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3969 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3969 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 62/4031 variables, 123/125 constraints. Problems are: Problem set: 6 solved, 3 unsolved
[2024-06-07 09:33:40] [INFO ] Deduced a trap composed of 124 places in 190 ms of which 24 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/4031 variables, 1/126 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4031 variables, 0/126 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 7812/11843 variables, 4031/4157 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11843 variables, 112/4269 constraints. Problems are: Problem set: 6 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 11843/11844 variables, and 4271 constraints, problems are : Problem set: 6 solved, 3 unsolved in 5045 ms.
Refiners :[Positive P Invariants (semi-flows): 125/125 constraints, State Equation: 4031/4031 constraints, ReadFeed: 112/113 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 18086ms problems are : Problem set: 6 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3969 out of 4031 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4031/4031 places, 7813/7813 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 4031 transition count 7812
Applied a total of 1 rules in 1350 ms. Remains 4031 /4031 variables (removed 0) and now considering 7812/7813 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1362 ms. Remains : 4031/4031 places, 7812/7813 transitions.
RANDOM walk for 40000 steps (8 resets) in 5744 ms. (6 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2235 ms. (17 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 715 ms. (55 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 661 ms. (60 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 105500 steps, run timeout after 6002 ms. (steps per millisecond=17 ) properties seen :0 out of 3
Probabilistic random walk after 105500 steps, saw 85636 distinct states, run finished after 6006 ms. (steps per millisecond=17 ) properties seen :0
// Phase 1: matrix 7812 rows 4031 cols
[2024-06-07 09:33:54] [INFO ] Computed 125 invariants in 53 ms
[2024-06-07 09:33:54] [INFO ] State equation strengthened by 112 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3969 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3969 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 62/4031 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4031 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 7812/11843 variables, 4031/4156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11843 variables, 112/4268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11843 variables, 0/4268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/11843 variables, 0/4268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11843/11843 variables, and 4268 constraints, problems are : Problem set: 0 solved, 3 unsolved in 8803 ms.
Refiners :[Positive P Invariants (semi-flows): 125/125 constraints, State Equation: 4031/4031 constraints, ReadFeed: 112/112 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/3969 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3969 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 62/4031 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 09:34:04] [INFO ] Deduced a trap composed of 124 places in 140 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/4031 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4031 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 7812/11843 variables, 4031/4157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11843 variables, 112/4269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/11843 variables, 2/4271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/11843 variables, 0/4271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 09:34:12] [INFO ] Deduced a trap composed of 63 places in 133 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/11843 variables, 1/4272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/11843 variables, 0/4272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 09:34:15] [INFO ] Deduced a trap composed of 63 places in 115 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/11843 variables, 1/4273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/11843 variables, 0/4273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 09:34:27] [INFO ] Deduced a trap composed of 663 places in 1096 ms of which 10 ms to minimize.
[2024-06-07 09:34:32] [INFO ] Deduced a trap composed of 63 places in 1888 ms of which 14 ms to minimize.
[2024-06-07 09:34:34] [INFO ] Deduced a trap composed of 183 places in 2029 ms of which 15 ms to minimize.
[2024-06-07 09:34:36] [INFO ] Deduced a trap composed of 799 places in 1568 ms of which 12 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/11843 variables, 4/4277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/11843 variables, 0/4277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/11843 variables, 0/4277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11843/11843 variables, and 4277 constraints, problems are : Problem set: 0 solved, 3 unsolved in 43240 ms.
Refiners :[Positive P Invariants (semi-flows): 125/125 constraints, State Equation: 4031/4031 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 52700ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 5206 ms.
Support contains 3969 out of 4031 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4031/4031 places, 7812/7812 transitions.
Applied a total of 0 rules in 1322 ms. Remains 4031 /4031 variables (removed 0) and now considering 7812/7812 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1322 ms. Remains : 4031/4031 places, 7812/7812 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4031/4031 places, 7812/7812 transitions.
Applied a total of 0 rules in 1285 ms. Remains 4031 /4031 variables (removed 0) and now considering 7812/7812 (removed 0) transitions.
[2024-06-07 09:34:54] [INFO ] Invariant cache hit.
[2024-06-07 09:34:55] [INFO ] Implicit Places using invariants in 1034 ms returned []
[2024-06-07 09:34:55] [INFO ] Invariant cache hit.
[2024-06-07 09:35:00] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-07 09:35:03] [INFO ] Implicit Places using invariants and state equation in 7722 ms returned []
Implicit Place search using SMT with State Equation took 8766 ms to find 0 implicit places.
[2024-06-07 09:35:04] [INFO ] Redundant transitions in 929 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-06-07 09:35:04] [INFO ] Invariant cache hit.
[2024-06-07 09:35:04] [INFO ] State equation strengthened by 112 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1762 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD2014 is UNSAT
Problem TDEAD2077 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2266 is UNSAT
Problem TDEAD2329 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2455 is UNSAT
Problem TDEAD2518 is UNSAT
Problem TDEAD2644 is UNSAT
Problem TDEAD2707 is UNSAT
Problem TDEAD2770 is UNSAT
Problem TDEAD2833 is UNSAT
Problem TDEAD2896 is UNSAT
Problem TDEAD2959 is UNSAT
Problem TDEAD3022 is UNSAT
Problem TDEAD3085 is UNSAT
Problem TDEAD3148 is UNSAT
Problem TDEAD3211 is UNSAT
Problem TDEAD3274 is UNSAT
Problem TDEAD3463 is UNSAT
Problem TDEAD3526 is UNSAT
Problem TDEAD3589 is UNSAT
Problem TDEAD3652 is UNSAT
Problem TDEAD3715 is UNSAT
Problem TDEAD3841 is UNSAT
Problem TDEAD3904 is UNSAT
Problem TDEAD3967 is UNSAT
Problem TDEAD4030 is UNSAT
Problem TDEAD4152 is UNSAT
Problem TDEAD4272 is UNSAT
Problem TDEAD4390 is UNSAT
Problem TDEAD4506 is UNSAT
Problem TDEAD4620 is UNSAT
Problem TDEAD4732 is UNSAT
Problem TDEAD4842 is UNSAT
Problem TDEAD4950 is UNSAT
Problem TDEAD5056 is UNSAT
Problem TDEAD5160 is UNSAT
Problem TDEAD5262 is UNSAT
Problem TDEAD5362 is UNSAT
Problem TDEAD5460 is UNSAT
Problem TDEAD5556 is UNSAT
Problem TDEAD5742 is UNSAT
Problem TDEAD5832 is UNSAT
Problem TDEAD5920 is UNSAT
Problem TDEAD6006 is UNSAT
Problem TDEAD6090 is UNSAT
Problem TDEAD6172 is UNSAT
Problem TDEAD6252 is UNSAT
Problem TDEAD6330 is UNSAT
Problem TDEAD6406 is UNSAT
Problem TDEAD6480 is UNSAT
Problem TDEAD6552 is UNSAT
Problem TDEAD6622 is UNSAT
Problem TDEAD6756 is UNSAT
Problem TDEAD6820 is UNSAT
Problem TDEAD6882 is UNSAT
Problem TDEAD6942 is UNSAT
Problem TDEAD7000 is UNSAT
Problem TDEAD7056 is UNSAT
Problem TDEAD7110 is UNSAT
Problem TDEAD7162 is UNSAT
Problem TDEAD7212 is UNSAT
Problem TDEAD7306 is UNSAT
Problem TDEAD7350 is UNSAT
Problem TDEAD7392 is UNSAT
Problem TDEAD7432 is UNSAT
Problem TDEAD7470 is UNSAT
Problem TDEAD7506 is UNSAT
Problem TDEAD7540 is UNSAT
Problem TDEAD7572 is UNSAT
Problem TDEAD7602 is UNSAT
Problem TDEAD7630 is UNSAT
Problem TDEAD7656 is UNSAT
Problem TDEAD7722 is UNSAT
Problem TDEAD7740 is UNSAT
Problem TDEAD7756 is UNSAT
Problem TDEAD7770 is UNSAT
Problem TDEAD7782 is UNSAT
Problem TDEAD7800 is UNSAT
Problem TDEAD7806 is UNSAT
Problem TDEAD7810 is UNSAT
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/4025 variables, 113/113 constraints. Problems are: Problem set: 112 solved, 7694 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4025/11843 variables, and 113 constraints, problems are : Problem set: 112 solved, 7694 unsolved in 30266 ms.
Refiners :[Positive P Invariants (semi-flows): 113/125 constraints, State Equation: 0/4031 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 7750/3906 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 112 solved, 7694 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3969 variables, 7/7 constraints. Problems are: Problem set: 112 solved, 7694 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(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)
(s170 1)
(s171 0)
(s172 1)
(s173 1)
(s174 0)
(s175 1)
(s176 1)
(s177 0)
(s178 1)
(s179 1)
(s180 0)
(s181 1)
(s182 1)
(s183 0)
(s184 1)
(s185 1)
(s186 0)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 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)
(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)
(s288 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 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 0)
(s1180 0)
(s1181 0)
(s1182 0)
(s1183 0)
(s1184 0)
(s1185 0)
(s1186 0)
(s1187 0)
(s1188 0)
(s1189 0)
(s1190 0)
(s1191 0)
(s1192 0)
(s1193 0)
(s1194 0)
(s1195 0)
(s1196 0)
(s1197 0)
(s1198 0)
(s1199 0)
(s1200 0)
(s1201 0)
(s1202 0)
(s1203 0)
(s1204 0)
(s1205 0)
(s1206 0)
(s1207 0)
(s1208 0)
(s1209 0)
(s1210 0)
(s1211 0)
(s1212 0)
(s1213 0)
(s1214 0)
(s1215 0)
(s1216 0)
(s1217 0)
(s1218 0)
(s1219 0)
(s1220 0)
(s1221 0)
(s1222 0)
(s1223 0)
(s1224 0)
(s1225 0)
(s1226 0)
(s1227 0)
(s1228 0)
(s1229 0)
(s1230 0)
(s1231 0)
(s1232 0)
(s1233 0)
(s1234 0)
(s1235 0)
(s1236 0)
(s1237 0)
(s1238 0)
(s1239 0)
(s1240 0)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 1)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 1)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 1)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1385 1)
(s1386 1)
(s1387 1)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 1)
(s1397 1)
(s1398 1)
(s1399 1)
(s1400 1)
(s1401 1)
(s1402 1)
(s1403 1)
(s1404 1)
(s1405 1)
(s1406 1)
(s1407 1)
(s1408 1)
(s1409 1)
(s1410 1)
(s1411 1)
(s1412 1)
(s1413 1)
(s1414 1)
(s1415 1)
(s1416 1)
(s1417 1)
(s1418 1)
(s1419 1)
(s1420 1)
(s1421 1)
(s1422 1)
(s1423 1)
(s1424 1)
(s1425 1)
(s1426 1)
(s1427 1)
(s1428 1)
(s1429 1)
(s1430 1)
(s1431 1)
(s1432 1)
(s1433 1)
(s1434 1)
(s1435 1)
(s1436 1)
(s1437 1)
(s1438 1)
(s1439 1)
(s1440 1)
(s1441 1)
(s1442 1)
(s1443 1)
(s1444 1)
(s1445 1)
(s1446 1)
(s1448 1)
(s1449 1)
(s1450 1)
(s1451 1)
(s1452 1)
(s1453 1)
(s1454 1)
(s1455 1)
(s1456 1)
(s1457 1)
(s1458 1)
(s1459 1)
(s1460 1)
(s1461 1)
(s1462 1)
(s1463 1)
(s1464 1)
(s1465 1)
(s1466 1)
(s1467 1)
(s1468 1)
(s1469 1)
(s1470 1)
(s1471 1)
(s1472 1)
(s1473 1)
(s1474 1)
(s1475 1)
(s1476 1)
(s1477 1)
(s1478 1)
(s1479 1)
(s1480 1)
(s1481 1)
(s1482 1)
(s1483 1)
(s1484 1)
(s1485 1)
(s1486 1)
(s1487 1)
(s1488 1)
(s1489 1)
(s1490 1)
(s1491 1)
(s1492 1)
(s1493 1)
(s1494 1)
(s1495 1)
(s1496 1)
(s1497 1)
(s1498 1)
(s1499 1)
(s1500 1)
(s1501 1)
(s1502 1)
(s1503 1)
(s1504 1)
(s1505 1)
(s1506 1)
(s1507 1)
(s1508 1)
(s1509 1)
(s1511 1)
(s1512 1)
(s1513 1)
(s1514 1)
(s1515 1)
(s1516 1)
(s1517 1)
(s1518 1)
(s1519 1)
(s1520 1)
(s1521 1)
(s1522 1)
(s1523 1)
(s1524 1)
(s1525 1)
(s1526 1)
(s1527 1)
(s1528 1)
(s1529 1)
(s1530 1)
(s1531 1)
(s1532 1)
(s1533 1)
(s1534 1)
(s1535 1)
(s1536 1)
(s1537 1)
(s1538 1)
(s1539 1)
(s1540 1)
(s1541 1)
(s1542 1)
(s1543 1)
(s1544 1)
(s1545 1)
(s1546 1)
(s1547 1)
(s1548 1)
(s1549 1)
(s1550 1)
(s1551 1)
(s1552 1)
(s1553 1)
(s1554 1)
(s1555 1)
(s1556 1)
(s1557 1)
(s1558 1)
(s1559 1)
(s1560 1)
(s1561 1)
(s1562 1)
(s1563 1)
(s1564 1)
(s1565 1)
(s1566 1)
(s1568 1)
(s1569 1)
(s1570 1)
(s1571 1)
(s1572 1)
(s1574 1)
(s1575 1)
(s1576 1)
(s1577 1)
(s1578 1)
(s1579 1)
(s1580 1)
(s1581 1)
(s1582 1)
(s1583 1)
(s1584 1)
(s1585 1)
(s1586 1)
(s1587 1)
(s1588 1)
(s1589 1)
(s1590 1)
(s1591 1)
(s1592 1)
(s1593 1)
(s1594 1)
(s1595 1)
(s1596 1)
(s1597 1)
(s1598 1)
(s1599 1)
(s1600 1)
(s1601 1)
(s1602 1)
(s1603 1)
(s1604 1)
(s1605 1)
(s1606 1)
(s1607 1)
(s1608 1)
(s1609 1)
(s1610 1)
(s1611 1)
(s1612 1)
(s1613 1)
(s1614 1)
(s1615 1)
(s1616 1)
(s1617 1)
(s1618 1)
(s1619 1)
(s1620 1)
(s1621 1)
(s1622 1)
(s1623 1)
(s1624 1)
(s1625 1)
(s1626 1)
(s1627 1)
(s1628 1)
(s1629 1)
(s1630 1)
(s1631 1)
(s1632 1)
(s1633 1)
(s1634 1)
(s1635 1)
(s1637 1)
(s1638 1)
(s1639 1)
(s1640 1)
(s1641 1)
(s1642 1)
(s1643 1)
(s1644 1)
(s1645 1)
(s1646 1)
(s1647 1)
(s1648 1)
(s1649 1)
(s1650 1)
(s1651 1)
(s1652 1)
(s1653 1)
(s1654 1)
(s1655 1)
(s1656 1)
(s1657 1)
(s1658 1)
(s1659 1)
(s1660 1)
(s1661 1)
(s1662 1)
(s1663 1)
(s1664 1)
(s1665 1)
(s1666 1)
(s1667 1)
(s1668 1)
(s1669 1)
(s1670 1)
(s1671 1)
(s1672 1)
(s1673 1)
(s1674 1)
(s1675 1)
(s1676 1)
(s1677 1)
(s1678 1)
(s1679 1)
(s1680 1)
(s1681 1)
(s1682 1)
(s1683 1)
(s1684 1)
(s1685 1)
(s1686 1)
(s1687 1)
(s1688 1)
(s1689 1)
(s1690 1)
(s1691 1)
(s1692 1)
(s1693 1)
(s1694 1)
(s1695 1)
(s1696 1)
(s1697 1)
(s1698 1)
(s1700 1)
(s1701 1)
(s1702 1)
(s1703 1)
(s1704 1)
(s1705 1)
(s1706 1)
(s1707 1)
(s1708 1)
(s1709 1)
(s1710 1)
(s1711 1)
(s1712 1)
(s1713 1)
(s1714 1)
(s1715 1)
(s1716 1)
(s1717 1)
(s1718 1)
(s1719 1)
(s1720 1)
(s1721 1)
(s1722 1)
(s1723 1)
(s1724 1)
(s1725 1)
(s1726 1)
(s1727 1)
(s1728 1)
(s1729 1)
(s1730 1)
(s1731 1)
(s1732 1)
(s1733 1)
(s1734 1)
(s1735 1)
(s1736 1)
(s1737 1)
(s1738 1)
(s1739 1)
(s1740 1)
(s1741 1)
(s1742 1)
(s1743 1)
(s1744 1)
(s1745 1)
(s1746 1)
(s1747 1)
(s1748 1)
(s1749 1)
(s1750 1)
(s1751 1)
(s1752 1)
(s1753 1)
(s1754 1)
(s1755 1)
(s1756 1)
(s1757 1)
(s1758 1)
(s1759 1)
(s1760 1)
(s1761 1)
(s1763 1)
(s1764 1)
(s1765 1)
(s1766 1)
(s1767 1)
(s1768 1)
(s1769 1)
(s1770 1)
(s1771 1)
(s1772 1)
(s1773 1)
(s1774 1)
(s1775 1)
(s1776 1)
(s1777 1)
(s1778 1)
(s1779 1)
(s1780 1)
(s1781 1)
(s1782 1)
(s1783 1)
(s1784 1)
(s1785 1)
(s1786 timeout
1)
(s1787 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3969/11843 variables, and 7 constraints, problems are : Problem set: 112 solved, 7694 unsolved in 30123 ms.
Refiners :[Positive P Invariants (semi-flows): 7/125 constraints, State Equation: 0/4031 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 3844/3906 constraints, Known Traps: 0/0 constraints]
After SMT, in 132774ms problems are : Problem set: 112 solved, 7694 unsolved
Search for dead transitions found 112 dead transitions in 132852ms
Found 112 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 112 transitions
Dead transitions reduction (with SMT) removed 112 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 4031/4031 places, 7700/7812 transitions.
Deduced a syphon composed of 56 places in 5 ms
Applied a total of 0 rules in 1241 ms. Remains 4031 /4031 variables (removed 0) and now considering 7700/7700 (removed 0) transitions.
[2024-06-07 09:37:19] [INFO ] Redundant transitions in 635 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 145765 ms. Remains : 4031/4031 places, 7700/7812 transitions.
Deduced a syphon composed of 56 places in 4 ms
Reduce places removed 56 places and 0 transitions.
RANDOM walk for 40000 steps (8 resets) in 5217 ms. (7 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2088 ms. (19 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 685 ms. (58 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 659 ms. (60 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 111001 steps, run timeout after 6002 ms. (steps per millisecond=18 ) properties seen :0 out of 3
Probabilistic random walk after 111001 steps, saw 89997 distinct states, run finished after 6002 ms. (steps per millisecond=18 ) properties seen :0
// Phase 1: matrix 7700 rows 3975 cols
[2024-06-07 09:37:27] [INFO ] Computed 125 invariants in 46 ms
[2024-06-07 09:37:27] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3913 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3913 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 62/3975 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3975 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 7700/11675 variables, 3975/4100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11675 variables, 12/4112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11675 variables, 0/4112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/11675 variables, 0/4112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11675/11675 variables, and 4112 constraints, problems are : Problem set: 0 solved, 3 unsolved in 7382 ms.
Refiners :[Positive P Invariants (semi-flows): 125/125 constraints, State Equation: 3975/3975 constraints, ReadFeed: 12/12 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/3913 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3913 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 62/3975 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 09:37:36] [INFO ] Deduced a trap composed of 124 places in 132 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3975 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3975 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 7700/11675 variables, 3975/4101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11675 variables, 12/4113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/11675 variables, 2/4115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/11675 variables, 0/4115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 09:37:44] [INFO ] Deduced a trap composed of 124 places in 1868 ms of which 14 ms to minimize.
[2024-06-07 09:37:45] [INFO ] Deduced a trap composed of 124 places in 1164 ms of which 12 ms to minimize.
[2024-06-07 09:37:45] [INFO ] Deduced a trap composed of 183 places in 227 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/11675 variables, 3/4118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/11675 variables, 0/4118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/11675 variables, 0/4118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11675/11675 variables, and 4118 constraints, problems are : Problem set: 0 solved, 3 unsolved in 14728 ms.
Refiners :[Positive P Invariants (semi-flows): 125/125 constraints, State Equation: 3975/3975 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 22461ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA BlocksWorld-PT-12-ReachabilityCardinality-2024-08 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 5424 ms.
Support contains 3912 out of 3975 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3975/3975 places, 7700/7700 transitions.
Applied a total of 0 rules in 1235 ms. Remains 3975 /3975 variables (removed 0) and now considering 7700/7700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1235 ms. Remains : 3975/3975 places, 7700/7700 transitions.
RANDOM walk for 40000 steps (8 resets) in 5015 ms. (7 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2093 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 651 ms. (61 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 56514 steps, run timeout after 3002 ms. (steps per millisecond=18 ) properties seen :0 out of 2
Probabilistic random walk after 56514 steps, saw 46201 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
[2024-06-07 09:38:01] [INFO ] Invariant cache hit.
[2024-06-07 09:38:01] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3912 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 62/3974 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3974 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/3975 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3975 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7700/11675 variables, 3975/4100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11675 variables, 12/4112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/11675 variables, 0/4112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/11675 variables, 0/4112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11675/11675 variables, and 4112 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5527 ms.
Refiners :[Positive P Invariants (semi-flows): 125/125 constraints, State Equation: 3975/3975 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3912 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 62/3974 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 09:38:08] [INFO ] Deduced a trap composed of 124 places in 112 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3974 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3974 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/3975 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3975 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7700/11675 variables, 3975/4101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/11675 variables, 12/4113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/11675 variables, 1/4114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/11675 variables, 0/4114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/11675 variables, 0/4114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11675/11675 variables, and 4114 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8120 ms.
Refiners :[Positive P Invariants (semi-flows): 125/125 constraints, State Equation: 3975/3975 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 13963ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA BlocksWorld-PT-12-ReachabilityCardinality-2024-01 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1710 ms.
Support contains 20 out of 3975 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3975/3975 places, 7700/7700 transitions.
Applied a total of 0 rules in 40520 ms. Remains 3975 /3975 variables (removed 0) and now considering 7700/7700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40520 ms. Remains : 3975/3975 places, 7700/7700 transitions.
RANDOM walk for 40000 steps (8 resets) in 3218 ms. (12 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 425 ms. (93 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 268163 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 1
Probabilistic random walk after 268163 steps, saw 230058 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
[2024-06-07 09:39:01] [INFO ] Invariant cache hit.
[2024-06-07 09:39:01] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1790/1810 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1810 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2165/3975 variables, 92/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3975 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7700/11675 variables, 3975/4100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11675 variables, 12/4112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/11675 variables, 0/4112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/11675 variables, 0/4112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11675/11675 variables, and 4112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2610 ms.
Refiners :[Positive P Invariants (semi-flows): 125/125 constraints, State Equation: 3975/3975 constraints, ReadFeed: 12/12 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/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1790/1810 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 09:39:04] [INFO ] Deduced a trap composed of 124 places in 114 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1810 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1810 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2165/3975 variables, 92/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3975 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7700/11675 variables, 3975/4101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/11675 variables, 12/4113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/11675 variables, 1/4114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/11675 variables, 0/4114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/11675 variables, 0/4114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11675/11675 variables, and 4114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3284 ms.
Refiners :[Positive P Invariants (semi-flows): 125/125 constraints, State Equation: 3975/3975 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 5924ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 430 ms.
Support contains 20 out of 3975 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3975/3975 places, 7700/7700 transitions.
Applied a total of 0 rules in 37985 ms. Remains 3975 /3975 variables (removed 0) and now considering 7700/7700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37987 ms. Remains : 3975/3975 places, 7700/7700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3975/3975 places, 7700/7700 transitions.
Applied a total of 0 rules in 38325 ms. Remains 3975 /3975 variables (removed 0) and now considering 7700/7700 (removed 0) transitions.
[2024-06-07 09:40:24] [INFO ] Invariant cache hit.
[2024-06-07 09:40:28] [INFO ] Implicit Places using invariants in 3979 ms returned []
[2024-06-07 09:40:28] [INFO ] Invariant cache hit.
[2024-06-07 09:40:32] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-07 09:40:40] [INFO ] Implicit Places using invariants and state equation in 11996 ms returned []
Implicit Place search using SMT with State Equation took 15986 ms to find 0 implicit places.
[2024-06-07 09:40:41] [INFO ] Redundant transitions in 852 ms returned []
Running 7694 sub problems to find dead transitions.
[2024-06-07 09:40:41] [INFO ] Invariant cache hit.
[2024-06-07 09:40:41] [INFO ] State equation strengthened by 12 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3969 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 7694 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3969/11675 variables, and 113 constraints, problems are : Problem set: 0 solved, 7694 unsolved in 30173 ms.
Refiners :[Positive P Invariants (semi-flows): 113/125 constraints, State Equation: 0/3975 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 7694/3850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7694 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3969 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 7694 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3969/11675 variables, and 113 constraints, problems are : Problem set: 0 solved, 7694 unsolved in 30112 ms.
Refiners :[Positive P Invariants (semi-flows): 113/125 constraints, State Equation: 0/3975 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 3844/3850 constraints, Known Traps: 0/0 constraints]
After SMT, in 129121ms problems are : Problem set: 0 solved, 7694 unsolved
Search for dead transitions found 0 dead transitions in 129188ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184382 ms. Remains : 3975/3975 places, 7700/7700 transitions.
[2024-06-07 09:42:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2024-06-07 09:42:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3975 places, 7700 transitions and 38376 arcs took 45 ms.
[2024-06-07 09:42:51] [INFO ] Flatten gal took : 644 ms
Total runtime 580804 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-12-ReachabilityCardinality-2024-14

BK_STOP 1717753371688

--------------------
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-12-ReachabilityCardinality-2024-14
rfs formula type AG
rfs formula formula --invariant=/tmp/691/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-12"
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-12, 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-171774426900254"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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