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

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

=== Now, execution of the tool begins

BK_START 1717745866143

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
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:37:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-07 07:37:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:37:47] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2024-06-07 07:37:47] [INFO ] Transformed 379 places.
[2024-06-07 07:37:47] [INFO ] Transformed 685 transitions.
[2024-06-07 07:37:47] [INFO ] Found NUPN structural information;
[2024-06-07 07:37:47] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17]
[2024-06-07 07:37:47] [INFO ] Parsed PT model containing 379 places and 685 transitions and 3412 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BlocksWorld-PT-03-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-03-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-03-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 379 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 685/685 transitions.
Applied a total of 0 rules in 16 ms. Remains 379 /379 variables (removed 0) and now considering 685/685 (removed 0) transitions.
// Phase 1: matrix 685 rows 379 cols
[2024-06-07 07:37:47] [INFO ] Computed 37 invariants in 23 ms
[2024-06-07 07:37:48] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-06-07 07:37:48] [INFO ] Invariant cache hit.
[2024-06-07 07:37:48] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-06-07 07:37:48] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Running 680 sub problems to find dead transitions.
[2024-06-07 07:37:48] [INFO ] Invariant cache hit.
[2024-06-07 07:37:48] [INFO ] State equation strengthened by 27 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, 654 unsolved
[2024-06-07 07:37:56] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 12 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 1/28 constraints. Problems are: Problem set: 26 solved, 654 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 0/28 constraints. Problems are: Problem set: 26 solved, 654 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 3 (OVERLAPS) 5/379 variables, 10/38 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/38 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 5 (OVERLAPS) 684/1063 variables, 379/417 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1063 variables, 26/443 constraints. Problems are: Problem set: 36 solved, 644 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1063/1064 variables, and 443 constraints, problems are : Problem set: 36 solved, 644 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 379/379 constraints, ReadFeed: 26/27 constraints, PredecessorRefiner: 680/680 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 36 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 1/1 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 1/2 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/2 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 3 (OVERLAPS) 23/379 variables, 36/38 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/38 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 5 (OVERLAPS) 684/1063 variables, 379/417 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1063 variables, 26/443 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1063 variables, 644/1087 constraints. Problems are: Problem set: 36 solved, 644 unsolved
[2024-06-07 07:38:46] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 3 ms to minimize.
[2024-06-07 07:38:46] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2024-06-07 07:38:46] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-07 07:38:47] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:38:47] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-07 07:38:47] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:38:47] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:38:48] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:38:48] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:38:48] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:38:48] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:38:49] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:38:49] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:38:50] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-07 07:38:51] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:38:51] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:38:51] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1063/1064 variables, and 1104 constraints, problems are : Problem set: 36 solved, 644 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 379/379 constraints, ReadFeed: 26/27 constraints, PredecessorRefiner: 644/680 constraints, Known Traps: 18/18 constraints]
After SMT, in 64143ms problems are : Problem set: 36 solved, 644 unsolved
Search for dead transitions found 36 dead transitions in 64175ms
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 LTL mode, iteration 1 : 379/379 places, 649/685 transitions.
Deduced a syphon composed of 18 places in 1 ms
Applied a total of 0 rules in 4 ms. Remains 379 /379 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64739 ms. Remains : 379/379 places, 649/685 transitions.
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Support contains 361 out of 361 places after structural reductions.
FORMULA BlocksWorld-PT-03-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-07 07:38:53] [INFO ] Flatten gal took : 181 ms
[2024-06-07 07:38:53] [INFO ] Flatten gal took : 98 ms
[2024-06-07 07:38:53] [INFO ] Input system was already deterministic with 649 transitions.
Reduction of identical properties reduced properties to check from 17 to 15
RANDOM walk for 40000 steps (8 resets) in 2306 ms. (17 steps per ms) remains 2/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 237 ms. (168 steps per ms) remains 2/2 properties
// Phase 1: matrix 649 rows 361 cols
[2024-06-07 07:38:54] [INFO ] Computed 37 invariants in 4 ms
[2024-06-07 07:38:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 1 (OVERLAPS) 319/338 variables, 29/29 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/361 variables, 8/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1010 variables, 0/399 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1010 variables, 0/399 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 1 solved, 1 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 322/336 variables, 28/28 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/361 variables, 9/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1009 variables, 1/399 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1009 variables, 0/399 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1010 variables, 1/400 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1010 variables, 0/400 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1010 variables, 0/400 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1010/1010 variables, and 400 constraints, problems are : Problem set: 1 solved, 1 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 827ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 14 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 649/649 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 361 transition count 648
Applied a total of 1 rules in 567 ms. Remains 361 /361 variables (removed 0) and now considering 648/649 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 567 ms. Remains : 361/361 places, 648/649 transitions.
RANDOM walk for 40000 steps (8 resets) in 617 ms. (64 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 176 ms. (226 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 980413 steps, run timeout after 3008 ms. (steps per millisecond=325 ) properties seen :0 out of 1
Probabilistic random walk after 980413 steps, saw 762696 distinct states, run finished after 3011 ms. (steps per millisecond=325 ) properties seen :0
// Phase 1: matrix 648 rows 361 cols
[2024-06-07 07:38:59] [INFO ] Computed 37 invariants in 4 ms
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 283 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 240 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 535ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 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 266 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 266 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 251 ms. Remains 361 /361 variables (removed 0) and now considering 648/648 (removed 0) transitions.
[2024-06-07 07:39:00] [INFO ] Invariant cache hit.
[2024-06-07 07:39:00] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-06-07 07:39:00] [INFO ] Invariant cache hit.
[2024-06-07 07:39:00] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2024-06-07 07:39:00] [INFO ] Redundant transitions in 28 ms returned []
Running 643 sub problems to find dead transitions.
[2024-06-07 07:39:00] [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
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 timeout
1.0)
(s15 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30017 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:39:56] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:39:56] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:39:56] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:39:56] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:39:56] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:39:56] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:39:57] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:39:57] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:39:58] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:40:01] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:40:02] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:40:02] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:40:03] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:40:03] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:40:03] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:40:04] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:40:04] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 1 ms to minimize.
[2024-06-07 07:40:04] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
SMT process timed out in 64096ms, After SMT, problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 64103ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65010 ms. Remains : 361/361 places, 648/648 transitions.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA BlocksWorld-PT-03-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 37 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 9 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
// Phase 1: matrix 649 rows 361 cols
[2024-06-07 07:40:05] [INFO ] Computed 37 invariants in 3 ms
[2024-06-07 07:40:05] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-06-07 07:40:05] [INFO ] Invariant cache hit.
[2024-06-07 07:40:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:40:05] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 07:40:05] [INFO ] Invariant cache hit.
[2024-06-07 07:40:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:41:02] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:41:02] [INFO ] Deduced a trap composed of 99 places in 105 ms of which 2 ms to minimize.
[2024-06-07 07:41:02] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-06-07 07:41:03] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-06-07 07:41:04] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:41:04] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 2 ms to minimize.
[2024-06-07 07:41:04] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:41:04] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:41:05] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 2 ms to minimize.
[2024-06-07 07:41:05] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 2 ms to minimize.
[2024-06-07 07:41:05] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:41:05] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:41:07] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 0 ms to minimize.
[2024-06-07 07:41:08] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:41:08] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:41:08] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 63703ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63709ms
Finished structural reductions in LTL mode , in 1 iterations and 64264 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-03-LTLFireability-00
Product exploration explored 100000 steps with 30284 reset in 983 ms.
Product exploration explored 100000 steps with 30327 reset in 765 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 121 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 26 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 158 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 37 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 12 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:41:12] [INFO ] Invariant cache hit.
[2024-06-07 07:41:12] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-06-07 07:41:12] [INFO ] Invariant cache hit.
[2024-06-07 07:41:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:41:12] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 07:41:12] [INFO ] Invariant cache hit.
[2024-06-07 07:41:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:42:09] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:42:09] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 2 ms to minimize.
[2024-06-07 07:42:10] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-06-07 07:42:10] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 2 ms to minimize.
[2024-06-07 07:42:11] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 5 ms to minimize.
[2024-06-07 07:42:11] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:42:12] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:42:12] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:42:12] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-06-07 07:42:12] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:42:13] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:42:13] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:42:14] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:42:15] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:42:16] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1057 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 15/15 constraints]
After SMT, in 63648ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63654ms
Finished structural reductions in LTL mode , in 1 iterations and 64167 ms. Remains : 361/361 places, 649/649 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 123 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 26 steps (0 resets) in 6 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 141 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 30361 reset in 713 ms.
Product exploration explored 100000 steps with 30357 reset in 719 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 37 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 44 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:42:18] [INFO ] Redundant transitions in 5 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 07:42:18] [INFO ] Invariant cache hit.
[2024-06-07 07:42:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:43:14] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:43:15] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
[2024-06-07 07:43:15] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-06-07 07:43:15] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-06-07 07:43:17] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:43:17] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:43:17] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:43:17] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:43:18] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 1 ms to minimize.
[2024-06-07 07:43:18] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:43:18] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:43:18] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:43:20] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:43:20] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:43:21] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:43:21] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:43:22] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:43:22] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 0 ms to minimize.
[2024-06-07 07:43:22] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 2 ms to minimize.
SMT process timed out in 64111ms, After SMT, problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 64118ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64174 ms. Remains : 361/361 places, 649/649 transitions.
Support contains 37 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 4 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:43:22] [INFO ] Invariant cache hit.
[2024-06-07 07:43:23] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-06-07 07:43:23] [INFO ] Invariant cache hit.
[2024-06-07 07:43:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:43:23] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 07:43:23] [INFO ] Invariant cache hit.
[2024-06-07 07:43:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 (/ 1.0 4.0))
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 (/ 1.0 4.0))
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 (/ 3.0 4.0))
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:44:18] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:44:19] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 2 ms to minimize.
[2024-06-07 07:44:19] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 2 ms to minimize.
[2024-06-07 07:44:19] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 1 ms to minimize.
[2024-06-07 07:44:20] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:44:21] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 2 ms to minimize.
[2024-06-07 07:44:21] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:44:21] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 0 ms to minimize.
[2024-06-07 07:44:22] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 1 ms to minimize.
[2024-06-07 07:44:22] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:44:22] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:44:22] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:44:23] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:44:24] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:44:25] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:44:25] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:44:26] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:44:26] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:44:26] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:44:26] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1009 variables, 20/1062 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1062 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 20/20 constraints]
After SMT, in 63861ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63867ms
Finished structural reductions in LTL mode , in 1 iterations and 64345 ms. Remains : 361/361 places, 649/649 transitions.
Treatment of property BlocksWorld-PT-03-LTLFireability-00 finished in 262284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(G(p0)) U (X(X(p0)) U p1))))))'
Support contains 55 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 3 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:44:27] [INFO ] Invariant cache hit.
[2024-06-07 07:44:27] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-06-07 07:44:27] [INFO ] Invariant cache hit.
[2024-06-07 07:44:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:44:27] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 07:44:27] [INFO ] Invariant cache hit.
[2024-06-07 07:44:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 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 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:45:23] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:45:24] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 2 ms to minimize.
[2024-06-07 07:45:24] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-06-07 07:45:24] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 1 ms to minimize.
[2024-06-07 07:45:26] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:45:26] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 1 ms to minimize.
[2024-06-07 07:45:26] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:45:26] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:45:27] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 1 ms to minimize.
[2024-06-07 07:45:27] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:45:27] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:45:27] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:45:29] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:45:30] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:45:30] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:45:30] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:45:31] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 2 ms to minimize.
SMT process timed out in 63835ms, After SMT, problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63843ms
Finished structural reductions in LTL mode , in 1 iterations and 64365 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 270 ms :[(NOT p1), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BlocksWorld-PT-03-LTLFireability-01
Product exploration explored 100000 steps with 25000 reset in 609 ms.
Product exploration explored 100000 steps with 25000 reset in 634 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(NOT p1), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
RANDOM walk for 40000 steps (8 resets) in 1308 ms. (30 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2284 ms. (17 steps per ms) remains 1/1 properties
[2024-06-07 07:45:34] [INFO ] Invariant cache hit.
[2024-06-07 07:45:34] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 55/1010 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/37 constraints, State Equation: 0/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 331ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 2 factoid took 195 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Support contains 55 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 6 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:45:35] [INFO ] Invariant cache hit.
[2024-06-07 07:45:35] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-06-07 07:45:35] [INFO ] Invariant cache hit.
[2024-06-07 07:45:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:45:36] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 07:45:36] [INFO ] Invariant cache hit.
[2024-06-07 07:45:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:46:31] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:46:31] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 1 ms to minimize.
[2024-06-07 07:46:32] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-06-07 07:46:32] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-06-07 07:46:33] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:46:33] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 2 ms to minimize.
[2024-06-07 07:46:33] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:46:34] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:46:34] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 1 ms to minimize.
[2024-06-07 07:46:34] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:46:34] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:46:35] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:46:36] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:46:37] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:46:37] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:46:38] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:46:38] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 2 ms to minimize.
[2024-06-07 07:46:39] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 0 ms to minimize.
[2024-06-07 07:46:39] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:46:39] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1009 variables, 20/1062 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1062 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 20/20 constraints]
After SMT, in 63655ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63661ms
Finished structural reductions in LTL mode , in 1 iterations and 64148 ms. Remains : 361/361 places, 649/649 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
RANDOM walk for 38 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 153 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 25000 reset in 621 ms.
Product exploration explored 100000 steps with 25000 reset in 637 ms.
Applying partial POR strategy [false, true, false, false, false, false, false, true]
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Support contains 55 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 31 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:46:43] [INFO ] Redundant transitions in 14 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 07:46:43] [INFO ] Invariant cache hit.
[2024-06-07 07:46:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:47:40] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:47:40] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 2 ms to minimize.
[2024-06-07 07:47:40] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 1 ms to minimize.
[2024-06-07 07:47:41] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 1 ms to minimize.
[2024-06-07 07:47:42] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:47:42] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:47:42] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:47:42] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:47:43] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-06-07 07:47:43] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:47:43] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:47:43] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:47:45] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:47:46] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:47:46] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:47:47] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 64319ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 64327ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64384 ms. Remains : 361/361 places, 649/649 transitions.
Support contains 55 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 4 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:47:47] [INFO ] Invariant cache hit.
[2024-06-07 07:47:47] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-06-07 07:47:47] [INFO ] Invariant cache hit.
[2024-06-07 07:47:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:47:47] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 07:47:47] [INFO ] Invariant cache hit.
[2024-06-07 07:47:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:48:43] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:48:44] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 2 ms to minimize.
[2024-06-07 07:48:44] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 1 ms to minimize.
[2024-06-07 07:48:44] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 2 ms to minimize.
[2024-06-07 07:48:46] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:48:46] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 2 ms to minimize.
[2024-06-07 07:48:46] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:48:46] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:48:47] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-06-07 07:48:47] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:48:47] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:48:47] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:48:49] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:48:49] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:48:50] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:48:50] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:48:51] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:48:51] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
SMT process timed out in 63796ms, After SMT, problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63803ms
Finished structural reductions in LTL mode , in 1 iterations and 64314 ms. Remains : 361/361 places, 649/649 transitions.
Treatment of property BlocksWorld-PT-03-LTLFireability-01 finished in 264437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(!p0))))))'
Support contains 37 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 5 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:48:51] [INFO ] Invariant cache hit.
[2024-06-07 07:48:51] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-06-07 07:48:51] [INFO ] Invariant cache hit.
[2024-06-07 07:48:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:48:52] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 07:48:52] [INFO ] Invariant cache hit.
[2024-06-07 07:48:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 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 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:49:48] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:49:49] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 2 ms to minimize.
[2024-06-07 07:49:49] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-06-07 07:49:49] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-06-07 07:49:51] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:49:51] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 2 ms to minimize.
[2024-06-07 07:49:51] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:49:51] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:49:52] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-06-07 07:49:52] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:49:52] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:49:52] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:49:54] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:49:54] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:49:55] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:49:55] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 64219ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 64227ms
Finished structural reductions in LTL mode , in 1 iterations and 64710 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 200 ms :[true, p0, p0, p0, p0, p0]
Running random walk in product with property : BlocksWorld-PT-03-LTLFireability-02
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA BlocksWorld-PT-03-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-03-LTLFireability-02 finished in 64935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&p0))))'
Support contains 325 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 2 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:49:56] [INFO ] Invariant cache hit.
[2024-06-07 07:49:56] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-07 07:49:56] [INFO ] Invariant cache hit.
[2024-06-07 07:49:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:49:57] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 07:49:57] [INFO ] Invariant cache hit.
[2024-06-07 07:49:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:50:52] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:50:53] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 2 ms to minimize.
[2024-06-07 07:50:53] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-06-07 07:50:53] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 1 ms to minimize.
[2024-06-07 07:50:54] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2024-06-07 07:50:55] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:50:55] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:50:55] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:50:56] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
[2024-06-07 07:50:56] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:50:56] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:50:56] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:50:58] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:50:58] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:50:59] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:50:59] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 63440ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63447ms
Finished structural reductions in LTL mode , in 1 iterations and 63735 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-03-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BlocksWorld-PT-03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-03-LTLFireability-03 finished in 63898 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 18 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 28 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:51:00] [INFO ] Invariant cache hit.
[2024-06-07 07:51:00] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-06-07 07:51:00] [INFO ] Invariant cache hit.
[2024-06-07 07:51:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:51:01] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
[2024-06-07 07:51:01] [INFO ] Redundant transitions in 6 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 07:51:01] [INFO ] Invariant cache hit.
[2024-06-07 07:51:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:51:57] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:51:57] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 3 ms to minimize.
[2024-06-07 07:51:58] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-06-07 07:51:58] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-06-07 07:51:59] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:52:00] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:52:00] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:52:00] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:52:00] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-06-07 07:52:01] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:52:01] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:52:01] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:52:02] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:52:03] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:52:04] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:52:04] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 63757ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63763ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64436 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : BlocksWorld-PT-03-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 1023 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 0 ms.
FORMULA BlocksWorld-PT-03-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-03-LTLFireability-05 finished in 65515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 18 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 24 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:52:06] [INFO ] Invariant cache hit.
[2024-06-07 07:52:06] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-06-07 07:52:06] [INFO ] Invariant cache hit.
[2024-06-07 07:52:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:52:06] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
[2024-06-07 07:52:06] [INFO ] Redundant transitions in 4 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 07:52:06] [INFO ] Invariant cache hit.
[2024-06-07 07:52:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 (/ 1.0 4.0))
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 (/ 1.0 4.0))
(s14 1.0)
(s15 0.0)
(s16 (/ 1.0 4.0))
(s17 (/ 1.0 4.0))
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 (/ 3.0 4.0))
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 (/ 3.0 4.0))
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:53:02] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:53:03] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 2 ms to minimize.
[2024-06-07 07:53:03] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 2 ms to minimize.
[2024-06-07 07:53:03] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-06-07 07:53:05] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:53:05] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:53:05] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 2 ms to minimize.
[2024-06-07 07:53:05] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:53:06] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 1 ms to minimize.
[2024-06-07 07:53:06] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:53:06] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:53:06] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:53:07] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:53:08] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:53:09] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:53:09] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:53:10] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 2 ms to minimize.
[2024-06-07 07:53:10] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:53:10] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1061 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 19/19 constraints]
After SMT, in 63974ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63981ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64669 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-03-LTLFireability-06
Product exploration explored 100000 steps with 24828 reset in 676 ms.
Product exploration explored 100000 steps with 25006 reset in 804 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2024-06-07 07:53:12] [INFO ] Invariant cache hit.
[2024-06-07 07:53:13] [INFO ] [Real]Absence check using 37 positive place invariants in 20 ms returned sat
[2024-06-07 07:53:13] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2024-06-07 07:53:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-07 07:53:13] [INFO ] [Nat]Absence check using 37 positive place invariants in 25 ms returned sat
[2024-06-07 07:53:14] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2024-06-07 07:53:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:53:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2024-06-07 07:53:14] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:53:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2024-06-07 07:53:14] [INFO ] Computed and/alt/rep : 85/85/85 causal constraints (skipped 559 transitions) in 69 ms.
[2024-06-07 07:53:14] [INFO ] Added : 0 causal constraints over 0 iterations in 130 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 18 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 23 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:53:14] [INFO ] Invariant cache hit.
[2024-06-07 07:53:15] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-06-07 07:53:15] [INFO ] Invariant cache hit.
[2024-06-07 07:53:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:53:15] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
[2024-06-07 07:53:15] [INFO ] Redundant transitions in 4 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 07:53:15] [INFO ] Invariant cache hit.
[2024-06-07 07:53:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:54:11] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:54:11] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 2 ms to minimize.
[2024-06-07 07:54:12] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 1 ms to minimize.
[2024-06-07 07:54:12] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 3 ms to minimize.
[2024-06-07 07:54:13] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:54:13] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:54:14] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:54:14] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:54:14] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-06-07 07:54:14] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:54:15] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:54:15] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:54:16] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:54:17] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:54:17] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:54:18] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:54:19] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-06-07 07:54:19] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1060 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 18/18 constraints]
After SMT, in 63816ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63823ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64621 ms. Remains : 361/361 places, 649/649 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2024-06-07 07:54:19] [INFO ] Invariant cache hit.
[2024-06-07 07:54:19] [INFO ] [Real]Absence check using 37 positive place invariants in 19 ms returned sat
[2024-06-07 07:54:20] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2024-06-07 07:54:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-07 07:54:20] [INFO ] [Nat]Absence check using 37 positive place invariants in 26 ms returned sat
[2024-06-07 07:54:21] [INFO ] [Nat]Absence check using state equation in 670 ms returned sat
[2024-06-07 07:54:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:54:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2024-06-07 07:54:21] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:54:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2024-06-07 07:54:21] [INFO ] Computed and/alt/rep : 85/85/85 causal constraints (skipped 559 transitions) in 60 ms.
[2024-06-07 07:54:21] [INFO ] Added : 0 causal constraints over 0 iterations in 111 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 24842 reset in 649 ms.
Product exploration explored 100000 steps with 25006 reset in 658 ms.
Support contains 18 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 19 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:54:23] [INFO ] Invariant cache hit.
[2024-06-07 07:54:23] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-06-07 07:54:23] [INFO ] Invariant cache hit.
[2024-06-07 07:54:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:54:23] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2024-06-07 07:54:23] [INFO ] Redundant transitions in 3 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 07:54:23] [INFO ] Invariant cache hit.
[2024-06-07 07:54:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 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 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:55:19] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:55:19] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 2 ms to minimize.
[2024-06-07 07:55:20] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 1 ms to minimize.
[2024-06-07 07:55:20] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 1 ms to minimize.
[2024-06-07 07:55:21] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:55:22] [INFO ] Deduced a trap composed of 84 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:55:22] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:55:22] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:55:22] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 1 ms to minimize.
[2024-06-07 07:55:23] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:55:23] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:55:23] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:55:24] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:55:25] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:55:26] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:55:26] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:55:27] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2024-06-07 07:55:27] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:55:27] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:55:27] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1009 variables, 20/1062 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1062 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 20/20 constraints]
After SMT, in 64139ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 64145ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64784 ms. Remains : 361/361 places, 649/649 transitions.
Treatment of property BlocksWorld-PT-03-LTLFireability-06 finished in 201667 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 14 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 21 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:55:27] [INFO ] Invariant cache hit.
[2024-06-07 07:55:28] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-06-07 07:55:28] [INFO ] Invariant cache hit.
[2024-06-07 07:55:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:55:28] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
[2024-06-07 07:55:28] [INFO ] Redundant transitions in 3 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 07:55:28] [INFO ] Invariant cache hit.
[2024-06-07 07:55:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:56:25] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:56:25] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 2 ms to minimize.
[2024-06-07 07:56:26] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-06-07 07:56:26] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-06-07 07:56:27] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 1 ms to minimize.
[2024-06-07 07:56:27] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:56:28] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:56:28] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:56:28] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 1 ms to minimize.
[2024-06-07 07:56:28] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:56:29] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:56:29] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:56:30] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:56:31] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:56:32] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:56:32] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
SMT process timed out in 64231ms, After SMT, problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 64237ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64856 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : BlocksWorld-PT-03-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 885 ms.
Product exploration explored 100000 steps with 0 reset in 931 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 396 ms. (100 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 950168 steps, run timeout after 3001 ms. (steps per millisecond=316 ) properties seen :0 out of 1
Probabilistic random walk after 950168 steps, saw 739820 distinct states, run finished after 3002 ms. (steps per millisecond=316 ) properties seen :0
[2024-06-07 07:56:37] [INFO ] Invariant cache hit.
[2024-06-07 07:56:37] [INFO ] State equation strengthened by 1 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) 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) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1010 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1010 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 1 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 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) 1/1010 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1010 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1010 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1010/1010 variables, and 400 constraints, problems are : Problem set: 0 solved, 1 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 543ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 14 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 649/649 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 361 transition count 648
Applied a total of 1 rules in 326 ms. Remains 361 /361 variables (removed 0) and now considering 648/649 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 326 ms. Remains : 361/361 places, 648/649 transitions.
RANDOM walk for 40000 steps (8 resets) in 400 ms. (99 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 208 ms. (191 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 845032 steps, run timeout after 3001 ms. (steps per millisecond=281 ) properties seen :0 out of 1
Probabilistic random walk after 845032 steps, saw 659110 distinct states, run finished after 3001 ms. (steps per millisecond=281 ) properties seen :0
// Phase 1: matrix 648 rows 361 cols
[2024-06-07 07:56:41] [INFO ] Computed 37 invariants in 7 ms
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 218 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 216 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 466ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 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 240 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 241 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 240 ms. Remains 361 /361 variables (removed 0) and now considering 648/648 (removed 0) transitions.
[2024-06-07 07:56:42] [INFO ] Invariant cache hit.
[2024-06-07 07:56:43] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-06-07 07:56:43] [INFO ] Invariant cache hit.
[2024-06-07 07:56:43] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
[2024-06-07 07:56:43] [INFO ] Redundant transitions in 4 ms returned []
Running 643 sub problems to find dead transitions.
[2024-06-07 07:56:43] [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 30022 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:57:40] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:57:40] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:57:40] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:57:40] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:57:41] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:57:41] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:57:41] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:57:42] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:57:43] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:57:46] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:57:46] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:57:47] [INFO ] Deduced a trap composed of 51 places in 52 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 30021 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 64034ms problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 64044ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64926 ms. Remains : 361/361 places, 648/648 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 14 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 23 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
// Phase 1: matrix 649 rows 361 cols
[2024-06-07 07:57:47] [INFO ] Computed 37 invariants in 3 ms
[2024-06-07 07:57:47] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-06-07 07:57:47] [INFO ] Invariant cache hit.
[2024-06-07 07:57:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:57:48] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2024-06-07 07:57:48] [INFO ] Redundant transitions in 3 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 07:57:48] [INFO ] Invariant cache hit.
[2024-06-07 07:57:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:58:44] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:58:44] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 1 ms to minimize.
[2024-06-07 07:58:45] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-06-07 07:58:45] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 1 ms to minimize.
[2024-06-07 07:58:46] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:58:46] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:58:47] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:58:47] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:58:47] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-06-07 07:58:47] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:58:48] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:58:48] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:58:49] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:58:50] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:58:51] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:58:51] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:58:52] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2024-06-07 07:58:52] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1060 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 18/18 constraints]
After SMT, in 64023ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 64029ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64679 ms. Remains : 361/361 places, 649/649 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 455 ms. (87 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 858204 steps, run timeout after 3001 ms. (steps per millisecond=285 ) properties seen :0 out of 1
Probabilistic random walk after 858204 steps, saw 669225 distinct states, run finished after 3002 ms. (steps per millisecond=285 ) properties seen :0
[2024-06-07 07:58:55] [INFO ] Invariant cache hit.
[2024-06-07 07:58:55] [INFO ] State equation strengthened by 1 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) 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) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1010 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1010 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 1 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 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) 1/1010 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1010 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1010 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1010/1010 variables, and 400 constraints, problems are : Problem set: 0 solved, 1 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 557ms 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, 649/649 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 361 transition count 648
Applied a total of 1 rules in 349 ms. Remains 361 /361 variables (removed 0) and now considering 648/649 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 349 ms. Remains : 361/361 places, 648/649 transitions.
RANDOM walk for 40000 steps (8 resets) in 661 ms. (60 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 925009 steps, run timeout after 3001 ms. (steps per millisecond=308 ) properties seen :0 out of 1
Probabilistic random walk after 925009 steps, saw 720780 distinct states, run finished after 3001 ms. (steps per millisecond=308 ) properties seen :0
// Phase 1: matrix 648 rows 361 cols
[2024-06-07 07:58:59] [INFO ] Computed 37 invariants in 11 ms
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 233 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 241 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 501ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 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 259 ms. Remains 361 /361 variables (removed 0) and now considering 648/648 (removed 0) transitions.
[2024-06-07 07:59:00] [INFO ] Invariant cache hit.
[2024-06-07 07:59:01] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-06-07 07:59:01] [INFO ] Invariant cache hit.
[2024-06-07 07:59:01] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
[2024-06-07 07:59:01] [INFO ] Redundant transitions in 4 ms returned []
Running 643 sub problems to find dead transitions.
[2024-06-07 07:59:01] [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
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30021 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:59:57] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:59:57] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:59:57] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:59:58] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:59:58] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:59:58] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:59:58] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:59:59] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-06-07 08:00:00] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:00:03] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 1 ms to minimize.
[2024-06-07 08:00:04] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 08:00:04] [INFO ] Deduced a trap composed of 51 places in 51 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 30026 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 64066ms problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 64072ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64930 ms. Remains : 361/361 places, 648/648 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 868 ms.
Product exploration explored 100000 steps with 0 reset in 915 ms.
Support contains 14 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 16 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
// Phase 1: matrix 649 rows 361 cols
[2024-06-07 08:00:07] [INFO ] Computed 37 invariants in 7 ms
[2024-06-07 08:00:07] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-07 08:00:07] [INFO ] Invariant cache hit.
[2024-06-07 08:00:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:00:08] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
[2024-06-07 08:00:08] [INFO ] Redundant transitions in 3 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 08:00:08] [INFO ] Invariant cache hit.
[2024-06-07 08:00:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:01:04] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2024-06-07 08:01:05] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 1 ms to minimize.
[2024-06-07 08:01:05] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 1 ms to minimize.
[2024-06-07 08:01:05] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 1 ms to minimize.
[2024-06-07 08:01:07] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-06-07 08:01:07] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 1 ms to minimize.
[2024-06-07 08:01:07] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-07 08:01:07] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:01:08] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-06-07 08:01:08] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:01:08] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-06-07 08:01:08] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 08:01:10] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 0 ms to minimize.
[2024-06-07 08:01:10] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 08:01:11] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:01:11] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 63992ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63998ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64613 ms. Remains : 361/361 places, 649/649 transitions.
Treatment of property BlocksWorld-PT-03-LTLFireability-09 finished in 344474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 18 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:01:12] [INFO ] Invariant cache hit.
[2024-06-07 08:01:12] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-06-07 08:01:12] [INFO ] Invariant cache hit.
[2024-06-07 08:01:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:01:12] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2024-06-07 08:01:12] [INFO ] Redundant transitions in 4 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 08:01:12] [INFO ] Invariant cache hit.
[2024-06-07 08:01:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 (/ 1.0 4.0))
(s14 (/ 1.0 4.0))
(s15 0.0)
(s16 0.0)
(s17 (/ 1.0 4.0))
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 (/ 1.0 4.0))
(s27 0.0)
(s28 (/ 1.0 4.0))
(s29 1.0)
(s30 0.0)
(s31 (/ 1.0 4.0))
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)timeout

