fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r516-tajo-171654446500156
Last Updated
July 7, 2024

About the Execution of LTSMin+red for PolyORBLF-COL-S04J06T08

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16205.344 377199.00 482969.00 988.00 FFF????F?F???T?F normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446500156.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-COL-S04J06T08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446500156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 11K Apr 11 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 11 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717250606872

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:03:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:03:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:03:28] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 14:03:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 14:03:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 746 ms
[2024-06-01 14:03:29] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 792 PT places and 4336.0 transition bindings in 31 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 14:03:29] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-06-01 14:03:29] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 6 formulas.
FORMULA PolyORBLF-COL-S04J06T08-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T08-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T08-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T08-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T08-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T08-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 19 to 17
RANDOM walk for 40000 steps (13 resets) in 722 ms. (55 steps per ms) remains 1/17 properties
BEST_FIRST walk for 40003 steps (8 resets) in 244 ms. (163 steps per ms) remains 1/1 properties
[2024-06-01 14:03:29] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 14:03:29] [INFO ] Computed 26 invariants in 6 ms
[2024-06-01 14:03:29] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/38 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/48 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/52 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 75/145 variables, and 22 constraints, problems are : Problem set: 1 solved, 0 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 13/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 300ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
[2024-06-01 14:03:30] [INFO ] Flatten gal took : 25 ms
[2024-06-01 14:03:30] [INFO ] Flatten gal took : 18 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 14:03:30] [INFO ] Unfolded HLPN to a Petri net with 792 places and 4268 transitions 28832 arcs in 173 ms.
[2024-06-01 14:03:30] [INFO ] Unfolded 10 HLPN properties in 1 ms.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Support contains 272 out of 792 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 788 transition count 2100
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 12 place count 780 transition count 2092
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 780 transition count 2092
Applied a total of 20 rules in 120 ms. Remains 780 /792 variables (removed 12) and now considering 2092/2100 (removed 8) transitions.
Running 2088 sub problems to find dead transitions.
[2024-06-01 14:03:30] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
// Phase 1: matrix 2060 rows 780 cols
[2024-06-01 14:03:30] [INFO ] Computed 54 invariants in 104 ms
[2024-06-01 14:03:30] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/776 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/776 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 4.0)
(s1 6.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 1.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 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 10.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 (/ 1.0 3.0))
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 (/ 1.0 3.0))
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 (/ 1.0 3.0))
(s350 0.0)
(s351 1.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 1.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 1.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 1.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 1.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 1.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 1.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 1.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 1.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 10.0)
(s612 1.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 1.0)
(s617 0.0)
(s618 1.0)
(s619 1.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 1.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 8.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 776/2840 variables, and 50 constraints, problems are : Problem set: 0 solved, 2088 unsolved in 20066 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/780 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2088/2088 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2088 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/776 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/776 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
[2024-06-01 14:04:01] [INFO ] Deduced a trap composed of 82 places in 224 ms of which 32 ms to minimize.
[2024-06-01 14:04:02] [INFO ] Deduced a trap composed of 82 places in 363 ms of which 4 ms to minimize.
[2024-06-01 14:04:02] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 0 ms to minimize.
[2024-06-01 14:04:02] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 1 ms to minimize.
[2024-06-01 14:04:02] [INFO ] Deduced a trap composed of 82 places in 153 ms of which 1 ms to minimize.
[2024-06-01 14:04:02] [INFO ] Deduced a trap composed of 82 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:04:02] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 1 ms to minimize.
[2024-06-01 14:04:03] [INFO ] Deduced a trap composed of 228 places in 388 ms of which 5 ms to minimize.
[2024-06-01 14:04:04] [INFO ] Deduced a trap composed of 217 places in 357 ms of which 4 ms to minimize.
[2024-06-01 14:04:05] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 2 ms to minimize.
[2024-06-01 14:04:17] [INFO ] Deduced a trap composed of 98 places in 219 ms of which 3 ms to minimize.
[2024-06-01 14:04:18] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 3 ms to minimize.
[2024-06-01 14:04:18] [INFO ] Deduced a trap composed of 98 places in 243 ms of which 4 ms to minimize.
[2024-06-01 14:04:19] [INFO ] Deduced a trap composed of 97 places in 246 ms of which 4 ms to minimize.
[2024-06-01 14:04:19] [INFO ] Deduced a trap composed of 47 places in 276 ms of which 4 ms to minimize.
[2024-06-01 14:04:19] [INFO ] Deduced a trap composed of 48 places in 229 ms of which 3 ms to minimize.
[2024-06-01 14:04:20] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 776/2840 variables, and 67 constraints, problems are : Problem set: 0 solved, 2088 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/780 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2088 constraints, Known Traps: 17/17 constraints]
After SMT, in 49870ms problems are : Problem set: 0 solved, 2088 unsolved
Search for dead transitions found 0 dead transitions in 49942ms
[2024-06-01 14:04:20] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
[2024-06-01 14:04:20] [INFO ] Invariant cache hit.
[2024-06-01 14:04:20] [INFO ] Implicit Places using invariants in 508 ms returned []
[2024-06-01 14:04:20] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
[2024-06-01 14:04:20] [INFO ] Invariant cache hit.
[2024-06-01 14:04:21] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 14:04:32] [INFO ] Implicit Places using invariants and state equation in 11307 ms returned []
Implicit Place search using SMT with State Equation took 11823 ms to find 0 implicit places.
Running 2088 sub problems to find dead transitions.
[2024-06-01 14:04:32] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
[2024-06-01 14:04:32] [INFO ] Invariant cache hit.
[2024-06-01 14:04:32] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/776 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/776 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
[2024-06-01 14:05:03] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 2 ms to minimize.
[2024-06-01 14:05:07] [INFO ] Deduced a trap composed of 130 places in 347 ms of which 3 ms to minimize.
[2024-06-01 14:05:07] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:05:07] [INFO ] Deduced a trap composed of 82 places in 374 ms of which 4 ms to minimize.
[2024-06-01 14:05:08] [INFO ] Deduced a trap composed of 83 places in 387 ms of which 4 ms to minimize.
[2024-06-01 14:05:08] [INFO ] Deduced a trap composed of 82 places in 335 ms of which 4 ms to minimize.
[2024-06-01 14:05:08] [INFO ] Deduced a trap composed of 49 places in 337 ms of which 3 ms to minimize.
[2024-06-01 14:05:08] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-06-01 14:05:09] [INFO ] Deduced a trap composed of 83 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:05:09] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 4.0)
(s1 6.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 776/2840 variables, and 60 constraints, problems are : Problem set: 0 solved, 2088 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/780 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2088/2088 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2088 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/776 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/776 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/776 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
[2024-06-01 14:05:13] [INFO ] Deduced a trap composed of 157 places in 406 ms of which 6 ms to minimize.
[2024-06-01 14:05:14] [INFO ] Deduced a trap composed of 193 places in 361 ms of which 4 ms to minimize.
[2024-06-01 14:05:15] [INFO ] Deduced a trap composed of 387 places in 466 ms of which 5 ms to minimize.
[2024-06-01 14:05:16] [INFO ] Deduced a trap composed of 467 places in 499 ms of which 5 ms to minimize.
[2024-06-01 14:05:27] [INFO ] Deduced a trap composed of 38 places in 263 ms of which 3 ms to minimize.
[2024-06-01 14:05:31] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 776/2840 variables, and 66 constraints, problems are : Problem set: 0 solved, 2088 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/780 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2088 constraints, Known Traps: 16/16 constraints]
After SMT, in 68976ms problems are : Problem set: 0 solved, 2088 unsolved
Search for dead transitions found 0 dead transitions in 69020ms
Starting structural reductions in LTL mode, iteration 1 : 780/792 places, 2092/2100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130953 ms. Remains : 780/792 places, 2092/2100 transitions.
Support contains 272 out of 780 places after structural reductions.
[2024-06-01 14:05:41] [INFO ] Flatten gal took : 162 ms
[2024-06-01 14:05:41] [INFO ] Flatten gal took : 159 ms
[2024-06-01 14:05:42] [INFO ] Input system was already deterministic with 2092 transitions.
Support contains 264 out of 780 places (down from 272) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 19 to 16
RANDOM walk for 40000 steps (9 resets) in 894 ms. (44 steps per ms) remains 1/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 474 ms. (84 steps per ms) remains 1/1 properties
[2024-06-01 14:05:42] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
[2024-06-01 14:05:42] [INFO ] Invariant cache hit.
[2024-06-01 14:05:42] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/196 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 15/211 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 529/740 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:05:43] [INFO ] Deduced a trap composed of 82 places in 177 ms of which 2 ms to minimize.
[2024-06-01 14:05:43] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 5 ms to minimize.
[2024-06-01 14:05:43] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 1 ms to minimize.
[2024-06-01 14:05:43] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 2 ms to minimize.
[2024-06-01 14:05:43] [INFO ] Deduced a trap composed of 83 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/740 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/740 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/753 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/753 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp16 is UNSAT
After SMT solving in domain Real declared 778/2840 variables, and 58 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1078 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/780 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1153ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-COL-S04J06T08-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 17 out of 780 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 780/780 places, 2092/2092 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 780 transition count 2052
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 740 transition count 2044
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 732 transition count 2044
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 96 place count 732 transition count 1940
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 304 place count 628 transition count 1940
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 7 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 432 place count 564 transition count 1876
Applied a total of 432 rules in 274 ms. Remains 564 /780 variables (removed 216) and now considering 1876/2092 (removed 216) transitions.
Running 1872 sub problems to find dead transitions.
[2024-06-01 14:05:44] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
// Phase 1: matrix 1844 rows 564 cols
[2024-06-01 14:05:44] [INFO ] Computed 54 invariants in 43 ms
[2024-06-01 14:05:44] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
[2024-06-01 14:06:09] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:06:09] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:06:10] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:06:10] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 0 ms to minimize.
[2024-06-01 14:06:10] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:06:10] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:06:10] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:06:10] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/2408 variables, and 58 constraints, problems are : Problem set: 0 solved, 1872 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1872/1872 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1872 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
[2024-06-01 14:06:19] [INFO ] Deduced a trap composed of 268 places in 469 ms of which 6 ms to minimize.
[2024-06-01 14:06:20] [INFO ] Deduced a trap composed of 19 places in 382 ms of which 3 ms to minimize.
[2024-06-01 14:06:20] [INFO ] Deduced a trap composed of 268 places in 375 ms of which 4 ms to minimize.
[2024-06-01 14:06:20] [INFO ] Deduced a trap composed of 235 places in 440 ms of which 5 ms to minimize.
[2024-06-01 14:06:26] [INFO ] Deduced a trap composed of 308 places in 372 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/2408 variables, and 63 constraints, problems are : Problem set: 0 solved, 1872 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1872 constraints, Known Traps: 13/13 constraints]
After SMT, in 49936ms problems are : Problem set: 0 solved, 1872 unsolved
Search for dead transitions found 0 dead transitions in 49969ms
[2024-06-01 14:06:34] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
[2024-06-01 14:06:34] [INFO ] Invariant cache hit.
[2024-06-01 14:06:34] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-06-01 14:06:34] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
[2024-06-01 14:06:34] [INFO ] Invariant cache hit.
[2024-06-01 14:06:35] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 14:06:46] [INFO ] Implicit Places using invariants and state equation in 11905 ms returned []
Implicit Place search using SMT with State Equation took 12361 ms to find 0 implicit places.
[2024-06-01 14:06:46] [INFO ] Redundant transitions in 88 ms returned []
Running 1872 sub problems to find dead transitions.
[2024-06-01 14:06:46] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
[2024-06-01 14:06:46] [INFO ] Invariant cache hit.
[2024-06-01 14:06:46] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
[2024-06-01 14:07:08] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 2 ms to minimize.
[2024-06-01 14:07:08] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 2 ms to minimize.
[2024-06-01 14:07:09] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 1 ms to minimize.
[2024-06-01 14:07:09] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:07:09] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:07:09] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:07:09] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 2 ms to minimize.
[2024-06-01 14:07:09] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:07:09] [INFO ] Deduced a trap composed of 286 places in 360 ms of which 3 ms to minimize.
[2024-06-01 14:07:10] [INFO ] Deduced a trap composed of 258 places in 385 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 9.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 timeout
0.0)
(s369 0.0)
(s370 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/2408 variables, and 60 constraints, problems are : Problem set: 0 solved, 1872 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1872/1872 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1872 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
[2024-06-01 14:07:33] [INFO ] Deduced a trap composed of 308 places in 339 ms of which 4 ms to minimize.
[2024-06-01 14:07:34] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 3 ms to minimize.
[2024-06-01 14:07:45] [INFO ] Deduced a trap composed of 190 places in 355 ms of which 5 ms to minimize.
[2024-06-01 14:07:46] [INFO ] Deduced a trap composed of 33 places in 288 ms of which 2 ms to minimize.
[2024-06-01 14:07:55] [INFO ] Deduced a trap composed of 206 places in 350 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/2408 variables, and 65 constraints, problems are : Problem set: 0 solved, 1872 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1872 constraints, Known Traps: 15/15 constraints]
After SMT, in 69549ms problems are : Problem set: 0 solved, 1872 unsolved
Search for dead transitions found 0 dead transitions in 69568ms
Starting structural reductions in SI_LTL mode, iteration 1 : 564/780 places, 1876/2092 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132281 ms. Remains : 564/780 places, 1876/2092 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J06T08-LTLFireability-03
Product exploration explored 100000 steps with 3599 reset in 832 ms.
Product exploration explored 100000 steps with 3631 reset in 522 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 107 steps (0 resets) in 6 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2024-06-01 14:07:58] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
[2024-06-01 14:07:58] [INFO ] Invariant cache hit.
[2024-06-01 14:07:59] [INFO ] [Real]Absence check using 18 positive place invariants in 34 ms returned sat
[2024-06-01 14:07:59] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 60 ms returned sat
[2024-06-01 14:08:01] [INFO ] [Real]Absence check using state equation in 1730 ms returned sat
[2024-06-01 14:08:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:08:01] [INFO ] [Nat]Absence check using 18 positive place invariants in 20 ms returned sat
[2024-06-01 14:08:02] [INFO ] [Nat]Absence check using 18 positive and 36 generalized place invariants in 232 ms returned sat
[2024-06-01 14:08:03] [INFO ] [Nat]Absence check using state equation in 1573 ms returned sat
[2024-06-01 14:08:03] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 14:08:04] [INFO ] [Nat]Added 160 Read/Feed constraints in 462 ms returned sat
[2024-06-01 14:08:04] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:08:04] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:08:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 636 ms
[2024-06-01 14:08:05] [INFO ] Computed and/alt/rep : 928/3324/904 causal constraints (skipped 936 transitions) in 178 ms.
[2024-06-01 14:08:10] [INFO ] Added : 140 causal constraints over 29 iterations in 5772 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 17 out of 564 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 564/564 places, 1876/1876 transitions.
Applied a total of 0 rules in 64 ms. Remains 564 /564 variables (removed 0) and now considering 1876/1876 (removed 0) transitions.
Running 1872 sub problems to find dead transitions.
[2024-06-01 14:08:10] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
[2024-06-01 14:08:10] [INFO ] Invariant cache hit.
[2024-06-01 14:08:10] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
[2024-06-01 14:08:34] [INFO ] Deduced a trap composed of 55 places in 123 ms of which 2 ms to minimize.
[2024-06-01 14:08:34] [INFO ] Deduced a trap composed of 55 places in 140 ms of which 2 ms to minimize.
[2024-06-01 14:08:34] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 2 ms to minimize.
[2024-06-01 14:08:34] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 0 ms to minimize.
[2024-06-01 14:08:34] [INFO ] Deduced a trap composed of 55 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:08:34] [INFO ] Deduced a trap composed of 55 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:08:34] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:08:34] [INFO ] Deduced a trap composed of 56 places in 38 ms of which 0 ms to minimize.
[2024-06-01 14:08:35] [INFO ] Deduced a trap composed of 286 places in 387 ms of which 4 ms to minimize.
[2024-06-01 14:08:35] [INFO ] Deduced a trap composed of 258 places in 349 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/2408 variables, and 60 constraints, problems are : Problem set: 0 solved, 1872 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1872/1872 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1872 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
[2024-06-01 14:08:47] [INFO ] Deduced a trap composed of 308 places in 351 ms of which 3 ms to minimize.
[2024-06-01 14:08:48] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/2408 variables, and 62 constraints, problems are : Problem set: 0 solved, 1872 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/564 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1872 constraints, Known Traps: 12/12 constraints]
After SMT, in 49848ms problems are : Problem set: 0 solved, 1872 unsolved
Search for dead transitions found 0 dead transitions in 49878ms
[2024-06-01 14:09:00] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
[2024-06-01 14:09:00] [INFO ] Invariant cache hit.
[2024-06-01 14:09:01] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-06-01 14:09:01] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
[2024-06-01 14:09:01] [INFO ] Invariant cache hit.
[2024-06-01 14:09:01] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 14:09:11] [INFO ] Implicit Places using invariants and state equation in 10651 ms returned []
Implicit Place search using SMT with State Equation took 11119 ms to find 0 implicit places.
[2024-06-01 14:09:11] [INFO ] Redundant transitions in 94 ms returned []
Running 1872 sub problems to find dead transitions.
[2024-06-01 14:09:11] [INFO ] Flow matrix only has 1844 transitions (discarded 32 similar events)
[2024-06-01 14:09:11] [INFO ] Invariant cache hit.
[2024-06-01 14:09:11] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
[2024-06-01 14:09:34] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 2 ms to minimize.
[2024-06-01 14:09:34] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 1 ms to minimize.
[2024-06-01 14:09:34] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:09:35] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:09:35] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:09:35] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:09:35] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:09:35] [INFO ] Deduced a trap composed of 56 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:09:35] [INFO ] Deduced a trap composed of 286 places in 408 ms of which 3 ms to minimize.
[2024-06-01 14:09:36] [INFO ] Deduced a trap composed of 258 places in 382 ms of which 4 ms to minimize.
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-LTLFireability-00
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-LTLFireability-01
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-LTLFireability-02
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-LTLFireability-03
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-LTLFireability-04
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-LTLFireability-05
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-LTLFireability-06
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-LTLFireability-07
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-LTLFireability-08
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-LTLFireability-09
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-LTLFireability-10
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-LTLFireability-11
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-LTLFireability-12
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-LTLFireability-13
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-LTLFireability-14
Could not compute solution for formula : PolyORBLF-COL-S04J06T08-LTLFireability-15

