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.r312-tall-171662337700036.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 itstools
Input is QuasiCertifProtocol-COL-22, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662337700036
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.7K Apr 13 04:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 13 04:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 04:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 13 04:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 13 04:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 04:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 13 04:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 104K May 18 16:43 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 QuasiCertifProtocol-COL-22-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-22-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716658594159

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-25 17:36:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 17:36:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 17:36:35] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 17:36:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 17:36:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 591 ms
[2024-05-25 17:36:36] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1966 PT places and 356.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 17:36:36] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2024-05-25 17:36:36] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Reduction of identical properties reduced properties to check from 16 to 13
RANDOM walk for 27755 steps (858 resets) in 264 ms. (104 steps per ms) remains 0/13 properties
[2024-05-25 17:36:36] [INFO ] Flatten gal took : 24 ms
[2024-05-25 17:36:36] [INFO ] Flatten gal took : 5 ms
Domain [tsid(23), tsid(23)] of place n9 breaks symmetries in sort tsid
[2024-05-25 17:36:36] [INFO ] Unfolded HLPN to a Petri net with 1966 places and 356 transitions 4323 arcs in 36 ms.
[2024-05-25 17:36:36] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 811 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1916 transition count 356
Applied a total of 50 rules in 148 ms. Remains 1916 /1966 variables (removed 50) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-25 17:36:36] [INFO ] Computed 1562 invariants in 109 ms
[2024-05-25 17:36:39] [INFO ] Implicit Places using invariants in 2283 ms returned []
[2024-05-25 17:36:39] [INFO ] Invariant cache hit.
[2024-05-25 17:36:41] [INFO ] Implicit Places using invariants and state equation in 2899 ms returned []
Implicit Place search using SMT with State Equation took 5209 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 17:36:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2271/2272 variables, and 3477 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 332/3809 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2271/2272 variables, and 3809 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60668ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60697ms
Starting structural reductions in LTL mode, iteration 1 : 1916/1966 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66078 ms. Remains : 1916/1966 places, 356/356 transitions.
Support contains 811 out of 1916 places after structural reductions.
[2024-05-25 17:37:42] [INFO ] Flatten gal took : 147 ms
[2024-05-25 17:37:43] [INFO ] Flatten gal took : 122 ms
[2024-05-25 17:37:43] [INFO ] Input system was already deterministic with 356 transitions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40000 steps (1483 resets) in 3720 ms. (10 steps per ms) remains 15/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (9 resets) in 91 ms. (43 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 250 ms. (15 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (10 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (10 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (10 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 51 ms. (77 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 92 ms. (43 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (10 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (11 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
[2024-05-25 17:37:44] [INFO ] Invariant cache hit.
Problem AtomicPropp3 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 528/528 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 0/528 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 575/1340 variables, 550/1078 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1340 variables, 0/1078 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 4 (OVERLAPS) 355/1695 variables, 1340/2418 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1695 variables, 0/2418 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 577/2272 variables, 576/2994 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2272 variables, 484/3478 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2272 variables, 0/3478 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 6.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.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 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)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 0.0)
(s1361 0.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 0.0)
(s1416 0.0)
(s1417 0.0)
(s1418 0.0)
(s1419 0.0)
(s1420 0.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 0.0)
(s1426 0.0)
(s1427 0.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 0.0)
(s1432 0.0)
(s1433 0.0)
(s1434 0.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 0.0)
(s1441 0.0)
(s1442 0.0)
(s1443 0.0)
(s1444 0.0)
(s1445 0.0)
(s1446 0.0)
(s1447 0.0)
(s1448 0.0)
(s1449 0.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 0.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 0.0)
(s1461 0.0)
(s1462 0.0)
(s1463 0.0)
(s1464 0.0)
(s1465 0.0)
(s1466 0.0)
(s1467 0.0)
(s1468 0.0)
(s1469 0.0)
(s1470 0.0)
(s1471 0.0)
(s1472 0.0)
(s1473 0.0)
(s1474 0.0)
(s1475 0.0)
(s1476 0.0)
(s1477 0.0)
(s1478 0.0)
(s1479 0.0)
(s1480 0.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0)
(s1484 0.0)
(s1485 0.0)
(s1486 0.0)
(s1487 0.0)
(s1488 0.0)
(s1489 0.0)
(s1490 0.0)
(s1491 0.0)
(s1492 0.0)
(s1493 0.0)
(s1494 0.0)
(s1495 0.0)
(s1496 0.0)
(s1497 0.0)
(s1498 0.0)
(s1499 0.0)
(s1500 0.0)
(s1501 0.0)
(s1502 0.0)
(s1503 0.0)
(s1504 0.0)
(s1505 0.0)
(s1506 0.0)
(s1507 0.0)
(s1508 0.0)
(s1509 0.0)
(s1510 0.0)
(s1511 0.0)
(s1512 0.0)
(s1513 0.0)
(s1514 0.0)
(s1515 0.0)
(s1516 0.0)
(s1517 0.0)
(s1518 0.0)
(s1519 0.0)
(s1520 0.0)
(s1521 0.0)
(s1522 0.0)
(s1523 0.0)
(s1524 0.0)
(s1525 0.0)
(s1526 0.0)
(s1527 0.0)
(s1528 0.0)
(s1529 0.0)
(s1530 0.0)
(s1531 0.0)
(s1532 0.0)
(s1533 0.0)
(s1534 0.0)
(s1535 0.0)
(s1536 0.0)
(s1537 0.0)
(s1538 0.0)
(s1539 0.0)
(s1540 0.0)
(s1541 0.0)
(s1542 0.0)
(s1543 0.0)
(s1544 0.0)
(s1545 0.0)
(s1546 0.0)
(s1547 0.0)
(s1548 0.0)
(s1549 0.0)
(s1550 0.0)
(s1551 0.0)
(s1552 0.0)
(s1553 0.0)
(s1554 0.0)
(s1555 0.0)
(s1556 0.0)
(s1557 0.0)
(s1558 0.0)
(s1559 0.0)
(s1560 0.0)
(s1561 0.0)
(s1562 0.0)
(s1563 0.0)
(s1564 0.0)
(s1565 0.0)
(s1566 0.0)
(s1567 0.0)
(s1568 0.0)
(s1569 0.0)
(s1570 0.0)
(s1571 0.0)
(s1572 0.0)
(s1573 0.0)
(s1574 0.0)
(s1575 0.0)
(s1576 0.0)
(s1577 0.0)
(s1578 0.0)
(s1579 0.0)
(s1580 0.0)
(s1581 0.0)
(s1582 0.0)
(s1583 0.0)
(s1584 0.0)
(s1585 0.0)
(s1586 0.0)
(s1587 0.0)
(s1588 0.0)
(s1589 0.0)
(s1590 0.0)
(s1591 0.0)
(s1592 0.0)
(s1593 0.0)
(s1594 0.0)
(s1595 0.0)
(s1596 0.0)
(s1597 0.0)
(s1598 0.0)
(s1599 0.0)
(s1600 0.0)
(s1601 0.0)
(s1602 0.0)
(s1603 0.0)
(s1604 0.0)
(s1605 0.0)
(s1606 0.0)
(s1607 0.0)
(s1608 0.0)
(s1609 0.0)
(s1610 0.0)
(s1611 0.0)
(s1612 0.0)
(s1613 0.0)
(s1614 0.0)
(s1615 0.0)
(s1616 0.0)
(s1617 0.0)
(s1618 0.0)
(s1619 0.0)
(s1620 0.0)
(s1621 0.0)
(s1622 0.0)
(s1623 0.0)
(s1624 0.0)
(s1625 0.0)
(s1626 0.0)
(s1627 0.0)
(s1628 0.0)
(s1629 0.0)
(s1630 0.0)
(s1631 0.0)
(s1632 0.0)
(s1633 0.0)
(s1634 1.0)
(s1635 1.0)
(s1636 1.0)
(s1637 1.0)
(s1638 1.0)
(s1639 1.0)
(s1640 1.0)
(s1641 1.0)
(s1642 1.0)
(s1643 1.0)
(s1644 1.0)
(s1645 1.0)
(s1646 1.0)
(s1647 1.0)
(s1648 1.0)
(s1649 1.0)
(s1650 1.0)
(s1651 1.0)
(s1652 1.0)
(s1653 1.0)
(s1654 1.0)
(s1655 1.0)
(s1656 1.0)
(s1657 0.0)
(s1658 0.0)
(s1659 0.0)
(s1660 0.0)
(s1661 0.0)
(s1662 0.0)
(s1663 0.0)
(s1664 0.0)
(s1665 0.0)
(s1666 0.0)
(s1667 0.0)
(s1668 0.0)
(s1669 0.0)
(s1670 0.0)
(s1671 0.0)
(s1672 0.0)
(s1673 0.0)
(s1674 0.0)
(s1675 0.0)
(s1676 0.0)
(s1677 0.0)
(s1678 0.0)
(s1679 0.0)
(s1680 0.0)
(s1681 0.0)
(s1682 0.0)
(s1683 0.0)
(s1684 0.0)
(s1685 0.0)
(s1686 0.0)
(s1687 0.0)
(s1688 0.0)
(s1689 0.0)
(s1690 0.0)
(s1691 0.0)
(s1692 0.0)
(s1693 0.0)
(s1694 0.0)
(s1695 0.0)
(s1696 0.0)
(s1697 0.0)
(s1698 0.0)
(s1699 0.0)
(s1700 0.0)
(s1701 0.0)
(s1702 0.0)
(s1703 0.0)
(s1704 0.0)
(s1705 0.0)
(s1706 0.0)
(s1707 0.0)
(s1708 0.0)
(s1709 0.0)
(s1710 0.0)
(s1711 0.0)
(s1712 0.0)
(s1713 0.0)
(s1714 0.0)
(s1715 0.0)
(s1716 0.0)
(s1717 0.0)
(s1718 0.0)
(s1719 0.0)
(s1720 0.0)
(s1721 0.0)
(s1722 0.0)
(s1723 0.0)
(s1724 0.0)
(s1725 0.0)
(s1726 0.0)
(s1727 0.0)
(s1728 0.0)
(s1729 0.0)
(s1730 0.0)
(s1731 0.0)
(s1732 0.0)
(s1733 0.0)
(s1734 0.0)
(s1735 0.0)
(s1736 0.0)
(s1737 0.0)
(s1738 0.0)
(s1739 0.0)
(s1740 0.0)
(s1741 0.0)
(s1742 0.0)
(s1743 0.0)
(s1744 0.0)
(s1745 0.0)
(s1746 0.0)
(s1747 0.0)
(s1748 0.0)
(s1749 1.0)
(s1750 1.0)
(s1751 1.0)
(s1752 1.0)
(s1753 1.0)
(s1754 1.0)
(s1755 1.0)
(s1756 1.0)
(s1757 1.0)
(s1758 1.0)
(s1759 1.0)
(s1760 1.0)
(s1761 1.0)
(s1762 1.0)
(s1763 1.0)
(s1764 1.0)
(s1765 1.0)
(s1766 1.0)
(s1767 1.0)
(s1768 1.0)
(s1769 1.0)
(s1770 1.0)
(s1771 1.0)
(s1772 0.0)
(s1773 0.0)
(s1774 0.0)
(s1775 0.0)
(s1776 0.0)
(s1777 0.0)
(s1778 0.0)
(s1779 0.0)
(s1780 0.0)
(s1781 0.0)
(s1782 0.0)
(s1783 0.0)
(s1784 0.0)
(s1785 0.0)
(s1786 0.0)
(s1787 0.0)
(s1788 0.0)
(s1789 0.0)
(s1790 0.0)
(s1791 0.0)
(s1792 0.0)
(s1793 0.0)
(s1794 0.0)
(s1795 0.0)
(s1796 0.0)
(s1797 0.0)
(s1798 0.0)
(s1799 0.0)
(s1800 0.0)
(s1801 0.0)
(s1802 0.0)
(s1803 0.0)
(s1804 0.0)
(s1805 0.0)
(s1806 0.0)
(s1807 0.0)
(s1808 0.0)
(s1809 0.0)
(s1810 0.0)
(s1811 0.0)
(s1812 0.0)
(s1813 0.0)
(s1814 0.0)
(s1815 0.0)
(s1816 0.0)
(s1817 0.0)
(s1818 (/ 16.0 21.0))
(s1819 (/ 16.0 21.0))
(s1820 (/ 16.0 21.0))
(s1821 (/ 16.0 21.0))
(s1822 (/ 16.0 21.0))
(s1823 (/ 16.0 21.0))
(s1824 (/ 16.0 21.0))
(s1825 0.0)
(s1826 (/ 16.0 21.0))
(s1827 (/ 16.0 21.0))
(s1828 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/2272 variables, 0/3478 constraints. Problems are: Problem set: 2 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2272/2272 variables, and 3478 constraints, problems are : Problem set: 2 solved, 13 unsolved in 5017 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1916/1916 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/764 variables, 528/528 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/764 variables, 0/528 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 575/1339 variables, 550/1078 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1339 variables, 0/1078 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 355/1694 variables, 1339/2417 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1694 variables, 7/2424 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1694 variables, 0/2424 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 578/2272 variables, 577/3001 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2272 variables, 484/3485 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2272/2272 variables, and 3491 constraints, problems are : Problem set: 2 solved, 13 unsolved in 5044 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1916/1916 constraints, PredecessorRefiner: 13/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 10168ms problems are : Problem set: 2 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 764 out of 1916 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.8 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 71 ms. Remains 1892 /1916 variables (removed 24) and now considering 354/356 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 1892/1916 places, 354/356 transitions.
RANDOM walk for 40000 steps (1484 resets) in 996 ms. (40 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (71 resets) in 198 ms. (201 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (81 resets) in 629 ms. (63 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (85 resets) in 144 ms. (275 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (86 resets) in 169 ms. (235 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (89 resets) in 90 ms. (439 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (86 resets) in 93 ms. (425 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (32 resets) in 140 ms. (283 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (91 resets) in 130 ms. (305 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (66 resets) in 135 ms. (294 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (86 resets) in 62 ms. (634 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (84 resets) in 186 ms. (213 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (86 resets) in 131 ms. (303 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (67 resets) in 181 ms. (219 steps per ms) remains 12/12 properties
Finished probabilistic random walk after 4614 steps, run visited all 12 properties in 121 ms. (steps per millisecond=38 )
Probabilistic random walk after 4614 steps, saw 4496 distinct states, run finished after 128 ms. (steps per millisecond=36 ) properties seen :12
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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) U (X(G(!p0))||(X(!p0)&&(X(p1) U (X(G(p1))||(X(p1)&&G(p2))))))))'
Support contains 577 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 36 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-25 17:37:56] [INFO ] Invariant cache hit.
[2024-05-25 17:37:58] [INFO ] Implicit Places using invariants in 1701 ms returned []
[2024-05-25 17:37:58] [INFO ] Invariant cache hit.
[2024-05-25 17:38:01] [INFO ] Implicit Places using invariants and state equation in 3105 ms returned []
Implicit Place search using SMT with State Equation took 4813 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 17:38:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2271/2272 variables, and 3477 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 332/3809 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2271/2272 variables, and 3809 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60527ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60534ms
Finished structural reductions in LTL mode , in 1 iterations and 65386 ms. Remains : 1916/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 526 ms :[true, p0, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1)), (AND p0 (NOT p2)), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, p0, (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-00
Product exploration explored 100000 steps with 3720 reset in 1088 ms.
Product exploration explored 100000 steps with 3711 reset in 1023 ms.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0 p1)))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 584 ms. Reduced automaton from 12 states, 53 edges and 3 AP (stutter sensitive) to 17 states, 82 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 663 ms :[true, (AND p0 (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2)), p0, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0, p0, p0, p0, p0, p0, (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (1486 resets) in 1335 ms. (29 steps per ms) remains 13/18 properties
BEST_FIRST walk for 40003 steps (91 resets) in 1537 ms. (26 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (69 resets) in 1611 ms. (24 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (116 resets) in 1661 ms. (24 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (44 resets) in 162 ms. (245 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (45 resets) in 659 ms. (60 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (120 resets) in 575 ms. (69 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (116 resets) in 628 ms. (63 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (45 resets) in 638 ms. (62 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (50 resets) in 577 ms. (69 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (48 resets) in 633 ms. (63 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (120 resets) in 610 ms. (65 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (68 resets) in 661 ms. (60 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (68 resets) in 150 ms. (264 steps per ms) remains 13/13 properties
[2024-05-25 17:39:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 529/1106 variables, 506/1012 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1106 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem apf1 is UNSAT
Problem apf6 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 4 (OVERLAPS) 254/1360 variables, 1106/2118 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1360 variables, 0/2118 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Problem apf2 is UNSAT
Problem apf5 is UNSAT
Problem apf12 is UNSAT
At refinement iteration 6 (OVERLAPS) 785/2145 variables, 691/2809 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2145 variables, 484/3293 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2145 variables, 0/3293 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 23/2168 variables, 22/3315 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2168 variables, 23/3338 constraints. Problems are: Problem set: 6 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2168/2272 variables, and 3338 constraints, problems are : Problem set: 6 solved, 7 unsolved in 5011 ms.
Refiners :[Generalized P Invariants (flows): 1518/1562 constraints, State Equation: 1820/1916 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 506/506 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/506 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 529/1106 variables, 506/1012 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1106 variables, 0/1012 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 254/1360 variables, 1106/2118 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1360 variables, 0/2118 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 785/2145 variables, 691/2809 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2145 variables, 484/3293 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2145 variables, 7/3300 constraints. Problems are: Problem set: 6 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2145/2272 variables, and 3300 constraints, problems are : Problem set: 6 solved, 7 unsolved in 5013 ms.
Refiners :[Generalized P Invariants (flows): 1496/1562 constraints, State Equation: 1797/1916 constraints, PredecessorRefiner: 7/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 10893ms problems are : Problem set: 6 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 577 out of 1916 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.7 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 1363 transition count 325
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 1361 transition count 325
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 54 place count 1339 transition count 303
Iterating global reduction 2 with 22 rules applied. Total rules applied 76 place count 1339 transition count 303
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 2 with 23 rules applied. Total rules applied 99 place count 1339 transition count 280
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 122 place count 1316 transition count 280
Applied a total of 122 rules in 164 ms. Remains 1316 /1916 variables (removed 600) and now considering 280/356 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 1316/1916 places, 280/356 transitions.
RANDOM walk for 40000 steps (1541 resets) in 1005 ms. (39 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (93 resets) in 745 ms. (53 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (48 resets) in 156 ms. (254 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (48 resets) in 677 ms. (59 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (52 resets) in 587 ms. (68 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (52 resets) in 622 ms. (64 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (73 resets) in 646 ms. (61 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (76 resets) in 129 ms. (307 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 3709 steps, run visited all 7 properties in 160 ms. (steps per millisecond=23 )
Probabilistic random walk after 3709 steps, saw 3616 distinct states, run finished after 161 ms. (steps per millisecond=23 ) properties seen :7
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0 p1)))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (G (OR p1 (NOT p2) (NOT p0))), (G (OR (NOT p1) (NOT p2) (NOT p0))), (G (OR (NOT p1) (NOT p2))), (G (OR (NOT p1) (NOT p2) p0)), (G (OR (NOT p1) p2 (NOT p0))), (G (OR (NOT p2) (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p1 p2))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND p1 (NOT p2) (NOT p0)))), (F p2), (F (NOT p1)), (F p0), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 (NOT p2) p0)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 p2 (NOT p0))))
Knowledge based reduction with 23 factoid took 767 ms. Reduced automaton from 17 states, 82 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-00 finished in 86258 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((p0&&F(p1))))'
Support contains 47 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.19 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1891 transition count 353
Applied a total of 3 rules in 206 ms. Remains 1891 /1916 variables (removed 25) and now considering 353/356 (removed 3) transitions.
// Phase 1: matrix 353 rows 1891 cols
[2024-05-25 17:39:23] [INFO ] Computed 1540 invariants in 39 ms
[2024-05-25 17:39:25] [INFO ] Implicit Places using invariants in 2218 ms returned []
[2024-05-25 17:39:25] [INFO ] Invariant cache hit.
[2024-05-25 17:39:30] [INFO ] Implicit Places using invariants and state equation in 4754 ms returned [1680, 1681, 1682, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 6982 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/1916 places, 353/356 transitions.
Applied a total of 0 rules in 86 ms. Remains 1845 /1845 variables (removed 0) and now considering 353/353 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7274 ms. Remains : 1845/1916 places, 353/356 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-01
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-01 finished in 7356 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(F((p0&&X(p1)))))))'
Support contains 70 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 69 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-25 17:39:30] [INFO ] Computed 1562 invariants in 51 ms
[2024-05-25 17:39:32] [INFO ] Implicit Places using invariants in 1958 ms returned []
[2024-05-25 17:39:32] [INFO ] Invariant cache hit.
[2024-05-25 17:39:35] [INFO ] Implicit Places using invariants and state equation in 3352 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5317 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 72 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5459 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-02
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-02 finished in 5646 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))))'
Support contains 46 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 70 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-25 17:39:36] [INFO ] Invariant cache hit.
[2024-05-25 17:39:38] [INFO ] Implicit Places using invariants in 2021 ms returned []
[2024-05-25 17:39:38] [INFO ] Invariant cache hit.
[2024-05-25 17:39:44] [INFO ] Implicit Places using invariants and state equation in 5877 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 7902 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 65 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8037 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 91 ms :[p0, p0, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 386 ms.
Product exploration explored 100000 steps with 33333 reset in 382 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-03 finished in 9326 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((G(p0) U (X(X(X(p1)))&&F(p2))))))'
Support contains 71 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 74 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-25 17:39:45] [INFO ] Invariant cache hit.
[2024-05-25 17:39:47] [INFO ] Implicit Places using invariants in 1996 ms returned []
[2024-05-25 17:39:47] [INFO ] Invariant cache hit.
[2024-05-25 17:39:50] [INFO ] Implicit Places using invariants and state equation in 3269 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5269 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 67 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5410 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 561 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-04
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-04 finished in 5999 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 U X((F(!p1)&&X(X(G(!p2)))))))))'
Support contains 71 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1891 transition count 353
Applied a total of 3 rules in 156 ms. Remains 1891 /1916 variables (removed 25) and now considering 353/356 (removed 3) transitions.
// Phase 1: matrix 353 rows 1891 cols
[2024-05-25 17:39:51] [INFO ] Computed 1540 invariants in 23 ms
[2024-05-25 17:39:53] [INFO ] Implicit Places using invariants in 2020 ms returned []
[2024-05-25 17:39:53] [INFO ] Invariant cache hit.
[2024-05-25 17:40:03] [INFO ] Implicit Places using invariants and state equation in 9469 ms returned [1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 11491 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1868/1916 places, 353/356 transitions.
Applied a total of 0 rules in 80 ms. Remains 1868 /1868 variables (removed 0) and now considering 353/353 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11727 ms. Remains : 1868/1916 places, 353/356 transitions.
Stuttering acceptance computed with spot in 622 ms :[(OR p1 p2), (OR p1 p2), (OR p1 p2), p2, p2, p1, p2, p2, p2, (AND p1 p2), p2, p2, p2, p2]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-05
Product exploration explored 100000 steps with 3713 reset in 428 ms.
Product exploration explored 100000 steps with 3716 reset in 480 ms.
Computed a total of 1868 stabilizing places and 353 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1868 transition count 353
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 19 ms. Reduced automaton from 14 states, 61 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-05 finished in 13571 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(p0)||G(F(p1)))))'
Support contains 47 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 62 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-25 17:40:05] [INFO ] Computed 1562 invariants in 29 ms
[2024-05-25 17:40:07] [INFO ] Implicit Places using invariants in 2027 ms returned []
[2024-05-25 17:40:07] [INFO ] Invariant cache hit.
[2024-05-25 17:40:12] [INFO ] Implicit Places using invariants and state equation in 5769 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 7799 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 63 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7924 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-06
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-06 finished in 8065 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 46 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.4 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1890 transition count 352
Applied a total of 5 rules in 142 ms. Remains 1890 /1916 variables (removed 26) and now considering 352/356 (removed 4) transitions.
// Phase 1: matrix 352 rows 1890 cols
[2024-05-25 17:40:13] [INFO ] Computed 1540 invariants in 22 ms
[2024-05-25 17:40:15] [INFO ] Implicit Places using invariants in 2060 ms returned []
[2024-05-25 17:40:15] [INFO ] Invariant cache hit.
[2024-05-25 17:40:33] [INFO ] Implicit Places using invariants and state equation in 18210 ms returned [1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 20275 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1867/1916 places, 352/356 transitions.
Applied a total of 0 rules in 87 ms. Remains 1867 /1867 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20504 ms. Remains : 1867/1916 places, 352/356 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-07
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-07 finished in 20546 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((F(G(!p0))&&(G(F(p2))||p1))))'
Support contains 576 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.6 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1889 transition count 351
Applied a total of 5 rules in 87 ms. Remains 1889 /1916 variables (removed 27) and now considering 351/356 (removed 5) transitions.
// Phase 1: matrix 351 rows 1889 cols
[2024-05-25 17:40:33] [INFO ] Computed 1540 invariants in 29 ms
[2024-05-25 17:40:35] [INFO ] Implicit Places using invariants in 1665 ms returned []
[2024-05-25 17:40:35] [INFO ] Invariant cache hit.
[2024-05-25 17:40:38] [INFO ] Implicit Places using invariants and state equation in 3066 ms returned [1680, 1681, 1682, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 4735 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1866/1916 places, 351/356 transitions.
Applied a total of 0 rules in 49 ms. Remains 1866 /1866 variables (removed 0) and now considering 351/351 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4871 ms. Remains : 1866/1916 places, 351/356 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR p0 (AND (NOT p1) (NOT p2))), p0, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-08
Product exploration explored 100000 steps with 3476 reset in 517 ms.
Product exploration explored 100000 steps with 3474 reset in 547 ms.
Computed a total of 1866 stabilizing places and 351 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1866 transition count 351
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (G (NOT p1))), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 20 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-08 finished in 6432 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(G(p0))&&(X(p1) U p2))))'
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 35 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-25 17:40:40] [INFO ] Computed 1562 invariants in 28 ms
[2024-05-25 17:40:41] [INFO ] Implicit Places using invariants in 1683 ms returned []
[2024-05-25 17:40:41] [INFO ] Invariant cache hit.
[2024-05-25 17:40:47] [INFO ] Implicit Places using invariants and state equation in 5435 ms returned []
Implicit Place search using SMT with State Equation took 7120 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 17:40:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2271/2272 variables, and 3477 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 332/3809 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2271/2272 variables, and 3809 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60398ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60404ms
Finished structural reductions in LTL mode , in 1 iterations and 67562 ms. Remains : 1916/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-10 finished in 67771 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((!p0||G(!p1)))&&X(X(G(!p2)))))'
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 35 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-25 17:41:47] [INFO ] Invariant cache hit.
[2024-05-25 17:41:49] [INFO ] Implicit Places using invariants in 1589 ms returned []
[2024-05-25 17:41:49] [INFO ] Invariant cache hit.
[2024-05-25 17:41:54] [INFO ] Implicit Places using invariants and state equation in 5409 ms returned []
Implicit Place search using SMT with State Equation took 7003 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 17:41:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2271/2272 variables, and 3477 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 332/3809 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2271/2272 variables, and 3809 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60391ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60396ms
Finished structural reductions in LTL mode , in 1 iterations and 67436 ms. Remains : 1916/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 234 ms :[true, (OR p2 p1), (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-11
Product exploration explored 100000 steps with 3718 reset in 487 ms.
Product exploration explored 100000 steps with 3709 reset in 511 ms.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR p1 p2)))), (X (X (NOT (OR (AND p0 p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 11 factoid took 783 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (1482 resets) in 371 ms. (107 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (88 resets) in 635 ms. (62 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (86 resets) in 645 ms. (61 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (49 resets) in 709 ms. (56 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (90 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
[2024-05-25 17:42:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 552/1151 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1151 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 120/1271 variables, 1151/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1271 variables, 0/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 403/1674 variables, 167/2352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1674 variables, 0/2352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 46/1720 variables, 44/2396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1720 variables, 46/2442 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1720 variables, 0/2442 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 552/2272 variables, 552/2994 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2272 variables, 484/3478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2272 variables, 0/3478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/2272 variables, 0/3478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2272/2272 variables, and 3478 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3078 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1916/1916 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 552/1151 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1151 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 120/1271 variables, 1151/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1271 variables, 0/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 403/1674 variables, 167/2352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1674 variables, 4/2356 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1674 variables, 0/2356 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 46/1720 variables, 44/2400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1720 variables, 46/2446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1720 variables, 0/2446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 552/2272 variables, 552/2998 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2272 variables, 484/3482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2272 variables, 0/3482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2272/2272 variables, and 3482 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5017 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1916/1916 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 8154ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 765 are kept as prefixes of interest. Removing 1151 places using SCC suffix rule.5 ms
Discarding 1151 places :
Also discarding 71 output transitions
Drop transitions (Output transitions of discarded places.) removed 71 transitions
Drop transitions (Empty/Sink Transition effects.) removed 141 transitions
Reduce isomorphic transitions removed 141 transitions.
Discarding 46 places :
Implicit places reduction removed 46 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 188 rules applied. Total rules applied 189 place count 719 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 190 place count 718 transition count 143
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 190 place count 718 transition count 97
Deduced a syphon composed of 46 places in 1 ms
Ensure Unique test removed 23 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 115 rules applied. Total rules applied 305 place count 649 transition count 97
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 305 place count 649 transition count 96
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 307 place count 648 transition count 96
Applied a total of 307 rules in 63 ms. Remains 648 /1916 variables (removed 1268) and now considering 96/356 (removed 260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 648/1916 places, 96/356 transitions.
RANDOM walk for 40000 steps (1600 resets) in 520 ms. (76 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (99 resets) in 617 ms. (64 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (104 resets) in 585 ms. (68 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (64 resets) in 665 ms. (60 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (102 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 902 steps, run visited all 4 properties in 22 ms. (steps per millisecond=41 )
Probabilistic random walk after 902 steps, saw 856 distinct states, run finished after 23 ms. (steps per millisecond=39 ) properties seen :4
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR p1 p2)))), (X (X (NOT (OR (AND p0 p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (OR (NOT p0) (NOT p1)) (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2))), (F p0), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p1)]
Knowledge based reduction with 11 factoid took 1378 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Stuttering acceptance computed with spot in 169 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 35 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-25 17:43:09] [INFO ] Invariant cache hit.
[2024-05-25 17:43:10] [INFO ] Implicit Places using invariants in 1682 ms returned []
[2024-05-25 17:43:10] [INFO ] Invariant cache hit.
[2024-05-25 17:43:16] [INFO ] Implicit Places using invariants and state equation in 5452 ms returned []
Implicit Place search using SMT with State Equation took 7139 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 17:43:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2271/2272 variables, and 3477 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 332/3809 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2271/2272 variables, and 3809 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60395ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60403ms
Finished structural reductions in LTL mode , in 1 iterations and 67580 ms. Remains : 1916/1916 places, 356/356 transitions.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT p2))), (X (X (NOT (OR p1 p2)))), (X (X (NOT (OR (AND p0 p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 9 factoid took 606 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (1484 resets) in 663 ms. (60 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (91 resets) in 638 ms. (62 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (50 resets) in 688 ms. (58 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (85 resets) in 586 ms. (68 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (89 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
[2024-05-25 17:44:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 552/1151 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1151 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 120/1271 variables, 1151/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1271 variables, 0/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 403/1674 variables, 167/2352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1674 variables, 0/2352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 46/1720 variables, 44/2396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1720 variables, 46/2442 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1720 variables, 0/2442 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 552/2272 variables, 552/2994 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2272 variables, 484/3478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2272 variables, 0/3478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/2272 variables, 0/3478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2272/2272 variables, and 3478 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2777 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1916/1916 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 552/1151 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1151 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 120/1271 variables, 1151/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1271 variables, 0/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 403/1674 variables, 167/2352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1674 variables, 4/2356 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1674 variables, 0/2356 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 46/1720 variables, 44/2400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1720 variables, 46/2446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1720 variables, 0/2446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 552/2272 variables, 552/2998 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2272 variables, 484/3482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2272 variables, 0/3482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/2272 variables, 0/3482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2272/2272 variables, and 3482 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3956 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1916/1916 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 6792ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 102 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=25 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 13 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT p2))), (X (X (NOT (OR p1 p2)))), (X (X (NOT (OR (AND p0 p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (AND (OR (NOT p1) (NOT p0)) (NOT p2)))), (F p1)]
Knowledge based reduction with 9 factoid took 1100 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Stuttering acceptance computed with spot in 186 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Stuttering acceptance computed with spot in 183 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Product exploration explored 100000 steps with 3708 reset in 487 ms.
Product exploration explored 100000 steps with 3712 reset in 521 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 173 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.7 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1892 transition count 355
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 230 ms. Remains 1892 /1916 variables (removed 24) and now considering 355/356 (removed 1) transitions.
[2024-05-25 17:44:28] [INFO ] Redundant transitions in 45 ms returned []
Running 331 sub problems to find dead transitions.
// Phase 1: matrix 355 rows 1892 cols
[2024-05-25 17:44:28] [INFO ] Computed 1540 invariants in 25 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1891 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1891 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Problem TDEAD163 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 2 (OVERLAPS) 355/2246 variables, 1891/3431 constraints. Problems are: Problem set: 2 solved, 329 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 13.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.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)timeout

(s104 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2246/2247 variables, and 3431 constraints, problems are : Problem set: 2 solved, 329 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1891/1892 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1890 variables, 1540/1540 constraints. Problems are: Problem set: 2 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1890 variables, 0/1540 constraints. Problems are: Problem set: 2 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 354/2244 variables, 1890/3430 constraints. Problems are: Problem set: 2 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2244 variables, 329/3759 constraints. Problems are: Problem set: 2 solved, 329 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 13)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 0)
(s973 0)
(s974 0)
(s975 0)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 0)
(s987 0)
(s988 0)
(s989 0)
(s990 0)
(s991 0)
(s992 0)
(s993 0)
(s994 0)
(s995 0)
(s996 0)
(s997 0)
(s998 0)
(s999 0)
(s1000 0)
(s1001 0)
(s1002 0)
(s1003 0)
(s1004 0)
(s1005 0)
(s1006 0)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 0)
(s1011 0)
(s1012 0)
(s1013 0)
(s1014 0)
(s1015 0)
(s1016 0)
(s1017 0)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 0)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 0)
(s1028 0)
(s1029 0)
(s1030 0)
(s1031 0)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 0)
(s1037 0)
(s1038 0)
(s1039 0)
(s1040 0)
(s1041 0)
(s1042 0)
(s1043 0)
(s1044 0)
(s1045 0)
(s1046 0)
(s1047 0)
(s1048 0)
(s1049 0)
(s1050 0)
(s1051 0)
(s1052 0)
(s1053 0)
(s1054 0)
(s1055 0)
(s1056 0)
(s1057 0)
(s1058 0)
(s1059 0)
(s1060 0)
(s1061 0)
(s1062 0)
(s1063 0)
(s1064 0)
(s1065 0)
(s1066 0)
(s1067 0)
(s1068 0)
(s1069 0)
(s1070 0)
(s1071 0)
(s1072 0)
(s1073 0)
(s1074 0)
(s1075 0)
(s1076 0)
(s1077 0)
(s1078 0)
(s1079 0)
(s1080 0)
(s1081 0)
(s1082 0)
(s1083 0)
(s1084 0)
(s1085 0)
(s1086 0)
(s1087 0)
(s1088 0)
(s1089 0)
(s1090 0)
(s1091 0)
(s1092 0)
(s1093 0)
(s1094 0)
(s1095 0)
(s1096 0)
(s1097 0)
(s1098 0)
(s1099 0)
(s1100 0)
(s1101 0)
(s1102 0)
(s1103 0)
(s1104 0)
(s1105 0)
(s1106 0)
(s1107 0)
(s1108 0)
(s1109 0)
(s1110 0)
(s1111 0)
(s1112 0)
(s1113 0)
(s1114 0)
(s1115 0)
(s1116 0)
(s1117 0)
(s1118 0)
(s1119 0)
(s1120 0)
(s1121 0)
(s1122 0)
(s1123 0)
(s1124 0)
(s1125 0)
(s1126 0)
(s1127 0)
(s1128 0)
(s1129 0)
(s1130 0)
(s1131 0)
(s1132 0)
(s1133 0)
(s1134 0)
(s1135 0)
(s1136 0)
(s1137 0)
(s1138 0)
(s1139 0)
(s1140 0)
(s1141 0)
(s1142 0)
(s1143 0)
(s1144 0)
(s1145 0)
(s1146 0)
(s1147 0)
(s1148 0)
(s1149 0)
(s1150 0)
(s1151 0)
(s1152 0)
(s1153 0)
(s1154 0)
(s1155 0)
(s1156 0)
(s1157 0)
(s1158 0)
(s1159 0)
(s1160 0)
(s1161 0)
(s1162 0)
(s1163 0)
(s1164 0)
(s1165 0)
(s1166 0)
(s1167 0)
(s1168 0)
(s1169 0)
(s1170 0)
(s1171 0)
(s1172 0)
(s1173 0)
(s1174 0)
(s1175 0)
(s1176 0)
(s1177 0)
(s1178 0)
(s1179 0)
(s1180 0)
(s1181 0)
(s1182 0)
(s1183 0)
(s1184 0)
(s1185 0)
(s1186 0)
(s1187 0)
(s1188 0)
(s1189 0)
(s1190 0)
(s1191 0)
(s1192 0)
(s1193 0)
(s1194 0)
(s1195 0)
(s1196 0)
(s1197 0)
(s1198 0)
(s1199 0)
(s1200 0)
(s1201 0)
(s1202 0)
(s1203 0)
(s1204 0)
(s1205 0)
(s1206 0)
(s1207 0)
(s1208 0)
(s1209 0)
(s1210 0)
(s1211 0)
(s1212 0)
(s1213 0)
(s1214 0)
(s1215 0)
(s1216 0)
(s1217 0)
(s1218 0)
(s1219 0)
(s1220 0)
(s1221 0)
(s1222 0)
(s1223 0)
(s1224 0)
(s1225 0)
(s1226 0)
(s1227 0)
(s1228 0)
(s1229 0)
(s1230 0)
(s1231 0)
(s1232 0)
(s1233 0)
(s1234 0)
(s1235 0)
(s1236 0)
(s1237 0)
(s1238 0)
(s1239 0)
(s1240 0)
(s1241 0)
(s1242 0)
(s1243 0)
(s1244 0)
(s1245 0)
(s1246 0)
(s1247 0)
(s1248 0)
(s1249 0)
(s1250 0)
(s1251 0)
(s1252 0)
(s1253 0)
(s1254 0)
(s1255 0)
(s1256 0)
(s1257 0)
(s1258 0)
(s1259 0)
(s1260 0)
(s1261 0)
(s1262 0)
(s1263 0)
(s1264 0)
(s1265 0)
(s1266 0)
(s1267 0)
(s1268 0)
(s1269 0)
(s1270 0)
(s1271 0)
(s1272 0)
(s1273 0)
(s1274 0)
(s1275 0)
(s1276 0)
(s1277 0)
(s1278 0)
(s1279 0)
(s1280 0)
(s1281 0)
(s1282 0)
(s1283 0)
(s1284 0)
(s1285 0)
(s1286 0)
(s1287 0)
(s1288 0)
(s1289 0)
(s1290 0)
(s1291 0)
(s1292 0)
(s1293 0)
(s1294 0)
(s1295 0)
(s1296 0)
(s1297 0)
(s1298 0)
(s1299 0)
(s1300 0)
(s1301 0)
(s1302 0)
(s1303 0)
(s1304 0)
(s1305 0)
(s1306 0)
(s1307 0)
(s1308 0)
(s1309 0)
(s1310 0)
(s1311 0)
(s1312 0)
(s1313 0)
(s1314 0)
(s1315 0)
(s1316 0)
(s1317 0)
(s1318 0)
(s1319 0)
(s1320 0)
(s1321 0)
(s1322 0)
(s1323 0)
(s1324 0)
(s1325 0)
(s1326 0)
(s1327 0)
(s1328 0)
(s1329 0)
(s1330 0)
(s1331 0)
(s1332 0)
(s1333 0)
(s1334 0)
(s1335 0)
(s1336 0)
(s1337 0)
(s1338 0)
(s1339 0)
(s1340 0)
(s1341 0)
(s1342 0)
(s1343 0)
(s1344 0)
(s1345 0)
(s1346 0)
(s1347 0)
(s1348 0)
(s1349 0)
(s1350 0)
(s1351 0)
(s1352 0)
(s1353 0)
(s1354 0)
(s1355 0)
(s1356 0)
(s1357 0)
(s1358 0)
(s1359 0)
(s1360 0)
(s1361 0)
(s1362 0)
(s1363 0)
(s1364 0)
(s1365 0)
(s1366 0)
(s1367 0)
(s1368 0)
(s1369 0)
(s1370 0)
(s1371 0)
(s1372 0)
(s1373 0)
(s1374 0)
(s1375 0)
(s1376 0)
(s1377 0)
(s1378 0)
(s1379 0)
(s1380 0)
(s1381 0)
(s1382 0)
(s1383 0)
(s1384 0)
(s1385 0)
(s1386 0)
(s1387 0)
(s1388 0)
(s1389 0)
(s1390 0)
(s1391 0)
(s1392 0)
(s1393 0)
(s1394 0)
(s1395 0)
(s1396 0)
(s1397 0)
(s1398 0)
(s1399 0)
(s1400 0)
(s1401 0)
(s1402 0)
(s1403 0)
(s1404 0)
(s1405 0)
(s1406 0)
(s1407 0)
(s1408 0)
(s1409 0)
(s1410 0)
(s1411 0)
(s1412 0)
(s1413 0)
(s1414 0)
(s1415 0)
(s1416 0)
(s1417 0)
(s1418 0)
(s1419 0)
(s1420 0)
(s1421 0)
(s1422 0)
(s1423 0)
(s1424 0)
(s1425 0)
(s1426 0)
(s1427 0)
(s1428 0)
(s1429 0)
(s1430 0)
(s1431 0)
(s1432 0)
(s1433 0)
(s1434 0)
(s1435 0)
(s1436 0)
(s1437 0)
(s1438 0)
(s1439 0)
(s1440 0)
(s1441 0)
(s1442 0)
(s1443 0)
(s1444 0)
(s1445 0)
(s1446 0)
(s1447 0)
(s1448 0)
(s1449 0)
(s1450 0)
(s1451 0)
(s1452 0)
(s1453 0)
(s1454 0)
(s1455 0)
(s1456 0)
(s1457 0)
(s1458 0)
(s1459 0)
(s1460 0)
(s1461 0)
(s1462 0)
(s1463 0)
(s1464 0)
(s1465 0)
(s1466 0)
(s1467 0)
(s1468 0)
(s1469 0)
(s1470 0)
(s1471 0)
(s1472 0)
(s1473 0)
(s1474 0)
(s1475 0)
(s1476 0)
(s1477 0)
(s1478 0)
(s1479 0)
(s1480 0)
(s1481 0)
(s1482 0)
(s1483 0)
(s1484 0)
(s1485 0)
(s1486 0)
(s1487 0)
(s1488 0)
(s1489 0)
(s1490 0)
(s1491 0)
(s1492 0)
(s1493 0)
(s1494 0)
(s1495 0)
(s1496 0)
(s1497 0)
(s1498 0)
(s1499 0)
(s1500 0)
(s1501 0)
(s1502 0)
(s1503 0)
(s1504 0)
(s1505 0)
(s1506 0)
(s1507 0)
(s1508 0)
(s1509 0)
(s1510 0)
(s1511 0)
(s1512 0)
(s1513 0)
(s1514 0)
(s1515 0)
(s1516 0)
(s1517 0)
(s1518 0)
(s1519 0)
(s1520 0)
(s1521 0)
(s1522 0)
(s1523 0)
(s1524 0)
(s1525 0)
(s1526 0)
(s1527 0)
(s1528 0)
(s1529 0)
(s1530 0)
(s1531 0)
(s1532 0)
(s1533 0)
(s1534 0)
(s1535 0)
(s1536 0)
(s1537 0)
(s1538 0)
(s1539 0)
(s1540 0)
(s1541 0)
(s1542 0)
(s1543 0)
(s1544 0)
(s1545 0)
(s1546 0)
(s1547 0)
(s1548 0)
(s1549 0)
(s1550 0)
(s1551 0)
(s1552 0)
(s1553 0)
(s1554 0)
(s1555 0)
(s1556 0)
(s1557 0)
(s1558 0)
(s1559 0)
(s1560 0)
(s1561 0)
(s1562 0)
(s1563 0)
(s1564 0)
(s1565 0)
(s1566 0)
(s1567 0)
(s1568 0)
(s1569 0)
(s1570 0)
(s1571 0)
(s1572 0)
(s1573 0)
(s1574 0)
(s1575 0)
(s1576 0)
(s1577 0)
(s1578 0)
(s1579 0)
(s1580 0)
(s1581 0)
(s1582 0)
(s1583 0)
(s1584 0)
(s1585 0)
(s1586 0)
(s1587 0)
(s1588 0)
(s1589 0)
(s1590 0)
(s1591 0)
(s1592 0)
(s1593 0)
(s1594 0)
(s1595 0)
(s1596 0)
(s1597 0)
(s1598 0)
(s1599 0)
(s1600 0)
(s1601 0)
(s1602 0)
(s1603 0)
(s1604 0)
(s1605 0)
(s1606 0)
(s1607 0)
(s1608 0)
(s1609 0)
(s1610 0)
(s1611 0)
(s1612 0)
(s1613 0)
(s1614 0)
(s1615 0)
(s1616 0)
(s1617 0)
(s1618 0)
(s1619 0)
(s1620 0)
(s1621 0)
(s1622 0)
(s1623 0)
(s1624 0)
(s1625 0)
(s1626 0)
(s1627 0)
(s1628 0)
(s1629 0)
(s1630 0)
(s1631 0)
(s1632 0)
(s1633 0)
(s1634 2)
(s1635 2)
(s1636 2)
(s1637 2)
(s1638 2)
(s1639 2)
(s1640 2)
(s1641 2)
(s1642 2)
(s1643 2)
(s1644 2)
(s1645 2)
(s1646 2)
(s1647 2)
(s1648 2)
(s1649 2)
(s1650 2)
(s1651 2)
(s1652 2)
(s1653 2)
(s1654 2)
(s1655 2)
(s1656 2)
(s1657 0)
(s1658 0)
(s1659 0)
(s1660 0)
(s1661 0)
(s1662 0)
(s1663 0)
(s1664 0)
(s1665 0)
(s1666 0)
(s1667 0)
(s1668 0)
(s1669 0)
(s1670 0)
(s1671 0)
(s1672 0)
(s1673 0)
(s1674 0)
(s1675 0)
(s1676 0)
(s1677 0)
(s1678 0)
(s1679 0)
(s1680 2)
(s1681 2)
(s1682 2)
(s1683 2)
(s1684 2)
(s1685 2)
(s1686 2)
(s1687 2)
(s1688 2)
(s1689 2)
(s1690 2)
(s1691 2)
(s1692 2)
(s1693 2)
(s1694 2)
(s1695 2)
(s1696 2)
(s1697 2)
(s1698 2)
(s1699 2)
(s1700 2)
(s1701 2)
(s1702 2)
(s1703 0)
(s1704 0)
(s1705 0)
(s1706 0)
(s1707 0)
(s1708 0)
(s1709 0)
(s1710 0)
(s1711 0)
(s1712 0)
(s1713 0)
(s1714 0)
(s1715 0)
(s1716 0)
(s1717 0)
(s1718 0)
(s1719 0)
(s1720 0)
(s1721 0)
(s1722 0)
(s1723 0)
(s1724 0)
(s1725 0)
(s1726 1)
(s1727 1)
(s1728 1)
(s1729 1)
(s1730 1)
(s1731 1)
(s1732 1)
(s1733 1)
(s1734 1)
(s1735 1)
(s1736 1)
(s1737 1)
(s1738 1)
(s1739 1)
(s1740 1)
(s1741 1)
(s1742 1)
(s1743 1)
(s1744 1)
(s1745 timeout
1)
(s1746 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2244/2247 variables, and 3759 constraints, problems are : Problem set: 2 solved, 329 unsolved in 30057 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1890/1892 constraints, PredecessorRefiner: 329/331 constraints, Known Traps: 0/0 constraints]
After SMT, in 60521ms problems are : Problem set: 2 solved, 329 unsolved
Search for dead transitions found 2 dead transitions in 60526ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1892/1916 places, 353/356 transitions.
Graph (complete) has 15758 edges and 1892 vertex of which 1891 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 54 ms. Remains 1891 /1892 variables (removed 1) and now considering 353/353 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1891/1916 places, 353/356 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60868 ms. Remains : 1891/1916 places, 353/356 transitions.
Built C files in :
/tmp/ltsmin10586187833826493973
[2024-05-25 17:45:29] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10586187833826493973
Running compilation step : cd /tmp/ltsmin10586187833826493973;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1810 ms.
Running link step : cd /tmp/ltsmin10586187833826493973;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin10586187833826493973;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17717218091274883976.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 44 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-25 17:45:44] [INFO ] Computed 1562 invariants in 31 ms
[2024-05-25 17:45:46] [INFO ] Implicit Places using invariants in 1688 ms returned []
[2024-05-25 17:45:46] [INFO ] Invariant cache hit.
[2024-05-25 17:45:51] [INFO ] Implicit Places using invariants and state equation in 5312 ms returned []
Implicit Place search using SMT with State Equation took 7003 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 17:45:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2271/2272 variables, and 3477 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 332/3809 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2271/2272 variables, and 3809 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60402ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60406ms
Finished structural reductions in LTL mode , in 1 iterations and 67462 ms. Remains : 1916/1916 places, 356/356 transitions.
Built C files in :
/tmp/ltsmin17657350345202123117
[2024-05-25 17:46:52] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17657350345202123117
Running compilation step : cd /tmp/ltsmin17657350345202123117;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1505 ms.
Running link step : cd /tmp/ltsmin17657350345202123117;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin17657350345202123117;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7283542234645906102.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 17:47:07] [INFO ] Flatten gal took : 62 ms
[2024-05-25 17:47:07] [INFO ] Flatten gal took : 64 ms
[2024-05-25 17:47:07] [INFO ] Time to serialize gal into /tmp/LTL12814563545003550071.gal : 14 ms
[2024-05-25 17:47:07] [INFO ] Time to serialize properties into /tmp/LTL10509393616671419127.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12814563545003550071.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11948152643046197628.hoa' '-atoms' '/tmp/LTL10509393616671419127.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10509393616671419127.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11948152643046197628.hoa
Detected timeout of ITS tools.
[2024-05-25 17:47:22] [INFO ] Flatten gal took : 54 ms
[2024-05-25 17:47:22] [INFO ] Flatten gal took : 53 ms
[2024-05-25 17:47:22] [INFO ] Time to serialize gal into /tmp/LTL3605963575522969753.gal : 9 ms
[2024-05-25 17:47:22] [INFO ] Time to serialize properties into /tmp/LTL2251261301559785590.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3605963575522969753.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2251261301559785590.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G(("(((((((n1_16<1)||(Sstart_16<1))&&((n1_8<1)||(Sstart_8<1)))&&(((n1_21<1)||(Sstart_21<1))&&((n1_10<1)||(Sstart_10<1))))&&((((n1_...8404
Formula 0 simplified : F(!"(((((((n1_16<1)||(Sstart_16<1))&&((n1_8<1)||(Sstart_8<1)))&&(((n1_21<1)||(Sstart_21<1))&&((n1_10<1)||(Sstart_10<1))))&&((((n1_14...8390
Detected timeout of ITS tools.
[2024-05-25 17:47:37] [INFO ] Flatten gal took : 47 ms
[2024-05-25 17:47:37] [INFO ] Applying decomposition
[2024-05-25 17:47:37] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11724709637156170199.txt' '-o' '/tmp/graph11724709637156170199.bin' '-w' '/tmp/graph11724709637156170199.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11724709637156170199.bin' '-l' '-1' '-v' '-w' '/tmp/graph11724709637156170199.weights' '-q' '0' '-e' '0.001'
[2024-05-25 17:47:38] [INFO ] Decomposing Gal with order
[2024-05-25 17:47:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:47:38] [INFO ] Removed a total of 229 redundant transitions.
[2024-05-25 17:47:38] [INFO ] Flatten gal took : 317 ms
[2024-05-25 17:47:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 83 ms.
[2024-05-25 17:47:38] [INFO ] Time to serialize gal into /tmp/LTL14303200637675165141.gal : 21 ms
[2024-05-25 17:47:38] [INFO ] Time to serialize properties into /tmp/LTL3253237231437529708.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14303200637675165141.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3253237231437529708.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G(("(((((((i2.i1.u65.n1_16<1)||(i2.i1.u65.Sstart_16<1))&&((i11.u59.n1_8<1)||(i11.u101.Sstart_8<1)))&&(((i15.u68.n1_21<1)||(i15.u10...14848
Formula 0 simplified : F(!"(((((((i2.i1.u65.n1_16<1)||(i2.i1.u65.Sstart_16<1))&&((i11.u59.n1_8<1)||(i11.u101.Sstart_8<1)))&&(((i15.u68.n1_21<1)||(i15.u107....14834
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-11 finished in 365965 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(!p1)||X(!p2))))'
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 36 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-25 17:47:53] [INFO ] Invariant cache hit.
[2024-05-25 17:47:55] [INFO ] Implicit Places using invariants in 1805 ms returned []
[2024-05-25 17:47:55] [INFO ] Invariant cache hit.
[2024-05-25 17:48:01] [INFO ] Implicit Places using invariants and state equation in 5630 ms returned []
Implicit Place search using SMT with State Equation took 7441 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 17:48:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 13.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.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 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)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2271/2272 variables, and 3477 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 332/3809 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2271/2272 variables, and 3809 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60400ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60405ms
Finished structural reductions in LTL mode , in 1 iterations and 67884 ms. Remains : 1916/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (AND p1 p2)), (NOT p0), (NOT p0), (AND p1 p2), p1]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-12
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-12 finished in 68066 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))'
Support contains 1 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 70 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-25 17:49:01] [INFO ] Invariant cache hit.
[2024-05-25 17:49:03] [INFO ] Implicit Places using invariants in 2047 ms returned []
[2024-05-25 17:49:03] [INFO ] Invariant cache hit.
[2024-05-25 17:49:09] [INFO ] Implicit Places using invariants and state equation in 5845 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 7895 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 62 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8029 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-13
Entered a terminal (fully accepting) state of product in 7 steps with 3 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-13 finished in 8123 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&&X(G(p1)))))))'
Support contains 24 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 65 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-25 17:49:10] [INFO ] Invariant cache hit.
[2024-05-25 17:49:12] [INFO ] Implicit Places using invariants in 2071 ms returned []
[2024-05-25 17:49:12] [INFO ] Invariant cache hit.
[2024-05-25 17:49:18] [INFO ] Implicit Places using invariants and state equation in 6058 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 8132 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 64 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8264 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-14
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-14 finished in 8415 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||(G(p0) U (X(G(!p2))||p1)))))'
Support contains 48 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 65 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-25 17:49:18] [INFO ] Invariant cache hit.
[2024-05-25 17:49:20] [INFO ] Implicit Places using invariants in 2041 ms returned []
[2024-05-25 17:49:20] [INFO ] Invariant cache hit.
[2024-05-25 17:49:24] [INFO ] Implicit Places using invariants and state equation in 3537 ms returned [1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5583 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 63 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5712 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), p2]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-15
Product exploration explored 100000 steps with 31781 reset in 469 ms.
Product exploration explored 100000 steps with 31551 reset in 502 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 274 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
RANDOM walk for 40000 steps (1482 resets) in 361 ms. (110 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (66 resets) in 136 ms. (292 steps per ms) remains 1/1 properties
// Phase 1: matrix 356 rows 1893 cols
[2024-05-25 17:49:26] [INFO ] Computed 1540 invariants in 112 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 207/231 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1334/1565 variables, 1196/1220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1565 variables, 968/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1565 variables, 0/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 529/2094 variables, 506/2694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2094 variables, 529/3223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2094 variables, 0/3223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 144/2238 variables, 138/3361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2238 variables, 66/3427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2238 variables, 0/3427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/2249 variables, 6/3433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2249 variables, 0/3433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2249 variables, 0/3433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2249/2249 variables, and 3433 constraints, problems are : Problem set: 0 solved, 1 unsolved in 825 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1893/1893 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/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 207/231 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1334/1565 variables, 1196/1220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1565 variables, 968/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1565 variables, 1/2189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1565 variables, 0/2189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 529/2094 variables, 506/2695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2094 variables, 529/3224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2094 variables, 0/3224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 144/2238 variables, 138/3362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2238 variables, 66/3428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2238 variables, 0/3428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/2249 variables, 6/3434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2249 variables, 0/3434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2249 variables, 0/3434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2249/2249 variables, and 3434 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1299 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1893/1893 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2259ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 301 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
Support contains 25 out of 1893 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 69 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-25 17:49:28] [INFO ] Invariant cache hit.
[2024-05-25 17:49:30] [INFO ] Implicit Places using invariants in 1992 ms returned []
[2024-05-25 17:49:30] [INFO ] Invariant cache hit.
[2024-05-25 17:49:34] [INFO ] Implicit Places using invariants and state equation in 3556 ms returned []
Implicit Place search using SMT with State Equation took 5550 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 17:49:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2248 variables, 1892/3432 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2248/2249 variables, and 3432 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1892/1893 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2248 variables, 1892/3432 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2248 variables, 332/3764 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2248/2249 variables, and 3764 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1892/1893 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60424ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60433ms
Finished structural reductions in LTL mode , in 1 iterations and 66055 ms. Remains : 1893/1893 places, 356/356 transitions.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2)), (X (X (NOT p2))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
RANDOM walk for 40000 steps (1487 resets) in 185 ms. (215 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (74 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
[2024-05-25 17:50:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 207/231 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1334/1565 variables, 1196/1220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1565 variables, 968/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1565 variables, 0/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 529/2094 variables, 506/2694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2094 variables, 529/3223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2094 variables, 0/3223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 144/2238 variables, 138/3361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2238 variables, 66/3427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2238 variables, 0/3427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/2249 variables, 6/3433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2249 variables, 0/3433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2249 variables, 0/3433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2249/2249 variables, and 3433 constraints, problems are : Problem set: 0 solved, 1 unsolved in 795 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1893/1893 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/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 207/231 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1334/1565 variables, 1196/1220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1565 variables, 968/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1565 variables, 1/2189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1565 variables, 0/2189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 529/2094 variables, 506/2695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2094 variables, 529/3224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2094 variables, 0/3224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 144/2238 variables, 138/3362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2238 variables, 66/3428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2238 variables, 0/3428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/2249 variables, 6/3434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2249 variables, 0/3434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2249 variables, 0/3434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2249/2249 variables, and 3434 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1252 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1893/1893 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2069ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND p0 (NOT p2)), (X (X (NOT p2))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F p2), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 186 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 104 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 112 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
Product exploration explored 100000 steps with 31559 reset in 473 ms.
Product exploration explored 100000 steps with 31491 reset in 470 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 113 ms :[true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2]
Support contains 25 out of 1893 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Graph (complete) has 14725 edges and 1893 vertex of which 1869 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.4 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1869 transition count 356
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 144 ms. Remains 1869 /1893 variables (removed 24) and now considering 356/356 (removed 0) transitions.
[2024-05-25 17:50:39] [INFO ] Redundant transitions in 41 ms returned []
Running 332 sub problems to find dead transitions.
// Phase 1: matrix 356 rows 1869 cols
[2024-05-25 17:50:39] [INFO ] Computed 1518 invariants in 164 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1868 variables, 1518/1518 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1868 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
At refinement iteration 2 (OVERLAPS) 356/2224 variables, 1868/3386 constraints. Problems are: Problem set: 4 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2224/2225 variables, and 3386 constraints, problems are : Problem set: 4 solved, 328 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1868/1869 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1866 variables, 1518/1518 constraints. Problems are: Problem set: 4 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1866 variables, 0/1518 constraints. Problems are: Problem set: 4 solved, 328 unsolved
At refinement iteration 2 (OVERLAPS) 354/2220 variables, 1866/3384 constraints. Problems are: Problem set: 4 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2220 variables, 328/3712 constraints. Problems are: Problem set: 4 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2220/2225 variables, and 3712 constraints, problems are : Problem set: 4 solved, 328 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1866/1869 constraints, PredecessorRefiner: 328/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60596ms problems are : Problem set: 4 solved, 328 unsolved
Search for dead transitions found 4 dead transitions in 60600ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1869/1893 places, 352/356 transitions.
Graph (complete) has 15711 edges and 1869 vertex of which 1867 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 74 ms. Remains 1867 /1869 variables (removed 2) and now considering 352/352 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1867/1893 places, 352/356 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60867 ms. Remains : 1867/1893 places, 352/356 transitions.
Built C files in :
/tmp/ltsmin17214878540293317261
[2024-05-25 17:51:40] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17214878540293317261
Running compilation step : cd /tmp/ltsmin17214878540293317261;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1469 ms.
Running link step : cd /tmp/ltsmin17214878540293317261;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17214878540293317261;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7223611842823161907.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 25 out of 1893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 71 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1893 cols
[2024-05-25 17:51:55] [INFO ] Computed 1540 invariants in 102 ms
[2024-05-25 17:51:57] [INFO ] Implicit Places using invariants in 2161 ms returned []
[2024-05-25 17:51:57] [INFO ] Invariant cache hit.
[2024-05-25 17:52:01] [INFO ] Implicit Places using invariants and state equation in 3646 ms returned []
Implicit Place search using SMT with State Equation took 5812 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 17:52:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2248 variables, 1892/3432 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 13.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.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 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)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2248/2249 variables, and 3432 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1892/1893 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2248 variables, 1892/3432 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2248 variables, 332/3764 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2248/2249 variables, and 3764 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1892/1893 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60431ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60437ms
Finished structural reductions in LTL mode , in 1 iterations and 66322 ms. Remains : 1893/1893 places, 356/356 transitions.
Built C files in :
/tmp/ltsmin218696834735586009
[2024-05-25 17:53:01] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin218696834735586009
Running compilation step : cd /tmp/ltsmin218696834735586009;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1453 ms.
Running link step : cd /tmp/ltsmin218696834735586009;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin218696834735586009;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14440351756810924071.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 17:53:16] [INFO ] Flatten gal took : 41 ms
[2024-05-25 17:53:16] [INFO ] Flatten gal took : 39 ms
[2024-05-25 17:53:16] [INFO ] Time to serialize gal into /tmp/LTL11401075786160898566.gal : 5 ms
[2024-05-25 17:53:16] [INFO ] Time to serialize properties into /tmp/LTL17320253140586416187.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11401075786160898566.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1107991657346802484.hoa' '-atoms' '/tmp/LTL17320253140586416187.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17320253140586416187.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1107991657346802484.hoa
Detected timeout of ITS tools.
[2024-05-25 17:53:32] [INFO ] Flatten gal took : 38 ms
[2024-05-25 17:53:32] [INFO ] Flatten gal took : 37 ms
[2024-05-25 17:53:32] [INFO ] Time to serialize gal into /tmp/LTL6132303568021812985.gal : 5 ms
[2024-05-25 17:53:32] [INFO ] Time to serialize properties into /tmp/LTL15966402072259227308.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6132303568021812985.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15966402072259227308.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(("(Astart>=1)")||((G("(Astart>=1)"))U(("((((((malicious_reservoir>=1)&&(c1_13>=1))||((malicious_reservoir>=1)&&(c1_14>=1)))||(((m...2004
Formula 0 simplified : X(!"(Astart>=1)" & (F!"(Astart>=1)" R (!"((((((malicious_reservoir>=1)&&(c1_13>=1))||((malicious_reservoir>=1)&&(c1_14>=1)))||(((mal...1985
Detected timeout of ITS tools.
[2024-05-25 17:53:47] [INFO ] Flatten gal took : 39 ms
[2024-05-25 17:53:47] [INFO ] Applying decomposition
[2024-05-25 17:53:47] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14200494420002049280.txt' '-o' '/tmp/graph14200494420002049280.bin' '-w' '/tmp/graph14200494420002049280.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14200494420002049280.bin' '-l' '-1' '-v' '-w' '/tmp/graph14200494420002049280.weights' '-q' '0' '-e' '0.001'
[2024-05-25 17:53:47] [INFO ] Decomposing Gal with order
[2024-05-25 17:53:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:53:47] [INFO ] Removed a total of 229 redundant transitions.
[2024-05-25 17:53:47] [INFO ] Flatten gal took : 99 ms
[2024-05-25 17:53:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 31 ms.
[2024-05-25 17:53:47] [INFO ] Time to serialize gal into /tmp/LTL17618507206504777996.gal : 14 ms
[2024-05-25 17:53:47] [INFO ] Time to serialize properties into /tmp/LTL18109146390155567826.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17618507206504777996.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18109146390155567826.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(("(i8.i2.u134.Astart>=1)")||((G("(i8.i2.u134.Astart>=1)"))U(("((((((u0.malicious_reservoir>=1)&&(i4.i1.u5.c1_13>=1))||((u0.malici...2510
Formula 0 simplified : X(!"(i8.i2.u134.Astart>=1)" & (F!"(i8.i2.u134.Astart>=1)" R (!"((((((u0.malicious_reservoir>=1)&&(i4.i1.u5.c1_13>=1))||((u0.maliciou...2491
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-15 finished in 284299 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((!p0||G(!p1)))&&X(X(G(!p2)))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-22-LTLFireability-11
Stuttering acceptance computed with spot in 175 ms :[true, (OR p2 p1), (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Support contains 599 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1892 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.9 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1891 transition count 353
Applied a total of 3 rules in 88 ms. Remains 1891 /1916 variables (removed 25) and now considering 353/356 (removed 3) transitions.
// Phase 1: matrix 353 rows 1891 cols
[2024-05-25 17:54:03] [INFO ] Computed 1540 invariants in 19 ms
[2024-05-25 17:54:04] [INFO ] Implicit Places using invariants in 1699 ms returned []
[2024-05-25 17:54:04] [INFO ] Invariant cache hit.
[2024-05-25 17:54:09] [INFO ] Implicit Places using invariants and state equation in 5125 ms returned []
Implicit Place search using SMT with State Equation took 6826 ms to find 0 implicit places.
Running 329 sub problems to find dead transitions.
[2024-05-25 17:54:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1890 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1890 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 353/2243 variables, 1890/3430 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2243/2244 variables, and 3430 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1890/1891 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1890 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1890 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 353/2243 variables, 1890/3430 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2243 variables, 329/3759 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2243/2244 variables, and 3759 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1890/1891 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints]
After SMT, in 60426ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 60430ms
Starting structural reductions in LI_LTL mode, iteration 1 : 1891/1916 places, 353/356 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 67346 ms. Remains : 1891/1916 places, 353/356 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLFireability-11
Product exploration explored 100000 steps with 3715 reset in 489 ms.
Product exploration explored 100000 steps with 3718 reset in 516 ms.
Computed a total of 1891 stabilizing places and 353 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1891 transition count 353
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR p1 p2)))), (X (X (NOT (OR (AND p0 p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 11 factoid took 866 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (1484 resets) in 601 ms. (66 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (90 resets) in 664 ms. (60 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (83 resets) in 649 ms. (61 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (48 resets) in 699 ms. (57 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (86 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
[2024-05-25 17:55:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 552/1151 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1151 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 121/1272 variables, 1151/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1272 variables, 0/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 420/1692 variables, 188/2373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1692 variables, 22/2395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1692 variables, 0/2395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 552/2244 variables, 552/2947 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2244 variables, 484/3431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2244 variables, 0/3431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/2244 variables, 0/3431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2244/2244 variables, and 3431 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2435 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1891/1891 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 552/1151 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1151 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 121/1272 variables, 1151/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1272 variables, 0/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 420/1692 variables, 188/2373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1692 variables, 22/2395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1692 variables, 4/2399 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1692 variables, 0/2399 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 552/2244 variables, 552/2951 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2244 variables, 484/3435 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2244 variables, 0/3435 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/2244 variables, 0/3435 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2244/2244 variables, and 3435 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4801 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1891/1891 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 7298ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 2 properties in 82 ms.
Support contains 599 out of 1891 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1891/1891 places, 353/353 transitions.
Graph (complete) has 15758 edges and 1891 vertex of which 764 are kept as prefixes of interest. Removing 1127 places using SCC suffix rule.2 ms
Discarding 1127 places :
Also discarding 69 output transitions
Drop transitions (Output transitions of discarded places.) removed 69 transitions
Drop transitions (Empty/Sink Transition effects.) removed 141 transitions
Reduce isomorphic transitions removed 141 transitions.
Discarding 46 places :
Implicit places reduction removed 46 places
Iterating post reduction 0 with 187 rules applied. Total rules applied 188 place count 718 transition count 143
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 46 Pre rules applied. Total rules applied 188 place count 718 transition count 97
Deduced a syphon composed of 46 places in 1 ms
Ensure Unique test removed 23 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 1 with 115 rules applied. Total rules applied 303 place count 649 transition count 97
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 303 place count 649 transition count 96
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 305 place count 648 transition count 96
Applied a total of 305 rules in 22 ms. Remains 648 /1891 variables (removed 1243) and now considering 96/353 (removed 257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 648/1891 places, 96/353 transitions.
RANDOM walk for 40000 steps (1600 resets) in 739 ms. (54 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (97 resets) in 594 ms. (67 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (64 resets) in 678 ms. (58 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 902 steps, run visited all 2 properties in 15 ms. (steps per millisecond=60 )
Probabilistic random walk after 902 steps, saw 856 distinct states, run finished after 15 ms. (steps per millisecond=60 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR p1 p2)))), (X (X (NOT (OR (AND p0 p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (OR (NOT p0) (NOT p1)) (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2))), (F p0), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p1)]
Knowledge based reduction with 11 factoid took 1431 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Stuttering acceptance computed with spot in 329 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Support contains 599 out of 1891 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1891/1891 places, 353/353 transitions.
Applied a total of 0 rules in 40 ms. Remains 1891 /1891 variables (removed 0) and now considering 353/353 (removed 0) transitions.
[2024-05-25 17:55:23] [INFO ] Invariant cache hit.
[2024-05-25 17:55:25] [INFO ] Implicit Places using invariants in 1741 ms returned []
[2024-05-25 17:55:25] [INFO ] Invariant cache hit.
[2024-05-25 17:55:30] [INFO ] Implicit Places using invariants and state equation in 5222 ms returned []
Implicit Place search using SMT with State Equation took 6968 ms to find 0 implicit places.
Running 329 sub problems to find dead transitions.
[2024-05-25 17:55:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1890 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1890 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 353/2243 variables, 1890/3430 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2243/2244 variables, and 3430 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1890/1891 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1890 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1890 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 353/2243 variables, 1890/3430 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2243 variables, 329/3759 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2243/2244 variables, and 3759 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1890/1891 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints]
After SMT, in 60463ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 60468ms
Finished structural reductions in LTL mode , in 1 iterations and 67478 ms. Remains : 1891/1891 places, 353/353 transitions.
Computed a total of 1891 stabilizing places and 353 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1891 transition count 353
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT p2))), (X (X (NOT (OR p1 p2)))), (X (X (NOT (OR (AND p0 p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 9 factoid took 561 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (1484 resets) in 1552 ms. (25 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (83 resets) in 752 ms. (53 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (49 resets) in 875 ms. (45 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (82 resets) in 791 ms. (50 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (90 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
[2024-05-25 17:56:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 552/1151 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1151 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 121/1272 variables, 1151/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1272 variables, 0/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 420/1692 variables, 188/2373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1692 variables, 22/2395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1692 variables, 0/2395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 552/2244 variables, 552/2947 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2244 variables, 484/3431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2244 variables, 0/3431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/2244 variables, 0/3431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2244/2244 variables, and 3431 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2339 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1891/1891 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 506/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 552/1151 variables, 528/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1151 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 121/1272 variables, 1151/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1272 variables, 0/2185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 420/1692 variables, 188/2373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1692 variables, 22/2395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1692 variables, 4/2399 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1692 variables, 0/2399 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 552/2244 variables, 552/2951 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2244/2244 variables, and 3435 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5010 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1891/1891 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 7435ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 599 out of 1891 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1891/1891 places, 353/353 transitions.
Graph (complete) has 15758 edges and 1891 vertex of which 764 are kept as prefixes of interest. Removing 1127 places using SCC suffix rule.1 ms
Discarding 1127 places :
Also discarding 69 output transitions
Drop transitions (Output transitions of discarded places.) removed 69 transitions
Drop transitions (Empty/Sink Transition effects.) removed 141 transitions
Reduce isomorphic transitions removed 141 transitions.
Discarding 46 places :
Implicit places reduction removed 46 places
Iterating post reduction 0 with 187 rules applied. Total rules applied 188 place count 718 transition count 143
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 46 Pre rules applied. Total rules applied 188 place count 718 transition count 97
Deduced a syphon composed of 46 places in 1 ms
Ensure Unique test removed 23 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 1 with 115 rules applied. Total rules applied 303 place count 649 transition count 97
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 303 place count 649 transition count 96
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 305 place count 648 transition count 96
Applied a total of 305 rules in 29 ms. Remains 648 /1891 variables (removed 1243) and now considering 96/353 (removed 257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 648/1891 places, 96/353 transitions.
RANDOM walk for 40000 steps (1600 resets) in 1098 ms. (36 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (98 resets) in 743 ms. (53 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (64 resets) in 727 ms. (54 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (100 resets) in 650 ms. (61 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (101 resets) in 136 ms. (292 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 902 steps, run visited all 4 properties in 23 ms. (steps per millisecond=39 )
Probabilistic random walk after 902 steps, saw 856 distinct states, run finished after 23 ms. (steps per millisecond=39 ) properties seen :4
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT p2))), (X (X (NOT (OR p1 p2)))), (X (X (NOT (OR (AND p0 p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (AND (OR (NOT p1) (NOT p0)) (NOT p2)))), (F p1)]
Knowledge based reduction with 9 factoid took 1013 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Stuttering acceptance computed with spot in 172 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Stuttering acceptance computed with spot in 154 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Product exploration explored 100000 steps with 3713 reset in 482 ms.
Product exploration explored 100000 steps with 3715 reset in 509 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 165 ms :[true, (OR p2 p1), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (OR p2 (AND p0 p1))]
Support contains 599 out of 1891 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1891/1891 places, 353/353 transitions.
Applied a total of 0 rules in 57 ms. Remains 1891 /1891 variables (removed 0) and now considering 353/353 (removed 0) transitions.
[2024-05-25 17:56:44] [INFO ] Redundant transitions in 20 ms returned []
Running 329 sub problems to find dead transitions.
[2024-05-25 17:56:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1890 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1890 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 353/2243 variables, 1890/3430 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2243/2244 variables, and 3430 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1890/1891 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1890 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1890 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 353/2243 variables, 1890/3430 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2243 variables, 329/3759 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2243/2244 variables, and 3759 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1890/1891 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints]
After SMT, in 60396ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 60400ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60494 ms. Remains : 1891/1891 places, 353/353 transitions.
Built C files in :
/tmp/ltsmin1957274087719323845
[2024-05-25 17:57:44] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1957274087719323845
Running compilation step : cd /tmp/ltsmin1957274087719323845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1535 ms.
Running link step : cd /tmp/ltsmin1957274087719323845;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1957274087719323845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8287246924255800965.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 599 out of 1891 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1891/1891 places, 353/353 transitions.
Applied a total of 0 rules in 37 ms. Remains 1891 /1891 variables (removed 0) and now considering 353/353 (removed 0) transitions.
[2024-05-25 17:58:00] [INFO ] Invariant cache hit.
[2024-05-25 17:58:01] [INFO ] Implicit Places using invariants in 1749 ms returned []
[2024-05-25 17:58:01] [INFO ] Invariant cache hit.
[2024-05-25 17:58:07] [INFO ] Implicit Places using invariants and state equation in 5440 ms returned []
Implicit Place search using SMT with State Equation took 7195 ms to find 0 implicit places.
Running 329 sub problems to find dead transitions.
[2024-05-25 17:58:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1890 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1890 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 353/2243 variables, 1890/3430 constraints. Problems are: Problem set: 0 solved, 329 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 2243/2244 variables, and 3430 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1890/1891 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1890 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1890 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 353/2243 variables, 1890/3430 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2243 variables, 329/3759 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2243/2244 variables, and 3759 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1890/1891 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints]
After SMT, in 60420ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 60427ms
Finished structural reductions in LTL mode , in 1 iterations and 67661 ms. Remains : 1891/1891 places, 353/353 transitions.
Built C files in :
/tmp/ltsmin7202541796605250199
[2024-05-25 17:59:07] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7202541796605250199
Running compilation step : cd /tmp/ltsmin7202541796605250199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1528 ms.
Running link step : cd /tmp/ltsmin7202541796605250199;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7202541796605250199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4634340972038724952.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 17:59:22] [INFO ] Flatten gal took : 38 ms
[2024-05-25 17:59:22] [INFO ] Flatten gal took : 36 ms
[2024-05-25 17:59:22] [INFO ] Time to serialize gal into /tmp/LTL17133446438558229276.gal : 5 ms
[2024-05-25 17:59:22] [INFO ] Time to serialize properties into /tmp/LTL6649028390741733243.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17133446438558229276.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8227596404699214763.hoa' '-atoms' '/tmp/LTL6649028390741733243.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6649028390741733243.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8227596404699214763.hoa
Detected timeout of ITS tools.
[2024-05-25 17:59:38] [INFO ] Flatten gal took : 38 ms
[2024-05-25 17:59:38] [INFO ] Flatten gal took : 39 ms
[2024-05-25 17:59:38] [INFO ] Time to serialize gal into /tmp/LTL16310772676992013801.gal : 5 ms
[2024-05-25 17:59:38] [INFO ] Time to serialize properties into /tmp/LTL12110433384203179841.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16310772676992013801.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12110433384203179841.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G(("(((((((n1_16<1)||(Sstart_16<1))&&((n1_8<1)||(Sstart_8<1)))&&(((n1_21<1)||(Sstart_21<1))&&((n1_10<1)||(Sstart_10<1))))&&((((n1_...8404
Formula 0 simplified : F(!"(((((((n1_16<1)||(Sstart_16<1))&&((n1_8<1)||(Sstart_8<1)))&&(((n1_21<1)||(Sstart_21<1))&&((n1_10<1)||(Sstart_10<1))))&&((((n1_14...8390
Detected timeout of ITS tools.
[2024-05-25 17:59:53] [INFO ] Flatten gal took : 38 ms
[2024-05-25 17:59:53] [INFO ] Applying decomposition
[2024-05-25 17:59:53] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7246379073087719373.txt' '-o' '/tmp/graph7246379073087719373.bin' '-w' '/tmp/graph7246379073087719373.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7246379073087719373.bin' '-l' '-1' '-v' '-w' '/tmp/graph7246379073087719373.weights' '-q' '0' '-e' '0.001'
[2024-05-25 17:59:53] [INFO ] Decomposing Gal with order
[2024-05-25 17:59:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:59:53] [INFO ] Removed a total of 230 redundant transitions.
[2024-05-25 17:59:53] [INFO ] Flatten gal took : 102 ms
[2024-05-25 17:59:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 232 labels/synchronizations in 45 ms.
[2024-05-25 17:59:53] [INFO ] Time to serialize gal into /tmp/LTL6610769915335779658.gal : 13 ms
[2024-05-25 17:59:53] [INFO ] Time to serialize properties into /tmp/LTL6693654242549698823.ltl : 56 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6610769915335779658.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6693654242549698823.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((G(("(((((((i31.u41.n1_16<1)||(i31.u84.Sstart_16<1))&&((i38.u94.n1_8<1)||(i38.u78.Sstart_8<1)))&&(((i10.u46.n1_21<1)||(i10.u88.Ssta...13305
Formula 0 simplified : F(!"(((((((i31.u41.n1_16<1)||(i31.u84.Sstart_16<1))&&((i38.u94.n1_8<1)||(i38.u78.Sstart_8<1)))&&(((i10.u46.n1_21<1)||(i10.u88.Sstart...13291
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-22-LTLFireability-11 finished in 366078 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||(G(p0) U (X(G(!p2))||p1)))))'
[2024-05-25 18:00:08] [INFO ] Flatten gal took : 46 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8259132672970976534
[2024-05-25 18:00:08] [INFO ] Computing symmetric may disable matrix : 356 transitions.
[2024-05-25 18:00:08] [INFO ] Applying decomposition
[2024-05-25 18:00:08] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:00:08] [INFO ] Computing symmetric may enable matrix : 356 transitions.
[2024-05-25 18:00:08] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:00:09] [INFO ] Flatten gal took : 37 ms
[2024-05-25 18:00:09] [INFO ] Computing Do-Not-Accords matrix : 356 transitions.
[2024-05-25 18:00:09] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 18:00:09] [INFO ] Built C files in 127ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8259132672970976534
Running compilation step : cd /tmp/ltsmin8259132672970976534;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8488794693646701906.txt' '-o' '/tmp/graph8488794693646701906.bin' '-w' '/tmp/graph8488794693646701906.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8488794693646701906.bin' '-l' '-1' '-v' '-w' '/tmp/graph8488794693646701906.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:00:09] [INFO ] Decomposing Gal with order
[2024-05-25 18:00:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:00:09] [INFO ] Removed a total of 229 redundant transitions.
[2024-05-25 18:00:09] [INFO ] Flatten gal took : 124 ms
[2024-05-25 18:00:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 35 ms.
[2024-05-25 18:00:09] [INFO ] Time to serialize gal into /tmp/LTLFireability10471076165763124299.gal : 83 ms
[2024-05-25 18:00:09] [INFO ] Time to serialize properties into /tmp/LTLFireability8036593006918995912.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10471076165763124299.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8036593006918995912.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !(((G((!("(((((((i14.i0.u101.n1_16>=1)&&(i14.i0.u101.Sstart_16>=1))||((i5.u96.n1_8>=1)&&(i5.u96.Sstart_8>=1)))||(((i19.u67.n1_21>=1)&&...15255
Formula 0 simplified : F("(((((((i14.i0.u101.n1_16>=1)&&(i14.i0.u101.Sstart_16>=1))||((i5.u96.n1_8>=1)&&(i5.u96.Sstart_8>=1)))||(((i19.u67.n1_21>=1)&&(i19....15233
Compilation finished in 1926 ms.
Running link step : cd /tmp/ltsmin8259132672970976534;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8259132672970976534;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((!(LTLAPp0==true)||[](!(LTLAPp1==true))))&&X(X([](!(LTLAPp2==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.543: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.543: LTL layer: formula: ([]((!(LTLAPp0==true)||[](!(LTLAPp1==true))))&&X(X([](!(LTLAPp2==true)))))
pins2lts-mc-linux64( 6/ 8), 0.544: "([]((!(LTLAPp0==true)||[](!(LTLAPp1==true))))&&X(X([](!(LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.544: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.566: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.572: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.584: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.593: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.591: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.594: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.604: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.694: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 1.092: DFS-FIFO for weak LTL, using special progress label 363
pins2lts-mc-linux64( 0/ 8), 1.092: There are 364 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.092: State length is 1917, there are 372 groups
pins2lts-mc-linux64( 0/ 8), 1.092: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.092: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.092: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 1.092: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 3.771: ~1 levels ~960 states ~24296 transitions
pins2lts-mc-linux64( 5/ 8), 4.237: ~1 levels ~1920 states ~51160 transitions
pins2lts-mc-linux64( 3/ 8), 4.881: ~1 levels ~3840 states ~103536 transitions
pins2lts-mc-linux64( 0/ 8), 6.210: ~1 levels ~7680 states ~224296 transitions
pins2lts-mc-linux64( 0/ 8), 8.981: ~1 levels ~15360 states ~487000 transitions
pins2lts-mc-linux64( 3/ 8), 10.613: ~1 levels ~30720 states ~878272 transitions
pins2lts-mc-linux64( 3/ 8), 13.906: ~1 levels ~61440 states ~2067968 transitions
pins2lts-mc-linux64( 5/ 8), 19.671: ~1 levels ~122880 states ~4280152 transitions
pins2lts-mc-linux64( 5/ 8), 29.566: ~1 levels ~245760 states ~8002064 transitions
pins2lts-mc-linux64( 5/ 8), 51.048: ~1 levels ~491520 states ~16247616 transitions
pins2lts-mc-linux64( 1/ 8), 100.897: ~1 levels ~983040 states ~35702744 transitions
pins2lts-mc-linux64( 4/ 8), 101.972: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 102.287:
pins2lts-mc-linux64( 0/ 8), 102.287: mean standard work distribution: 4.0% (states) 0.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 102.287:
pins2lts-mc-linux64( 0/ 8), 102.287: Explored 946764 states 35734483 transitions, fanout: 37.744
pins2lts-mc-linux64( 0/ 8), 102.287: Total exploration time 101.190 sec (100.890 sec minimum, 101.058 sec on average)
pins2lts-mc-linux64( 0/ 8), 102.287: States per second: 9356, Transitions per second: 353142
pins2lts-mc-linux64( 0/ 8), 102.287:
pins2lts-mc-linux64( 0/ 8), 102.287: Progress states detected: 9102191
pins2lts-mc-linux64( 0/ 8), 102.287: Redundant explorations: -89.5988
pins2lts-mc-linux64( 0/ 8), 102.287:
pins2lts-mc-linux64( 0/ 8), 102.287: Queue width: 8B, total height: 9824299, memory: 74.95MB
pins2lts-mc-linux64( 0/ 8), 102.287: Tree memory: 325.4MB, 37.5 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 102.287: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 102.287: Stored 358 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 102.287: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 102.287: Est. total memory use: 400.4MB (~1099.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8259132672970976534;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((!(LTLAPp0==true)||[](!(LTLAPp1==true))))&&X(X([](!(LTLAPp2==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8259132672970976534;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((!(LTLAPp0==true)||[](!(LTLAPp1==true))))&&X(X([](!(LTLAPp2==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-25 18:08:53] [INFO ] Applying decomposition
[2024-05-25 18:08:53] [INFO ] Flatten gal took : 38 ms
[2024-05-25 18:08:53] [INFO ] Decomposing Gal with order
[2024-05-25 18:08:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:08:54] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to malicious_reservoir in partition [n6_0, n5_0, n4_0, n3_0, n2_0, n1_0, c1_0, Cstart_0, Sstart_0, s2_0, s3_0, s4_0, s5_0, s6_0],[n6_1, n5_1, n4_1, n3_1, n2_1, n1_1, c1_1, Cstart_1, Sstart_1, s2_1, s3_1, s4_1, s5_1, s6_1],[n6_2, n5_2, n4_2, n3_2, n2_2, n1_2, c1_2, Cstart_2, Sstart_2, s2_2, s3_2, s4_2, s5_2, s6_2],[n6_3, n5_3, n4_3, n3_3, n2_3, n1_3, c1_3, Cstart_3, Sstart_3, s2_3, s3_3, s4_3, s5_3, s6_3],[n6_4, n5_4, n4_4, n3_4, n2_4, n1_4, c1_4, Cstart_4, Sstart_4, s2_4, s3_4, s4_4, s5_4, s6_4],[n6_5, n5_5, n4_5, n3_5, n2_5, n1_5, c1_5, Cstart_5, Sstart_5, s2_5, s3_5, s4_5, s5_5, s6_5],[n6_6, n5_6, n4_6, n3_6, n2_6, n1_6, c1_6, Cstart_6, Sstart_6, s2_6, s3_6, s4_6, s5_6, s6_6],[n6_7, n5_7, n4_7, n3_7, n2_7, n1_7, c1_7, Cstart_7, Sstart_7, s2_7, s3_7, s4_7, s5_7, s6_7],[n6_8, n5_8, n4_8, n3_8, n2_8, n1_8, c1_8, Cstart_8, Sstart_8, s2_8, s3_8, s4_8, s5_8, s6_8],[n6_9, n5_9, n4_9, n3_9, n2_9, n1_9, c1_9, Cstart_9, Sstart_9, s2_9, s3_9, s4_9, s5_9, s6_9],[n6_10, n5_10, n4_10, n3_10, n2_10, n1_10, c1_10, Cstart_10, Sstart_10, s2_10, s3_10, s4_10, s5_10, s6_10],[n6_11, n5_11, n4_11, n3_11, n2_11, n1_11, c1_11, Cstart_11, Sstart_11, s2_11, s3_11, s4_11, s5_11, s6_11],[n6_12, n5_12, n4_12, n3_12, n2_12, n1_12, c1_12, Cstart_12, Sstart_12, s2_12, s3_12, s4_12, s5_12, s6_12],[n6_13, n5_13, n4_13, n3_13, n2_13, n1_13, c1_13, Cstart_13, Sstart_13, s2_13, s3_13, s4_13, s5_13, s6_13],[n6_14, n5_14, n4_14, n3_14, n2_14, n1_14, c1_14, Cstart_14, Sstart_14, s2_14, s3_14, s4_14, s5_14, s6_14],[n6_15, n5_15, n4_15, n3_15, n2_15, n1_15, c1_15, Cstart_15, Sstart_15, s2_15, s3_15, s4_15, s5_15, s6_15],[n6_16, n5_16, n4_16, n3_16, n2_16, n1_16, c1_16, Cstart_16, Sstart_16, s2_16, s3_16, s4_16, s5_16, s6_16],[n6_17, n5_17, n4_17, n3_17, n2_17, n1_17, c1_17, Cstart_17, Sstart_17, s2_17, s3_17, s4_17, s5_17, s6_17],[n6_18, n5_18, n4_18, n3_18, n2_18, n1_18, c1_18, Cstart_18, Sstart_18, s2_18, s3_18, s4_18, s5_18, s6_18],[n6_19, n5_19, n4_19, n3_19, n2_19, n1_19, c1_19, Cstart_19, Sstart_19, s2_19, s3_19, s4_19, s5_19, s6_19],[n6_20, n5_20, n4_20, n3_20, n2_20, n1_20, c1_20, Cstart_20, Sstart_20, s2_20, s3_20, s4_20, s5_20, s6_20],[n6_21, n5_21, n4_21, n3_21, n2_21, n1_21, c1_21, Cstart_21, Sstart_21, s2_21, s3_21, s4_21, s5_21, s6_21],[n6_22, n5_22, n4_22, n3_22, n2_22, n1_22, c1_22, Cstart_22, Sstart_22, s2_22, s3_22, s4_22, s5_22, s6_22],[n9_0, n8_0, n7_0],[n9_1, n8_1, n7_1],[n9_2, n8_2, n7_2],[n9_3, n8_3, n7_3],[n9_4, n8_4, n7_4],[n9_5, n8_5, n7_5],[n9_6, n8_6, n7_6],[n9_7, n8_7, n7_7],[n9_8, n8_8, n7_8],[n9_9, n8_9, n7_9],[n9_10, n8_10, n7_10],[n9_11, n8_11, n7_11],[n9_12, n8_12, n7_12],[n9_13, n8_13, n7_13],[n9_14, n8_14, n7_14],[n9_15, n8_15, n7_15],[n9_16, n8_16, n7_16],[n9_17, n8_17, n7_17],[n9_18, n8_18, n7_18],[n9_19, n8_19, n7_19],[n9_20, n8_20, n7_20],[n9_21, n8_21, n7_21],[n9_22, n8_22, n7_22],[n9_23, n8_23, n7_23],[n9_24, n8_24, n7_24],[n9_25, n8_25, n7_25],[n9_26, n8_26, n7_26],[n9_27, n8_27, n7_27],[n9_28, n8_28, n7_28],[n9_29, n8_29, n7_29],[n9_30, n8_30, n7_30],[n9_31, n8_31, n7_31],[n9_32, n8_32, n7_32],[n9_33, n8_33, n7_33],[n9_34, n8_34, n7_34],[n9_35, n8_35, n7_35],[n9_36, n8_36, n7_36],[n9_37, n8_37, n7_37],[n9_38, n8_38, n7_38],[n9_39, n8_39, n7_39],[n9_40, n8_40, n7_40],[n9_41, n8_41, n7_41],[n9_42, n8_42, n7_42],[n9_43, n8_43, n7_43],[n9_44, n8_44, n7_44],[n9_45, n8_45, n7_45],[n9_46, n8_46, n7_46],[n9_47, n8_47, n7_47],[n9_48, n8_48, n7_48],[n9_49, n8_49, n7_49],[n9_50, n8_50, n7_50],[n9_51, n8_51, n7_51],[n9_52, n8_52, n7_52],[n9_53, n8_53, n7_53],[n9_54, n8_54, n7_54],[n9_55, n8_55, n7_55],[n9_56, n8_56, n7_56],[n9_57, n8_57, n7_57],[n9_58, n8_58, n7_58],[n9_59, n8_59, n7_59],[n9_60, n8_60, n7_60],[n9_61, n8_61, n7_61],[n9_62, n8_62, n7_62],[n9_63, n8_63, n7_63],[n9_64, n8_64, n7_64],[n9_65, n8_65, n7_65],[n9_66, n8_66, n7_66],[n9_67, n8_67, n7_67],[n9_68, n8_68, n7_68],[n9_69, n8_69, n7_69],[n9_70, n8_70, n7_70],[n9_71, n8_71, n7_71],[n9_72, n8_72, n7_72],[n9_73, n8_73, n7_73],[n9_74, n8_74, n7_74],[n9_75, n8_75, n7_75],[n9_76, n8_76, n7_76],[n9_77, n8_77, n7_77],[n9_78, n8_78, n7_78],[n9_79, n8_79, n7_79],[n9_80, n8_80, n7_80],[n9_81, n8_81, n7_81],[n9_82, n8_82, n7_82],[n9_83, n8_83, n7_83],[n9_84, n8_84, n7_84],[n9_85, n8_85, n7_85],[n9_86, n8_86, n7_86],[n9_87, n8_87, n7_87],[n9_88, n8_88, n7_88],[n9_89, n8_89, n7_89],[n9_90, n8_90, n7_90],[n9_91, n8_91, n7_91],[n9_92, n8_92, n7_92],[n9_93, n8_93, n7_93],[n9_94, n8_94, n7_94],[n9_95, n8_95, n7_95],[n9_96, n8_96, n7_96],[n9_97, n8_97, n7_97],[n9_98, n8_98, n7_98],[n9_99, n8_99, n7_99],[n9_100, n8_100, n7_100],[n9_101, n8_101, n7_101],[n9_102, n8_102, n7_102],[n9_103, n8_103, n7_103],[n9_104, n8_104, n7_104],[n9_105, n8_105, n7_105],[n9_106, n8_106, n7_106],[n9_107, n8_107, n7_107],[n9_108, n8_108, n7_108],[n9_109, n8_109, n7_109],[n9_110, n8_110, n7_110],[n9_111, n8_111, n7_111],[n9_112, n8_112, n7_112],[n9_113, n8_113, n7_113],[n9_114, n8_114, n7_114],[n9_115, n8_115, n7_115],[n9_116, n8_116, n7_116],[n9_117, n8_117, n7_117],[n9_118, n8_118, n7_118],[n9_119, n8_119, n7_119],[n9_120, n8_120, n7_120],[n9_121, n8_121, n7_121],[n9_122, n8_122, n7_122],[n9_123, n8_123, n7_123],[n9_124, n8_124, n7_124],[n9_125, n8_125, n7_125],[n9_126, n8_126, n7_126],[n9_127, n8_127, n7_127],[n9_128, n8_128, n7_128],[n9_129, n8_129, n7_129],[n9_130, n8_130, n7_130],[n9_131, n8_131, n7_131],[n9_132, n8_132, n7_132],[n9_133, n8_133, n7_133],[n9_134, n8_134, n7_134],[n9_135, n8_135, n7_135],[n9_136, n8_136, n7_136],[n9_137, n8_137, n7_137],[n9_138, n8_138, n7_138],[n9_139, n8_139, n7_139],[n9_140, n8_140, n7_140],[n9_141, n8_141, n7_141],[n9_142, n8_142, n7_142],[n9_143, n8_143, n7_143],[n9_144, n8_144, n7_144],[n9_145, n8_145, n7_145],[n9_146, n8_146, n7_146],[n9_147, n8_147, n7_147],[n9_148, n8_148, n7_148],[n9_149, n8_149, n7_149],[n9_150, n8_150, n7_150],[n9_151, n8_151, n7_151],[n9_152, n8_152, n7_152],[n9_153, n8_153, n7_153],[n9_154, n8_154, n7_154],[n9_155, n8_155, n7_155],[n9_156, n8_156, n7_156],[n9_157, n8_157, n7_157],[n9_158, n8_158, n7_158],[n9_159, n8_159, n7_159],[n9_160, n8_160, n7_160],[n9_161, n8_161, n7_161],[n9_162, n8_162, n7_162],[n9_163, n8_163, n7_163],[n9_164, n8_164, n7_164],[n9_165, n8_165, n7_165],[n9_166, n8_166, n7_166],[n9_167, n8_167, n7_167],[n9_168, n8_168, n7_168],[n9_169, n8_169, n7_169],[n9_170, n8_170, n7_170],[n9_171, n8_171, n7_171],[n9_172, n8_172, n7_172],[n9_173, n8_173, n7_173],[n9_174, n8_174, n7_174],[n9_175, n8_175, n7_175],[n9_176, n8_176, n7_176],[n9_177, n8_177, n7_177],[n9_178, n8_178, n7_178],[n9_179, n8_179, n7_179],[n9_180, n8_180, n7_180],[n9_181, n8_181, n7_181],[n9_182, n8_182, n7_182],[n9_183, n8_183, n7_183],[n9_184, n8_184, n7_184],[n9_185, n8_185, n7_185],[n9_186, n8_186, n7_186],[n9_187, n8_187, n7_187],[n9_188, n8_188, n7_188],[n9_189, n8_189, n7_189],[n9_190, n8_190, n7_190],[n9_191, n8_191, n7_191],[n9_192, n8_192, n7_192],[n9_193, n8_193, n7_193],[n9_194, n8_194, n7_194],[n9_195, n8_195, n7_195],[n9_196, n8_196, n7_196],[n9_197, n8_197, n7_197],[n9_198, n8_198, n7_198],[n9_199, n8_199, n7_199],[n9_200, n8_200, n7_200],[n9_201, n8_201, n7_201],[n9_202, n8_202, n7_202],[n9_203, n8_203, n7_203],[n9_204, n8_204, n7_204],[n9_205, n8_205, n7_205],[n9_206, n8_206, n7_206],[n9_207, n8_207, n7_207],[n9_208, n8_208, n7_208],[n9_209, n8_209, n7_209],[n9_210, n8_210, n7_210],[n9_211, n8_211, n7_211],[n9_212, n8_212, n7_212],[n9_213, n8_213, n7_213],[n9_214, n8_214, n7_214],[n9_215, n8_215, n7_215],[n9_216, n8_216, n7_216],[n9_217, n8_217, n7_217],[n9_218, n8_218, n7_218],[n9_219, n8_219, n7_219],[n9_220, n8_220, n7_220],[n9_221, n8_221, n7_221],[n9_222, n8_222, n7_222],[n9_223, n8_223, n7_223],[n9_224, n8_224, n7_224],[n9_225, n8_225, n7_225],[n9_226, n8_226, n7_226],[n9_227, n8_227, n7_227],[n9_228, n8_228, n7_228],[n9_229, n8_229, n7_229],[n9_230, n8_230, n7_230],[n9_231, n8_231, n7_231],[n9_232, n8_232, n7_232],[n9_233, n8_233, n7_233],[n9_234, n8_234, n7_234],[n9_235, n8_235, n7_235],[n9_236, n8_236, n7_236],[n9_237, n8_237, n7_237],[n9_238, n8_238, n7_238],[n9_239, n8_239, n7_239],[n9_240, n8_240, n7_240],[n9_241, n8_241, n7_241],[n9_242, n8_242, n7_242],[n9_243, n8_243, n7_243],[n9_244, n8_244, n7_244],[n9_245, n8_245, n7_245],[n9_246, n8_246, n7_246],[n9_247, n8_247, n7_247],[n9_248, n8_248, n7_248],[n9_249, n8_249, n7_249],[n9_250, n8_250, n7_250],[n9_251, n8_251, n7_251],[n9_252, n8_252, n7_252],[n9_253, n8_253, n7_253],[n9_254, n8_254, n7_254],[n9_255, n8_255, n7_255],[n9_256, n8_256, n7_256],[n9_257, n8_257, n7_257],[n9_258, n8_258, n7_258],[n9_259, n8_259, n7_259],[n9_260, n8_260, n7_260],[n9_261, n8_261, n7_261],[n9_262, n8_262, n7_262],[n9_263, n8_263, n7_263],[n9_264, n8_264, n7_264],[n9_265, n8_265, n7_265],[n9_266, n8_266, n7_266],[n9_267, n8_267, n7_267],[n9_268, n8_268, n7_268],[n9_269, n8_269, n7_269],[n9_270, n8_270, n7_270],[n9_271, n8_271, n7_271],[n9_272, n8_272, n7_272],[n9_273, n8_273, n7_273],[n9_274, n8_274, n7_274],[n9_275, n8_275, n7_275],[n9_276, n8_276, n7_276],[n9_277, n8_277, n7_277],[n9_278, n8_278, n7_278],[n9_279, n8_279, n7_279],[n9_280, n8_280, n7_280],[n9_281, n8_281, n7_281],[n9_282, n8_282, n7_282],[n9_283, n8_283, n7_283],[n9_284, n8_284, n7_284],[n9_285, n8_285, n7_285],[n9_286, n8_286, n7_286],[n9_287, n8_287, n7_287],[n9_288, n8_288, n7_288],[n9_289, n8_289, n7_289],[n9_290, n8_290, n7_290],[n9_291, n8_291, n7_291],[n9_292, n8_292, n7_292],[n9_293, n8_293, n7_293],[n9_294, n8_294, n7_294],[n9_295, n8_295, n7_295],[n9_296, n8_296, n7_296],[n9_297, n8_297, n7_297],[n9_298, n8_298, n7_298],[n9_299, n8_299, n7_299],[n9_300, n8_300, n7_300],[n9_301, n8_301, n7_301],[n9_302, n8_302, n7_302],[n9_303, n8_303, n7_303],[n9_304, n8_304, n7_304],[n9_305, n8_305, n7_305],[n9_306, n8_306, n7_306],[n9_307, n8_307, n7_307],[n9_308, n8_308, n7_308],[n9_309, n8_309, n7_309],[n9_310, n8_310, n7_310],[n9_311, n8_311, n7_311],[n9_312, n8_312, n7_312],[n9_313, n8_313, n7_313],[n9_314, n8_314, n7_314],[n9_315, n8_315, n7_315],[n9_316, n8_316, n7_316],[n9_317, n8_317, n7_317],[n9_318, n8_318, n7_318],[n9_319, n8_319, n7_319],[n9_320, n8_320, n7_320],[n9_321, n8_321, n7_321],[n9_322, n8_322, n7_322],[n9_323, n8_323, n7_323],[n9_324, n8_324, n7_324],[n9_325, n8_325, n7_325],[n9_326, n8_326, n7_326],[n9_327, n8_327, n7_327],[n9_328, n8_328, n7_328],[n9_329, n8_329, n7_329],[n9_330, n8_330, n7_330],[n9_331, n8_331, n7_331],[n9_332, n8_332, n7_332],[n9_333, n8_333, n7_333],[n9_334, n8_334, n7_334],[n9_335, n8_335, n7_335],[n9_336, n8_336, n7_336],[n9_337, n8_337, n7_337],[n9_338, n8_338, n7_338],[n9_339, n8_339, n7_339],[n9_340, n8_340, n7_340],[n9_341, n8_341, n7_341],[n9_342, n8_342, n7_342],[n9_343, n8_343, n7_343],[n9_344, n8_344, n7_344],[n9_345, n8_345, n7_345],[n9_346, n8_346, n7_346],[n9_347, n8_347, n7_347],[n9_348, n8_348, n7_348],[n9_349, n8_349, n7_349],[n9_350, n8_350, n7_350],[n9_351, n8_351, n7_351],[n9_352, n8_352, n7_352],[n9_353, n8_353, n7_353],[n9_354, n8_354, n7_354],[n9_355, n8_355, n7_355],[n9_356, n8_356, n7_356],[n9_357, n8_357, n7_357],[n9_358, n8_358, n7_358],[n9_359, n8_359, n7_359],[n9_360, n8_360, n7_360],[n9_361, n8_361, n7_361],[n9_362, n8_362, n7_362],[n9_363, n8_363, n7_363],[n9_364, n8_364, n7_364],[n9_365, n8_365, n7_365],[n9_366, n8_366, n7_366],[n9_367, n8_367, n7_367],[n9_368, n8_368, n7_368],[n9_369, n8_369, n7_369],[n9_370, n8_370, n7_370],[n9_371, n8_371, n7_371],[n9_372, n8_372, n7_372],[n9_373, n8_373, n7_373],[n9_374, n8_374, n7_374],[n9_375, n8_375, n7_375],[n9_376, n8_376, n7_376],[n9_377, n8_377, n7_377],[n9_378, n8_378, n7_378],[n9_379, n8_379, n7_379],[n9_380, n8_380, n7_380],[n9_381, n8_381, n7_381],[n9_382, n8_382, n7_382],[n9_383, n8_383, n7_383],[n9_384, n8_384, n7_384],[n9_385, n8_385, n7_385],[n9_386, n8_386, n7_386],[n9_387, n8_387, n7_387],[n9_388, n8_388, n7_388],[n9_389, n8_389, n7_389],[n9_390, n8_390, n7_390],[n9_391, n8_391, n7_391],[n9_392, n8_392, n7_392],[n9_393, n8_393, n7_393],[n9_394, n8_394, n7_394],[n9_395, n8_395, n7_395],[n9_396, n8_396, n7_396],[n9_397, n8_397, n7_397],[n9_398, n8_398, n7_398],[n9_399, n8_399, n7_399],[n9_400, n8_400, n7_400],[n9_401, n8_401, n7_401],[n9_402, n8_402, n7_402],[n9_403, n8_403, n7_403],[n9_404, n8_404, n7_404],[n9_405, n8_405, n7_405],[n9_406, n8_406, n7_406],[n9_407, n8_407, n7_407],[n9_408, n8_408, n7_408],[n9_409, n8_409, n7_409],[n9_410, n8_410, n7_410],[n9_411, n8_411, n7_411],[n9_412, n8_412, n7_412],[n9_413, n8_413, n7_413],[n9_414, n8_414, n7_414],[n9_415, n8_415, n7_415],[n9_416, n8_416, n7_416],[n9_417, n8_417, n7_417],[n9_418, n8_418, n7_418],[n9_419, n8_419, n7_419],[n9_420, n8_420, n7_420],[n9_421, n8_421, n7_421],[n9_422, n8_422, n7_422],[n9_423, n8_423, n7_423],[n9_424, n8_424, n7_424],[n9_425, n8_425, n7_425],[n9_426, n8_426, n7_426],[n9_427, n8_427, n7_427],[n9_428, n8_428, n7_428],[n9_429, n8_429, n7_429],[n9_430, n8_430, n7_430],[n9_431, n8_431, n7_431],[n9_432, n8_432, n7_432],[n9_433, n8_433, n7_433],[n9_434, n8_434, n7_434],[n9_435, n8_435, n7_435],[n9_436, n8_436, n7_436],[n9_437, n8_437, n7_437],[n9_438, n8_438, n7_438],[n9_439, n8_439, n7_439],[n9_440, n8_440, n7_440],[n9_441, n8_441, n7_441],[n9_442, n8_442, n7_442],[n9_443, n8_443, n7_443],[n9_444, n8_444, n7_444],[n9_445, n8_445, n7_445],[n9_446, n8_446, n7_446],[n9_447, n8_447, n7_447],[n9_448, n8_448, n7_448],[n9_449, n8_449, n7_449],[n9_450, n8_450, n7_450],[n9_451, n8_451, n7_451],[n9_452, n8_452, n7_452],[n9_453, n8_453, n7_453],[n9_454, n8_454, n7_454],[n9_455, n8_455, n7_455],[n9_456, n8_456, n7_456],[n9_457, n8_457, n7_457],[n9_458, n8_458, n7_458],[n9_459, n8_459, n7_459],[n9_460, n8_460, n7_460],[n9_461, n8_461, n7_461],[n9_462, n8_462, n7_462],[n9_463, n8_463, n7_463],[n9_464, n8_464, n7_464],[n9_465, n8_465, n7_465],[n9_466, n8_466, n7_466],[n9_467, n8_467, n7_467],[n9_468, n8_468, n7_468],[n9_469, n8_469, n7_469],[n9_470, n8_470, n7_470],[n9_471, n8_471, n7_471],[n9_472, n8_472, n7_472],[n9_473, n8_473, n7_473],[n9_474, n8_474, n7_474],[n9_475, n8_475, n7_475],[n9_476, n8_476, n7_476],[n9_477, n8_477, n7_477],[n9_478, n8_478, n7_478],[n9_479, n8_479, n7_479],[n9_480, n8_480, n7_480],[n9_481, n8_481, n7_481],[n9_482, n8_482, n7_482],[n9_483, n8_483, n7_483],[n9_484, n8_484, n7_484],[n9_485, n8_485, n7_485],[n9_486, n8_486, n7_486],[n9_487, n8_487, n7_487],[n9_488, n8_488, n7_488],[n9_489, n8_489, n7_489],[n9_490, n8_490, n7_490],[n9_491, n8_491, n7_491],[n9_492, n8_492, n7_492],[n9_493, n8_493, n7_493],[n9_494, n8_494, n7_494],[n9_495, n8_495, n7_495],[n9_496, n8_496, n7_496],[n9_497, n8_497, n7_497],[n9_498, n8_498, n7_498],[n9_499, n8_499, n7_499],[n9_500, n8_500, n7_500],[n9_501, n8_501, n7_501],[n9_502, n8_502, n7_502],[n9_503, n8_503, n7_503],[n9_504, n8_504, n7_504],[n9_505, n8_505, n7_505],[n9_506, n8_506, n7_506],[n9_507, n8_507, n7_507],[n9_508, n8_508, n7_508],[n9_509, n8_509, n7_509],[n9_510, n8_510, n7_510],[n9_511, n8_511, n7_511],[n9_512, n8_512, n7_512],[n9_513, n8_513, n7_513],[n9_514, n8_514, n7_514],[n9_515, n8_515, n7_515],[n9_516, n8_516, n7_516],[n9_517, n8_517, n7_517],[n9_518, n8_518, n7_518],[n9_519, n8_519, n7_519],[n9_520, n8_520, n7_520],[n9_521, n8_521, n7_521],[n9_522, n8_522, n7_522],[n9_523, n8_523, n7_523],[n9_524, n8_524, n7_524],[n9_525, n8_525, n7_525],[n9_526, n8_526, n7_526],[n9_527, n8_527, n7_527],[n9_528, n8_528, n7_528],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1011)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-25 18:08:54] [INFO ] Flatten gal took : 38 ms
[2024-05-25 18:08:54] [INFO ] Time to serialize gal into /tmp/LTLFireability18218322985107942414.gal : 13 ms
[2024-05-25 18:08:54] [INFO ] Time to serialize properties into /tmp/LTLFireability12080838855912764330.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18218322985107942414.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12080838855912764330.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 2 LTL properties
Checking formula 0 : !(((G((!("(((((((n1_16>=1)&&(Sstart_16>=1))||((n1_8>=1)&&(Sstart_8>=1)))||(((n1_21>=1)&&(Sstart_21>=1))||((n1_10>=1)&&(Sstart_10>=1)))...9008
Formula 0 simplified : F("(((((((n1_16>=1)&&(Sstart_16>=1))||((n1_8>=1)&&(Sstart_8>=1)))||(((n1_21>=1)&&(Sstart_21>=1))||((n1_10>=1)&&(Sstart_10>=1))))||((...8986
ITS-tools command line returned an error code 137
[2024-05-25 18:19:06] [INFO ] Flatten gal took : 38 ms
[2024-05-25 18:19:06] [INFO ] Input system was already deterministic with 356 transitions.
[2024-05-25 18:19:06] [INFO ] Transformed 1916 places.
[2024-05-25 18:19:06] [INFO ] Transformed 356 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 18:19:06] [INFO ] Time to serialize gal into /tmp/LTLFireability13588584294966709474.gal : 5 ms
[2024-05-25 18:19:06] [INFO ] Time to serialize properties into /tmp/LTLFireability13577948023794263178.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13588584294966709474.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13577948023794263178.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G((!("(((((((n1_16>=1)&&(Sstart_16>=1))||((n1_8>=1)&&(Sstart_8>=1)))||(((n1_21>=1)&&(Sstart_21>=1))||((n1_10>=1)&&(Sstart_10>=1)))...9008
Formula 0 simplified : F("(((((((n1_16>=1)&&(Sstart_16>=1))||((n1_8>=1)&&(Sstart_8>=1)))||(((n1_21>=1)&&(Sstart_21>=1))||((n1_10>=1)&&(Sstart_10>=1))))||((...8986
ITS-tools command line returned an error code 137
Total runtime 3385530 ms.

BK_STOP 1716661981232

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="QuasiCertifProtocol-COL-22"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is QuasiCertifProtocol-COL-22, 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 r312-tall-171662337700036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-22.tgz
mv QuasiCertifProtocol-COL-22 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 ;