Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007400148.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 FunctionPointer-PT-c032, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007400148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 4.2M 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 FunctionPointer-PT-c032-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c032-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748870132613

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c032
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 13:15:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 13:15:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 13:15:36] [INFO ] Load time of PNML (sax parser for PT used): 921 ms
[2025-06-02 13:15:36] [INFO ] Transformed 2826 places.
[2025-06-02 13:15:36] [INFO ] Transformed 8960 transitions.
[2025-06-02 13:15:36] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 1194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1198 places in 62 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c032-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-c032-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 299 places :
Symmetric choice reduction at 1 with 299 rule applications. Total rules 316 place count 1312 transition count 3710
Iterating global reduction 1 with 299 rules applied. Total rules applied 615 place count 1312 transition count 3710
Ensure Unique test removed 382 transitions
Reduce isomorphic transitions removed 382 transitions.
Iterating post reduction 1 with 382 rules applied. Total rules applied 997 place count 1312 transition count 3328
Discarding 154 places :
Symmetric choice reduction at 2 with 154 rule applications. Total rules 1151 place count 1158 transition count 3020
Iterating global reduction 2 with 154 rules applied. Total rules applied 1305 place count 1158 transition count 3020
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 2 with 76 rules applied. Total rules applied 1381 place count 1158 transition count 2944
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1395 place count 1144 transition count 2916
Iterating global reduction 3 with 14 rules applied. Total rules applied 1409 place count 1144 transition count 2916
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1423 place count 1130 transition count 2888
Iterating global reduction 3 with 14 rules applied. Total rules applied 1437 place count 1130 transition count 2888
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1451 place count 1116 transition count 2860
Iterating global reduction 3 with 14 rules applied. Total rules applied 1465 place count 1116 transition count 2860
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1479 place count 1102 transition count 2832
Iterating global reduction 3 with 14 rules applied. Total rules applied 1493 place count 1102 transition count 2832
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1507 place count 1088 transition count 2804
Iterating global reduction 3 with 14 rules applied. Total rules applied 1521 place count 1088 transition count 2804
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1535 place count 1074 transition count 2776
Iterating global reduction 3 with 14 rules applied. Total rules applied 1549 place count 1074 transition count 2776
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1563 place count 1060 transition count 2748
Iterating global reduction 3 with 14 rules applied. Total rules applied 1577 place count 1060 transition count 2748
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 1634 place count 1003 transition count 2534
Iterating global reduction 3 with 57 rules applied. Total rules applied 1691 place count 1003 transition count 2534
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 1747 place count 947 transition count 2310
Iterating global reduction 3 with 56 rules applied. Total rules applied 1803 place count 947 transition count 2310
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 1858 place count 892 transition count 2186
Iterating global reduction 3 with 55 rules applied. Total rules applied 1913 place count 892 transition count 2186
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1967 place count 838 transition count 2078
Iterating global reduction 3 with 54 rules applied. Total rules applied 2021 place count 838 transition count 2078
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2074 place count 785 transition count 1972
Iterating global reduction 3 with 53 rules applied. Total rules applied 2127 place count 785 transition count 1972
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2180 place count 732 transition count 1866
Iterating global reduction 3 with 53 rules applied. Total rules applied 2233 place count 732 transition count 1866
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2286 place count 679 transition count 1760
Iterating global reduction 3 with 53 rules applied. Total rules applied 2339 place count 679 transition count 1760
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2346 place count 672 transition count 1746
Iterating global reduction 3 with 7 rules applied. Total rules applied 2353 place count 672 transition count 1746
Applied a total of 2353 rules in 2500 ms. Remains 672 /1628 variables (removed 956) and now considering 1746/5962 (removed 4216) transitions.
[2025-06-02 13:15:39] [INFO ] Flow matrix only has 1176 transitions (discarded 570 similar events)
// Phase 1: matrix 1176 rows 672 cols
[2025-06-02 13:15:39] [INFO ] Computed 2 invariants in 55 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:15:40] [INFO ] Implicit Places using invariants in 1227 ms returned []
[2025-06-02 13:15:40] [INFO ] Flow matrix only has 1176 transitions (discarded 570 similar events)
[2025-06-02 13:15:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:15:41] [INFO ] State equation strengthened by 291 read => feed constraints.
[2025-06-02 13:15:44] [INFO ] Implicit Places using invariants and state equation in 4418 ms returned []
Implicit Place search using SMT with State Equation took 5722 ms to find 0 implicit places.
Running 1744 sub problems to find dead transitions.
[2025-06-02 13:15:45] [INFO ] Flow matrix only has 1176 transitions (discarded 570 similar events)
[2025-06-02 13:15:45] [INFO ] Invariant cache hit.
[2025-06-02 13:15:45] [INFO ] State equation strengthened by 291 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 1.0)
(s189 0.0)
(s190 1.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/672 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1744 unsolved
SMT process timed out in 35479ms, After SMT, problems are : Problem set: 0 solved, 1744 unsolved
Search for dead transitions found 0 dead transitions in 35525ms
Starting structural reductions in LTL mode, iteration 1 : 672/1628 places, 1746/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43790 ms. Remains : 672/1628 places, 1746/5962 transitions.
Support contains 19 out of 672 places after structural reductions.
[2025-06-02 13:16:21] [INFO ] Flatten gal took : 304 ms
[2025-06-02 13:16:21] [INFO ] Flatten gal took : 192 ms
[2025-06-02 13:16:21] [INFO ] Input system was already deterministic with 1746 transitions.
RANDOM walk for 40038 steps (8 resets) in 1775 ms. (22 steps per ms) remains 13/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (17 resets) in 349 ms. (114 steps per ms) remains 10/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 189 ms. (210 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (16 resets) in 496 ms. (80 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 7/7 properties
[2025-06-02 13:16:22] [INFO ] Flow matrix only has 1176 transitions (discarded 570 similar events)
[2025-06-02 13:16:22] [INFO ] Invariant cache hit.
[2025-06-02 13:16:22] [INFO ] State equation strengthened by 291 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 19/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 605/635 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/635 variables, 12/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/635 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1001/1636 variables, 494/537 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1636 variables, 279/816 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1636 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 62/1698 variables, 1/817 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1698 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 149/1847 variables, 147/964 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1847 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 1/1848 variables, 1/965 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1848 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/1848 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1848/1848 variables, and 965 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2985 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 672/672 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 19/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 605/635 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/635 variables, 12/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/635 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1001/1636 variables, 494/537 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1636 variables, 279/816 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1636 variables, 7/823 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1636 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 62/1698 variables, 1/824 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:30] [INFO ] Deduced a trap along path composed of 3 places in 102 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:30] [INFO ] Deduced a trap along path composed of 3 places in 95 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:30] [INFO ] Deduced a trap along path composed of 3 places in 88 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:30] [INFO ] Deduced a trap along path composed of 3 places in 76 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:30] [INFO ] Deduced a trap along path composed of 3 places in 94 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:30] [INFO ] Deduced a trap along path composed of 3 places in 81 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:31] [INFO ] Deduced a trap along path composed of 3 places in 69 ms of which 2 ms to minimize.
SMT process timed out in 8176ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 2 properties in 1452 ms.
Support contains 7 out of 672 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 672/672 places, 1746/1746 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 667 transition count 1732
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 667 transition count 1732
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 662 transition count 1720
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 662 transition count 1720
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 657 transition count 1708
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 657 transition count 1708
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 653 transition count 1698
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 653 transition count 1698
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 649 transition count 1690
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 649 transition count 1690
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 646 transition count 1684
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 646 transition count 1684
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 644 transition count 1680
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 644 transition count 1680
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 643 transition count 1678
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 643 transition count 1678
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 642 transition count 1676
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 642 transition count 1676
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 70 place count 642 transition count 1666
Applied a total of 70 rules in 596 ms. Remains 642 /672 variables (removed 30) and now considering 1666/1746 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 597 ms. Remains : 642/672 places, 1666/1746 transitions.
RANDOM walk for 40020 steps (8 resets) in 263 ms. (151 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (17 resets) in 125 ms. (317 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 154144 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 5
Probabilistic random walk after 154144 steps, saw 100070 distinct states, run finished after 3007 ms. (steps per millisecond=51 ) properties seen :0
[2025-06-02 13:16:36] [INFO ] Flow matrix only has 1117 transitions (discarded 549 similar events)
// Phase 1: matrix 1117 rows 642 cols
[2025-06-02 13:16:36] [INFO ] Computed 2 invariants in 10 ms
[2025-06-02 13:16:36] [INFO ] State equation strengthened by 277 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 372/392 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1164/1556 variables, 481/509 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1556 variables, 270/779 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1556 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 62/1618 variables, 1/780 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1618 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 141/1759 variables, 141/921 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1759 variables, 0/921 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/1759 variables, 0/921 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1759/1759 variables, and 921 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1787 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 642/642 constraints, ReadFeed: 277/277 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 372/392 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1164/1556 variables, 481/509 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1556 variables, 270/779 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1556 variables, 5/784 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1556 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 62/1618 variables, 1/785 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1618 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 141/1759 variables, 141/926 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:41] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:41] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:41] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:42] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:42] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:42] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1759 variables, 6/932 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1759 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/1759 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1759/1759 variables, and 932 constraints, problems are : Problem set: 0 solved, 5 unsolved in 7757 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 642/642 constraints, ReadFeed: 277/277 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 9603ms problems are : Problem set: 0 solved, 5 unsolved
Finished Parikh walk after 33889 steps, including 165 resets, run visited all 1 properties in 116 ms. (steps per millisecond=292 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 3 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 1246 ms.
FORMULA FunctionPointer-PT-c032-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FunctionPointer-PT-c032-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 192 stabilizing places and 512 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(!p0) U ((X(!p0)&&(p0||X(!p1)))||X(G(!p0))))))'
Support contains 3 out of 672 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 672/672 places, 1746/1746 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 664 transition count 1726
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 664 transition count 1726
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 656 transition count 1706
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 656 transition count 1706
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 648 transition count 1684
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 648 transition count 1684
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 641 transition count 1666
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 641 transition count 1666
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 635 transition count 1654
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 635 transition count 1654
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 630 transition count 1644
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 630 transition count 1644
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 626 transition count 1636
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 626 transition count 1636
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 95 place count 623 transition count 1630
Iterating global reduction 0 with 3 rules applied. Total rules applied 98 place count 623 transition count 1630
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 100 place count 621 transition count 1626
Iterating global reduction 0 with 2 rules applied. Total rules applied 102 place count 621 transition count 1626
Applied a total of 102 rules in 265 ms. Remains 621 /672 variables (removed 51) and now considering 1626/1746 (removed 120) transitions.
[2025-06-02 13:16:47] [INFO ] Flow matrix only has 1086 transitions (discarded 540 similar events)
// Phase 1: matrix 1086 rows 621 cols
[2025-06-02 13:16:47] [INFO ] Computed 2 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:16:48] [INFO ] Implicit Places using invariants in 856 ms returned []
[2025-06-02 13:16:48] [INFO ] Flow matrix only has 1086 transitions (discarded 540 similar events)
[2025-06-02 13:16:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:16:49] [INFO ] State equation strengthened by 268 read => feed constraints.
[2025-06-02 13:16:52] [INFO ] Implicit Places using invariants and state equation in 3738 ms returned []
Implicit Place search using SMT with State Equation took 4598 ms to find 0 implicit places.
Running 1624 sub problems to find dead transitions.
[2025-06-02 13:16:52] [INFO ] Flow matrix only has 1086 transitions (discarded 540 similar events)
[2025-06-02 13:16:52] [INFO ] Invariant cache hit.
[2025-06-02 13:16:52] [INFO ] State equation strengthened by 268 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1624 unsolved
SMT process timed out in 34411ms, After SMT, problems are : Problem set: 0 solved, 1624 unsolved
Search for dead transitions found 0 dead transitions in 34418ms
Starting structural reductions in LTL mode, iteration 1 : 621/672 places, 1626/1746 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39288 ms. Remains : 621/672 places, 1626/1746 transitions.
Stuttering acceptance computed with spot in 535 ms :[true, p0, p0, p0, p0]
Running random walk in product with property : FunctionPointer-PT-c032-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 1610 ms.
Product exploration explored 100000 steps with 33333 reset in 1003 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 20 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c032-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c032-LTLFireability-03 finished in 42616 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X((X(p0) U p1)))))'
Support contains 2 out of 672 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 672/672 places, 1746/1746 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 664 transition count 1726
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 664 transition count 1726
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 656 transition count 1704
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 656 transition count 1704
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 648 transition count 1682
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 648 transition count 1682
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 641 transition count 1664
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 641 transition count 1664
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 635 transition count 1652
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 635 transition count 1652
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 630 transition count 1642
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 630 transition count 1642
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 89 place count 625 transition count 1632
Iterating global reduction 0 with 5 rules applied. Total rules applied 94 place count 625 transition count 1632
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 97 place count 622 transition count 1626
Iterating global reduction 0 with 3 rules applied. Total rules applied 100 place count 622 transition count 1626
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 102 place count 620 transition count 1622
Iterating global reduction 0 with 2 rules applied. Total rules applied 104 place count 620 transition count 1622
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 110 place count 620 transition count 1616
Applied a total of 110 rules in 582 ms. Remains 620 /672 variables (removed 52) and now considering 1616/1746 (removed 130) transitions.
[2025-06-02 13:17:30] [INFO ] Flow matrix only has 1081 transitions (discarded 535 similar events)
// Phase 1: matrix 1081 rows 620 cols
[2025-06-02 13:17:30] [INFO ] Computed 2 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:17:31] [INFO ] Implicit Places using invariants in 891 ms returned []
[2025-06-02 13:17:31] [INFO ] Flow matrix only has 1081 transitions (discarded 535 similar events)
[2025-06-02 13:17:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:17:32] [INFO ] State equation strengthened by 268 read => feed constraints.
[2025-06-02 13:17:35] [INFO ] Implicit Places using invariants and state equation in 3403 ms returned []
Implicit Place search using SMT with State Equation took 4298 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:17:35] [INFO ] Redundant transitions in 133 ms returned []
Running 1614 sub problems to find dead transitions.
[2025-06-02 13:17:35] [INFO ] Flow matrix only has 1081 transitions (discarded 535 similar events)
[2025-06-02 13:17:35] [INFO ] Invariant cache hit.
[2025-06-02 13:17:35] [INFO ] State equation strengthened by 268 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1701 variables, and 2 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 30091 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/620 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1614/1614 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1614 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/1701 variables, and 2 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/620 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 0/1614 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63812ms problems are : Problem set: 0 solved, 1614 unsolved
Search for dead transitions found 0 dead transitions in 63818ms
Starting structural reductions in SI_LTL mode, iteration 1 : 620/672 places, 1616/1746 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68841 ms. Remains : 620/672 places, 1616/1746 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c032-LTLFireability-06
Stuttering criterion allowed to conclude after 96 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-c032-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c032-LTLFireability-06 finished in 68965 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U (G((p0 U p1))&&X(X(X(p2)))))))'
Support contains 6 out of 672 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 672/672 places, 1746/1746 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 664 transition count 1724
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 664 transition count 1724
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 656 transition count 1702
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 656 transition count 1702
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 648 transition count 1678
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 648 transition count 1678
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 641 transition count 1658
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 641 transition count 1658
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 69 place count 634 transition count 1644
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 634 transition count 1644
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 83 place count 627 transition count 1630
Iterating global reduction 0 with 7 rules applied. Total rules applied 90 place count 627 transition count 1630
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 96 place count 621 transition count 1618
Iterating global reduction 0 with 6 rules applied. Total rules applied 102 place count 621 transition count 1618
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 106 place count 617 transition count 1610
Iterating global reduction 0 with 4 rules applied. Total rules applied 110 place count 617 transition count 1610
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 113 place count 614 transition count 1604
Iterating global reduction 0 with 3 rules applied. Total rules applied 116 place count 614 transition count 1604
Applied a total of 116 rules in 244 ms. Remains 614 /672 variables (removed 58) and now considering 1604/1746 (removed 142) transitions.
[2025-06-02 13:18:39] [INFO ] Flow matrix only has 1074 transitions (discarded 530 similar events)
// Phase 1: matrix 1074 rows 614 cols
[2025-06-02 13:18:39] [INFO ] Computed 2 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:18:40] [INFO ] Implicit Places using invariants in 980 ms returned []
[2025-06-02 13:18:40] [INFO ] Flow matrix only has 1074 transitions (discarded 530 similar events)
[2025-06-02 13:18:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:18:40] [INFO ] State equation strengthened by 268 read => feed constraints.
[2025-06-02 13:18:44] [INFO ] Implicit Places using invariants and state equation in 3983 ms returned []
Implicit Place search using SMT with State Equation took 4970 ms to find 0 implicit places.
Running 1602 sub problems to find dead transitions.
[2025-06-02 13:18:44] [INFO ] Flow matrix only has 1074 transitions (discarded 530 similar events)
[2025-06-02 13:18:44] [INFO ] Invariant cache hit.
[2025-06-02 13:18:44] [INFO ] State equation strengthened by 268 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
SMT process timed out in 33856ms, After SMT, problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 33862ms
Starting structural reductions in LTL mode, iteration 1 : 614/672 places, 1604/1746 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39086 ms. Remains : 614/672 places, 1604/1746 transitions.
Stuttering acceptance computed with spot in 1848 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p2), true, (NOT p1), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-c032-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c032-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c032-LTLFireability-07 finished in 41011 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 672 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 672/672 places, 1746/1746 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 663 transition count 1724
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 663 transition count 1724
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 654 transition count 1702
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 654 transition count 1702
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 645 transition count 1676
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 645 transition count 1676
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 62 place count 637 transition count 1654
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 637 transition count 1654
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 630 transition count 1640
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 630 transition count 1640
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 90 place count 624 transition count 1628
Iterating global reduction 0 with 6 rules applied. Total rules applied 96 place count 624 transition count 1628
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 101 place count 619 transition count 1618
Iterating global reduction 0 with 5 rules applied. Total rules applied 106 place count 619 transition count 1618
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 110 place count 615 transition count 1610
Iterating global reduction 0 with 4 rules applied. Total rules applied 114 place count 615 transition count 1610
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 117 place count 612 transition count 1604
Iterating global reduction 0 with 3 rules applied. Total rules applied 120 place count 612 transition count 1604
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 122 place count 612 transition count 1602
Applied a total of 122 rules in 645 ms. Remains 612 /672 variables (removed 60) and now considering 1602/1746 (removed 144) transitions.
[2025-06-02 13:19:20] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 612 cols
[2025-06-02 13:19:20] [INFO ] Computed 2 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:19:21] [INFO ] Implicit Places using invariants in 780 ms returned []
[2025-06-02 13:19:21] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2025-06-02 13:19:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:19:22] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-02 13:19:27] [INFO ] Implicit Places using invariants and state equation in 6356 ms returned []
Implicit Place search using SMT with State Equation took 7139 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:19:28] [INFO ] Redundant transitions in 214 ms returned []
Running 1600 sub problems to find dead transitions.
[2025-06-02 13:19:28] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2025-06-02 13:19:28] [INFO ] Invariant cache hit.
[2025-06-02 13:19:28] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
SMT process timed out in 33926ms, After SMT, problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 33935ms
Starting structural reductions in SI_LTL mode, iteration 1 : 612/672 places, 1602/1746 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41960 ms. Remains : 612/672 places, 1602/1746 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c032-LTLFireability-11
Stuttering criterion allowed to conclude after 250 steps with 0 reset in 5 ms.
FORMULA FunctionPointer-PT-c032-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c032-LTLFireability-11 finished in 42050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||G((F(p2)||(F(!p0)&&F(!p3))||p1)))))'
Support contains 5 out of 672 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 672/672 places, 1746/1746 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 665 transition count 1726
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 665 transition count 1726
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 658 transition count 1708
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 658 transition count 1708
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 651 transition count 1690
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 651 transition count 1690
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 644 transition count 1672
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 644 transition count 1672
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 638 transition count 1660
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 638 transition count 1660
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 633 transition count 1650
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 633 transition count 1650
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 629 transition count 1642
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 629 transition count 1642
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 627 transition count 1638
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 627 transition count 1638
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 625 transition count 1634
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 625 transition count 1634
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 100 place count 625 transition count 1628
Applied a total of 100 rules in 752 ms. Remains 625 /672 variables (removed 47) and now considering 1628/1746 (removed 118) transitions.
[2025-06-02 13:20:02] [INFO ] Flow matrix only has 1090 transitions (discarded 538 similar events)
// Phase 1: matrix 1090 rows 625 cols
[2025-06-02 13:20:03] [INFO ] Computed 2 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:20:03] [INFO ] Implicit Places using invariants in 868 ms returned []
[2025-06-02 13:20:03] [INFO ] Flow matrix only has 1090 transitions (discarded 538 similar events)
[2025-06-02 13:20:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:20:04] [INFO ] State equation strengthened by 270 read => feed constraints.
[2025-06-02 13:20:07] [INFO ] Implicit Places using invariants and state equation in 3762 ms returned []
Implicit Place search using SMT with State Equation took 4632 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:20:07] [INFO ] Redundant transitions in 62 ms returned []
Running 1626 sub problems to find dead transitions.
[2025-06-02 13:20:07] [INFO ] Flow matrix only has 1090 transitions (discarded 538 similar events)
[2025-06-02 13:20:07] [INFO ] Invariant cache hit.
[2025-06-02 13:20:07] [INFO ] State equation strengthened by 270 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
SMT process timed out in 34228ms, After SMT, problems are : Problem set: 0 solved, 1626 unsolved
Search for dead transitions found 0 dead transitions in 34234ms
Starting structural reductions in SI_LTL mode, iteration 1 : 625/672 places, 1628/1746 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39691 ms. Remains : 625/672 places, 1628/1746 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-c032-LTLFireability-12
Product exploration explored 100000 steps with 90 reset in 1608 ms.
Product exploration explored 100000 steps with 188 reset in 1330 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 132 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 40017 steps (8 resets) in 324 ms. (123 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 136124 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 5
Probabilistic random walk after 136124 steps, saw 88376 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
[2025-06-02 13:20:48] [INFO ] Flow matrix only has 1090 transitions (discarded 538 similar events)
[2025-06-02 13:20:48] [INFO ] Invariant cache hit.
[2025-06-02 13:20:48] [INFO ] State equation strengthened by 270 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
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 547/552 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/552 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf2 is UNSAT
At refinement iteration 4 (OVERLAPS) 950/1502 variables, 479/485 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1502 variables, 1/486 constraints. Problems are: Problem set: 1 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1502 variables, 269/755 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1502 variables, 0/755 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 62/1564 variables, 1/756 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1564 variables, 0/756 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 142/1706 variables, 135/891 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1706 variables, 0/891 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 8/1714 variables, 5/896 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1714 variables, 0/896 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/1715 variables, 1/897 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1715 variables, 0/897 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1715 variables, 0/897 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1715/1715 variables, and 897 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1376 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 625/625 constraints, ReadFeed: 270/270 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 547/552 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/552 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 950/1502 variables, 479/485 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1502 variables, 1/486 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1502 variables, 269/755 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1502 variables, 3/758 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1502 variables, 0/758 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 62/1564 variables, 1/759 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:52] [INFO ] Deduced a trap composed of 131 places in 319 ms of which 13 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1564 variables, 1/760 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:53] [INFO ] Deduced a trap along path composed of 3 places in 99 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:53] [INFO ] Deduced a trap along path composed of 3 places in 103 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:53] [INFO ] Deduced a trap along path composed of 3 places in 103 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:53] [INFO ] Deduced a trap along path composed of 3 places in 108 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:54] [INFO ] Deduced a trap along path composed of 3 places in 90 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:54] [INFO ] Deduced a trap along path composed of 3 places in 99 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:54] [INFO ] Deduced a trap along path composed of 3 places in 94 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:54] [INFO ] Deduced a trap along path composed of 3 places in 78 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:54] [INFO ] Deduced a trap along path composed of 3 places in 78 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:54] [INFO ] Deduced a trap along path composed of 3 places in 96 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:54] [INFO ] Deduced a trap along path composed of 3 places in 83 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1564/1715 variables, and 771 constraints, problems are : Problem set: 1 solved, 4 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 484/625 constraints, ReadFeed: 270/270 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 11/11 constraints]
After SMT, in 6433ms problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 625 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 625/625 places, 1628/1628 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 624 transition count 1626
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 624 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 623 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 623 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 622 transition count 1620
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 622 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 621 transition count 1618
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 621 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 620 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 620 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 619 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 619 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 618 transition count 1612
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 618 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 617 transition count 1610
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 617 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 616 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 616 transition count 1608
Applied a total of 18 rules in 458 ms. Remains 616 /625 variables (removed 9) and now considering 1608/1628 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 459 ms. Remains : 616/625 places, 1608/1628 transitions.
RANDOM walk for 40061 steps (8 resets) in 290 ms. (137 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 85 ms. (465 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 148837 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 4
Probabilistic random walk after 148837 steps, saw 96626 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
[2025-06-02 13:20:58] [INFO ] Flow matrix only has 1076 transitions (discarded 532 similar events)
// Phase 1: matrix 1076 rows 616 cols
[2025-06-02 13:20:58] [INFO ] Computed 2 invariants in 6 ms
[2025-06-02 13:20:58] [INFO ] State equation strengthened by 267 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 541/546 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/546 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 941/1487 variables, 474/480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1487 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1487 variables, 266/747 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1487 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 62/1549 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1549 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 137/1686 variables, 133/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1686 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 5/1691 variables, 3/884 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1691 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/1692 variables, 1/885 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1692 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1692 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1692/1692 variables, and 885 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1689 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 616/616 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 541/546 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/546 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 941/1487 variables, 474/480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1487 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1487 variables, 266/747 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1487 variables, 3/750 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1487 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 62/1549 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:02] [INFO ] Deduced a trap composed of 131 places in 191 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1549 variables, 1/752 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:03] [INFO ] Deduced a trap along path composed of 3 places in 113 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:03] [INFO ] Deduced a trap along path composed of 3 places in 102 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:03] [INFO ] Deduced a trap along path composed of 3 places in 115 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:04] [INFO ] Deduced a trap along path composed of 3 places in 98 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:04] [INFO ] Deduced a trap along path composed of 3 places in 105 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:04] [INFO ] Deduced a trap along path composed of 3 places in 106 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:04] [INFO ] Deduced a trap along path composed of 3 places in 107 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:04] [INFO ] Deduced a trap along path composed of 3 places in 89 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:04] [INFO ] Deduced a trap along path composed of 3 places in 87 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:05] [INFO ] Deduced a trap along path composed of 3 places in 82 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:05] [INFO ] Deduced a trap along path composed of 3 places in 94 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:05] [INFO ] Deduced a trap along path composed of 3 places in 80 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:05] [INFO ] Deduced a trap along path composed of 3 places in 78 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:05] [INFO ] Deduced a trap along path composed of 3 places in 75 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:05] [INFO ] Deduced a trap along path composed of 3 places in 72 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:06] [INFO ] Deduced a trap along path composed of 3 places in 82 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:06] [INFO ] Deduced a trap along path composed of 3 places in 68 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:06] [INFO ] Deduced a trap along path composed of 3 places in 78 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:06] [INFO ] Deduced a trap along path composed of 3 places in 70 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:06] [INFO ] Deduced a trap along path composed of 3 places in 63 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1549 variables, 20/772 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:07] [INFO ] Deduced a trap along path composed of 3 places in 59 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:07] [INFO ] Deduced a trap along path composed of 3 places in 61 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:07] [INFO ] Deduced a trap along path composed of 3 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:07] [INFO ] Deduced a trap along path composed of 3 places in 53 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:07] [INFO ] Deduced a trap along path composed of 3 places in 56 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:08] [INFO ] Deduced a trap along path composed of 3 places in 50 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:08] [INFO ] Deduced a trap along path composed of 3 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:08] [INFO ] Deduced a trap along path composed of 3 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:08] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:08] [INFO ] Deduced a trap along path composed of 3 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:08] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:08] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:08] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:09] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:09] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:09] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:09] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:09] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1549 variables, 18/790 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1549 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 137/1686 variables, 133/923 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1686 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 5/1691 variables, 3/926 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1691 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 1/1692 variables, 1/927 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1692 variables, 0/927 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1692 variables, 0/927 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1692/1692 variables, and 927 constraints, problems are : Problem set: 0 solved, 4 unsolved in 17510 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 616/616 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 38/38 constraints]
After SMT, in 19232ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 837 ms.
Support contains 2 out of 616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 1608/1608 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 615 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 615 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 614 transition count 1604
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 614 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 613 transition count 1602
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 613 transition count 1602
Applied a total of 6 rules in 160 ms. Remains 613 /616 variables (removed 3) and now considering 1602/1608 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 613/616 places, 1602/1608 transitions.
RANDOM walk for 40020 steps (8 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 345183 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 1
Probabilistic random walk after 345183 steps, saw 224054 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
[2025-06-02 13:21:22] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2025-06-02 13:21:22] [INFO ] Computed 2 invariants in 10 ms
[2025-06-02 13:21:22] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1537 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1537 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1538 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 139/1677 variables, 135/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/1683 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1683 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1683 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1683/1683 variables, and 880 constraints, problems are : Problem set: 0 solved, 1 unsolved in 994 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1475 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1537 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:27] [INFO ] Deduced a trap along path composed of 3 places in 69 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:27] [INFO ] Deduced a trap along path composed of 3 places in 64 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:28] [INFO ] Deduced a trap along path composed of 3 places in 94 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:28] [INFO ] Deduced a trap along path composed of 3 places in 90 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:28] [INFO ] Deduced a trap along path composed of 3 places in 103 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:29] [INFO ] Deduced a trap along path composed of 3 places in 86 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:29] [INFO ] Deduced a trap along path composed of 3 places in 85 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:29] [INFO ] Deduced a trap along path composed of 3 places in 99 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:30] [INFO ] Deduced a trap along path composed of 3 places in 83 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:30] [INFO ] Deduced a trap along path composed of 3 places in 69 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:31] [INFO ] Deduced a trap along path composed of 3 places in 86 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:31] [INFO ] Deduced a trap along path composed of 3 places in 66 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:31] [INFO ] Deduced a trap along path composed of 3 places in 62 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:31] [INFO ] Deduced a trap along path composed of 3 places in 50 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:32] [INFO ] Deduced a trap along path composed of 3 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:32] [INFO ] Deduced a trap along path composed of 3 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:32] [INFO ] Deduced a trap along path composed of 3 places in 58 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:32] [INFO ] Deduced a trap along path composed of 3 places in 58 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:33] [INFO ] Deduced a trap along path composed of 3 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:33] [INFO ] Deduced a trap along path composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1537 variables, 20/760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:33] [INFO ] Deduced a trap along path composed of 3 places in 51 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:34] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:34] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:34] [INFO ] Deduced a trap along path composed of 3 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:35] [INFO ] Deduced a trap along path composed of 3 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:35] [INFO ] Deduced a trap along path composed of 3 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:35] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:35] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:36] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:36] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:36] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:36] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:36] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:37] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:37] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1537 variables, 15/775 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1537 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/1538 variables, 1/776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1538 variables, 1/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1538 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 139/1677 variables, 135/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1677 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/1682 variables, 3/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1682 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/1683 variables, 1/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1683 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1683 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 916 constraints, problems are : Problem set: 0 solved, 1 unsolved in 18106 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 35/35 constraints]
After SMT, in 19131ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 380 ms.
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1602/1602 transitions.
Applied a total of 0 rules in 169 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1602 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 613/613 places, 1602/1602 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1602/1602 transitions.
Applied a total of 0 rules in 168 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1602 (removed 0) transitions.
[2025-06-02 13:21:41] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2025-06-02 13:21:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:21:43] [INFO ] Implicit Places using invariants in 1175 ms returned []
[2025-06-02 13:21:43] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2025-06-02 13:21:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:21:43] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-02 13:21:47] [INFO ] Implicit Places using invariants and state equation in 4274 ms returned []
Implicit Place search using SMT with State Equation took 5452 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:21:47] [INFO ] Redundant transitions in 51 ms returned []
Running 1600 sub problems to find dead transitions.
[2025-06-02 13:21:47] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2025-06-02 13:21:47] [INFO ] Invariant cache hit.
[2025-06-02 13:21:47] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
SMT process timed out in 33115ms, After SMT, problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 33121ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38803 ms. Remains : 613/613 places, 1602/1602 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 942 edges and 613 vertex of which 192 / 613 are part of one of the 64 SCC in 5 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 404 transitions
Reduce isomorphic transitions removed 724 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 485 transition count 868
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 475 transition count 868
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 475 transition count 795
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 167 place count 402 transition count 795
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 339 transition count 732
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 339 transition count 732
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 339 transition count 606
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 673 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 148 transition count 351
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 85 transition count 224
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 22 transition count 98
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 22 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 20 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1122 place count 20 transition count 32
Applied a total of 1122 rules in 125 ms. Remains 20 /613 variables (removed 593) and now considering 32/1602 (removed 1570) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 32 rows 20 cols
[2025-06-02 13:22:20] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 13:22:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 13:22:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 13:22:20] [INFO ] After 18ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-02 13:22:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 13:22:20] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 13:22:20] [INFO ] After 70ms 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-02 13:22:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 13:22:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 13:22:20] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-02 13:22:20] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 13:22:20] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 13:22:20] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 275 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (G (OR p2 (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p2 (NOT p0) (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 18 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c032-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c032-LTLFireability-12 finished in 138585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 672 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 672/672 places, 1746/1746 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 662 transition count 1720
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 662 transition count 1720
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 652 transition count 1694
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 652 transition count 1694
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 642 transition count 1666
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 642 transition count 1666
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 633 transition count 1642
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 633 transition count 1642
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 86 place count 625 transition count 1626
Iterating global reduction 0 with 8 rules applied. Total rules applied 94 place count 625 transition count 1626
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 101 place count 618 transition count 1612
Iterating global reduction 0 with 7 rules applied. Total rules applied 108 place count 618 transition count 1612
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 114 place count 612 transition count 1600
Iterating global reduction 0 with 6 rules applied. Total rules applied 120 place count 612 transition count 1600
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 124 place count 608 transition count 1592
Iterating global reduction 0 with 4 rules applied. Total rules applied 128 place count 608 transition count 1592
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 131 place count 605 transition count 1586
Iterating global reduction 0 with 3 rules applied. Total rules applied 134 place count 605 transition count 1586
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 136 place count 605 transition count 1584
Applied a total of 136 rules in 659 ms. Remains 605 /672 variables (removed 67) and now considering 1584/1746 (removed 162) transitions.
[2025-06-02 13:22:21] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2025-06-02 13:22:21] [INFO ] Computed 2 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:22:22] [INFO ] Implicit Places using invariants in 808 ms returned []
[2025-06-02 13:22:22] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2025-06-02 13:22:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:22:22] [INFO ] State equation strengthened by 262 read => feed constraints.
[2025-06-02 13:22:26] [INFO ] Implicit Places using invariants and state equation in 4673 ms returned []
Implicit Place search using SMT with State Equation took 5483 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:22:27] [INFO ] Redundant transitions in 84 ms returned []
Running 1582 sub problems to find dead transitions.
[2025-06-02 13:22:27] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2025-06-02 13:22:27] [INFO ] Invariant cache hit.
[2025-06-02 13:22:27] [INFO ] State equation strengthened by 262 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 0/1582 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63773ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 63779ms
Starting structural reductions in SI_LTL mode, iteration 1 : 605/672 places, 1584/1746 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70021 ms. Remains : 605/672 places, 1584/1746 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c032-LTLFireability-14
Stuttering criterion allowed to conclude after 237 steps with 0 reset in 4 ms.
FORMULA FunctionPointer-PT-c032-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c032-LTLFireability-14 finished in 70116 ms.
All properties solved by simple procedures.
Total runtime 475842 ms.

BK_STOP 1748870611050

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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 LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-c032"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-c032, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r100-smll-174867007400148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c032.tgz
mv FunctionPointer-PT-c032 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;