About the Execution of ITS-Tools for PolyORBNT-COL-S10J30
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | TTTTTTT?TFTTFTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254300607.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is PolyORBNT-COL-S10J30, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254300607
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 93K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityFireability-2025-00
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityFireability-2025-01
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityFireability-2025-02
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityFireability-2025-03
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityFireability-2025-04
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityFireability-2025-05
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityFireability-2025-06
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityFireability-2025-07
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityFireability-2025-08
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityFireability-2025-09
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityFireability-2025-10
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityFireability-2025-11
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityFireability-2025-12
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityFireability-2025-13
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityFireability-2025-14
FORMULA_NAME PolyORBNT-COL-S10J30-ReachabilityFireability-2025-15
=== Now, execution of the tool begins
BK_START 1749066928528
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J30
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
ReachabilityFireability COL
Running Version 202505121319
[2025-06-04 19:55:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 19:55:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 19:55:29] [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.
[2025-06-04 19:55:30] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-04 19:55:30] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 606 ms
[2025-06-04 19:55:30] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 694 PT places and 12142.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2025-06-04 19:55:30] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 7 ms.
[2025-06-04 19:55:30] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-04 19:55:30] [INFO ] Unfolded HLPN to a Petri net with 694 places and 12080 transitions 112619 arcs in 208 ms.
[2025-06-04 19:55:30] [INFO ] Unfolded 16 HLPN properties in 7 ms.
[2025-06-04 19:55:30] [INFO ] Reduced 780 identical enabling conditions.
[2025-06-04 19:55:30] [INFO ] Reduced 780 identical enabling conditions.
[2025-06-04 19:55:30] [INFO ] Reduced 9285 identical enabling conditions.
[2025-06-04 19:55:30] [INFO ] Reduced 45 identical enabling conditions.
[2025-06-04 19:55:30] [INFO ] Reduced 45 identical enabling conditions.
[2025-06-04 19:55:30] [INFO ] Reduced 45 identical enabling conditions.
[2025-06-04 19:55:30] [INFO ] Reduced 9285 identical enabling conditions.
[2025-06-04 19:55:30] [INFO ] Reduced 780 identical enabling conditions.
[2025-06-04 19:55:30] [INFO ] Reduced 45 identical enabling conditions.
[2025-06-04 19:55:30] [INFO ] Reduced 9285 identical enabling conditions.
[2025-06-04 19:55:30] [INFO ] Reduced 45 identical enabling conditions.
[2025-06-04 19:55:30] [INFO ] Reduced 9285 identical enabling conditions.
[2025-06-04 19:55:30] [INFO ] Reduced 9285 identical enabling conditions.
[2025-06-04 19:55:30] [INFO ] Reduced 45 identical enabling conditions.
[2025-06-04 19:55:30] [INFO ] Reduced 45 identical enabling conditions.
[2025-06-04 19:55:30] [INFO ] Reduced 780 identical enabling conditions.
[2025-06-04 19:55:30] [INFO ] Reduced 780 identical enabling conditions.
Deduced a syphon composed of 30 places in 30 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
[2025-06-04 19:55:32] [INFO ] Flatten gal took : 657 ms
[2025-06-04 19:55:32] [INFO ] Flatten gal took : 381 ms
[2025-06-04 19:55:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16169227722489042637.gal : 105 ms
RANDOM walk for 40000 steps (2238 resets) in 7192 ms. (5 steps per ms) remains 16/16 properties
[2025-06-04 19:55:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12088208855975680346.prop : 89 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16169227722489042637.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12088208855975680346.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4003 steps (40 resets) in 298 ms. (13 steps per ms) remains 16/16 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 4004 steps (39 resets) in 1175 ms. (3 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (40 resets) in 117 ms. (33 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (40 resets) in 95 ms. (41 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (40 resets) in 91 ms. (43 steps per ms) remains 16/16 properties
Loading property file /tmp/ReachabilityCardinality12088208855975680346.prop.
BEST_FIRST walk for 4004 steps (40 resets) in 1039 ms. (3 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 9/16 properties
FORMULA PolyORBNT-COL-S10J30-ReachabilityFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J30-ReachabilityFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J30-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J30-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J30-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J30-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J30-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4004 steps (48 resets) in 1378 ms. (2 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4004 steps (40 resets) in 60 ms. (65 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4002 steps (40 resets) in 746 ms. (5 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4004 steps (40 resets) in 436 ms. (9 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4003 steps (43 resets) in 188 ms. (21 steps per ms) remains 9/9 properties
[2025-06-04 19:55:34] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2025-06-04 19:55:34] [INFO ] Computed 92 invariants in 97 ms
[2025-06-04 19:55:34] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem PolyORBNT-COL-S10J30-ReachabilityFireability-2025-08 is UNSAT
FORMULA PolyORBNT-COL-S10J30-ReachabilityFireability-2025-08 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/664 variables, 85/85 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem PolyORBNT-COL-S10J30-ReachabilityFireability-2025-09 is UNSAT
FORMULA PolyORBNT-COL-S10J30-ReachabilityFireability-2025-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-COL-S10J30-ReachabilityFireability-2025-10 is UNSAT
FORMULA PolyORBNT-COL-S10J30-ReachabilityFireability-2025-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-COL-S10J30-ReachabilityFireability-2025-14 is UNSAT
FORMULA PolyORBNT-COL-S10J30-ReachabilityFireability-2025-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-COL-S10J30-ReachabilityFireability-2025-15 is UNSAT
FORMULA PolyORBNT-COL-S10J30-ReachabilityFireability-2025-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/664 variables, 7/92 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/664 variables, 0/92 constraints. Problems are: Problem set: 5 solved, 4 unsolved
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 386
At refinement iteration 3 (OVERLAPS) 1931/2595 variables, 664/756 constraints. Problems are: Problem set: 5 solved, 4 unsolved
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :386 after 1023
At refinement iteration 4 (INCLUDED_ONLY) 0/2595 variables, 1/757 constraints. Problems are: Problem set: 5 solved, 4 unsolved
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :1023 after 1024
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :1024 after 2048
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2595/2595 variables, and 757 constraints, problems are : Problem set: 5 solved, 4 unsolved in 5033 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 664/664 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/533 variables, 2/3 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 128/661 variables, 84/87 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/661 variables, 2/89 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/661 variables, 0/89 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 3/664 variables, 3/92 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/664 variables, 0/92 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1931/2595 variables, 664/756 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2595 variables, 1/757 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2595 variables, 0/757 constraints. Problems are: Problem set: 5 solved, 4 unsolved
(t1783 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((t0 0)
(t1 0)
(t2 0)
(t3 0)
(t4 0)
(t5 0)
(t6 0)
(t7 0)
(t8 0)
(t9 0)
(t10 0)
(t11 0)
(t12 0)
(t13 0)
(t14 0)
(t15 0)
(t16 1)
(t17 0)
(t18 0)
(t19 0)
(t20 0)
(t21 0)
(t22 0)
(t23 0)
(t24 0)
(t25 0)
(t26 0)
(t27 0)
(t28 0)
(t29 0)
(t30 0)
(t31 0)
(t32 0)
(t33 0)
(t34 0)
(t35 0)
(t36 0)
(t37 0)
(t38 0)
(t39 0)
(t40 0)
(t41 0)
(t42 0)
(t43 0)
(t44 0)
(t45 0)
(t46 0)
(t47 0)
(t48 0)
(t49 0)
(t50 0)
(t51 0)
(t52 0)
(t53 0)
(t54 0)
(t55 0)
(t56 0)
(t57 0)
(t58 0)
(t59 0)
(t60 0)
(t61 0)
(t62 0)
(t63 0)
(t64 0)
(t65 0)
(t66 0)
(t67 0)
(t68 0)
(t69 0)
(t70 0)
(t71 0)
(t72 0)
(t73 0)
(t74 0)
(t75 0)
(t76 0)
(t77 0)
(t78 0)
(t79 0)
(t80 0)
(t81 0)
(t82 0)
(t83 0)
(t84 0)
(t85 0)
(t86 0)
(t87 0)
(t88 0)
(t89 0)
(t90 0)
(t91 0)
(t92 0)
(t93 0)
(t94 0)
(t95 0)
(t96 0)
(t97 0)
(t98 0)
(t99 0)
(t100 0)
(t101 0)
(t102 0)
(t103 0)
(t104 0)
(t105 0)
(t106 0)
(t107 0)
(t108 0)
(t109 0)
(t110 0)
(t111 0)
(t112 0)
(t113 0)
(t114 0)
(t115 1)
(t116 0)
(t117 0)
(t118 0)
(t119 0)
(t120 0)
(t121 0)
(t122 0)
(t123 0)
(t124 0)
(t125 0)
(t126 0)
(t127 0)
(t128 0)
(t129 0)
(t130 0)
(t131 0)
(t132 0)
(t133 0)
(t134 0)
(t135 0)
(t136 0)
(t137 0)
(t138 0)
(t139 0)
(t140 0)
(t141 0)
(t142 0)
(t143 0)
(t144 0)
(t145 1)
(t146 0)
(t147 0)
(t148 0)
(t149 0)
(t150 0)
(t151 0)
(t152 0)
(t153 0)
(t154 0)
(t155 0)
(t156 0)
(t157 0)
(t158 0)
(t159 0)
(t160 0)
(t161 0)
(t162 0)
(t163 0)
(t164 0)
(t165 0)
(t166 0)
(t167 0)
(t168 0)
(t169 0)
(t170 0)
(t171 0)
(t172 0)
(t173 0)
(t174 0)
(t175 0)
(t176 0)
(t177 1)
(t178 0)
(t179 0)
(t180 0)
(t181 0)
(t182 1)
(t183 0)
(t184 0)
(t185 0)
(t186 0)
(t187 0)
(t188 0)
(t189 0)
(t190 0)
(t191 0)
(t192 0)
(t193 0)
(t194 0)
(t195 0)
(t196 0)
(t197 0)
(t198 0)
(t199 0)
(t200 0)
(t201 0)
(t202 1)
(t203 0)
(t204 0)
(t205 0)
(t206 0)
(t207 1)
(t208 1)
(t209 0)
(t210 0)
(t211 0)
(t212 0)
(t213 1)
(t214 0)
(t215 0)
(t216 0)
(t217 4)
(t218 0)
(t219 0)
(t220 0)
(t221 0)
(t222 0)
(t223 0)
(t224 0)
(t225 1)
(t226 1)
(t227 0)
(t228 0)
(t229 0)
(t230 0)
(t231 0)
(t232 0)
(t233 0)
(t234 0)
(t235 0)
(t236 0)
(t237 0)
(t238 0)
(t239 0)
(t240 0)
(t241 0)
(t242 0)
(t243 0)
(t244 0)
(t245 0)
(t246 0)
(t247 0)
(t248 0)
(t249 0)
(t250 0)
(t251 0)
(t252 0)
(t253 0)
(t254 0)
(t255 0)
(t256 0)
(t257 0)
(t258 0)
(t259 0)
(t260 0)
(t261 0)
(t262 0)
(t263 0)
(t264 0)
(t265 0)
(t266 0)
(t267 0)
(t268 0)
(t269 0)
(t270 0)
(t271 0)
(t272 0)
(t273 0)
(t274 0)
(t275 0)
(t276 0)
(t277 0)
(t278 0)
(t279 0)
(t280 0)
(t281 0)
(t282 0)
(t283 0)
(t284 0)
(t285 0)
(t286 0)
(t287 0)
(t288 0)
(t289 0)
(t290 0)
(t291 0)
(t292 0)
(t293 0)
(t294 0)
(t295 0)
(t296 0)
(t297 0)
(t298 0)
(t299 0)
(t300 0)
(t301 0)
(t302 0)
(t303 0)
(t304 0)
(t305 0)
(t306 0)
(t307 0)
(t308 0)
(t309 0)
(t310 0)
(t311 0)
(t312 0)
(t313 0)
(t314 0)
(t315 0)
(t316 0)
(t317 0)
(t318 0)
(t319 0)
(t320 0)
(t321 0)
(t322 0)
(t323 0)
(t324 0)
(t325 0)
(t326 0)
(t327 0)
(t328 0)
(t329 0)
(t330 0)
(t331 0)
(t332 0)
(t333 0)
(t334 0)
(t335 0)
(t336 0)
(t337 0)
(t338 0)
(t339 0)
(t340 0)
(t341 0)
(t342 0)
(t343 0)
(t344 0)
(t345 0)
(t346 0)
(t347 0)
(t348 0)
(t349 0)
(t350 0)
(t351 0)
(t352 0)
(t353 0)
(t354 0)
(t355 0)
(t356 0)
(t357 0)
(t358 0)
(t359 0)
(t360 0)
(t361 0)
(t362 0)
(t363 0)
(t364 0)
(t365 0)
(t366 0)
(t367 0)
(t368 0)
(t369 0)
(t370 0)
(t371 0)
(t372 0)
(t373 0)
(t374 0)
(t375 0)
(t376 0)
(t377 0)
(t378 0)
(t379 0)
(t380 0)
(t381 0)
(t382 0)
(t383 0)
(t384 0)
(t385 0)
(t386 0)
(t387 0)
(t388 0)
(t389 0)
(t390 0)
(t391 0)
(t392 0)
(t393 0)
(t394 0)
(t395 0)
(t396 0)
(t397 0)
(t398 0)
(t399 0)
(t400 0)
(t401 0)
(t402 0)
(t403 0)
(t404 0)
(t405 0)
(t406 0)
(t407 0)
(t408 0)
(t409 0)
(t410 0)
(t411 0)
(t412 0)
(t413 0)
(t414 0)
(t415 0)
(t416 0)
(t417 0)
(t418 0)
(t419 0)
(t420 0)
(t421 0)
(t422 0)
(t423 0)
(t424 0)
(t425 0)
(t426 0)
(t427 0)
(t428 0)
(t429 0)
(t430 0)
(t431 0)
(t432 0)
(t433 0)
(t434 0)
(t435 0)
(t436 0)
(t437 0)
(t438 0)
(t439 0)
(t440 0)
(t441 0)
(t442 0)
(t443 0)
(t444 0)
(t445 0)
(t446 0)
(t447 0)
(t448 0)
(t449 0)
(t450 0)
(t451 0)
(t452 0)
(t453 0)
(t454 0)
(t455 0)
(t456 0)
(t457 0)
(t458 0)
(t459 0)
(t460 0)
(t461 0)
(t462 0)
(t463 0)
(t464 0)
(t465 0)
(t466 0)
(t467 0)
(t468 0)
(t469 0)
(t470 0)
(t471 0)
(t472 0)
(t473 0)
(t474 0)
(t475 0)
(t476 0)
(t477 0)
(t478 0)
(t479 0)
(t480 0)
(t481 0)
(t482 0)
(t483 0)
(t484 0)
(t485 0)
(t486 0)
(t487 0)
(t488 0)
(t489 0)
(t490 0)
(t491 0)
(t492 0)
(t493 0)
(t494 0)
(t495 0)
(t496 0)
(t497 0)
(t498 0)
(t499 0)
(t500 0)
(t501 0)
(t502 0)
(t503 0)
(t504 0)
(t505 0)
(t506 0)
(t507 0)
(t508 0)
(t509 0)
(t510 0)
(t511 0)
(t512 0)
(t513 0)
(t514 0)
(t515 0)
(t516 0)
(t517 0)
(t518 0)
(t519 0)
(t520 0)
(t521 0)
(t522 0)
(t523 0)
(t524 0)
(t525 0)
(t526 0)
(t527 0)
(t528 0)
(t529 0)
(t530 0)
(t531 0)
(t532 0)
(t533 0)
(t534 0)
(t535 0)
(t536 0)
(t537 0)
(t538 0)
(t539 0)
(t540 0)
(t541 0)
(t542 0)
(t543 0)
(t544 0)
(t545 0)
(t546 0)
(t547 0)
(t548 0)
(t549 0)
(t550 0)
(t551 0)
(t552 0)
(t553 0)
(t554 0)
(t555 0)
(t556 0)
(t557 0)
(t558 0)
(t559 0)
(t560 0)
(t561 0)
(t562 0)
(t563 0)
(t564 0)
(t565 0)
(t566 0)
(t567 0)
(t568 0)
(t569 0)
(t570 0)
(t571 0)
(t572 0)
(t573 0)
(t574 0)
(t575 0)
(t576 0)
(t577 0)
(t578 0)
(t579 0)
(t580 0)
(t581 0)
(t582 0)
(t583 0)
(t584 0)
(t585 0)
(t586 0)
(t587 0)
(t588 0)
(t589 0)
(t590 0)
(t591 0)
(t592 0)
(t593 0)
(t594 0)
(t595 0)
(t596 0)
(t597 0)
(t598 0)
(t599 0)
(t600 0)
(t601 0)
(t602 0)
(t603 0)
(t604 0)
(t605 0)
(t606 0)
(t607 0)
(t608 0)
(t609 0)
(t610 0)
(t611 0)
(t612 0)
(t613 0)
(t614 0)
(t615 0)
(t616 0)
(t617 0)
(t618 0)
(t619 0)
(t620 0)
(t621 0)
(t622 0)
(t623 0)
(t624 0)
(t625 0)
(t626 0)
(t627 0)
(t628 0)
(t629 0)
(t630 0)
(t631 0)
(t632 0)
(t633 0)
(t634 0)
(t635 0)
(t636 0)
(t637 0)
(t638 0)
(t639 0)
(t640 0)
(t641 0)
(t642 0)
(t643 0)
(t644 0)
(t645 0)
(t646 0)
(t647 0)
(t648 0)
(t649 0)
(t650 0)
(t651 0)
(t652 0)
(t653 0)
(t654 0)
(t655 0)
(t656 0)
(t657 0)
(t658 0)
(t659 0)
(t660 0)
(t661 0)
(t662 0)
(t663 0)
(t664 0)
(t665 0)
(t666 0)
(t667 0)
(t668 0)
(t669 0)
(t670 0)
(t671 0)
(t672 0)
(t673 0)
(t674 0)
(t675 0)
(t676 0)
(t677 0)
(t678 0)
(t679 0)
(t680 0)
(t681 0)
(t682 0)
(t683 0)
(t684 0)
(t685 0)
(t686 0)
(t687 0)
(t688 0)
(t689 0)
(t690 0)
(t691 0)
(t692 0)
(t693 0)
(t694 0)
(t695 0)
(t696 0)
(t697 0)
(t698 0)
(t699 0)
(t700 0)
(t701 0)
(t702 0)
(t703 0)
(t704 0)
(t705 0)
(t706 0)
(t707 0)
(t708 0)
(t709 0)
(t710 0)
(t711 0)
(t712 0)
(t713 0)
(t714 0)
(t715 0)
(t716 0)
(t717 0)
(t718 0)
(t719 0)
(t720 0)
(t721 0)
(t722 0)
(t723 0)
(t724 0)
(t725 0)
(t726 0)
(t727 0)
(t728 0)
(t729 0)
(t730 0)
(t731 0)
(t732 1)
(t733 0)
(t734 0)
(t735 0)
(t736 0)
(t737 0)
(t738 0)
(t739 0)
(t740 0)
(t741 0)
(t742 0)
(t743 0)
(t744 0)
(t745 0)
(t746 0)
(t747 0)
(t748 0)
(t749 0)
(t750 0)
(t751 0)
(t752 0)
(t753 0)
(t754 0)
(t755 0)
(t756 0)
(t757 0)
(t758 0)
(t759 0)
(t760 0)
(t761 0)
(t762 0)
(t763 0)
(t764 0)
(t765 0)
(t766 0)
(t767 0)
(t768 0)
(t769 0)
(t770 0)
(t771 0)
(t772 0)
(t773 0)
(t774 0)
(t775 0)
(t776 0)
(t777 0)
(t778 0)
(t779 0)
(t780 0)
(t781 0)
(t782 0)
(t783 0)
(t784 0)
(t785 0)
(t786 0)
(t787 0)
(t788 0)
(t789 0)
(t790 0)
(t791 0)
(t792 0)
(t793 0)
(t794 0)
(t795 0)
(t796 0)
(t797 0)
(t798 0)
(t799 0)
(t800 0)
(t801 0)
(t802 0)
(t803 0)
(t804 0)
(t805 0)
(t806 0)
(t807 0)
(t808 0)
(t809 0)
(t810 0)
(t811 0)
(t812 0)
(t813 0)
(t814 0)
(t815 0)
(t816 0)
(t817 0)
(t818 0)
(t819 0)
(t820 0)
(t821 0)
(t822 0)
(t823 0)
(t824 0)
(t825 0)
(t826 0)
(t827 0)
(t828 0)
(t829 0)
(t830 0)
(t831 0)
(t832 0)
(t833 0)
(t834 0)
(t835 0)
(t836 0)
(t837 0)
(t838 0)
(t839 0)
(t840 0)
(t841 0)
(t842 0)
(t843 0)
(t844 0)
(t845 0)
(t846 0)
(t847 0)
(t848 0)
(t849 0)
(t850 0)
(t851 0)
(t852 0)
(t853 0)
(t854 0)
(t855 0)
(t856 0)
(t857 0)
(t858 0)
(t859 0)
(t860 0)
(t861 0)
(t862 0)
(t863 0)
(t864 0)
(t865 0)
(t866 0)
(t867 0)
(t868 0)
(t869 0)
(t870 0)
(t871 0)
(t872 0)
(t873 0)
(t874 0)
(t875 0)
(t876 0)
(t877 0)
(t878 0)
(t879 0)
(t880 0)
(t881 0)
(t882 0)
(t883 0)
(t884 0)
(t885 0)
(t886 0)
(t887 0)
(t888 0)
(t889 0)
(t890 0)
(t891 0)
(t892 0)
(t893 0)
(t894 0)
(t895 0)
(t896 0)
(t897 0)
(t898 0)
(t899 0)
(t900 0)
(t901 0)
(t902 0)
(t903 0)
(t904 0)
(t905 0)
(t906 0)
(t907 0)
(t908 0)
(t909 0)
(t910 0)
(t911 0)
(t912 0)
(t913 0)
(t914 0)
(t915 0)
(t916 0)
(t917 0)
(t918 0)
(t919 0)
(t920 0)
(t921 0)
(t922 0)
(t923 0)
(t924 0)
(t925 0)
(t926 0)
(t927 0)
(t928 0)
(t929 0)
(t930 0)
(t931 0)
(t932 0)
(t933 0)
(t934 0)
(t935 0)
(t936 0)
(t937 0)
(t938 0)
(t939 0)
(t940 0)
(t941 0)
(t942 0)
(t943 0)
(t944 0)
(t945 0)
(t946 0)
(t947 0)
(t948 0)
(t949 0)
(t950 0)
(t951 0)
(t952 0)
(t953 0)
(t954 0)
(t955 0)
(t956 0)
(t957 0)
(t958 0)
(t959 0)
(t960 0)
(t961 0)
(t962 0)
(t963 0)
(t964 0)
(t965 0)
(t966 0)
(t967 0)
(t968 0)
(t969 0)
(t970 0)
(t971 0)
(t972 0)
(t973 0)
(t974 0)
(t975 0)
(t976 0)
(t977 0)
(t978 0)
(t979 0)
(t980 0)
(t981 0)
(t982 0)
(t983 0)
(t984 0)
(t985 0)
(t986 0)
(t987 0)
(t988 0)
(t989 0)
(t990 0)
(t991 0)
(t992 0)
(t993 0)
(t994 0)
(t995 0)
(t996 0)
(t997 0)
(t998 0)
(t999 0)
(t1000 0)
(t1001 0)
(t1002 0)
(t1003 0)
(t1004 0)
(t1005 0)
(t1006 0)
(t1007 0)
(t1008 0)
(t1009 0)
(t1010 0)
(t1011 0)
(t1012 0)
(t1013 0)
(t1014 0)
(t1015 0)
(t1016 0)
(t1017 0)
(t1018 0)
(t1019 0)
(t1020 0)
(t1021 0)
(t1022 0)
(t1023 0)
(t1024 0)
(t1025 0)
(t1026 0)
(t1027 0)
(t1028 0)
(t1029 0)
(t1030 0)
(t1031 0)
(t1032 0)
(t1033 0)
(t1034 0)
(t1035 0)
(t1036 0)
(t1037 0)
(t1038 0)
(t1039 0)
(t1040 0)
(t1041 0)
(t1042 0)
(t1043 0)
(t1044 0)
(t1045 0)
(t1046 0)
(t1047 0)
(t1048 0)
(t1049 0)
(t1050 0)
(t1051 0)
(t1052 0)
(t1053 0)
(t1054 0)
(t1055 0)
(t1056 0)
(t1057 0)
(t1058 0)
(t1059 0)
(t1060 0)
(t1061 0)
(t1062 0)
(t1063 0)
(t1064 0)
(t1065 0)
(t1066 0)
(t1067 0)
(t1068 0)
(t1069 0)
(t1070 0)
(t1071 0)
(t1072 0)
(t1073 0)
(t1074 0)
(t1075 0)
(t1076 0)
(t1077 0)
(t1078 0)
(t1079 0)
(t1080 0)
(t1081 0)
(t1082 0)
(t1083 0)
(t1084 0)
(t1085 0)
(t1086 0)
(t1087 0)
(t1088 0)
(t1089 0)
(t1090 0)
(t1091 0)
(t1092 0)
(t1093 0)
(t1094 0)
(t1095 0)
(t1096 0)
(t1097 0)
(t1098 0)
(t1099 0)
(t1100 0)
(t1101 0)
(t1102 0)
(t1103 0)
(t1104 0)
(t1105 0)
(t1106 0)
(t1107 0)
(t1108 0)
(t1109 0)
(t1110 0)
(t1111 0)
(t1112 0)
(t1113 0)
(t1114 0)
(t1115 0)
(t1116 0)
(t1117 0)
(t1118 0)
(t1119 0)
(t1120 0)
(t1121 0)
(t1122 0)
(t1123 0)
(t1124 0)
(t1125 0)
(t1126 0)
(t1127 0)
(t1128 0)
(t1129 0)
(t1130 0)
(t1131 0)
(t1132 0)
(t1133 0)
(t1134 0)
(t1135 0)
(t1136 0)
(t1137 0)
(t1138 0)
(t1139 0)
(t1140 0)
(t1141 0)
(t1142 0)
(t1143 0)
(t1144 0)
(t1145 0)
(t1146 0)
(t1147 0)
(t1148 0)
(t1149 0)
(t1150 0)
(t1151 0)
(t1152 0)
(t1153 0)
(t1154 0)
(t1155 0)
(t1156 0)
(t1157 0)
(t1158 0)
(t1159 0)
(t1160 0)
(t1161 0)
(t1162 0)
(t1163 0)
(t1164 0)
(t1165 0)
(t1166 0)
(t1167 0)
(t1168 0)
(t1169 0)
(t1170 0)
(t1171 0)
(t1172 0)
(t1173 0)
(t1174 0)
(t1175 0)
(t1176 0)
(t1177 0)
(t1178 0)
(t1179 0)
(t1180 0)
(t1181 0)
(t1182 0)
(t1183 0)
(t1184 0)
(t1185 0)
(t1186 0)
(t1187 0)
(t1188 0)
(t1189 0)
(t1190 0)
(t1191 0)
(t1192 0)
(t1193 0)
(t1194 0)
(t1195 0)
(t1196 0)
(t1197 0)
(t1198 0)
(t1199 0)
(t1200 0)
(t1201 0)
(t1202 0)
(t1203 0)
(t1204 0)
(t1205 0)
(t1206 0)
(t1207 0)
(t1208 0)
(t1209 0)
(t1210 0)
(t1211 0)
(t1212 0)
(t1213 0)
(t1214 0)
(t1215 0)
(t1216 0)
(t1217 0)
(t1218 0)
(t1219 0)
(t1220 0)
(t1221 0)
(t1222 0)
(t1223 0)
(t1224 0)
(t1225 0)
(t1226 0)
(t1227 0)
(t1228 0)
(t1229 0)
(t1230 0)
(t1231 0)
(t1232 0)
(t1233 0)
(t1234 0)
(t1235 0)
(t1236 0)
(t1237 0)
(t1238 0)
(t1239 0)
(t1240 0)
(t1241 0)
(t1242 0)
(t1243 1)
(t1244 0)
(t1245 0)
(t1246 0)
(t1247 0)
(t1248 0)
(t1249 1)
(t1250 0)
(t1251 0)
(t1252 0)
(t1253 0)
(t1254 0)
(t1255 0)
(t1256 0)
(t1257 0)
(t1258 0)
(t1259 0)
(t1260 0)
(t1261 0)
(t1262 0)
(t1263 0)
(t1264 0)
(t1265 0)
(t1266 0)
(t1267 0)
(t1268 0)
(t1269 0)
(t1270 0)
(t1271 0)
(t1272 0)
(t1273 0)
(t1274 0)
(t1275 0)
(t1276 0)
(t1277 0)
(t1278 0)
(t1279 0)
(t1280 0)
(t1281 0)
(t1282 0)
(t1283 0)
(t1284 0)
(t1285 0)
(t1286 0)
(t1287 0)
(t1288 0)
(t1289 0)
(t1290 0)
(t1291 0)
(t1292 0)
(t1293 0)
(t1294 0)
(t1295 0)
(t1296 0)
(t1297 0)
(t1298 0)
(t1299 0)
(t1300 0)
(t1301 0)
(t1302 0)
(t1303 0)
(t1304 0)
(t1305 0)
(t1306 0)
(t1307 0)
(t1308 0)
(t1309 0)
(t1310 0)
(t1311 0)
(t1312 0)
(t1313 0)
(t1314 0)
(t1315 0)
(t1316 0)
(t1317 0)
(t1318 0)
(t1319 0)
(t1320 0)
(t1321 0)
(t1322 0)
(t1323 0)
(t1324 0)
(t1325 0)
(t1326 0)
(t1327 0)
(t1328 0)
(t1329 0)
(t1330 0)
(t1331 0)
(t1332 0)
(t1333 0)
(t1334 0)
(t1335 0)
(t1336 0)
(t1337 0)
(t1338 0)
(t1339 0)
(t1340 0)
(t1341 1)
(t1342 0)
(t1343 0)
(t1344 0)
(t1345 0)
(t1346 0)
(t1347 0)
(t1348 0)
(t1349 0)
(t1350 0)
(t1351 0)
(t1352 0)
(t1353 0)
(t1354 0)
(t1355 0)
(t1356 0)
(t1357 0)
(t1358 0)
(t1359 0)
(t1360 0)
(t1361 0)
(t1362 0)
(t1363 0)
(t1364 0)
(t1365 0)
(t1366 0)
(t1367 0)
(t1368 0)
(t1369 0)
(t1370 0)
(t1371 0)
(t1372 0)
(t1373 0)
(t1374 0)
(t1375 0)
(t1376 0)
(t1377 0)
(t1378 0)
(t1379 0)
(t1380 0)
(t1381 0)
(t1382 0)
(t1383 0)
(t1384 0)
(t1385 0)
(t1386 0)
(t1387 0)
(t1388 0)
(t1389 0)
(t1390 0)
(t1391 0)
(t1392 0)
(t1393 0)
(t1394 0)
(t1395 0)
(t1396 0)
(t1397 0)
(t1398 0)
(t1399 0)
(t1400 0)
(t1401 0)
(t1402 0)
(t1403 0)
(t1404 0)
(t1405 0)
(t1406 0)
(t1407 0)
(t1408 0)
(t1409 0)
(t1410 0)
(t1411 0)
(t1412 0)
(t1413 0)
(t1414 0)
(t1415 0)
(t1416 0)
(t1417 0)
(t1418 0)
(t1419 0)
(t1420 0)
(t1421 0)
(t1422 0)
(t1423 0)
(t1424 0)
(t1425 0)
(t1426 0)
(t1427 0)
(t1428 0)
(t1429 0)
(t1430 0)
(t1431 0)
(t1432 0)
(t1433 0)
(t1434 0)
(t1435 0)
(t1436 0)
(t1437 0)
(t1438 0)
(t1439 0)
(t1440 0)
(t1441 0)
(t1442 0)
(t1443 0)
(t1444 0)
(t1445 0)
(t1446 0)
(t1447 0)
(t1448 0)
(t1449 0)
(t1450 0)
(t1451 0)
(t1452 0)
(t1453 0)
(t1454 0)
(t1455 0)
(t1456 0)
(t1457 0)
(t1458 0)
(t1459 0)
(t1460 0)
(t1461 0)
(t1462 0)
(t1463 0)
(t1464 0)
(t1465 0)
(t1466 0)
(t1467 0)
(t1468 0)
(t1469 0)
(t1470 0)
(t1471 0)
(t1472 0)
(t1473 0)
(t1474 0)
(t1475 0)
(t1476 0)
(t1477 0)
(t1478 0)
(t1479 0)
(t1480 0)
(t1481 0)
(t1482 0)
(t1483 0)
(t1484 0)
(t1485 0)
(t1486 0)
(t1487 0)
(t1488 0)
(t1489 0)
(t1490 0)
(t1491 0)
(t1492 0)
(t1493 0)
(t1494 0)
(t1495 0)
(t1496 0)
(t1497 0)
(t1498 0)
(t1499 0)
(t1500 0)
(t1501 0)
(t1502 0)
(t1503 0)
(t1504 0)
(t1505 0)
(t1506 0)
(t1507 0)
(t1508 0)
(t1509 0)
(t1510 0)
(t1511 0)
(t1512 0)
(t1513 0)
(t1514 0)
(t1515 0)
(t1516 0)
(t1517 0)
(t1518 0)
(t1519 0)
(t1520 0)
(t1521 0)
(t1522 0)
(t1523 0)
(t1524 0)
(t1525 0)
(t1526 0)
(t1527 0)
(t1528 0)
(t1529 0)
(t1530 0)
(t1531 0)
(t1532 0)
(t1533 1)
(t1534 0)
(t1535 0)
(t1536 0)
(t1537 3)
(t1538 0)
(t1539 0)
(t1540 0)
(t1541 2)
(t1542 0)
(t1543 0)
(t1544 1)
(t1545 0)
(t1546 0)
(t1547 0)
(t1548 0)
(t1549 0)
(t1550 1)
(t1551 1)
(t1552 0)
(t1553 0)
(t1554 0)
(t1555 0)
(t1556 0)
(t1557 0)
(t1558 0)
(t1559 0)
(t1560 0)
(t1561 0)
(t1562 0)
(t1563 0)
(t1564 0)
(t1565 0)
(t1566 0)
(t1567 0)
(t1568 0)
(t1569 0)
(t1570 0)
(t1571 0)
(t1572 0)
(t1573 0)
(t1574 1)
(t1575 0)
(t1576 0)
(t1577 0)
(t1578 0)
(t1579 0)
(t1580 0)
(t1581 0)
(t1582 0)
(t1583 2)
(t1584 1)
(t1585 1)
(t1586 1)
(t1587 0)
(t1588 0)
(t1589 0)
(t1590 0)
(t1591 0)
(t1592 0)
(t1593 0)
(t1594 0)
(t1595 0)
(t1596 0)
(t1597 0)
(t1598 0)
(t1599 0)
(t1600 0)
(t1601 0)
(t1602 0)
(t1603 0)
(t1604 0)
(t1605 0)
(t1606 0)
(t1607 0)
(t1608 0)
(t1609 1)
(t1610 0)
(t1611 0)
(t1612 0)
(t1613 0)
(t1614 0)
(t1615 0)
(t1616 0)
(t1617 0)
(t1618 0)
(t1619 0)
(t1620 0)
(t1621 0)
(t1622 0)
(t1623 0)
(t1624 0)
(t1625 0)
(t1626 0)
(t1627 0)
(t1628 0)
(t1629 0)
(t1630 0)
(t1631 0)
(t1632 0)
(t1633 0)
(t1634 0)
(t1635 0)
(t1636 0)
(t1637 0)
(t1638 0)
(t1639 0)
(t1640 0)
(t1641 0)
(t1642 0)
(t1643 0)
(t1644 0)
(t1645 0)
(t1646 0)
(t1647 0)
(t1648 0)
(t1649 0)
(t1650 0)
(t1651 0)
(t1652 0)
(t1653 0)
(t1654 0)
(t1655 0)
(t1656 0)
(t1657 0)
(t1658 0)
(t1659 0)
(t1660 0)
(t1661 0)
(t1662 0)
(t1663 0)
(t1664 0)
(t1665 0)
(t1666 0)
(t1667 0)
(t1668 0)
(t1669 0)
(t1670 0)
(t1671 0)
(t1672 0)
(t1673 0)
(t1674 0)
(t1675 0)
(t1676 0)
(t1677 0)
(t1678 0)
(t1679 0)
(t1680 0)
(t1681 0)
(t1682 0)
(t1683 0)
(t1684 0)
(t1685 0)
(t1686 0)
(t1687 0)
(t1688 0)
(t1689 0)
(t1690 0)
(t1691 0)
(t1692 0)
(t1693 0)
(t1694 0)
(t1695 0)
(t1696 0)
(t1697 0)
(t1698 0)
(t1699 0)
(t1700 0)
(t1701 0)
(t1702 0)
(t1703 0)
(t1704 0)
(t1705 0)
(t1706 0)
(t1707 0)
(t1708 0)
(t1709 0)
(t1710 0)
(t1711 0)
(t1712 0)
(t1713 0)
(t1714 0)
(t1715 0)
(t1716 0)
(t1717 0)
(t1718 0)
(t1719 0)
(t1720 0)
(t1721 0)
(t1722 0)
(t1723 0)
(t1724 0)
(t1725 0)
(t1726 0)
(t1727 0)
(t1728 0)
(t1729 0)
(t1730 0)
(t1731 0)
(t1732 0)
(t1733 0)
(t1734 0)
(t1735 0)
(t1736 0)
(t1737 0)
(t1738 0)
(t1739 0)
(t1740 0)
(t1741 0)
(t1742 0)
(t1743 0)
(t1744 0)
(t1745 0)
(t1746 0)
(t1747 0)
(t1748 0)
(t1749 0)
(t1750 0)
(t1751 0)
(t1752 0)
(t1753 0)
(t1754 0)
(t1755 0)
(t1756 0)
(t1757 0)
(t1758 0)
(t1759 0)
(t1760 0)
(t1761 0)
(t1762 0)
(t1763 0)
(t1764 0)
(t1765 0)
(t1766 0)
(t1767 0)
(t1768 0)
(t1769 0)
(t1770 0)
(t1771 0)
(t1772 0)
(t1773 0)
(t1774 0)
(t1775 0)
(t1776 0)
(t1777 0)
(t1778 0)
(t1779 0)
(t1780 0)
(t1781 0)
(t1782 0)
(t1783 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2595/2595 variables, and 757 constraints, problems are : Problem set: 5 solved, 4 unsolved in 5028 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 664/664 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10268ms problems are : Problem set: 5 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 533 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1939
Applied a total of 12 rules in 163 ms. Remains 653 /664 variables (removed 11) and now considering 1939/1940 (removed 1) transitions.
Running 1928 sub problems to find dead transitions.
[2025-06-04 19:55:45] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
// Phase 1: matrix 1930 rows 653 cols
Reachability property PolyORBNT-COL-S10J30-ReachabilityFireability-2025-13 is true.
[2025-06-04 19:55:45] [INFO ] Computed 82 invariants in 87 ms
[2025-06-04 19:55:45] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Reachability property PolyORBNT-COL-S10J30-ReachabilityFireability-2025-06 is true.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Reachability property PolyORBNT-COL-S10J30-ReachabilityFireability-2025-05 is true.
Reachability property PolyORBNT-COL-S10J30-ReachabilityFireability-2025-03 is true.
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :5120 after 233220
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :233220 after 686870
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20054 ms.
Refiners :[Positive P Invariants (semi-flows): 66/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :686870 after 1.59832e+06
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:14] [INFO ] Deduced a trap composed of 12 places in 507 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:15] [INFO ] Deduced a trap composed of 19 places in 459 ms of which 36 ms to minimize.
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 Int declared 642/2583 variables, and 73 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 66/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1001/927 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44029ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 44056ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44259 ms. Remains : 653/664 places, 1939/1940 transitions.
RANDOM walk for 40000 steps (2239 resets) in 1448 ms. (27 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (419 resets) in 667 ms. (59 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (448 resets) in 1286 ms. (31 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (417 resets) in 404 ms. (98 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (418 resets) in 9505 ms. (4 steps per ms) remains 4/4 properties
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :1.59832e+06 after 3.27823e+06
Interrupted probabilistic random walk after 601521 steps, run timeout after 9001 ms. (steps per millisecond=66 ) properties seen :2 out of 4
Probabilistic random walk after 601521 steps, saw 169818 distinct states, run finished after 9005 ms. (steps per millisecond=66 ) properties seen :2
FORMULA PolyORBNT-COL-S10J30-ReachabilityFireability-2025-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA PolyORBNT-COL-S10J30-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2025-06-04 19:56:42] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2025-06-04 19:56:42] [INFO ] Invariant cache hit.
[2025-06-04 19:56:42] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 471/613 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/613 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 32/645 variables, 32/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/645 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/651 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/651 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/652 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/652 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1930/2582 variables, 652/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2582 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2582 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/2583 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2583 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/2583 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2583/2583 variables, and 736 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1731 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 653/653 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 471/613 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/613 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 32/645 variables, 32/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/645 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/651 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/651 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/652 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/652 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1930/2582 variables, 652/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2582 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2582 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/2583 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2583 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/2583 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2583/2583 variables, and 736 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7391 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 653/653 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9143ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA PolyORBNT-COL-S10J30-ReachabilityFireability-2025-00 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 246 ms.
Support contains 110 out of 653 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 653/653 places, 1939/1939 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 2 rules applied. Total rules applied 2 place count 653 transition count 1937
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 651 transition count 1936
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 650 transition count 1936
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 6 place count 650 transition count 1933
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 12 place count 647 transition count 1933
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 645 transition count 1931
Applied a total of 16 rules in 293 ms. Remains 645 /653 variables (removed 8) and now considering 1931/1939 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 293 ms. Remains : 645/653 places, 1931/1939 transitions.
RANDOM walk for 40000 steps (2745 resets) in 1417 ms. (28 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (500 resets) in 903 ms. (44 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 233749 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 1
Probabilistic random walk after 233749 steps, saw 69637 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
[2025-06-04 19:56:55] [INFO ] Flow matrix only has 1922 transitions (discarded 9 similar events)
// Phase 1: matrix 1922 rows 645 cols
[2025-06-04 19:56:55] [INFO ] Computed 82 invariants in 43 ms
[2025-06-04 19:56:55] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 495/605 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/605 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 32/637 variables, 32/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/637 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/643 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/644 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/644 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1922/2566 variables, 644/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2566 variables, 1/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2566 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/2567 variables, 1/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2567 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2567 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2567/2567 variables, and 728 constraints, problems are : Problem set: 0 solved, 1 unsolved in 884 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 645/645 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 495/605 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/605 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 32/637 variables, 32/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/637 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/643 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:56:57] [INFO ] Deduced a trap composed of 141 places in 522 ms of which 82 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/644 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/644 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1922/2566 variables, 644/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2566 variables, 1/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2566 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2567 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2567 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2567 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2567/2567 variables, and 729 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3668 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 645/645 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4626ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 53 ms.
Support contains 110 out of 645 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 1931/1931 transitions.
Applied a total of 0 rules in 49 ms. Remains 645 /645 variables (removed 0) and now considering 1931/1931 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 645/645 places, 1931/1931 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 1931/1931 transitions.
Applied a total of 0 rules in 48 ms. Remains 645 /645 variables (removed 0) and now considering 1931/1931 (removed 0) transitions.
[2025-06-04 19:57:00] [INFO ] Flow matrix only has 1922 transitions (discarded 9 similar events)
[2025-06-04 19:57:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 19:57:01] [INFO ] Implicit Places using invariants in 701 ms returned []
[2025-06-04 19:57:01] [INFO ] Flow matrix only has 1922 transitions (discarded 9 similar events)
[2025-06-04 19:57:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 19:57:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 19:57:05] [INFO ] Implicit Places using invariants and state equation in 3987 ms returned []
Implicit Place search using SMT with State Equation took 4706 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 19:57:05] [INFO ] Redundant transitions in 95 ms returned []
Running 1920 sub problems to find dead transitions.
[2025-06-04 19:57:05] [INFO ] Flow matrix only has 1922 transitions (discarded 9 similar events)
[2025-06-04 19:57:05] [INFO ] Invariant cache hit.
[2025-06-04 19:57:05] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,12 properties remain. new max is 512
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD size :3.27823e+06 after 7.81148e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/635 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 1920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/635 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 1920 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 635/2567 variables, and 72 constraints, problems are : Problem set: 0 solved, 1920 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 67/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/645 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1920/919 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1920 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/635 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 1920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/635 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 1920 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:57:44] [INFO ] Deduced a trap composed of 18 places in 426 ms of which 22 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 635/2567 variables, and 73 constraints, problems are : Problem set: 0 solved, 1920 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 67/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/645 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1001/919 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63545ms problems are : Problem set: 0 solved, 1920 unsolved
Search for dead transitions found 0 dead transitions in 63551ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68417 ms. Remains : 645/645 places, 1931/1931 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 645 transition count 1922
Applied a total of 9 rules in 50 ms. Remains 645 /645 variables (removed 0) and now considering 1922/1931 (removed 9) transitions.
Running SMT prover for 1 properties.
[2025-06-04 19:58:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-04 19:58:08] [INFO ] [Real]Absence check using 76 positive place invariants in 19 ms returned sat
[2025-06-04 19:58:08] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 17 ms returned sat
[2025-06-04 19:58:09] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-04 19:58:09] [INFO ] [Nat]Absence check using 76 positive place invariants in 18 ms returned sat
[2025-06-04 19:58:09] [INFO ] [Nat]Absence check using 76 positive and 6 generalized place invariants in 17 ms returned sat
[2025-06-04 19:58:09] [INFO ] After 781ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 19:58:10] [INFO ] Deduced a trap composed of 141 places in 473 ms of which 56 ms to minimize.
[2025-06-04 19:58:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 623 ms
TRAPS : Iteration 1
[2025-06-04 19:58:10] [INFO ] After 1742ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-04 19:58:12] [INFO ] After 3860ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-04 19:58:13] [INFO ] Flatten gal took : 107 ms
[2025-06-04 19:58:13] [INFO ] Flatten gal took : 105 ms
[2025-06-04 19:58:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1601968038910802924.gal : 19 ms
[2025-06-04 19:58:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15663260155405509840.prop : 0 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1601968038910802924.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15663260155405509840.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality15663260155405509840.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 512
Detected timeout of ITS tools.
[2025-06-04 19:58:28] [INFO ] Flatten gal took : 99 ms
[2025-06-04 19:58:28] [INFO ] Applying decomposition
[2025-06-04 19:58:28] [INFO ] Flatten gal took : 100 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8007292895495599858.txt' '-o' '/tmp/graph8007292895495599858.bin' '-w' '/tmp/graph8007292895495599858.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8007292895495599858.bin' '-l' '-1' '-v' '-w' '/tmp/graph8007292895495599858.weights' '-q' '0' '-e' '0.001'
[2025-06-04 19:58:28] [INFO ] Decomposing Gal with order
[2025-06-04 19:58:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 19:58:29] [INFO ] Removed a total of 4215 redundant transitions.
[2025-06-04 19:58:29] [INFO ] Flatten gal took : 295 ms
[2025-06-04 19:58:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 519 labels/synchronizations in 63 ms.
[2025-06-04 19:58:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15272440943489469101.gal : 20 ms
[2025-06-04 19:58:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6438376499121151329.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15272440943489469101.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6438376499121151329.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality6438376499121151329.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1024
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1024 after 1024
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1024 after 1024
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1024 after 1024
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1024 after 1024
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1024 after 1024
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 35646 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-04 19:58:44] [INFO ] Flatten gal took : 101 ms
[2025-06-04 19:58:44] [INFO ] Applying decomposition
[2025-06-04 19:58:44] [INFO ] Flatten gal took : 101 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15763179312682484588.txt' '-o' '/tmp/graph15763179312682484588.bin' '-w' '/tmp/graph15763179312682484588.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15763179312682484588.bin' '-l' '-1' '-v' '-w' '/tmp/graph15763179312682484588.weights' '-q' '0' '-e' '0.001'
[2025-06-04 19:58:45] [INFO ] Decomposing Gal with order
[2025-06-04 19:58:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 19:58:45] [INFO ] Removed a total of 4202 redundant transitions.
[2025-06-04 19:58:45] [INFO ] Flatten gal took : 208 ms
[2025-06-04 19:58:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 401 labels/synchronizations in 43 ms.
[2025-06-04 19:58:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12827676660246116881.gal : 11 ms
[2025-06-04 19:58:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11712164076589063516.prop : 0 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12827676660246116881.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11712164076589063516.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality11712164076589063516.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2048
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2048 after 3072
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3072 after 8321
Detected timeout of ITS tools.
[2025-06-04 20:28:45] [INFO ] Flatten gal took : 87 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13105990071479054696
[2025-06-04 20:28:46] [INFO ] Too many transitions (1931) to apply POR reductions. Disabling POR matrices.
[2025-06-04 20:28:46] [INFO ] Applying decomposition
[2025-06-04 20:28:46] [INFO ] Flatten gal took : 110 ms
[2025-06-04 20:28:46] [INFO ] Built C files in 124ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13105990071479054696
Running compilation step : cd /tmp/ltsmin13105990071479054696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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.202505121319/bin/convert-linux64' '-i' '/tmp/graph13385955872338612505.txt' '-o' '/tmp/graph13385955872338612505.bin' '-w' '/tmp/graph13385955872338612505.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13385955872338612505.bin' '-l' '-1' '-v' '-w' '/tmp/graph13385955872338612505.weights' '-q' '0' '-e' '0.001'
[2025-06-04 20:28:46] [INFO ] Decomposing Gal with order
[2025-06-04 20:28:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 20:28:46] [INFO ] Removed a total of 4526 redundant transitions.
[2025-06-04 20:28:46] [INFO ] Flatten gal took : 273 ms
[2025-06-04 20:28:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 517 labels/synchronizations in 61 ms.
[2025-06-04 20:28:46] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability8274647628267889874.gal : 29 ms
[2025-06-04 20:28:46] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7756207238401730347.prop : 0 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability8274647628267889874.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7756207238401730347.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityFireability7756207238401730347.prop.
Compilation finished in 6191 ms.
Running link step : cd /tmp/ltsmin13105990071479054696;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin13105990071479054696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'PolyORBNTCOLS10J30ReachabilityFireability202507==true'
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4097
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4097 after 4102
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4102 after 4109
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :4109 after 1.06509e+08
BK_TIME_CONFINEMENT_REACHED
--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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="PolyORBNT-COL-S10J30"
export BK_EXAMINATION="ReachabilityFireability"
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-5832"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S10J30, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881254300607"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J30.tgz
mv PolyORBNT-COL-S10J30 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;