(s54 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:02:10] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-07 08:02:11] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 1 ms to minimize.
[2024-06-07 08:02:11] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-06-07 08:02:11] [INFO ] Deduced a trap composed of 96 places in 90 ms of which 1 ms to minimize.
[2024-06-07 08:02:13] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 08:02:13] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 1 ms to minimize.
[2024-06-07 08:02:13] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 08:02:13] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:02:14] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 1 ms to minimize.
[2024-06-07 08:02:14] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-07 08:02:14] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-06-07 08:02:14] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 08:02:16] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:02:17] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1056 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 14/14 constraints]
After SMT, in 64409ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 64415ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64981 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-03-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 894 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 1 ms.
FORMULA BlocksWorld-PT-03-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-03-LTLFireability-11 finished in 66022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 20 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:02:18] [INFO ] Invariant cache hit.
[2024-06-07 08:02:18] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-06-07 08:02:18] [INFO ] Invariant cache hit.
[2024-06-07 08:02:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:02:18] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
[2024-06-07 08:02:18] [INFO ] Redundant transitions in 3 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 08:02:18] [INFO ] Invariant cache hit.
[2024-06-07 08:02:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:03:14] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-06-07 08:03:14] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 1 ms to minimize.
[2024-06-07 08:03:15] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-06-07 08:03:15] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-06-07 08:03:16] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 08:03:16] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 1 ms to minimize.
[2024-06-07 08:03:17] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 08:03:17] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-06-07 08:03:17] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 1 ms to minimize.
[2024-06-07 08:03:17] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-07 08:03:18] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-06-07 08:03:18] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 08:03:19] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:03:20] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 08:03:20] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:03:21] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-06-07 08:03:22] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-06-07 08:03:22] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
[2024-06-07 08:03:22] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
SMT process timed out in 63453ms, After SMT, problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63459ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64106 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-03-LTLFireability-12
Product exploration explored 100000 steps with 142 reset in 867 ms.
Product exploration explored 100000 steps with 149 reset in 873 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3140 steps (0 resets) in 39 ms. (78 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 25 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:03:24] [INFO ] Invariant cache hit.
[2024-06-07 08:03:25] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-06-07 08:03:25] [INFO ] Invariant cache hit.
[2024-06-07 08:03:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:03:25] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2024-06-07 08:03:25] [INFO ] Redundant transitions in 4 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 08:03:25] [INFO ] Invariant cache hit.
[2024-06-07 08:03:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:04:21] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:04:22] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 2 ms to minimize.
[2024-06-07 08:04:22] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 2 ms to minimize.
[2024-06-07 08:04:22] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 1 ms to minimize.
[2024-06-07 08:04:23] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 08:04:24] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 1 ms to minimize.
[2024-06-07 08:04:24] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 08:04:24] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-07 08:04:25] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-06-07 08:04:25] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-06-07 08:04:25] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:04:25] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-07 08:04:26] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 0 ms to minimize.
[2024-06-07 08:04:27] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:04:28] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:04:28] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-07 08:04:29] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1059 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 17/17 constraints]
After SMT, in 63966ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63972ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64631 ms. Remains : 361/361 places, 649/649 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2230 steps (0 resets) in 36 ms. (60 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 137 reset in 873 ms.
Product exploration explored 100000 steps with 138 reset in 887 ms.
Support contains 2 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 16 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:04:31] [INFO ] Invariant cache hit.
[2024-06-07 08:04:32] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-07 08:04:32] [INFO ] Invariant cache hit.
[2024-06-07 08:04:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:04:32] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2024-06-07 08:04:32] [INFO ] Redundant transitions in 4 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 08:04:32] [INFO ] Invariant cache hit.
[2024-06-07 08:04:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 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 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:05:28] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:05:28] [INFO ] Deduced a trap composed of 99 places in 101 ms of which 2 ms to minimize.
[2024-06-07 08:05:29] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 1 ms to minimize.
[2024-06-07 08:05:29] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 1 ms to minimize.
[2024-06-07 08:05:30] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:05:31] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 1 ms to minimize.
[2024-06-07 08:05:31] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 08:05:31] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-06-07 08:05:32] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-06-07 08:05:32] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-07 08:05:32] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-07 08:05:32] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-07 08:05:33] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:05:34] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-06-07 08:05:35] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:05:35] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 63786ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63793ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64430 ms. Remains : 361/361 places, 649/649 transitions.
Treatment of property BlocksWorld-PT-03-LTLFireability-12 finished in 197964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)||X(p1))) U X(G(!p2))))'
Support contains 7 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 5 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:05:36] [INFO ] Invariant cache hit.
[2024-06-07 08:05:36] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-06-07 08:05:36] [INFO ] Invariant cache hit.
[2024-06-07 08:05:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:05:36] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 08:05:36] [INFO ] Invariant cache hit.
[2024-06-07 08:05:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:06:33] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:06:33] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
[2024-06-07 08:06:34] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 1 ms to minimize.
[2024-06-07 08:06:34] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 1 ms to minimize.
[2024-06-07 08:06:35] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:06:36] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 1 ms to minimize.
[2024-06-07 08:06:36] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 08:06:36] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:06:37] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-06-07 08:06:37] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-07 08:06:37] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:06:37] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:06:38] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-06-07 08:06:39] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 08:06:40] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:06:40] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 63890ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63896ms
Finished structural reductions in LTL mode , in 1 iterations and 64442 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p0) (NOT p1) p2), false, p2, (NOT p0), (AND (NOT p0) p1 p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : BlocksWorld-PT-03-LTLFireability-14
Product exploration explored 100000 steps with 33387 reset in 628 ms.
Product exploration explored 100000 steps with 33338 reset in 642 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 142 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p0) p2 (NOT p1)), false, p2, (NOT p0), (AND (NOT p0) p2 p1), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 397 ms. (100 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 442 ms. (90 steps per ms) remains 1/1 properties
[2024-06-07 08:06:43] [INFO ] Invariant cache hit.
[2024-06-07 08:06:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 137/1010 variables, and 8 constraints, problems are : Problem set: 1 solved, 0 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 8/37 constraints, State Equation: 0/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 53ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p1))), (G (OR p0 (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2) p1))), (F p0), (F p2), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 p2 (NOT p1)))), (F p1)]
Knowledge based reduction with 17 factoid took 406 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) p2), false, p2, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) p2), false, p2, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 7 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 4 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:06:43] [INFO ] Invariant cache hit.
[2024-06-07 08:06:44] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-07 08:06:44] [INFO ] Invariant cache hit.
[2024-06-07 08:06:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:06:44] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 08:06:44] [INFO ] Invariant cache hit.
[2024-06-07 08:06:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:07:41] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:07:41] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 2 ms to minimize.
[2024-06-07 08:07:41] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-06-07 08:07:42] [INFO ] Deduced a trap composed of 96 places in 90 ms of which 2 ms to minimize.
[2024-06-07 08:07:43] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 08:07:43] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 1 ms to minimize.
[2024-06-07 08:07:43] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 08:07:43] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-06-07 08:07:44] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-06-07 08:07:44] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-07 08:07:44] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-07 08:07:44] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 08:07:46] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 0 ms to minimize.
[2024-06-07 08:07:47] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 08:07:47] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:07:47] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 63922ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63928ms
Finished structural reductions in LTL mode , in 1 iterations and 64501 ms. Remains : 361/361 places, 649/649 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 101 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) p2), false, p2, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 8099 steps (0 resets) in 113 ms. (71 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p2) (NOT p0)))), (F p1), (F p2), (F (NOT (OR (NOT p2) p0))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0))))]
Knowledge based reduction with 10 factoid took 308 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) p2), false, p2, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) p2), false, p2, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) p2), false, p2, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 39937 reset in 460 ms.
Product exploration explored 100000 steps with 40098 reset in 489 ms.
Applying partial POR strategy [true, false, false, true, false, true]
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) p2), false, p2, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 7 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 23 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:07:51] [INFO ] Redundant transitions in 3 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 08:07:51] [INFO ] Invariant cache hit.
[2024-06-07 08:07:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 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 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:08:47] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 0 ms to minimize.
[2024-06-07 08:08:47] [INFO ] Deduced a trap composed of 99 places in 101 ms of which 2 ms to minimize.
[2024-06-07 08:08:48] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 1 ms to minimize.
[2024-06-07 08:08:48] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-06-07 08:08:49] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 08:08:49] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 1 ms to minimize.
[2024-06-07 08:08:49] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-07 08:08:49] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-06-07 08:08:50] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 1 ms to minimize.
[2024-06-07 08:08:50] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-07 08:08:50] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-06-07 08:08:50] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 08:08:52] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:08:53] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 08:08:53] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-07 08:08:53] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-07 08:08:55] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2024-06-07 08:08:55] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1060 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 18/18 constraints]
After SMT, in 63992ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63998ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64033 ms. Remains : 361/361 places, 649/649 transitions.
Support contains 7 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 4 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:08:55] [INFO ] Invariant cache hit.
[2024-06-07 08:08:55] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-06-07 08:08:55] [INFO ] Invariant cache hit.
[2024-06-07 08:08:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:08:55] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 08:08:55] [INFO ] Invariant cache hit.
[2024-06-07 08:08:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 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 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:09:52] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:09:52] [INFO ] Deduced a trap composed of 99 places in 95 ms of which 2 ms to minimize.
[2024-06-07 08:09:53] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 1 ms to minimize.
[2024-06-07 08:09:53] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 1 ms to minimize.
[2024-06-07 08:09:54] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 08:09:55] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 2 ms to minimize.
[2024-06-07 08:09:55] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 08:09:55] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:09:55] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 2 ms to minimize.
[2024-06-07 08:09:56] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 2 ms to minimize.
[2024-06-07 08:09:56] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-07 08:09:56] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 08:09:57] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 0 ms to minimize.
[2024-06-07 08:09:58] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 08:09:59] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 0 ms to minimize.
[2024-06-07 08:09:59] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 64182ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 64188ms
Finished structural reductions in LTL mode , in 1 iterations and 64751 ms. Remains : 361/361 places, 649/649 transitions.
Treatment of property BlocksWorld-PT-03-LTLFireability-14 finished in 263657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X((p0||F(p1))) U G(!p0)) U X(G(!p1))))'
Support contains 2 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 6 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:09:59] [INFO ] Invariant cache hit.
[2024-06-07 08:10:00] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-07 08:10:00] [INFO ] Invariant cache hit.
[2024-06-07 08:10:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:10:00] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 08:10:00] [INFO ] Invariant cache hit.
[2024-06-07 08:10:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:10:56] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:10:57] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 2 ms to minimize.
[2024-06-07 08:10:57] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 1 ms to minimize.
[2024-06-07 08:10:57] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 1 ms to minimize.
[2024-06-07 08:10:59] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:10:59] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 2 ms to minimize.
[2024-06-07 08:10:59] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 08:10:59] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 0 ms to minimize.
[2024-06-07 08:11:00] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 1 ms to minimize.
[2024-06-07 08:11:00] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:11:00] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-07 08:11:00] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 08:11:02] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-07 08:11:02] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-06-07 08:11:03] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2024-06-07 08:11:03] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 2 ms to minimize.
[2024-06-07 08:11:04] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
SMT process timed out in 64016ms, After SMT, problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 64023ms
Finished structural reductions in LTL mode , in 1 iterations and 64628 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 249 ms :[(AND p0 p1), p1, (AND (NOT p1) (NOT p0)), false, p0, (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : BlocksWorld-PT-03-LTLFireability-15
Product exploration explored 100000 steps with 20122 reset in 765 ms.
Stack based approach found an accepted trace after 172 steps with 34 reset with depth 4 and stack size 4 in 1 ms.
FORMULA BlocksWorld-PT-03-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-03-LTLFireability-15 finished in 65672 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : BlocksWorld-PT-03-LTLFireability-00
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 37 out of 361 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 8 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:11:05] [INFO ] Invariant cache hit.
[2024-06-07 08:11:05] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-06-07 08:11:05] [INFO ] Invariant cache hit.
[2024-06-07 08:11:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:11:06] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 08:11:06] [INFO ] Invariant cache hit.
[2024-06-07 08:11:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:12:02] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:12:03] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 2 ms to minimize.
[2024-06-07 08:12:03] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-06-07 08:12:03] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-06-07 08:12:05] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 13 ms to minimize.
[2024-06-07 08:12:05] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 2 ms to minimize.
[2024-06-07 08:12:05] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-07 08:12:05] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:12:06] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 2 ms to minimize.
[2024-06-07 08:12:06] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-07 08:12:06] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-07 08:12:06] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 08:12:07] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:12:08] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 08:12:09] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:12:09] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 63820ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63826ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 64315 ms. Remains : 361/361 places, 649/649 transitions.
Running random walk in product with property : BlocksWorld-PT-03-LTLFireability-00
Product exploration explored 100000 steps with 30298 reset in 711 ms.
Product exploration explored 100000 steps with 30333 reset in 707 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 155 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 37 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 3 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:12:12] [INFO ] Invariant cache hit.
[2024-06-07 08:12:12] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-06-07 08:12:12] [INFO ] Invariant cache hit.
[2024-06-07 08:12:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:12:12] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 08:12:12] [INFO ] Invariant cache hit.
[2024-06-07 08:12:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 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 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:13:09] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:13:09] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 2 ms to minimize.
[2024-06-07 08:13:09] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 1 ms to minimize.
[2024-06-07 08:13:10] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-06-07 08:13:11] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 08:13:11] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 1 ms to minimize.
[2024-06-07 08:13:11] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2024-06-07 08:13:12] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:13:12] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-06-07 08:13:12] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-07 08:13:12] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-07 08:13:13] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 08:13:14] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 0 ms to minimize.
[2024-06-07 08:13:15] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 08:13:15] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2024-06-07 08:13:16] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 63678ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63684ms
Finished structural reductions in LTL mode , in 1 iterations and 64165 ms. Remains : 361/361 places, 649/649 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 140 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 30 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 131 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 30260 reset in 705 ms.
Product exploration explored 100000 steps with 30324 reset in 712 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 37 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 26 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:13:18] [INFO ] Redundant transitions in 3 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 08:13:18] [INFO ] Invariant cache hit.
[2024-06-07 08:13:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 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 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:14:15] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:14:15] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 2 ms to minimize.
[2024-06-07 08:14:15] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 1 ms to minimize.
[2024-06-07 08:14:16] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 1 ms to minimize.
[2024-06-07 08:14:17] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 08:14:17] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 1 ms to minimize.
[2024-06-07 08:14:17] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-07 08:14:17] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
[2024-06-07 08:14:18] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 1 ms to minimize.
[2024-06-07 08:14:18] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-07 08:14:18] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-06-07 08:14:18] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 08:14:20] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:14:21] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-07 08:14:21] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 0 ms to minimize.
[2024-06-07 08:14:21] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 63825ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63833ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63874 ms. Remains : 361/361 places, 649/649 transitions.
Support contains 37 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 3 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:14:22] [INFO ] Invariant cache hit.
[2024-06-07 08:14:22] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-07 08:14:22] [INFO ] Invariant cache hit.
[2024-06-07 08:14:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:14:23] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 08:14:23] [INFO ] Invariant cache hit.
[2024-06-07 08:14:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:15:19] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 0 ms to minimize.
[2024-06-07 08:15:19] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 2 ms to minimize.
[2024-06-07 08:15:20] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 2 ms to minimize.
[2024-06-07 08:15:20] [INFO ] Deduced a trap composed of 96 places in 87 ms of which 1 ms to minimize.
[2024-06-07 08:15:21] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 08:15:21] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 1 ms to minimize.
[2024-06-07 08:15:22] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2024-06-07 08:15:22] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-07 08:15:22] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-06-07 08:15:22] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:15:23] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-07 08:15:23] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-07 08:15:24] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:15:25] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 08:15:26] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:15:26] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 63696ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63702ms
Finished structural reductions in LTL mode , in 1 iterations and 64178 ms. Remains : 361/361 places, 649/649 transitions.
Treatment of property BlocksWorld-PT-03-LTLFireability-00 finished in 261193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(G(p0)) U (X(X(p0)) U p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)||X(p1))) U X(G(!p2))))'
Found a Lengthening insensitive property : BlocksWorld-PT-03-LTLFireability-14
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p0) (NOT p1) p2), false, p2, (NOT p0), (AND (NOT p0) p1 p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 7 out of 361 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 11 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:15:27] [INFO ] Invariant cache hit.
[2024-06-07 08:15:27] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-07 08:15:27] [INFO ] Invariant cache hit.
[2024-06-07 08:15:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:15:28] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 08:15:28] [INFO ] Invariant cache hit.
[2024-06-07 08:15:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:16:24] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 2 ms to minimize.
[2024-06-07 08:16:25] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 1 ms to minimize.
[2024-06-07 08:16:25] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 1 ms to minimize.
[2024-06-07 08:16:25] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 1 ms to minimize.
[2024-06-07 08:16:27] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-07 08:16:27] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 1 ms to minimize.
[2024-06-07 08:16:27] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-06-07 08:16:27] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-07 08:16:28] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-06-07 08:16:28] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-07 08:16:28] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-06-07 08:16:28] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-07 08:16:30] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-07 08:16:30] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 08:16:31] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 ms to minimize.
[2024-06-07 08:16:31] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 63957ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63963ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 64489 ms. Remains : 361/361 places, 649/649 transitions.
Running random walk in product with property : BlocksWorld-PT-03-LTLFireability-14
Product exploration explored 100000 steps with 33420 reset in 611 ms.
Product exploration explored 100000 steps with 33316 reset in 618 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 131 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) p2 (NOT p1)), false, p2, (NOT p0), (AND (NOT p0) p2 p1), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 484 ms. (82 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
[2024-06-07 08:16:33] [INFO ] Invariant cache hit.
[2024-06-07 08:16:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 137/1010 variables, and 8 constraints, problems are : Problem set: 1 solved, 0 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 8/37 constraints, State Equation: 0/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 48ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p1))), (G (OR p0 (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2) p1))), (F p0), (F p2), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 p2 (NOT p1)))), (F p1)]
Knowledge based reduction with 17 factoid took 364 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) p2), false, p2, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) p2), false, p2, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 7 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 11 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:16:34] [INFO ] Invariant cache hit.
[2024-06-07 08:16:34] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-06-07 08:16:34] [INFO ] Invariant cache hit.
[2024-06-07 08:16:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:16:35] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 08:16:35] [INFO ] Invariant cache hit.
[2024-06-07 08:16:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:17:32] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:17:32] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 1 ms to minimize.
[2024-06-07 08:17:32] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 1 ms to minimize.
[2024-06-07 08:17:33] [INFO ] Deduced a trap composed of 96 places in 90 ms of which 2 ms to minimize.
[2024-06-07 08:17:34] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 08:17:34] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 1 ms to minimize.
[2024-06-07 08:17:34] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-07 08:17:35] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2024-06-07 08:17:35] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 1 ms to minimize.
[2024-06-07 08:17:35] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-06-07 08:17:35] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-07 08:17:35] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 08:17:37] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-07 08:17:38] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:17:38] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 1 ms to minimize.
[2024-06-07 08:17:39] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 64150ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 64156ms
Finished structural reductions in LTL mode , in 1 iterations and 64722 ms. Remains : 361/361 places, 649/649 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 103 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) p2), false, p2, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 14097 steps (2 resets) in 165 ms. (84 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p2) (NOT p0)))), (F p1), (F p2), (F (NOT (OR (NOT p2) p0))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0))))]
Knowledge based reduction with 10 factoid took 315 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) p2), false, p2, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) p2), false, p2, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) p2), false, p2, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 40092 reset in 458 ms.
Product exploration explored 100000 steps with 39840 reset in 470 ms.
Applying partial POR strategy [true, false, false, true, false, true]
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) p2), false, p2, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 7 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 20 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:17:42] [INFO ] Redundant transitions in 3 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 08:17:42] [INFO ] Invariant cache hit.
[2024-06-07 08:17:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:18:38] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:18:38] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 2 ms to minimize.
[2024-06-07 08:18:39] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 1 ms to minimize.
[2024-06-07 08:18:39] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 2 ms to minimize.
[2024-06-07 08:18:40] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 08:18:40] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 1 ms to minimize.
[2024-06-07 08:18:40] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-07 08:18:41] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:18:41] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 1 ms to minimize.
[2024-06-07 08:18:41] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-06-07 08:18:41] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:18:42] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:18:43] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:18:44] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 08:18:44] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 0 ms to minimize.
[2024-06-07 08:18:45] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-07 08:18:46] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 1 ms to minimize.
[2024-06-07 08:18:46] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
SMT process timed out in 63892ms, After SMT, problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63903ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63941 ms. Remains : 361/361 places, 649/649 transitions.
Support contains 7 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 3 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:18:46] [INFO ] Invariant cache hit.
[2024-06-07 08:18:46] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-07 08:18:46] [INFO ] Invariant cache hit.
[2024-06-07 08:18:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:18:46] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 08:18:46] [INFO ] Invariant cache hit.
[2024-06-07 08:18:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 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 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:19:42] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
[2024-06-07 08:19:42] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 1 ms to minimize.
[2024-06-07 08:19:43] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-06-07 08:19:43] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-06-07 08:19:44] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 08:19:44] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 2 ms to minimize.
[2024-06-07 08:19:44] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 08:19:45] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-07 08:19:45] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-06-07 08:19:45] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-07 08:19:45] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-06-07 08:19:46] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:19:47] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-07 08:19:48] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 08:19:48] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:19:49] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-07 08:19:50] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 1 ms to minimize.
[2024-06-07 08:19:50] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
SMT process timed out in 63467ms, After SMT, problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63473ms
Finished structural reductions in LTL mode , in 1 iterations and 63982 ms. Remains : 361/361 places, 649/649 transitions.
Treatment of property BlocksWorld-PT-03-LTLFireability-14 finished in 262949 ms.
[2024-06-07 08:19:50] [INFO ] Flatten gal took : 54 ms
[2024-06-07 08:19:50] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 7 ms.
[2024-06-07 08:19:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 361 places, 649 transitions and 3232 arcs took 6 ms.
Total runtime 2522950 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : BlocksWorld-PT-03-LTLFireability-00
Could not compute solution for formula : BlocksWorld-PT-03-LTLFireability-01
Could not compute solution for formula : BlocksWorld-PT-03-LTLFireability-06
Could not compute solution for formula : BlocksWorld-PT-03-LTLFireability-09
Could not compute solution for formula : BlocksWorld-PT-03-LTLFireability-12
FORMULA BlocksWorld-PT-03-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717748454094

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name BlocksWorld-PT-03-LTLFireability-00
ltl formula formula --ltl=/tmp/4722/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 361 places, 649 transitions and 3232 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.030 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4722/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4722/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4722/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4722/ltl_0_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
corrupted size vs. prev_size in fastbins
corrupted size vs. prev_size in fastbins
corrupted size vs. prev_size in fastbins
ltl formula name BlocksWorld-PT-03-LTLFireability-01
ltl formula formula --ltl=/tmp/4722/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 361 places, 649 transitions and 3232 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.040 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4722/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4722/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4722/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4722/ltl_1_
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
ltl formula name BlocksWorld-PT-03-LTLFireability-06
ltl formula formula --ltl=/tmp/4722/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 361 places, 649 transitions and 3232 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.030 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4722/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4722/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4722/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4722/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 363 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 362, there are 652 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~1642 levels ~10000 states ~39388 transitions
pnml2lts-mc( 2/ 4): ~3308 levels ~20000 states ~80788 transitions
pnml2lts-mc( 2/ 4): ~6642 levels ~40000 states ~171700 transitions
pnml2lts-mc( 2/ 4): ~13240 levels ~80000 states ~331748 transitions
pnml2lts-mc( 2/ 4): ~26490 levels ~160000 states ~656564 transitions
pnml2lts-mc( 3/ 4): ~52934 levels ~320000 states ~1289832 transitions
pnml2lts-mc( 3/ 4): ~105977 levels ~640000 states ~2633708 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 406089
pnml2lts-mc( 0/ 4): unique states count: 1219579
pnml2lts-mc( 0/ 4): unique transitions count: 5420373
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 449036
pnml2lts-mc( 0/ 4): - claim found count: 900065
pnml2lts-mc( 0/ 4): - claim success count: 1219584
pnml2lts-mc( 0/ 4): - cum. max stack depth: 809725
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1219584 states 5420404 transitions, fanout: 4.444
pnml2lts-mc( 0/ 4): Total exploration time 14.830 sec (14.780 sec minimum, 14.810 sec on average)
pnml2lts-mc( 0/ 4): States per second: 82238, Transitions per second: 365503
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 93.4MB, 25.4 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 11.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 661 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 93.4MB (~256.0MB paged-in)
ltl formula name BlocksWorld-PT-03-LTLFireability-09
ltl formula formula --ltl=/tmp/4722/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 361 places, 649 transitions and 3232 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4722/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4722/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4722/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4722/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 362 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 362, there are 679 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2479 levels ~10000 states ~578276 transitions
pnml2lts-mc( 0/ 4): ~4985 levels ~20000 states ~1214672 transitions
pnml2lts-mc( 0/ 4): ~9947 levels ~40000 states ~2381796 transitions
pnml2lts-mc( 0/ 4): ~19807 levels ~80000 states ~4498340 transitions
pnml2lts-mc( 0/ 4): ~39572 levels ~160000 states ~8906908 transitions
pnml2lts-mc( 0/ 4): ~78924 levels ~320000 states ~17346808 transitions
pnml2lts-mc( 0/ 4): ~158445 levels ~640000 states ~36327460 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1110890
pnml2lts-mc( 0/ 4): unique transitions count: 71657479
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 16765166
pnml2lts-mc( 0/ 4): - claim success count: 1110897
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1107030
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1110897 states 71657976 transitions, fanout: 64.505
pnml2lts-mc( 0/ 4): Total exploration time 27.920 sec (27.170 sec minimum, 27.430 sec on average)
pnml2lts-mc( 0/ 4): States per second: 39789, Transitions per second: 2566546
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 93.6MB, 25.3 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 11.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 661 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 93.6MB (~256.0MB paged-in)
ltl formula name BlocksWorld-PT-03-LTLFireability-12
ltl formula formula --ltl=/tmp/4722/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 361 places, 649 transitions and 3232 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.040 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4722/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4722/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4722/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4722/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 363 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 362, there are 652 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2493 levels ~10000 states ~46324 transitions
pnml2lts-mc( 0/ 4): ~4941 levels ~20000 states ~88268 transitions
pnml2lts-mc( 0/ 4): ~9767 levels ~40000 states ~164440 transitions
pnml2lts-mc( 0/ 4): ~19462 levels ~80000 states ~320068 transitions
pnml2lts-mc( 0/ 4): ~39035 levels ~160000 states ~645400 transitions
pnml2lts-mc( 0/ 4): ~77718 levels ~320000 states ~1304936 transitions
pnml2lts-mc( 0/ 4): ~155999 levels ~640000 states ~2673564 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 13199
pnml2lts-mc( 0/ 4): unique states count: 1073612
pnml2lts-mc( 0/ 4): unique transitions count: 5207853
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1216439
pnml2lts-mc( 0/ 4): - claim success count: 1073616
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1056721
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1073616 states 5207876 transitions, fanout: 4.851
pnml2lts-mc( 0/ 4): Total exploration time 14.550 sec (14.520 sec minimum, 14.530 sec on average)
pnml2lts-mc( 0/ 4): States per second: 73788, Transitions per second: 357930
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 92.5MB, 26.0 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 11.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 661 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 92.5MB (~256.0MB paged-in)
ltl formula name BlocksWorld-PT-03-LTLFireability-14
ltl formula formula --ltl=/tmp/4722/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 361 places, 649 transitions and 3232 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4722/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4722/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4722/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4722/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 362 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 362, there are 709 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~29!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 476
pnml2lts-mc( 0/ 4): unique states count: 614
pnml2lts-mc( 0/ 4): unique transitions count: 6078
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1948
pnml2lts-mc( 0/ 4): - claim found count: 193
pnml2lts-mc( 0/ 4): - claim success count: 622
pnml2lts-mc( 0/ 4): - cum. max stack depth: 145
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 622 states 6247 transitions, fanout: 10.043
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 31100, Transitions per second: 312350
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 26.0 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 661 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BlocksWorld-PT-03"
export BK_EXAMINATION="LTLFireability"
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 LTLFireability"
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-171774426700180"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;