BK_STOP 1717250984071

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBLF-COL-S04J06T08-LTLFireability-00
ltl formula formula --ltl=/tmp/940/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 2/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 3/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S04J06T08-LTLFireability-01
ltl formula formula --ltl=/tmp/940/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 2/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S04J06T08-LTLFireability-02
ltl formula formula --ltl=/tmp/940/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 2/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S04J06T08-LTLFireability-03
ltl formula formula --ltl=/tmp/940/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S04J06T08-LTLFireability-04
ltl formula formula --ltl=/tmp/940/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S04J06T08-LTLFireability-05
ltl formula formula --ltl=/tmp/940/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S04J06T08-LTLFireability-06
ltl formula formula --ltl=/tmp/940/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S04J06T08-LTLFireability-07
ltl formula formula --ltl=/tmp/940/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S04J06T08-LTLFireability-08
ltl formula formula --ltl=/tmp/940/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S04J06T08-LTLFireability-09
ltl formula formula --ltl=/tmp/940/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S04J06T08-LTLFireability-10
ltl formula formula --ltl=/tmp/940/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S04J06T08-LTLFireability-11
ltl formula formula --ltl=/tmp/940/ltl_11_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S04J06T08-LTLFireability-12
ltl formula formula --ltl=/tmp/940/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
Warning: program compiled against libxml 210 using older 209
ltl formula name PolyORBLF-COL-S04J06T08-LTLFireability-13
ltl formula formula --ltl=/tmp/940/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 2/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 3/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S04J06T08-LTLFireability-14
ltl formula formula --ltl=/tmp/940/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 2/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
Warning: program compiled against libxml 210 using older 209
ltl formula name PolyORBLF-COL-S04J06T08-LTLFireability-15
ltl formula formula --ltl=/tmp/940/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
Warning: program compiled against libxml 210 using older 209

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="PolyORBLF-COL-S04J06T08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-COL-S04J06T08, 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 r516-tajo-171654446500156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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