Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r245-tall-171654349000020.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is MultiCrashLeafsetExtension-PT-S16C04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349000020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.5M
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 05:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 12 05:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 12 05:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 12 05:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.1M 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 MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716565806231

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 15:50:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 15:50:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:50:07] [INFO ] Load time of PNML (sax parser for PT used): 342 ms
[2024-05-24 15:50:07] [INFO ] Transformed 4260 places.
[2024-05-24 15:50:07] [INFO ] Transformed 6027 transitions.
[2024-05-24 15:50:07] [INFO ] Parsed PT model containing 4260 places and 6027 transitions and 23774 arcs in 481 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 4260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4260/4260 places, 6027/6027 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 4232 transition count 6027
Discarding 1075 places :
Symmetric choice reduction at 1 with 1075 rule applications. Total rules 1103 place count 3157 transition count 4952
Iterating global reduction 1 with 1075 rules applied. Total rules applied 2178 place count 3157 transition count 4952
Discarding 934 places :
Symmetric choice reduction at 1 with 934 rule applications. Total rules 3112 place count 2223 transition count 4018
Iterating global reduction 1 with 934 rules applied. Total rules applied 4046 place count 2223 transition count 4018
Discarding 218 places :
Symmetric choice reduction at 1 with 218 rule applications. Total rules 4264 place count 2005 transition count 3146
Iterating global reduction 1 with 218 rules applied. Total rules applied 4482 place count 2005 transition count 3146
Applied a total of 4482 rules in 844 ms. Remains 2005 /4260 variables (removed 2255) and now considering 3146/6027 (removed 2881) transitions.
[2024-05-24 15:50:09] [INFO ] Flow matrix only has 2874 transitions (discarded 272 similar events)
// Phase 1: matrix 2874 rows 2005 cols
[2024-05-24 15:50:09] [INFO ] Computed 469 invariants in 148 ms
[2024-05-24 15:50:11] [INFO ] Implicit Places using invariants in 2554 ms returned [4, 8, 12, 14, 18, 20, 25, 32, 41, 52, 65, 82, 98, 118, 120, 122, 135, 146, 158, 165, 170, 176, 195, 202, 205, 206, 207, 208, 209, 212, 217, 224, 233, 244, 257, 271, 286, 287, 288, 289, 303, 312, 319, 324, 327, 329, 348, 355, 358, 359, 361, 362, 364, 369, 374, 381, 390, 401, 413, 425, 426, 428, 429, 438, 445, 450, 455, 457, 459, 478, 485, 489, 490, 491, 492, 496, 498, 501, 506, 513, 522, 532, 543, 544, 545, 546, 555, 560, 563, 565, 567, 569, 588, 595, 598, 599, 600, 601, 602, 604, 606, 608, 611, 616, 623, 631, 639, 640, 641, 642, 643, 648, 651, 653, 655, 657, 659, 678, 685, 688, 690, 691, 692, 694, 696, 698, 700, 703, 708, 716, 722, 723, 724, 725, 726, 730, 732, 734, 736, 738, 740, 759, 766, 769, 770, 771, 773, 775, 779, 781, 783, 785, 788, 792, 796, 797, 798, 799, 800, 802, 804, 806, 808, 810, 812, 831, 838, 841, 842, 844, 845, 847, 849, 851, 855, 857, 859, 861, 864, 865, 866, 867, 868, 870, 872, 874, 876, 878, 880, 899, 901, 905, 908, 909, 911, 912, 914, 916, 918, 920, 925, 927, 929, 932, 933, 934, 935, 936, 938, 940, 942, 944, 946, 948, 967, 974, 977, 979, 980, 981, 983, 985, 987, 991, 993, 995, 997, 1000, 1001, 1002, 1004, 1006, 1010, 1012, 1014, 1016, 1018, 1037, 1044, 1047, 1048, 1049, 1050, 1051, 1053, 1055, 1057, 1059, 1061, 1063, 1066, 1071, 1072, 1073, 1074, 1075, 1078, 1080, 1082, 1084, 1086, 1088, 1107, 1114, 1117, 1118, 1119, 1120, 1121, 1123, 1125, 1127, 1129, 1131, 1134, 1139, 1146, 1147, 1148, 1149, 1150, 1155, 1158, 1160, 1162, 1164, 1166, 1185, 1192, 1196, 1197, 1198, 1199, 1203, 1205, 1207, 1209, 1212, 1217, 1224, 1233, 1234, 1235, 1236, 1237, 1244, 1249, 1252, 1254, 1256, 1258, 1277, 1284, 1287, 1288, 1289, 1290, 1291, 1293, 1295, 1297, 1300, 1305, 1312, 1321, 1332, 1334, 1335, 1336, 1347, 1354, 1359, 1362, 1364, 1366, 1385, 1392, 1395, 1396, 1397, 1399, 1401, 1403, 1406, 1411, 1418, 1429, 1440, 1453, 1454, 1455, 1456, 1457, 1468, 1477, 1484, 1489, 1492, 1494, 1513, 1520, 1523, 1524, 1525, 1526, 1527, 1529, 1532, 1537, 1544, 1553, 1564, 1577, 1592, 1593, 1594, 1595, 1596, 1609, 1620, 1629, 1637, 1642, 1645, 1664, 1666, 1670, 1673, 1674, 1675, 1676, 1677, 1680, 1685, 1692, 1701, 1712, 1725, 1740, 1757, 1758, 1760, 1761, 1776, 1789, 1803, 1812, 1819, 1824, 1844]
[2024-05-24 15:50:11] [INFO ] Actually due to overlaps returned [195, 348, 478, 588, 678, 759, 831, 899, 967, 1037, 1107, 1185, 1277, 1385, 1513, 1664, 1844, 4, 12, 14, 18, 118, 120, 205, 206, 207, 208, 286, 287, 288, 358, 359, 361, 425, 426, 428, 489, 490, 491, 543, 544, 545, 598, 599, 600, 601, 639, 640, 641, 642, 688, 690, 691, 722, 723, 724, 725, 769, 770, 771, 796, 797, 798, 799, 841, 842, 844, 864, 865, 866, 867, 901, 908, 909, 911, 932, 933, 934, 935, 977, 979, 980, 1000, 1001, 1002, 1047, 1048, 1049, 1050, 1071, 1072, 1073, 1074, 1117, 1118, 1119, 1120, 1146, 1147, 1148, 1149, 1196, 1197, 1198, 1233, 1234, 1235, 1236, 1287, 1288, 1289, 1290, 1332, 1334, 1335, 1395, 1396, 1397, 1453, 1454, 1455, 1456, 1523, 1524, 1525, 1526, 1592, 1593, 1594, 1595, 1666, 1673, 1674, 1675, 1676, 1757, 1758, 1760]
Discarding 138 places :
Implicit Place search using SMT only with invariants took 2605 ms to find 138 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1867/4260 places, 3146/6027 transitions.
Discarding 110 places :
Symmetric choice reduction at 0 with 110 rule applications. Total rules 110 place count 1757 transition count 3036
Iterating global reduction 0 with 110 rules applied. Total rules applied 220 place count 1757 transition count 3036
Discarding 110 places :
Symmetric choice reduction at 0 with 110 rule applications. Total rules 330 place count 1647 transition count 2926
Iterating global reduction 0 with 110 rules applied. Total rules applied 440 place count 1647 transition count 2926
Discarding 108 places :
Symmetric choice reduction at 0 with 108 rule applications. Total rules 548 place count 1539 transition count 2818
Iterating global reduction 0 with 108 rules applied. Total rules applied 656 place count 1539 transition count 2818
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 670 place count 1525 transition count 2762
Iterating global reduction 0 with 14 rules applied. Total rules applied 684 place count 1525 transition count 2762
Applied a total of 684 rules in 701 ms. Remains 1525 /1867 variables (removed 342) and now considering 2762/3146 (removed 384) transitions.
[2024-05-24 15:50:12] [INFO ] Flow matrix only has 2490 transitions (discarded 272 similar events)
// Phase 1: matrix 2490 rows 1525 cols
[2024-05-24 15:50:12] [INFO ] Computed 331 invariants in 41 ms
[2024-05-24 15:50:13] [INFO ] Implicit Places using invariants in 1605 ms returned [7, 16, 21, 28, 37, 48, 61, 78, 94, 116, 129, 140, 152, 159, 164, 170, 195, 198, 201, 206, 213, 222, 233, 246, 260, 275, 289, 298, 305, 310, 313, 315, 331, 335, 337, 342, 347, 354, 363, 374, 386, 399, 408, 415, 420, 425, 427, 429, 444, 448, 452, 454, 457, 462, 469, 478, 488, 499, 508, 513, 516, 518, 520, 522, 535, 537, 539, 541, 543, 546, 551, 558, 566, 574, 579, 582, 584, 586, 588, 590, 599, 603, 605, 607, 609, 611, 614, 619, 627, 632, 636, 638, 640, 642, 644, 646, 657, 661, 663, 667, 669, 671, 673, 676, 680, 683, 685, 687, 689, 691, 693, 695, 706, 710, 712, 714, 716, 720, 722, 724, 726, 728, 730, 732, 734, 736, 738, 740, 749, 753, 755, 757, 759, 761, 766, 768, 770, 772, 774, 776, 778, 780, 782, 784, 795, 799, 801, 803, 805, 809, 811, 813, 815, 819, 821, 825, 827, 829, 831, 833, 846, 848, 850, 852, 854, 856, 858, 860, 863, 867, 870, 872, 874, 876, 878, 880, 889, 891, 893, 895, 897, 899, 901, 904, 909, 915, 920, 923, 925, 927, 929, 931, 940, 944, 948, 950, 952, 954, 957, 962, 969, 977, 984, 989, 992, 994, 996, 998, 1009, 1012, 1014, 1016, 1018, 1021, 1026, 1033, 1042, 1054, 1065, 1072, 1077, 1080, 1082, 1084, 1096, 1100, 1102, 1104, 1107, 1112, 1119, 1130, 1141, 1153, 1164, 1173, 1180, 1185, 1188, 1190, 1201, 1203, 1205, 1208, 1213, 1220, 1229, 1240, 1253, 1267, 1280, 1291, 1300, 1308, 1313, 1316, 1323, 1325, 1328, 1333, 1340, 1349, 1360, 1373, 1388, 1406, 1421, 1434, 1448, 1457, 1464, 1469]
Discarding 272 places :
Implicit Place search using SMT only with invariants took 1609 ms to find 272 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1253/4260 places, 2762/6027 transitions.
Applied a total of 0 rules in 45 ms. Remains 1253 /1253 variables (removed 0) and now considering 2762/2762 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5822 ms. Remains : 1253/4260 places, 2762/6027 transitions.
Support contains 66 out of 1253 places after structural reductions.
[2024-05-24 15:50:14] [INFO ] Flatten gal took : 246 ms
[2024-05-24 15:50:14] [INFO ] Flatten gal took : 148 ms
[2024-05-24 15:50:14] [INFO ] Input system was already deterministic with 2762 transitions.
Support contains 61 out of 1253 places (down from 66) after GAL structural reductions.
RANDOM walk for 40000 steps (956 resets) in 2810 ms. (14 steps per ms) remains 12/33 properties
BEST_FIRST walk for 40003 steps (244 resets) in 375 ms. (106 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (244 resets) in 212 ms. (187 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (244 resets) in 196 ms. (203 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (244 resets) in 210 ms. (189 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (244 resets) in 194 ms. (205 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (244 resets) in 151 ms. (263 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (244 resets) in 219 ms. (181 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (244 resets) in 179 ms. (222 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40004 steps (244 resets) in 154 ms. (258 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (244 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (244 resets) in 344 ms. (115 steps per ms) remains 10/10 properties
[2024-05-24 15:50:16] [INFO ] Flow matrix only has 2490 transitions (discarded 272 similar events)
// Phase 1: matrix 2490 rows 1253 cols
[2024-05-24 15:50:16] [INFO ] Computed 59 invariants in 31 ms
[2024-05-24 15:50:16] [INFO ] State equation strengthened by 938 read => feed constraints.
Problem AtomicPropp31 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 2 (OVERLAPS) 1150/1173 variables, 11/12 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-24 15:50:17] [INFO ] Deduced a trap composed of 214 places in 564 ms of which 20 ms to minimize.
[2024-05-24 15:50:18] [INFO ] Deduced a trap composed of 227 places in 607 ms of which 54 ms to minimize.
[2024-05-24 15:50:18] [INFO ] Deduced a trap composed of 537 places in 476 ms of which 7 ms to minimize.
[2024-05-24 15:50:18] [INFO ] Deduced a trap composed of 307 places in 246 ms of which 5 ms to minimize.
[2024-05-24 15:50:19] [INFO ] Deduced a trap composed of 299 places in 549 ms of which 8 ms to minimize.
[2024-05-24 15:50:20] [INFO ] Deduced a trap composed of 247 places in 552 ms of which 8 ms to minimize.
[2024-05-24 15:50:20] [INFO ] Deduced a trap composed of 302 places in 573 ms of which 8 ms to minimize.
[2024-05-24 15:50:21] [INFO ] Deduced a trap composed of 441 places in 535 ms of which 8 ms to minimize.
[2024-05-24 15:50:21] [INFO ] Deduced a trap composed of 237 places in 575 ms of which 8 ms to minimize.
SMT process timed out in 5397ms, After SMT, problems are : Problem set: 2 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 1253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 2762/2762 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 1253 transition count 2749
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 1240 transition count 2749
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 26 place count 1240 transition count 2728
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 68 place count 1219 transition count 2728
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 84 place count 1203 transition count 2706
Iterating global reduction 2 with 16 rules applied. Total rules applied 100 place count 1203 transition count 2706
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 100 place count 1203 transition count 2703
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 1200 transition count 2703
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 119 place count 1187 transition count 2651
Iterating global reduction 2 with 13 rules applied. Total rules applied 132 place count 1187 transition count 2651
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 4 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 182 place count 1162 transition count 2626
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 187 place count 1157 transition count 2621
Iterating global reduction 2 with 5 rules applied. Total rules applied 192 place count 1157 transition count 2621
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 197 place count 1152 transition count 2601
Iterating global reduction 2 with 5 rules applied. Total rules applied 202 place count 1152 transition count 2601
Free-agglomeration rule (complex) applied 146 times.
Iterating global reduction 2 with 146 rules applied. Total rules applied 348 place count 1152 transition count 3190
Reduce places removed 146 places and 0 transitions.
Iterating post reduction 2 with 146 rules applied. Total rules applied 494 place count 1006 transition count 3190
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 505 place count 1006 transition count 3190
Applied a total of 505 rules in 768 ms. Remains 1006 /1253 variables (removed 247) and now considering 3190/2762 (removed -428) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 769 ms. Remains : 1006/1253 places, 3190/2762 transitions.
RANDOM walk for 40000 steps (1699 resets) in 1073 ms. (37 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (185 resets) in 214 ms. (186 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (182 resets) in 163 ms. (243 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (186 resets) in 158 ms. (251 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (185 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (160 resets) in 180 ms. (221 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (193 resets) in 138 ms. (287 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (158 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (185 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 64265 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :2 out of 8
Probabilistic random walk after 64265 steps, saw 27155 distinct states, run finished after 3004 ms. (steps per millisecond=21 ) properties seen :2
[2024-05-24 15:50:26] [INFO ] Flow matrix only has 2794 transitions (discarded 396 similar events)
// Phase 1: matrix 2794 rows 1006 cols
[2024-05-24 15:50:26] [INFO ] Computed 59 invariants in 36 ms
[2024-05-24 15:50:26] [INFO ] State equation strengthened by 1613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 907/919 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 15:50:26] [INFO ] Deduced a trap composed of 261 places in 165 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/919 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 15:50:27] [INFO ] Deduced a trap composed of 269 places in 390 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/919 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/919 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 21/940 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 15:50:28] [INFO ] Deduced a trap composed of 145 places in 501 ms of which 6 ms to minimize.
[2024-05-24 15:50:28] [INFO ] Deduced a trap composed of 88 places in 481 ms of which 5 ms to minimize.
[2024-05-24 15:50:29] [INFO ] Deduced a trap composed of 356 places in 480 ms of which 6 ms to minimize.
[2024-05-24 15:50:29] [INFO ] Deduced a trap composed of 126 places in 503 ms of which 6 ms to minimize.
[2024-05-24 15:50:30] [INFO ] Deduced a trap composed of 124 places in 503 ms of which 6 ms to minimize.
[2024-05-24 15:50:30] [INFO ] Deduced a trap composed of 112 places in 493 ms of which 6 ms to minimize.
[2024-05-24 15:50:31] [INFO ] Deduced a trap composed of 161 places in 473 ms of which 6 ms to minimize.
[2024-05-24 15:50:31] [INFO ] Deduced a trap composed of 424 places in 464 ms of which 6 ms to minimize.
[2024-05-24 15:50:32] [INFO ] Deduced a trap composed of 150 places in 495 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/940 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 15:50:33] [INFO ] Deduced a trap composed of 363 places in 426 ms of which 6 ms to minimize.
[2024-05-24 15:50:33] [INFO ] Deduced a trap composed of 107 places in 486 ms of which 6 ms to minimize.
[2024-05-24 15:50:34] [INFO ] Deduced a trap composed of 102 places in 469 ms of which 6 ms to minimize.
[2024-05-24 15:50:34] [INFO ] Deduced a trap composed of 120 places in 489 ms of which 5 ms to minimize.
[2024-05-24 15:50:35] [INFO ] Deduced a trap composed of 125 places in 466 ms of which 6 ms to minimize.
[2024-05-24 15:50:35] [INFO ] Deduced a trap composed of 102 places in 468 ms of which 6 ms to minimize.
[2024-05-24 15:50:36] [INFO ] Deduced a trap composed of 125 places in 464 ms of which 5 ms to minimize.
[2024-05-24 15:50:36] [INFO ] Deduced a trap composed of 137 places in 477 ms of which 6 ms to minimize.
[2024-05-24 15:50:37] [INFO ] Deduced a trap composed of 117 places in 467 ms of which 6 ms to minimize.
[2024-05-24 15:50:37] [INFO ] Deduced a trap composed of 101 places in 496 ms of which 6 ms to minimize.
[2024-05-24 15:50:38] [INFO ] Deduced a trap composed of 109 places in 485 ms of which 6 ms to minimize.
[2024-05-24 15:50:38] [INFO ] Deduced a trap composed of 118 places in 493 ms of which 9 ms to minimize.
[2024-05-24 15:50:39] [INFO ] Deduced a trap composed of 100 places in 471 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/940 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/940 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 40/980 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/980 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 18/998 variables, 18/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/998 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 8/1006 variables, 8/83 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1006 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2794/3800 variables, 1006/1089 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/3800 variables, 1613/2702 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3800 variables, 0/2702 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/3800 variables, 0/2702 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3800/3800 variables, and 2702 constraints, problems are : Problem set: 1 solved, 5 unsolved in 15876 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 1006/1006 constraints, ReadFeed: 1613/1613 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 907/917 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/917 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 20/937 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/937 variables, 6/17 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-24 15:50:43] [INFO ] Deduced a trap composed of 152 places in 471 ms of which 6 ms to minimize.
[2024-05-24 15:50:43] [INFO ] Deduced a trap composed of 101 places in 477 ms of which 6 ms to minimize.
[2024-05-24 15:50:44] [INFO ] Deduced a trap composed of 108 places in 478 ms of which 6 ms to minimize.
[2024-05-24 15:50:44] [INFO ] Deduced a trap composed of 162 places in 486 ms of which 6 ms to minimize.
[2024-05-24 15:50:45] [INFO ] Deduced a trap composed of 130 places in 463 ms of which 6 ms to minimize.
[2024-05-24 15:50:45] [INFO ] Deduced a trap composed of 124 places in 481 ms of which 6 ms to minimize.
[2024-05-24 15:50:46] [INFO ] Deduced a trap composed of 117 places in 452 ms of which 6 ms to minimize.
[2024-05-24 15:50:46] [INFO ] Deduced a trap composed of 373 places in 428 ms of which 6 ms to minimize.
[2024-05-24 15:50:47] [INFO ] Deduced a trap composed of 374 places in 476 ms of which 6 ms to minimize.
[2024-05-24 15:50:47] [INFO ] Deduced a trap composed of 123 places in 460 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/937 variables, 10/27 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/937 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 41/978 variables, 20/47 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/978 variables, 18/65 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-24 15:50:48] [INFO ] Deduced a trap composed of 5 places in 526 ms of which 6 ms to minimize.
[2024-05-24 15:50:48] [INFO ] Deduced a trap composed of 68 places in 487 ms of which 6 ms to minimize.
[2024-05-24 15:50:49] [INFO ] Deduced a trap composed of 27 places in 474 ms of which 6 ms to minimize.
[2024-05-24 15:50:49] [INFO ] Deduced a trap composed of 77 places in 476 ms of which 5 ms to minimize.
[2024-05-24 15:50:50] [INFO ] Deduced a trap composed of 77 places in 475 ms of which 6 ms to minimize.
[2024-05-24 15:50:50] [INFO ] Deduced a trap composed of 27 places in 472 ms of which 5 ms to minimize.
[2024-05-24 15:50:51] [INFO ] Deduced a trap composed of 57 places in 479 ms of which 5 ms to minimize.
[2024-05-24 15:50:51] [INFO ] Deduced a trap composed of 79 places in 493 ms of which 7 ms to minimize.
[2024-05-24 15:50:52] [INFO ] Deduced a trap composed of 89 places in 486 ms of which 6 ms to minimize.
[2024-05-24 15:50:52] [INFO ] Deduced a trap composed of 93 places in 479 ms of which 7 ms to minimize.
[2024-05-24 15:50:53] [INFO ] Deduced a trap composed of 73 places in 479 ms of which 8 ms to minimize.
[2024-05-24 15:50:53] [INFO ] Deduced a trap composed of 93 places in 485 ms of which 6 ms to minimize.
[2024-05-24 15:50:54] [INFO ] Deduced a trap composed of 172 places in 505 ms of which 6 ms to minimize.
[2024-05-24 15:50:54] [INFO ] Deduced a trap composed of 102 places in 468 ms of which 6 ms to minimize.
[2024-05-24 15:50:55] [INFO ] Deduced a trap composed of 110 places in 481 ms of which 6 ms to minimize.
[2024-05-24 15:50:55] [INFO ] Deduced a trap composed of 103 places in 490 ms of which 6 ms to minimize.
[2024-05-24 15:50:56] [INFO ] Deduced a trap composed of 74 places in 499 ms of which 6 ms to minimize.
[2024-05-24 15:50:56] [INFO ] Deduced a trap composed of 88 places in 488 ms of which 6 ms to minimize.
[2024-05-24 15:50:57] [INFO ] Deduced a trap composed of 48 places in 535 ms of which 7 ms to minimize.
[2024-05-24 15:50:58] [INFO ] Deduced a trap composed of 114 places in 557 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/978 variables, 20/85 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-24 15:50:58] [INFO ] Deduced a trap composed of 171 places in 500 ms of which 6 ms to minimize.
[2024-05-24 15:50:59] [INFO ] Deduced a trap composed of 84 places in 487 ms of which 6 ms to minimize.
[2024-05-24 15:50:59] [INFO ] Deduced a trap composed of 94 places in 481 ms of which 6 ms to minimize.
[2024-05-24 15:51:00] [INFO ] Deduced a trap composed of 86 places in 501 ms of which 6 ms to minimize.
[2024-05-24 15:51:00] [INFO ] Deduced a trap composed of 82 places in 498 ms of which 6 ms to minimize.
[2024-05-24 15:51:01] [INFO ] Deduced a trap composed of 83 places in 487 ms of which 6 ms to minimize.
[2024-05-24 15:51:01] [INFO ] Deduced a trap composed of 80 places in 482 ms of which 6 ms to minimize.
[2024-05-24 15:51:02] [INFO ] Deduced a trap composed of 78 places in 488 ms of which 6 ms to minimize.
[2024-05-24 15:51:02] [INFO ] Deduced a trap composed of 80 places in 489 ms of which 5 ms to minimize.
[2024-05-24 15:51:03] [INFO ] Deduced a trap composed of 91 places in 477 ms of which 6 ms to minimize.
[2024-05-24 15:51:03] [INFO ] Deduced a trap composed of 78 places in 479 ms of which 5 ms to minimize.
[2024-05-24 15:51:04] [INFO ] Deduced a trap composed of 84 places in 484 ms of which 6 ms to minimize.
[2024-05-24 15:51:04] [INFO ] Deduced a trap composed of 70 places in 501 ms of which 7 ms to minimize.
[2024-05-24 15:51:05] [INFO ] Deduced a trap composed of 79 places in 525 ms of which 6 ms to minimize.
[2024-05-24 15:51:05] [INFO ] Deduced a trap composed of 95 places in 557 ms of which 7 ms to minimize.
[2024-05-24 15:51:06] [INFO ] Deduced a trap composed of 81 places in 516 ms of which 6 ms to minimize.
[2024-05-24 15:51:06] [INFO ] Deduced a trap composed of 72 places in 498 ms of which 6 ms to minimize.
[2024-05-24 15:51:07] [INFO ] Deduced a trap composed of 68 places in 487 ms of which 6 ms to minimize.
[2024-05-24 15:51:07] [INFO ] Deduced a trap composed of 75 places in 510 ms of which 6 ms to minimize.
[2024-05-24 15:51:08] [INFO ] Deduced a trap composed of 98 places in 509 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/978 variables, 20/105 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-24 15:51:09] [INFO ] Deduced a trap composed of 130 places in 534 ms of which 6 ms to minimize.
[2024-05-24 15:51:09] [INFO ] Deduced a trap composed of 99 places in 517 ms of which 7 ms to minimize.
[2024-05-24 15:51:10] [INFO ] Deduced a trap composed of 47 places in 485 ms of which 6 ms to minimize.
[2024-05-24 15:51:10] [INFO ] Deduced a trap composed of 71 places in 517 ms of which 21 ms to minimize.
[2024-05-24 15:51:11] [INFO ] Deduced a trap composed of 97 places in 513 ms of which 6 ms to minimize.
[2024-05-24 15:51:11] [INFO ] Deduced a trap composed of 81 places in 536 ms of which 6 ms to minimize.
[2024-05-24 15:51:12] [INFO ] Deduced a trap composed of 86 places in 497 ms of which 6 ms to minimize.
[2024-05-24 15:51:12] [INFO ] Deduced a trap composed of 77 places in 540 ms of which 7 ms to minimize.
[2024-05-24 15:51:13] [INFO ] Deduced a trap composed of 79 places in 560 ms of which 6 ms to minimize.
[2024-05-24 15:51:14] [INFO ] Deduced a trap composed of 141 places in 531 ms of which 7 ms to minimize.
[2024-05-24 15:51:14] [INFO ] Deduced a trap composed of 172 places in 552 ms of which 7 ms to minimize.
[2024-05-24 15:51:15] [INFO ] Deduced a trap composed of 80 places in 561 ms of which 8 ms to minimize.
[2024-05-24 15:51:15] [INFO ] Deduced a trap composed of 105 places in 524 ms of which 6 ms to minimize.
[2024-05-24 15:51:16] [INFO ] Deduced a trap composed of 70 places in 542 ms of which 6 ms to minimize.
[2024-05-24 15:51:16] [INFO ] Deduced a trap composed of 102 places in 515 ms of which 7 ms to minimize.
[2024-05-24 15:51:17] [INFO ] Deduced a trap composed of 84 places in 527 ms of which 6 ms to minimize.
[2024-05-24 15:51:17] [INFO ] Deduced a trap composed of 47 places in 464 ms of which 6 ms to minimize.
[2024-05-24 15:51:18] [INFO ] Deduced a trap composed of 72 places in 477 ms of which 6 ms to minimize.
[2024-05-24 15:51:18] [INFO ] Deduced a trap composed of 89 places in 524 ms of which 7 ms to minimize.
[2024-05-24 15:51:19] [INFO ] Deduced a trap composed of 99 places in 498 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/978 variables, 20/125 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-24 15:51:19] [INFO ] Deduced a trap composed of 167 places in 434 ms of which 6 ms to minimize.
[2024-05-24 15:51:20] [INFO ] Deduced a trap composed of 162 places in 412 ms of which 6 ms to minimize.
[2024-05-24 15:51:20] [INFO ] Deduced a trap composed of 170 places in 414 ms of which 6 ms to minimize.
[2024-05-24 15:51:21] [INFO ] Deduced a trap composed of 178 places in 430 ms of which 6 ms to minimize.
[2024-05-24 15:51:21] [INFO ] Deduced a trap composed of 173 places in 422 ms of which 6 ms to minimize.
[2024-05-24 15:51:22] [INFO ] Deduced a trap composed of 170 places in 413 ms of which 5 ms to minimize.
[2024-05-24 15:51:22] [INFO ] Deduced a trap composed of 178 places in 413 ms of which 6 ms to minimize.
[2024-05-24 15:51:23] [INFO ] Deduced a trap composed of 181 places in 412 ms of which 6 ms to minimize.
[2024-05-24 15:51:23] [INFO ] Deduced a trap composed of 172 places in 425 ms of which 6 ms to minimize.
[2024-05-24 15:51:23] [INFO ] Deduced a trap composed of 180 places in 414 ms of which 5 ms to minimize.
[2024-05-24 15:51:24] [INFO ] Deduced a trap composed of 180 places in 419 ms of which 5 ms to minimize.
[2024-05-24 15:51:24] [INFO ] Deduced a trap composed of 179 places in 427 ms of which 6 ms to minimize.
[2024-05-24 15:51:25] [INFO ] Deduced a trap composed of 187 places in 439 ms of which 6 ms to minimize.
[2024-05-24 15:51:25] [INFO ] Deduced a trap composed of 201 places in 435 ms of which 6 ms to minimize.
[2024-05-24 15:51:26] [INFO ] Deduced a trap composed of 181 places in 414 ms of which 6 ms to minimize.
[2024-05-24 15:51:26] [INFO ] Deduced a trap composed of 188 places in 424 ms of which 6 ms to minimize.
[2024-05-24 15:51:26] [INFO ] Deduced a trap composed of 193 places in 416 ms of which 6 ms to minimize.
[2024-05-24 15:51:27] [INFO ] Deduced a trap composed of 181 places in 425 ms of which 6 ms to minimize.
[2024-05-24 15:51:27] [INFO ] Deduced a trap composed of 184 places in 421 ms of which 5 ms to minimize.
SMT process timed out in 61409ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 1006 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1006/1006 places, 3190/3190 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1006 transition count 3189
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1005 transition count 3189
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1004 transition count 3188
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1004 transition count 3188
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 1004 transition count 3188
Applied a total of 5 rules in 197 ms. Remains 1004 /1006 variables (removed 2) and now considering 3188/3190 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 1004/1006 places, 3188/3190 transitions.
RANDOM walk for 40000 steps (1694 resets) in 901 ms. (44 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (185 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (187 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (158 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (194 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (159 resets) in 90 ms. (439 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 67938 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 5
Probabilistic random walk after 67938 steps, saw 28695 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-24 15:51:31] [INFO ] Flow matrix only has 2792 transitions (discarded 396 similar events)
// Phase 1: matrix 2792 rows 1004 cols
[2024-05-24 15:51:31] [INFO ] Computed 59 invariants in 21 ms
[2024-05-24 15:51:31] [INFO ] State equation strengthened by 1613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 906/916 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/916 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 20/936 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 15:51:32] [INFO ] Deduced a trap composed of 122 places in 500 ms of which 6 ms to minimize.
[2024-05-24 15:51:32] [INFO ] Deduced a trap composed of 126 places in 471 ms of which 6 ms to minimize.
[2024-05-24 15:51:33] [INFO ] Deduced a trap composed of 121 places in 480 ms of which 5 ms to minimize.
[2024-05-24 15:51:33] [INFO ] Deduced a trap composed of 161 places in 457 ms of which 6 ms to minimize.
[2024-05-24 15:51:34] [INFO ] Deduced a trap composed of 134 places in 452 ms of which 5 ms to minimize.
[2024-05-24 15:51:34] [INFO ] Deduced a trap composed of 373 places in 413 ms of which 6 ms to minimize.
[2024-05-24 15:51:35] [INFO ] Deduced a trap composed of 116 places in 462 ms of which 6 ms to minimize.
[2024-05-24 15:51:35] [INFO ] Deduced a trap composed of 100 places in 479 ms of which 6 ms to minimize.
[2024-05-24 15:51:36] [INFO ] Deduced a trap composed of 101 places in 474 ms of which 6 ms to minimize.
[2024-05-24 15:51:36] [INFO ] Deduced a trap composed of 107 places in 484 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/936 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/936 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 40/976 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 15:51:37] [INFO ] Deduced a trap composed of 5 places in 465 ms of which 6 ms to minimize.
[2024-05-24 15:51:38] [INFO ] Deduced a trap composed of 29 places in 433 ms of which 5 ms to minimize.
[2024-05-24 15:51:38] [INFO ] Deduced a trap composed of 184 places in 446 ms of which 6 ms to minimize.
[2024-05-24 15:51:38] [INFO ] Deduced a trap composed of 181 places in 453 ms of which 6 ms to minimize.
[2024-05-24 15:51:39] [INFO ] Deduced a trap composed of 27 places in 432 ms of which 5 ms to minimize.
[2024-05-24 15:51:39] [INFO ] Deduced a trap composed of 172 places in 460 ms of which 6 ms to minimize.
[2024-05-24 15:51:40] [INFO ] Deduced a trap composed of 154 places in 443 ms of which 6 ms to minimize.
[2024-05-24 15:51:40] [INFO ] Deduced a trap composed of 177 places in 444 ms of which 6 ms to minimize.
[2024-05-24 15:51:41] [INFO ] Deduced a trap composed of 27 places in 435 ms of which 6 ms to minimize.
[2024-05-24 15:51:41] [INFO ] Deduced a trap composed of 188 places in 458 ms of which 6 ms to minimize.
[2024-05-24 15:51:42] [INFO ] Deduced a trap composed of 57 places in 438 ms of which 6 ms to minimize.
[2024-05-24 15:51:42] [INFO ] Deduced a trap composed of 167 places in 461 ms of which 6 ms to minimize.
[2024-05-24 15:51:42] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 2 ms to minimize.
[2024-05-24 15:51:43] [INFO ] Deduced a trap composed of 100 places in 511 ms of which 6 ms to minimize.
[2024-05-24 15:51:43] [INFO ] Deduced a trap composed of 106 places in 523 ms of which 6 ms to minimize.
[2024-05-24 15:51:44] [INFO ] Deduced a trap composed of 47 places in 508 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/976 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 15:51:45] [INFO ] Deduced a trap composed of 100 places in 503 ms of which 7 ms to minimize.
[2024-05-24 15:51:45] [INFO ] Deduced a trap composed of 80 places in 522 ms of which 6 ms to minimize.
[2024-05-24 15:51:46] [INFO ] Deduced a trap composed of 100 places in 491 ms of which 7 ms to minimize.
[2024-05-24 15:51:46] [INFO ] Deduced a trap composed of 89 places in 534 ms of which 6 ms to minimize.
[2024-05-24 15:51:47] [INFO ] Deduced a trap composed of 79 places in 518 ms of which 6 ms to minimize.
[2024-05-24 15:51:47] [INFO ] Deduced a trap composed of 79 places in 508 ms of which 6 ms to minimize.
[2024-05-24 15:51:48] [INFO ] Deduced a trap composed of 86 places in 501 ms of which 6 ms to minimize.
[2024-05-24 15:51:48] [INFO ] Deduced a trap composed of 158 places in 455 ms of which 6 ms to minimize.
[2024-05-24 15:51:49] [INFO ] Deduced a trap composed of 174 places in 428 ms of which 6 ms to minimize.
[2024-05-24 15:51:49] [INFO ] Deduced a trap composed of 115 places in 502 ms of which 6 ms to minimize.
[2024-05-24 15:51:50] [INFO ] Deduced a trap composed of 197 places in 419 ms of which 6 ms to minimize.
[2024-05-24 15:51:50] [INFO ] Deduced a trap composed of 97 places in 528 ms of which 6 ms to minimize.
[2024-05-24 15:51:51] [INFO ] Deduced a trap composed of 180 places in 506 ms of which 6 ms to minimize.
[2024-05-24 15:51:51] [INFO ] Deduced a trap composed of 88 places in 517 ms of which 6 ms to minimize.
[2024-05-24 15:51:52] [INFO ] Deduced a trap composed of 96 places in 534 ms of which 6 ms to minimize.
[2024-05-24 15:51:52] [INFO ] Deduced a trap composed of 91 places in 512 ms of which 6 ms to minimize.
[2024-05-24 15:51:53] [INFO ] Deduced a trap composed of 185 places in 443 ms of which 6 ms to minimize.
[2024-05-24 15:51:53] [INFO ] Deduced a trap composed of 78 places in 524 ms of which 6 ms to minimize.
[2024-05-24 15:51:54] [INFO ] Deduced a trap composed of 102 places in 496 ms of which 6 ms to minimize.
[2024-05-24 15:51:54] [INFO ] Deduced a trap composed of 195 places in 423 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/976 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 15:51:55] [INFO ] Deduced a trap composed of 100 places in 496 ms of which 5 ms to minimize.
[2024-05-24 15:51:55] [INFO ] Deduced a trap composed of 107 places in 539 ms of which 7 ms to minimize.
[2024-05-24 15:51:56] [INFO ] Deduced a trap composed of 192 places in 447 ms of which 6 ms to minimize.
[2024-05-24 15:51:56] [INFO ] Deduced a trap composed of 90 places in 539 ms of which 6 ms to minimize.
[2024-05-24 15:51:57] [INFO ] Deduced a trap composed of 105 places in 537 ms of which 6 ms to minimize.
[2024-05-24 15:51:58] [INFO ] Deduced a trap composed of 116 places in 547 ms of which 6 ms to minimize.
[2024-05-24 15:51:58] [INFO ] Deduced a trap composed of 171 places in 446 ms of which 6 ms to minimize.
[2024-05-24 15:51:59] [INFO ] Deduced a trap composed of 81 places in 538 ms of which 6 ms to minimize.
[2024-05-24 15:51:59] [INFO ] Deduced a trap composed of 80 places in 542 ms of which 6 ms to minimize.
[2024-05-24 15:52:00] [INFO ] Deduced a trap composed of 81 places in 483 ms of which 6 ms to minimize.
[2024-05-24 15:52:00] [INFO ] Deduced a trap composed of 192 places in 441 ms of which 6 ms to minimize.
[2024-05-24 15:52:01] [INFO ] Deduced a trap composed of 171 places in 434 ms of which 6 ms to minimize.
[2024-05-24 15:52:01] [INFO ] Deduced a trap composed of 193 places in 459 ms of which 6 ms to minimize.
[2024-05-24 15:52:01] [INFO ] Deduced a trap composed of 191 places in 435 ms of which 6 ms to minimize.
[2024-05-24 15:52:02] [INFO ] Deduced a trap composed of 186 places in 427 ms of which 6 ms to minimize.
[2024-05-24 15:52:02] [INFO ] Deduced a trap composed of 154 places in 440 ms of which 6 ms to minimize.
[2024-05-24 15:52:03] [INFO ] Deduced a trap composed of 165 places in 438 ms of which 6 ms to minimize.
[2024-05-24 15:52:03] [INFO ] Deduced a trap composed of 118 places in 542 ms of which 7 ms to minimize.
[2024-05-24 15:52:04] [INFO ] Deduced a trap composed of 151 places in 533 ms of which 8 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/976 variables, 19/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/976 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 20/996 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/996 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 8/1004 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1004 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2792/3796 variables, 1004/1128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp27 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/3796 variables, 1613/2741 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3796 variables, 0/2741 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/3796 variables, 0/2741 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3796/3796 variables, and 2741 constraints, problems are : Problem set: 1 solved, 4 unsolved in 35660 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 1004/1004 constraints, ReadFeed: 1613/1613 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 905/913 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/913 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 20/933 variables, 3/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 9/18 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-24 15:52:08] [INFO ] Deduced a trap composed of 108 places in 471 ms of which 6 ms to minimize.
[2024-05-24 15:52:08] [INFO ] Deduced a trap composed of 122 places in 464 ms of which 5 ms to minimize.
[2024-05-24 15:52:09] [INFO ] Deduced a trap composed of 121 places in 467 ms of which 5 ms to minimize.
[2024-05-24 15:52:09] [INFO ] Deduced a trap composed of 101 places in 443 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/933 variables, 4/22 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/933 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 41/974 variables, 20/42 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/974 variables, 41/83 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-24 15:52:10] [INFO ] Deduced a trap composed of 87 places in 489 ms of which 6 ms to minimize.
[2024-05-24 15:52:10] [INFO ] Deduced a trap composed of 88 places in 517 ms of which 7 ms to minimize.
[2024-05-24 15:52:11] [INFO ] Deduced a trap composed of 87 places in 476 ms of which 6 ms to minimize.
[2024-05-24 15:52:11] [INFO ] Deduced a trap composed of 78 places in 481 ms of which 7 ms to minimize.
[2024-05-24 15:52:12] [INFO ] Deduced a trap composed of 72 places in 504 ms of which 7 ms to minimize.
[2024-05-24 15:52:12] [INFO ] Deduced a trap composed of 79 places in 483 ms of which 6 ms to minimize.
[2024-05-24 15:52:13] [INFO ] Deduced a trap composed of 98 places in 541 ms of which 7 ms to minimize.
[2024-05-24 15:52:13] [INFO ] Deduced a trap composed of 87 places in 516 ms of which 6 ms to minimize.
[2024-05-24 15:52:14] [INFO ] Deduced a trap composed of 170 places in 448 ms of which 6 ms to minimize.
[2024-05-24 15:52:14] [INFO ] Deduced a trap composed of 163 places in 452 ms of which 6 ms to minimize.
[2024-05-24 15:52:15] [INFO ] Deduced a trap composed of 188 places in 455 ms of which 5 ms to minimize.
[2024-05-24 15:52:15] [INFO ] Deduced a trap composed of 63 places in 517 ms of which 6 ms to minimize.
[2024-05-24 15:52:16] [INFO ] Deduced a trap composed of 72 places in 516 ms of which 6 ms to minimize.
[2024-05-24 15:52:16] [INFO ] Deduced a trap composed of 92 places in 526 ms of which 6 ms to minimize.
[2024-05-24 15:52:17] [INFO ] Deduced a trap composed of 89 places in 499 ms of which 6 ms to minimize.
[2024-05-24 15:52:17] [INFO ] Deduced a trap composed of 63 places in 527 ms of which 6 ms to minimize.
[2024-05-24 15:52:18] [INFO ] Deduced a trap composed of 88 places in 506 ms of which 6 ms to minimize.
[2024-05-24 15:52:19] [INFO ] Deduced a trap composed of 181 places in 549 ms of which 6 ms to minimize.
[2024-05-24 15:52:19] [INFO ] Deduced a trap composed of 98 places in 544 ms of which 6 ms to minimize.
[2024-05-24 15:52:20] [INFO ] Deduced a trap composed of 93 places in 535 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/974 variables, 20/103 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-24 15:52:20] [INFO ] Deduced a trap composed of 167 places in 471 ms of which 6 ms to minimize.
[2024-05-24 15:52:21] [INFO ] Deduced a trap composed of 179 places in 495 ms of which 6 ms to minimize.
[2024-05-24 15:52:21] [INFO ] Deduced a trap composed of 188 places in 456 ms of which 6 ms to minimize.
[2024-05-24 15:52:22] [INFO ] Deduced a trap composed of 214 places in 483 ms of which 6 ms to minimize.
[2024-05-24 15:52:22] [INFO ] Deduced a trap composed of 151 places in 433 ms of which 6 ms to minimize.
[2024-05-24 15:52:23] [INFO ] Deduced a trap composed of 160 places in 457 ms of which 6 ms to minimize.
[2024-05-24 15:52:23] [INFO ] Deduced a trap composed of 167 places in 437 ms of which 6 ms to minimize.
[2024-05-24 15:52:24] [INFO ] Deduced a trap composed of 192 places in 464 ms of which 7 ms to minimize.
[2024-05-24 15:52:24] [INFO ] Deduced a trap composed of 160 places in 447 ms of which 6 ms to minimize.
[2024-05-24 15:52:25] [INFO ] Deduced a trap composed of 189 places in 445 ms of which 6 ms to minimize.
[2024-05-24 15:52:25] [INFO ] Deduced a trap composed of 168 places in 463 ms of which 6 ms to minimize.
[2024-05-24 15:52:26] [INFO ] Deduced a trap composed of 194 places in 468 ms of which 7 ms to minimize.
[2024-05-24 15:52:26] [INFO ] Deduced a trap composed of 162 places in 461 ms of which 7 ms to minimize.
[2024-05-24 15:52:26] [INFO ] Deduced a trap composed of 168 places in 443 ms of which 6 ms to minimize.
[2024-05-24 15:52:27] [INFO ] Deduced a trap composed of 196 places in 446 ms of which 6 ms to minimize.
[2024-05-24 15:52:27] [INFO ] Deduced a trap composed of 190 places in 452 ms of which 6 ms to minimize.
[2024-05-24 15:52:28] [INFO ] Deduced a trap composed of 216 places in 439 ms of which 6 ms to minimize.
[2024-05-24 15:52:28] [INFO ] Deduced a trap composed of 187 places in 442 ms of which 6 ms to minimize.
[2024-05-24 15:52:29] [INFO ] Deduced a trap composed of 201 places in 437 ms of which 6 ms to minimize.
[2024-05-24 15:52:29] [INFO ] Deduced a trap composed of 183 places in 413 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/974 variables, 20/123 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-24 15:52:30] [INFO ] Deduced a trap composed of 153 places in 451 ms of which 6 ms to minimize.
[2024-05-24 15:52:30] [INFO ] Deduced a trap composed of 178 places in 427 ms of which 6 ms to minimize.
[2024-05-24 15:52:31] [INFO ] Deduced a trap composed of 164 places in 461 ms of which 6 ms to minimize.
[2024-05-24 15:52:31] [INFO ] Deduced a trap composed of 172 places in 434 ms of which 6 ms to minimize.
[2024-05-24 15:52:32] [INFO ] Deduced a trap composed of 155 places in 435 ms of which 6 ms to minimize.
[2024-05-24 15:52:32] [INFO ] Deduced a trap composed of 169 places in 435 ms of which 6 ms to minimize.
[2024-05-24 15:52:33] [INFO ] Deduced a trap composed of 160 places in 452 ms of which 6 ms to minimize.
[2024-05-24 15:52:33] [INFO ] Deduced a trap composed of 207 places in 428 ms of which 6 ms to minimize.
[2024-05-24 15:52:33] [INFO ] Deduced a trap composed of 202 places in 467 ms of which 6 ms to minimize.
[2024-05-24 15:52:34] [INFO ] Deduced a trap composed of 190 places in 455 ms of which 6 ms to minimize.
[2024-05-24 15:52:34] [INFO ] Deduced a trap composed of 184 places in 438 ms of which 7 ms to minimize.
[2024-05-24 15:52:35] [INFO ] Deduced a trap composed of 177 places in 437 ms of which 6 ms to minimize.
[2024-05-24 15:52:35] [INFO ] Deduced a trap composed of 184 places in 443 ms of which 6 ms to minimize.
[2024-05-24 15:52:36] [INFO ] Deduced a trap composed of 192 places in 445 ms of which 6 ms to minimize.
[2024-05-24 15:52:36] [INFO ] Deduced a trap composed of 198 places in 435 ms of which 7 ms to minimize.
[2024-05-24 15:52:37] [INFO ] Deduced a trap composed of 181 places in 476 ms of which 6 ms to minimize.
[2024-05-24 15:52:37] [INFO ] Deduced a trap composed of 187 places in 451 ms of which 6 ms to minimize.
[2024-05-24 15:52:38] [INFO ] Deduced a trap composed of 248 places in 449 ms of which 7 ms to minimize.
[2024-05-24 15:52:38] [INFO ] Deduced a trap composed of 221 places in 431 ms of which 6 ms to minimize.
[2024-05-24 15:52:39] [INFO ] Deduced a trap composed of 165 places in 466 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/974 variables, 20/143 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-24 15:52:39] [INFO ] Deduced a trap composed of 159 places in 428 ms of which 6 ms to minimize.
[2024-05-24 15:52:40] [INFO ] Deduced a trap composed of 170 places in 451 ms of which 6 ms to minimize.
[2024-05-24 15:52:40] [INFO ] Deduced a trap composed of 185 places in 413 ms of which 6 ms to minimize.
[2024-05-24 15:52:41] [INFO ] Deduced a trap composed of 136 places in 464 ms of which 7 ms to minimize.
[2024-05-24 15:52:41] [INFO ] Deduced a trap composed of 149 places in 428 ms of which 6 ms to minimize.
[2024-05-24 15:52:42] [INFO ] Deduced a trap composed of 153 places in 443 ms of which 6 ms to minimize.
[2024-05-24 15:52:42] [INFO ] Deduced a trap composed of 160 places in 401 ms of which 5 ms to minimize.
[2024-05-24 15:52:42] [INFO ] Deduced a trap composed of 168 places in 400 ms of which 5 ms to minimize.
[2024-05-24 15:52:43] [INFO ] Deduced a trap composed of 182 places in 428 ms of which 6 ms to minimize.
[2024-05-24 15:52:43] [INFO ] Deduced a trap composed of 188 places in 408 ms of which 6 ms to minimize.
[2024-05-24 15:52:44] [INFO ] Deduced a trap composed of 141 places in 417 ms of which 5 ms to minimize.
[2024-05-24 15:52:44] [INFO ] Deduced a trap composed of 151 places in 405 ms of which 6 ms to minimize.
[2024-05-24 15:52:45] [INFO ] Deduced a trap composed of 171 places in 407 ms of which 6 ms to minimize.
[2024-05-24 15:52:45] [INFO ] Deduced a trap composed of 231 places in 451 ms of which 6 ms to minimize.
[2024-05-24 15:52:46] [INFO ] Deduced a trap composed of 183 places in 409 ms of which 6 ms to minimize.
[2024-05-24 15:52:46] [INFO ] Deduced a trap composed of 188 places in 438 ms of which 5 ms to minimize.
[2024-05-24 15:52:47] [INFO ] Deduced a trap composed of 189 places in 415 ms of which 6 ms to minimize.
[2024-05-24 15:52:47] [INFO ] Deduced a trap composed of 94 places in 458 ms of which 6 ms to minimize.
[2024-05-24 15:52:48] [INFO ] Deduced a trap composed of 97 places in 427 ms of which 6 ms to minimize.
[2024-05-24 15:52:48] [INFO ] Deduced a trap composed of 87 places in 456 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/974 variables, 20/163 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-24 15:52:49] [INFO ] Deduced a trap composed of 113 places in 448 ms of which 6 ms to minimize.
[2024-05-24 15:52:49] [INFO ] Deduced a trap composed of 63 places in 466 ms of which 6 ms to minimize.
[2024-05-24 15:52:50] [INFO ] Deduced a trap composed of 98 places in 463 ms of which 6 ms to minimize.
[2024-05-24 15:52:50] [INFO ] Deduced a trap composed of 63 places in 433 ms of which 5 ms to minimize.
[2024-05-24 15:52:51] [INFO ] Deduced a trap composed of 105 places in 447 ms of which 6 ms to minimize.
[2024-05-24 15:52:51] [INFO ] Deduced a trap composed of 94 places in 446 ms of which 6 ms to minimize.
[2024-05-24 15:52:52] [INFO ] Deduced a trap composed of 124 places in 443 ms of which 6 ms to minimize.
[2024-05-24 15:52:52] [INFO ] Deduced a trap composed of 94 places in 474 ms of which 5 ms to minimize.
[2024-05-24 15:52:53] [INFO ] Deduced a trap composed of 129 places in 432 ms of which 6 ms to minimize.
[2024-05-24 15:52:53] [INFO ] Deduced a trap composed of 156 places in 454 ms of which 6 ms to minimize.
[2024-05-24 15:52:54] [INFO ] Deduced a trap composed of 95 places in 524 ms of which 6 ms to minimize.
[2024-05-24 15:52:54] [INFO ] Deduced a trap composed of 70 places in 514 ms of which 6 ms to minimize.
[2024-05-24 15:52:55] [INFO ] Deduced a trap composed of 173 places in 512 ms of which 7 ms to minimize.
[2024-05-24 15:52:55] [INFO ] Deduced a trap composed of 98 places in 504 ms of which 5 ms to minimize.
[2024-05-24 15:52:56] [INFO ] Deduced a trap composed of 80 places in 489 ms of which 5 ms to minimize.
[2024-05-24 15:52:56] [INFO ] Deduced a trap composed of 74 places in 506 ms of which 6 ms to minimize.
[2024-05-24 15:52:57] [INFO ] Deduced a trap composed of 137 places in 210 ms of which 4 ms to minimize.
[2024-05-24 15:52:57] [INFO ] Deduced a trap composed of 104 places in 487 ms of which 6 ms to minimize.
[2024-05-24 15:52:58] [INFO ] Deduced a trap composed of 100 places in 487 ms of which 6 ms to minimize.
[2024-05-24 15:52:58] [INFO ] Deduced a trap composed of 155 places in 462 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/974 variables, 20/183 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-24 15:52:59] [INFO ] Deduced a trap composed of 189 places in 450 ms of which 6 ms to minimize.
[2024-05-24 15:52:59] [INFO ] Deduced a trap composed of 280 places in 427 ms of which 6 ms to minimize.
[2024-05-24 15:52:59] [INFO ] Deduced a trap composed of 234 places in 416 ms of which 5 ms to minimize.
[2024-05-24 15:53:00] [INFO ] Deduced a trap composed of 236 places in 426 ms of which 6 ms to minimize.
[2024-05-24 15:53:00] [INFO ] Deduced a trap composed of 176 places in 452 ms of which 6 ms to minimize.
[2024-05-24 15:53:01] [INFO ] Deduced a trap composed of 110 places in 182 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/974 variables, 6/189 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-24 15:53:01] [INFO ] Deduced a trap composed of 192 places in 463 ms of which 6 ms to minimize.
[2024-05-24 15:53:02] [INFO ] Deduced a trap composed of 198 places in 446 ms of which 6 ms to minimize.
[2024-05-24 15:53:02] [INFO ] Deduced a trap composed of 215 places in 430 ms of which 5 ms to minimize.
[2024-05-24 15:53:03] [INFO ] Deduced a trap composed of 217 places in 439 ms of which 6 ms to minimize.
[2024-05-24 15:53:03] [INFO ] Deduced a trap composed of 203 places in 425 ms of which 5 ms to minimize.
[2024-05-24 15:53:04] [INFO ] Deduced a trap composed of 300 places in 451 ms of which 6 ms to minimize.
[2024-05-24 15:53:04] [INFO ] Deduced a trap composed of 206 places in 430 ms of which 6 ms to minimize.
[2024-05-24 15:53:04] [INFO ] Deduced a trap composed of 265 places in 452 ms of which 6 ms to minimize.
[2024-05-24 15:53:05] [INFO ] Deduced a trap composed of 219 places in 447 ms of which 6 ms to minimize.
[2024-05-24 15:53:05] [INFO ] Deduced a trap composed of 269 places in 439 ms of which 5 ms to minimize.
[2024-05-24 15:53:06] [INFO ] Deduced a trap composed of 216 places in 425 ms of which 6 ms to minimize.
[2024-05-24 15:53:06] [INFO ] Deduced a trap composed of 215 places in 434 ms of which 6 ms to minimize.
[2024-05-24 15:53:07] [INFO ] Deduced a trap composed of 260 places in 429 ms of which 7 ms to minimize.
[2024-05-24 15:53:07] [INFO ] Deduced a trap composed of 268 places in 423 ms of which 5 ms to minimize.
[2024-05-24 15:53:08] [INFO ] Deduced a trap composed of 273 places in 421 ms of which 6 ms to minimize.
[2024-05-24 15:53:08] [INFO ] Deduced a trap composed of 234 places in 456 ms of which 5 ms to minimize.
[2024-05-24 15:53:09] [INFO ] Deduced a trap composed of 109 places in 491 ms of which 6 ms to minimize.
[2024-05-24 15:53:09] [INFO ] Deduced a trap composed of 211 places in 436 ms of which 6 ms to minimize.
[2024-05-24 15:53:10] [INFO ] Deduced a trap composed of 85 places in 501 ms of which 6 ms to minimize.
[2024-05-24 15:53:10] [INFO ] Deduced a trap composed of 90 places in 504 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/974 variables, 20/209 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-24 15:53:11] [INFO ] Deduced a trap composed of 228 places in 428 ms of which 6 ms to minimize.
[2024-05-24 15:53:11] [INFO ] Deduced a trap composed of 230 places in 441 ms of which 6 ms to minimize.
[2024-05-24 15:53:12] [INFO ] Deduced a trap composed of 230 places in 428 ms of which 6 ms to minimize.
[2024-05-24 15:53:12] [INFO ] Deduced a trap composed of 230 places in 430 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/974 variables, 4/213 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/974 variables, 0/213 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 22/996 variables, 22/235 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/996 variables, 15/250 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-24 15:53:13] [INFO ] Deduced a trap composed of 72 places in 539 ms of which 7 ms to minimize.
[2024-05-24 15:53:14] [INFO ] Deduced a trap composed of 70 places in 520 ms of which 6 ms to minimize.
[2024-05-24 15:53:14] [INFO ] Deduced a trap composed of 188 places in 478 ms of which 7 ms to minimize.
[2024-05-24 15:53:15] [INFO ] Deduced a trap composed of 95 places in 516 ms of which 6 ms to minimize.
[2024-05-24 15:53:15] [INFO ] Deduced a trap composed of 82 places in 501 ms of which 6 ms to minimize.
[2024-05-24 15:53:16] [INFO ] Deduced a trap composed of 186 places in 483 ms of which 6 ms to minimize.
[2024-05-24 15:53:16] [INFO ] Deduced a trap composed of 194 places in 484 ms of which 6 ms to minimize.
[2024-05-24 15:53:17] [INFO ] Deduced a trap composed of 77 places in 518 ms of which 6 ms to minimize.
[2024-05-24 15:53:17] [INFO ] Deduced a trap composed of 179 places in 469 ms of which 6 ms to minimize.
[2024-05-24 15:53:18] [INFO ] Deduced a trap composed of 187 places in 462 ms of which 6 ms to minimize.
[2024-05-24 15:53:18] [INFO ] Deduced a trap composed of 179 places in 468 ms of which 6 ms to minimize.
[2024-05-24 15:53:19] [INFO ] Deduced a trap composed of 89 places in 519 ms of which 6 ms to minimize.
[2024-05-24 15:53:19] [INFO ] Deduced a trap composed of 97 places in 494 ms of which 6 ms to minimize.
[2024-05-24 15:53:20] [INFO ] Deduced a trap composed of 81 places in 519 ms of which 6 ms to minimize.
[2024-05-24 15:53:20] [INFO ] Deduced a trap composed of 92 places in 519 ms of which 7 ms to minimize.
[2024-05-24 15:53:21] [INFO ] Deduced a trap composed of 90 places in 535 ms of which 6 ms to minimize.
[2024-05-24 15:53:22] [INFO ] Deduced a trap composed of 88 places in 511 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 996/3796 variables, and 267 constraints, problems are : Problem set: 1 solved, 4 unsolved in 75010 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 20/28 constraints, State Equation: 0/1004 constraints, ReadFeed: 0/1613 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 216/216 constraints]
After SMT, in 110748ms problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 1004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 3188/3188 transitions.
Applied a total of 0 rules in 80 ms. Remains 1004 /1004 variables (removed 0) and now considering 3188/3188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 1004/1004 places, 3188/3188 transitions.
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
Computed a total of 421 stabilizing places and 1129 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' '!((p0 U X(X(G(p1)))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 2762/2762 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1232 transition count 2738
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1232 transition count 2738
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 61 place count 1213 transition count 2677
Iterating global reduction 0 with 19 rules applied. Total rules applied 80 place count 1213 transition count 2677
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 1208 transition count 2657
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 1208 transition count 2657
Applied a total of 90 rules in 153 ms. Remains 1208 /1253 variables (removed 45) and now considering 2657/2762 (removed 105) transitions.
[2024-05-24 15:53:22] [INFO ] Flow matrix only has 2385 transitions (discarded 272 similar events)
// Phase 1: matrix 2385 rows 1208 cols
[2024-05-24 15:53:22] [INFO ] Computed 59 invariants in 32 ms
[2024-05-24 15:53:24] [INFO ] Implicit Places using invariants in 1105 ms returned [12, 99, 101, 241, 289, 343, 382, 423, 501, 540, 571, 596, 623, 633, 716, 799, 834, 1098]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1107 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1190/1253 places, 2657/2762 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1172 transition count 2639
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1172 transition count 2639
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 1154 transition count 2621
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 1154 transition count 2621
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 90 place count 1136 transition count 2603
Iterating global reduction 0 with 18 rules applied. Total rules applied 108 place count 1136 transition count 2603
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 125 place count 1119 transition count 2535
Iterating global reduction 0 with 17 rules applied. Total rules applied 142 place count 1119 transition count 2535
Applied a total of 142 rules in 201 ms. Remains 1119 /1190 variables (removed 71) and now considering 2535/2657 (removed 122) transitions.
[2024-05-24 15:53:24] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
// Phase 1: matrix 2263 rows 1119 cols
[2024-05-24 15:53:24] [INFO ] Computed 41 invariants in 24 ms
[2024-05-24 15:53:25] [INFO ] Implicit Places using invariants in 961 ms returned []
[2024-05-24 15:53:25] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2024-05-24 15:53:25] [INFO ] Invariant cache hit.
[2024-05-24 15:53:25] [INFO ] State equation strengthened by 827 read => feed constraints.
[2024-05-24 15:53:36] [INFO ] Implicit Places using invariants and state equation in 11244 ms returned [1096]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 12208 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1118/1253 places, 2535/2762 transitions.
Applied a total of 0 rules in 37 ms. Remains 1118 /1118 variables (removed 0) and now considering 2535/2535 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 13708 ms. Remains : 1118/1253 places, 2535/2762 transitions.
Stuttering acceptance computed with spot in 302 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-00 finished in 14067 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 2762/2762 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1232 transition count 2735
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1232 transition count 2735
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 60 place count 1214 transition count 2678
Iterating global reduction 0 with 18 rules applied. Total rules applied 78 place count 1214 transition count 2678
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 1209 transition count 2658
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 1209 transition count 2658
Applied a total of 88 rules in 154 ms. Remains 1209 /1253 variables (removed 44) and now considering 2658/2762 (removed 104) transitions.
[2024-05-24 15:53:36] [INFO ] Flow matrix only has 2386 transitions (discarded 272 similar events)
// Phase 1: matrix 2386 rows 1209 cols
[2024-05-24 15:53:36] [INFO ] Computed 59 invariants in 20 ms
[2024-05-24 15:53:37] [INFO ] Implicit Places using invariants in 1024 ms returned [12, 99, 101, 241, 289, 343, 382, 423, 542, 573, 598, 625, 635, 718, 801, 836, 1099]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1026 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1192/1253 places, 2658/2762 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1175 transition count 2641
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1175 transition count 2641
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 1158 transition count 2624
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 1158 transition count 2624
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 85 place count 1141 transition count 2607
Iterating global reduction 0 with 17 rules applied. Total rules applied 102 place count 1141 transition count 2607
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 118 place count 1125 transition count 2543
Iterating global reduction 0 with 16 rules applied. Total rules applied 134 place count 1125 transition count 2543
Applied a total of 134 rules in 196 ms. Remains 1125 /1192 variables (removed 67) and now considering 2543/2658 (removed 115) transitions.
[2024-05-24 15:53:38] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1125 cols
[2024-05-24 15:53:38] [INFO ] Computed 42 invariants in 20 ms
[2024-05-24 15:53:39] [INFO ] Implicit Places using invariants in 972 ms returned []
[2024-05-24 15:53:39] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2024-05-24 15:53:39] [INFO ] Invariant cache hit.
[2024-05-24 15:53:39] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-24 15:53:50] [INFO ] Implicit Places using invariants and state equation in 11131 ms returned [1114]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 12106 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1124/1253 places, 2543/2762 transitions.
Applied a total of 0 rules in 37 ms. Remains 1124 /1124 variables (removed 0) and now considering 2543/2543 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 13520 ms. Remains : 1124/1253 places, 2543/2762 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-01
Entered a terminal (fully accepting) state of product in 9529 steps with 228 reset in 110 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-01 finished in 13822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 2762/2762 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1231 transition count 2734
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1231 transition count 2734
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 63 place count 1212 transition count 2673
Iterating global reduction 0 with 19 rules applied. Total rules applied 82 place count 1212 transition count 2673
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 87 place count 1207 transition count 2653
Iterating global reduction 0 with 5 rules applied. Total rules applied 92 place count 1207 transition count 2653
Applied a total of 92 rules in 163 ms. Remains 1207 /1253 variables (removed 46) and now considering 2653/2762 (removed 109) transitions.
[2024-05-24 15:53:50] [INFO ] Flow matrix only has 2381 transitions (discarded 272 similar events)
// Phase 1: matrix 2381 rows 1207 cols
[2024-05-24 15:53:50] [INFO ] Computed 59 invariants in 28 ms
[2024-05-24 15:53:51] [INFO ] Implicit Places using invariants in 1090 ms returned [12, 99, 101, 241, 289, 343, 382, 423, 501, 540, 571, 596, 623, 633, 716, 799, 834, 1097]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1092 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1189/1253 places, 2653/2762 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1171 transition count 2635
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1171 transition count 2635
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 1153 transition count 2617
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 1153 transition count 2617
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 90 place count 1135 transition count 2599
Iterating global reduction 0 with 18 rules applied. Total rules applied 108 place count 1135 transition count 2599
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 125 place count 1118 transition count 2531
Iterating global reduction 0 with 17 rules applied. Total rules applied 142 place count 1118 transition count 2531
Applied a total of 142 rules in 208 ms. Remains 1118 /1189 variables (removed 71) and now considering 2531/2653 (removed 122) transitions.
[2024-05-24 15:53:52] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
// Phase 1: matrix 2259 rows 1118 cols
[2024-05-24 15:53:52] [INFO ] Computed 41 invariants in 30 ms
[2024-05-24 15:53:53] [INFO ] Implicit Places using invariants in 968 ms returned []
[2024-05-24 15:53:53] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
[2024-05-24 15:53:53] [INFO ] Invariant cache hit.
[2024-05-24 15:53:53] [INFO ] State equation strengthened by 824 read => feed constraints.
[2024-05-24 15:54:05] [INFO ] Implicit Places using invariants and state equation in 12461 ms returned [1095, 1107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13431 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1116/1253 places, 2531/2762 transitions.
Applied a total of 0 rules in 38 ms. Remains 1116 /1116 variables (removed 0) and now considering 2531/2531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 14933 ms. Remains : 1116/1253 places, 2531/2762 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-02 finished in 15077 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 2762/2762 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1233 transition count 2736
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1233 transition count 2736
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 58 place count 1215 transition count 2679
Iterating global reduction 0 with 18 rules applied. Total rules applied 76 place count 1215 transition count 2679
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 81 place count 1210 transition count 2659
Iterating global reduction 0 with 5 rules applied. Total rules applied 86 place count 1210 transition count 2659
Applied a total of 86 rules in 164 ms. Remains 1210 /1253 variables (removed 43) and now considering 2659/2762 (removed 103) transitions.
[2024-05-24 15:54:05] [INFO ] Flow matrix only has 2387 transitions (discarded 272 similar events)
// Phase 1: matrix 2387 rows 1210 cols
[2024-05-24 15:54:05] [INFO ] Computed 59 invariants in 29 ms
[2024-05-24 15:54:06] [INFO ] Implicit Places using invariants in 1092 ms returned [12, 99, 101, 241, 346, 385, 426, 504, 543, 574, 599, 626, 636, 719, 802, 837, 1100]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1094 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1193/1253 places, 2659/2762 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1176 transition count 2642
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1176 transition count 2642
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 1159 transition count 2625
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 1159 transition count 2625
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 85 place count 1142 transition count 2608
Iterating global reduction 0 with 17 rules applied. Total rules applied 102 place count 1142 transition count 2608
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 117 place count 1127 transition count 2548
Iterating global reduction 0 with 15 rules applied. Total rules applied 132 place count 1127 transition count 2548
Applied a total of 132 rules in 197 ms. Remains 1127 /1193 variables (removed 66) and now considering 2548/2659 (removed 111) transitions.
[2024-05-24 15:54:07] [INFO ] Flow matrix only has 2276 transitions (discarded 272 similar events)
// Phase 1: matrix 2276 rows 1127 cols
[2024-05-24 15:54:07] [INFO ] Computed 42 invariants in 30 ms
[2024-05-24 15:54:08] [INFO ] Implicit Places using invariants in 998 ms returned []
[2024-05-24 15:54:08] [INFO ] Flow matrix only has 2276 transitions (discarded 272 similar events)
[2024-05-24 15:54:08] [INFO ] Invariant cache hit.
[2024-05-24 15:54:08] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-24 15:54:20] [INFO ] Implicit Places using invariants and state equation in 12234 ms returned []
Implicit Place search using SMT with State Equation took 13233 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1127/1253 places, 2548/2762 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14689 ms. Remains : 1127/1253 places, 2548/2762 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-03
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-03 finished in 14840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 2762/2762 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 1253 transition count 2749
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 1240 transition count 2749
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 26 place count 1240 transition count 2729
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 66 place count 1220 transition count 2729
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 81 place count 1205 transition count 2708
Iterating global reduction 2 with 15 rules applied. Total rules applied 96 place count 1205 transition count 2708
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 96 place count 1205 transition count 2705
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 102 place count 1202 transition count 2705
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 114 place count 1190 transition count 2657
Iterating global reduction 2 with 12 rules applied. Total rules applied 126 place count 1190 transition count 2657
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 178 place count 1164 transition count 2631
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 183 place count 1159 transition count 2626
Iterating global reduction 2 with 5 rules applied. Total rules applied 188 place count 1159 transition count 2626
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 193 place count 1154 transition count 2606
Iterating global reduction 2 with 5 rules applied. Total rules applied 198 place count 1154 transition count 2606
Applied a total of 198 rules in 431 ms. Remains 1154 /1253 variables (removed 99) and now considering 2606/2762 (removed 156) transitions.
[2024-05-24 15:54:20] [INFO ] Flow matrix only has 2334 transitions (discarded 272 similar events)
// Phase 1: matrix 2334 rows 1154 cols
[2024-05-24 15:54:21] [INFO ] Computed 59 invariants in 26 ms
[2024-05-24 15:54:21] [INFO ] Implicit Places using invariants in 1018 ms returned [9, 94, 95, 224, 268, 322, 357, 398, 472, 509, 538, 561, 586, 677, 794, 1054]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1021 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1138/1253 places, 2606/2762 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1126 transition count 2594
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1126 transition count 2594
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1114 transition count 2582
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1114 transition count 2582
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 59 place count 1103 transition count 2538
Iterating global reduction 0 with 11 rules applied. Total rules applied 70 place count 1103 transition count 2538
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 78 place count 1099 transition count 2534
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 1095 transition count 2530
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 1095 transition count 2530
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 90 place count 1091 transition count 2514
Iterating global reduction 0 with 4 rules applied. Total rules applied 94 place count 1091 transition count 2514
Applied a total of 94 rules in 353 ms. Remains 1091 /1138 variables (removed 47) and now considering 2514/2606 (removed 92) transitions.
[2024-05-24 15:54:22] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
// Phase 1: matrix 2242 rows 1091 cols
[2024-05-24 15:54:22] [INFO ] Computed 43 invariants in 17 ms
[2024-05-24 15:54:23] [INFO ] Implicit Places using invariants in 976 ms returned []
[2024-05-24 15:54:23] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
[2024-05-24 15:54:23] [INFO ] Invariant cache hit.
[2024-05-24 15:54:24] [INFO ] State equation strengthened by 836 read => feed constraints.
[2024-05-24 15:54:34] [INFO ] Implicit Places using invariants and state equation in 11089 ms returned [1074]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 12069 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1090/1253 places, 2514/2762 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1090 transition count 2513
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1089 transition count 2513
Applied a total of 2 rules in 92 ms. Remains 1089 /1090 variables (removed 1) and now considering 2513/2514 (removed 1) transitions.
[2024-05-24 15:54:34] [INFO ] Flow matrix only has 2241 transitions (discarded 272 similar events)
// Phase 1: matrix 2241 rows 1089 cols
[2024-05-24 15:54:34] [INFO ] Computed 42 invariants in 27 ms
[2024-05-24 15:54:35] [INFO ] Implicit Places using invariants in 956 ms returned []
[2024-05-24 15:54:35] [INFO ] Flow matrix only has 2241 transitions (discarded 272 similar events)
[2024-05-24 15:54:35] [INFO ] Invariant cache hit.
[2024-05-24 15:54:36] [INFO ] State equation strengthened by 836 read => feed constraints.
[2024-05-24 15:54:45] [INFO ] Implicit Places using invariants and state equation in 10257 ms returned []
Implicit Place search using SMT with State Equation took 11216 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1089/1253 places, 2513/2762 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 25184 ms. Remains : 1089/1253 places, 2513/2762 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-04
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-04 finished in 25284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((F(G(p0))&&X(p0)) U G(p1))&&X(p2))))'
Support contains 6 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 2762/2762 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1232 transition count 2738
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1232 transition count 2738
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 60 place count 1214 transition count 2681
Iterating global reduction 0 with 18 rules applied. Total rules applied 78 place count 1214 transition count 2681
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 1209 transition count 2661
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 1209 transition count 2661
Applied a total of 88 rules in 159 ms. Remains 1209 /1253 variables (removed 44) and now considering 2661/2762 (removed 101) transitions.
[2024-05-24 15:54:45] [INFO ] Flow matrix only has 2389 transitions (discarded 272 similar events)
// Phase 1: matrix 2389 rows 1209 cols
[2024-05-24 15:54:46] [INFO ] Computed 59 invariants in 45 ms
[2024-05-24 15:54:47] [INFO ] Implicit Places using invariants in 1055 ms returned [12, 99, 101, 241, 289, 344, 383, 424, 502, 542, 573, 598, 625, 635, 718, 801, 836, 1099]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1057 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1191/1253 places, 2661/2762 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1173 transition count 2643
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1173 transition count 2643
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 1155 transition count 2625
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 1155 transition count 2625
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 90 place count 1137 transition count 2607
Iterating global reduction 0 with 18 rules applied. Total rules applied 108 place count 1137 transition count 2607
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 125 place count 1120 transition count 2539
Iterating global reduction 0 with 17 rules applied. Total rules applied 142 place count 1120 transition count 2539
Applied a total of 142 rules in 192 ms. Remains 1120 /1191 variables (removed 71) and now considering 2539/2661 (removed 122) transitions.
[2024-05-24 15:54:47] [INFO ] Flow matrix only has 2267 transitions (discarded 272 similar events)
// Phase 1: matrix 2267 rows 1120 cols
[2024-05-24 15:54:47] [INFO ] Computed 41 invariants in 26 ms
[2024-05-24 15:54:48] [INFO ] Implicit Places using invariants in 942 ms returned []
[2024-05-24 15:54:48] [INFO ] Flow matrix only has 2267 transitions (discarded 272 similar events)
[2024-05-24 15:54:48] [INFO ] Invariant cache hit.
[2024-05-24 15:54:48] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-24 15:55:00] [INFO ] Implicit Places using invariants and state equation in 11844 ms returned []
Implicit Place search using SMT with State Equation took 12789 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1120/1253 places, 2539/2762 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14198 ms. Remains : 1120/1253 places, 2539/2762 transitions.
Stuttering acceptance computed with spot in 497 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p0), (AND (NOT p1) p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-05 finished in 14728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 3 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 2762/2762 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1253 transition count 2750
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 1241 transition count 2750
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 24 place count 1241 transition count 2728
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 68 place count 1219 transition count 2728
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 85 place count 1202 transition count 2705
Iterating global reduction 2 with 17 rules applied. Total rules applied 102 place count 1202 transition count 2705
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 102 place count 1202 transition count 2701
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 110 place count 1198 transition count 2701
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 124 place count 1184 transition count 2645
Iterating global reduction 2 with 14 rules applied. Total rules applied 138 place count 1184 transition count 2645
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 188 place count 1159 transition count 2620
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 192 place count 1155 transition count 2616
Iterating global reduction 2 with 4 rules applied. Total rules applied 196 place count 1155 transition count 2616
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 200 place count 1151 transition count 2600
Iterating global reduction 2 with 4 rules applied. Total rules applied 204 place count 1151 transition count 2600
Applied a total of 204 rules in 339 ms. Remains 1151 /1253 variables (removed 102) and now considering 2600/2762 (removed 162) transitions.
[2024-05-24 15:55:00] [INFO ] Flow matrix only has 2328 transitions (discarded 272 similar events)
// Phase 1: matrix 2328 rows 1151 cols
[2024-05-24 15:55:00] [INFO ] Computed 59 invariants in 25 ms
[2024-05-24 15:55:01] [INFO ] Implicit Places using invariants in 1018 ms returned [9, 94, 95, 223, 267, 321, 356, 397, 471, 508, 537, 560, 585, 595, 673, 754, 787]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1020 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1134/1253 places, 2600/2762 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1121 transition count 2587
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1121 transition count 2587
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1108 transition count 2574
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1108 transition count 2574
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 63 place count 1097 transition count 2530
Iterating global reduction 0 with 11 rules applied. Total rules applied 74 place count 1097 transition count 2530
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 1093 transition count 2526
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 86 place count 1089 transition count 2522
Iterating global reduction 0 with 4 rules applied. Total rules applied 90 place count 1089 transition count 2522
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 95 place count 1084 transition count 2502
Iterating global reduction 0 with 5 rules applied. Total rules applied 100 place count 1084 transition count 2502
Applied a total of 100 rules in 312 ms. Remains 1084 /1134 variables (removed 50) and now considering 2502/2600 (removed 98) transitions.
[2024-05-24 15:55:02] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
// Phase 1: matrix 2230 rows 1084 cols
[2024-05-24 15:55:02] [INFO ] Computed 42 invariants in 26 ms
[2024-05-24 15:55:03] [INFO ] Implicit Places using invariants in 945 ms returned []
[2024-05-24 15:55:03] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2024-05-24 15:55:03] [INFO ] Invariant cache hit.
[2024-05-24 15:55:03] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-24 15:55:13] [INFO ] Implicit Places using invariants and state equation in 10264 ms returned [1067]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11211 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1083/1253 places, 2502/2762 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1083 transition count 2501
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1082 transition count 2501
Applied a total of 2 rules in 69 ms. Remains 1082 /1083 variables (removed 1) and now considering 2501/2502 (removed 1) transitions.
[2024-05-24 15:55:13] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
// Phase 1: matrix 2229 rows 1082 cols
[2024-05-24 15:55:13] [INFO ] Computed 41 invariants in 27 ms
[2024-05-24 15:55:14] [INFO ] Implicit Places using invariants in 905 ms returned []
[2024-05-24 15:55:14] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2024-05-24 15:55:14] [INFO ] Invariant cache hit.
[2024-05-24 15:55:15] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-24 15:55:24] [INFO ] Implicit Places using invariants and state equation in 10361 ms returned []
Implicit Place search using SMT with State Equation took 11268 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1082/1253 places, 2501/2762 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 24222 ms. Remains : 1082/1253 places, 2501/2762 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-06
Product exploration explored 100000 steps with 3388 reset in 563 ms.
Product exploration explored 100000 steps with 3397 reset in 610 ms.
Computed a total of 267 stabilizing places and 885 stable transitions
Computed a total of 267 stabilizing places and 885 stable transitions
Detected a total of 267/1082 stabilizing places and 885/2501 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 160 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 40000 steps (1353 resets) in 490 ms. (81 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (264 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
[2024-05-24 15:55:26] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2024-05-24 15:55:26] [INFO ] Invariant cache hit.
[2024-05-24 15:55:26] [INFO ] State equation strengthened by 830 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 1022/3311 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 5/31 constraints, Generalized P Invariants (flows): 0/10 constraints, State Equation: 0/1082 constraints, ReadFeed: 0/830 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 129ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 366 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 1082 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1082/1082 places, 2501/2501 transitions.
Applied a total of 0 rules in 72 ms. Remains 1082 /1082 variables (removed 0) and now considering 2501/2501 (removed 0) transitions.
[2024-05-24 15:55:27] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2024-05-24 15:55:27] [INFO ] Invariant cache hit.
[2024-05-24 15:55:28] [INFO ] Implicit Places using invariants in 911 ms returned []
[2024-05-24 15:55:28] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2024-05-24 15:55:28] [INFO ] Invariant cache hit.
[2024-05-24 15:55:29] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-24 15:55:38] [INFO ] Implicit Places using invariants and state equation in 10629 ms returned []
Implicit Place search using SMT with State Equation took 11541 ms to find 0 implicit places.
[2024-05-24 15:55:39] [INFO ] Redundant transitions in 120 ms returned []
Running 2484 sub problems to find dead transitions.
[2024-05-24 15:55:39] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2024-05-24 15:55:39] [INFO ] Invariant cache hit.
[2024-05-24 15:55:39] [INFO ] State equation strengthened by 830 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1080 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2484 unsolved
SMT process timed out in 33153ms, After SMT, problems are : Problem set: 0 solved, 2484 unsolved
Search for dead transitions found 0 dead transitions in 33183ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44928 ms. Remains : 1082/1082 places, 2501/2501 transitions.
Computed a total of 267 stabilizing places and 885 stable transitions
Computed a total of 267 stabilizing places and 885 stable transitions
Detected a total of 267/1082 stabilizing places and 885/2501 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 143 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 40000 steps (1354 resets) in 645 ms. (61 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (264 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
[2024-05-24 15:56:12] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2024-05-24 15:56:12] [INFO ] Invariant cache hit.
[2024-05-24 15:56:12] [INFO ] State equation strengthened by 830 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 1022/3311 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 5/31 constraints, Generalized P Invariants (flows): 0/10 constraints, State Equation: 0/1082 constraints, ReadFeed: 0/830 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 140ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 338 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 3389 reset in 499 ms.
Entered a terminal (fully accepting) state of product in 8505 steps with 286 reset in 43 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-06 finished in 73751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 2762/2762 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1231 transition count 2734
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1231 transition count 2734
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 63 place count 1212 transition count 2673
Iterating global reduction 0 with 19 rules applied. Total rules applied 82 place count 1212 transition count 2673
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 87 place count 1207 transition count 2653
Iterating global reduction 0 with 5 rules applied. Total rules applied 92 place count 1207 transition count 2653
Applied a total of 92 rules in 161 ms. Remains 1207 /1253 variables (removed 46) and now considering 2653/2762 (removed 109) transitions.
[2024-05-24 15:56:14] [INFO ] Flow matrix only has 2381 transitions (discarded 272 similar events)
// Phase 1: matrix 2381 rows 1207 cols
[2024-05-24 15:56:14] [INFO ] Computed 59 invariants in 23 ms
[2024-05-24 15:56:15] [INFO ] Implicit Places using invariants in 1044 ms returned [12, 99, 101, 241, 289, 343, 382, 423, 501, 540, 571, 596, 623, 633, 716, 799, 834, 1097]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1046 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1189/1253 places, 2653/2762 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1171 transition count 2635
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1171 transition count 2635
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 1153 transition count 2617
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 1153 transition count 2617
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 90 place count 1135 transition count 2599
Iterating global reduction 0 with 18 rules applied. Total rules applied 108 place count 1135 transition count 2599
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 125 place count 1118 transition count 2531
Iterating global reduction 0 with 17 rules applied. Total rules applied 142 place count 1118 transition count 2531
Applied a total of 142 rules in 193 ms. Remains 1118 /1189 variables (removed 71) and now considering 2531/2653 (removed 122) transitions.
[2024-05-24 15:56:15] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
// Phase 1: matrix 2259 rows 1118 cols
[2024-05-24 15:56:15] [INFO ] Computed 41 invariants in 28 ms
[2024-05-24 15:56:16] [INFO ] Implicit Places using invariants in 948 ms returned []
[2024-05-24 15:56:16] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
[2024-05-24 15:56:16] [INFO ] Invariant cache hit.
[2024-05-24 15:56:17] [INFO ] State equation strengthened by 824 read => feed constraints.
[2024-05-24 15:56:29] [INFO ] Implicit Places using invariants and state equation in 12511 ms returned [1095, 1107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13463 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1116/1253 places, 2531/2762 transitions.
Applied a total of 0 rules in 43 ms. Remains 1116 /1116 variables (removed 0) and now considering 2531/2531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 14908 ms. Remains : 1116/1253 places, 2531/2762 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-07 finished in 15024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 2762/2762 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1253 transition count 2750
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 1241 transition count 2750
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 24 place count 1241 transition count 2728
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 68 place count 1219 transition count 2728
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 85 place count 1202 transition count 2705
Iterating global reduction 2 with 17 rules applied. Total rules applied 102 place count 1202 transition count 2705
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 102 place count 1202 transition count 2701
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 110 place count 1198 transition count 2701
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 124 place count 1184 transition count 2645
Iterating global reduction 2 with 14 rules applied. Total rules applied 138 place count 1184 transition count 2645
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 188 place count 1159 transition count 2620
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 192 place count 1155 transition count 2616
Iterating global reduction 2 with 4 rules applied. Total rules applied 196 place count 1155 transition count 2616
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 200 place count 1151 transition count 2600
Iterating global reduction 2 with 4 rules applied. Total rules applied 204 place count 1151 transition count 2600
Applied a total of 204 rules in 326 ms. Remains 1151 /1253 variables (removed 102) and now considering 2600/2762 (removed 162) transitions.
[2024-05-24 15:56:29] [INFO ] Flow matrix only has 2328 transitions (discarded 272 similar events)
// Phase 1: matrix 2328 rows 1151 cols
[2024-05-24 15:56:29] [INFO ] Computed 59 invariants in 27 ms
[2024-05-24 15:56:30] [INFO ] Implicit Places using invariants in 1005 ms returned [9, 94, 95, 270, 324, 359, 400, 474, 511, 540, 563, 588, 598, 676, 757, 790, 1050]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1007 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1134/1253 places, 2600/2762 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1121 transition count 2587
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1121 transition count 2587
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1108 transition count 2574
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1108 transition count 2574
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 63 place count 1097 transition count 2530
Iterating global reduction 0 with 11 rules applied. Total rules applied 74 place count 1097 transition count 2530
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 1093 transition count 2526
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 86 place count 1089 transition count 2522
Iterating global reduction 0 with 4 rules applied. Total rules applied 90 place count 1089 transition count 2522
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 95 place count 1084 transition count 2502
Iterating global reduction 0 with 5 rules applied. Total rules applied 100 place count 1084 transition count 2502
Applied a total of 100 rules in 318 ms. Remains 1084 /1134 variables (removed 50) and now considering 2502/2600 (removed 98) transitions.
[2024-05-24 15:56:30] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
// Phase 1: matrix 2230 rows 1084 cols
[2024-05-24 15:56:31] [INFO ] Computed 42 invariants in 18 ms
[2024-05-24 15:56:31] [INFO ] Implicit Places using invariants in 940 ms returned []
[2024-05-24 15:56:31] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2024-05-24 15:56:31] [INFO ] Invariant cache hit.
[2024-05-24 15:56:32] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-24 15:56:42] [INFO ] Implicit Places using invariants and state equation in 10533 ms returned [1067]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11479 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1083/1253 places, 2502/2762 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1083 transition count 2501
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1082 transition count 2501
Applied a total of 2 rules in 78 ms. Remains 1082 /1083 variables (removed 1) and now considering 2501/2502 (removed 1) transitions.
[2024-05-24 15:56:42] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
// Phase 1: matrix 2229 rows 1082 cols
[2024-05-24 15:56:42] [INFO ] Computed 41 invariants in 23 ms
[2024-05-24 15:56:43] [INFO ] Implicit Places using invariants in 953 ms returned []
[2024-05-24 15:56:43] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2024-05-24 15:56:43] [INFO ] Invariant cache hit.
[2024-05-24 15:56:44] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-24 15:56:54] [INFO ] Implicit Places using invariants and state equation in 10689 ms returned []
Implicit Place search using SMT with State Equation took 11643 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1082/1253 places, 2501/2762 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 24854 ms. Remains : 1082/1253 places, 2501/2762 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-08
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-08 finished in 24909 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(F(p1))))'
Support contains 1 out of 1253 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 : 1253/1253 places, 2762/2762 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1253 transition count 2750
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 1241 transition count 2750
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 24 place count 1241 transition count 2729
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 66 place count 1220 transition count 2729
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 82 place count 1204 transition count 2707
Iterating global reduction 2 with 16 rules applied. Total rules applied 98 place count 1204 transition count 2707
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 98 place count 1204 transition count 2704
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 104 place count 1201 transition count 2704
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 117 place count 1188 transition count 2652
Iterating global reduction 2 with 13 rules applied. Total rules applied 130 place count 1188 transition count 2652
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 182 place count 1162 transition count 2626
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 186 place count 1158 transition count 2622
Iterating global reduction 2 with 4 rules applied. Total rules applied 190 place count 1158 transition count 2622
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 194 place count 1154 transition count 2606
Iterating global reduction 2 with 4 rules applied. Total rules applied 198 place count 1154 transition count 2606
Applied a total of 198 rules in 308 ms. Remains 1154 /1253 variables (removed 99) and now considering 2606/2762 (removed 156) transitions.
[2024-05-24 15:56:54] [INFO ] Flow matrix only has 2334 transitions (discarded 272 similar events)
// Phase 1: matrix 2334 rows 1154 cols
[2024-05-24 15:56:54] [INFO ] Computed 59 invariants in 24 ms
[2024-05-24 15:56:55] [INFO ] Implicit Places using invariants in 992 ms returned [10, 96, 227, 271, 325, 360, 401, 475, 512, 541, 564, 589, 599, 761, 794, 1054]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 994 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1138/1253 places, 2606/2762 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1127 transition count 2595
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1127 transition count 2595
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1116 transition count 2584
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1116 transition count 2584
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 54 place count 1106 transition count 2544
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 1106 transition count 2544
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 74 place count 1101 transition count 2539
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 1096 transition count 2534
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 1096 transition count 2534
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 89 place count 1091 transition count 2514
Iterating global reduction 0 with 5 rules applied. Total rules applied 94 place count 1091 transition count 2514
Applied a total of 94 rules in 308 ms. Remains 1091 /1138 variables (removed 47) and now considering 2514/2606 (removed 92) transitions.
[2024-05-24 15:56:55] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
// Phase 1: matrix 2242 rows 1091 cols
[2024-05-24 15:56:55] [INFO ] Computed 43 invariants in 26 ms
[2024-05-24 15:56:56] [INFO ] Implicit Places using invariants in 975 ms returned []
[2024-05-24 15:56:56] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
[2024-05-24 15:56:56] [INFO ] Invariant cache hit.
[2024-05-24 15:56:57] [INFO ] State equation strengthened by 836 read => feed constraints.
[2024-05-24 15:57:06] [INFO ] Implicit Places using invariants and state equation in 9712 ms returned []
Implicit Place search using SMT with State Equation took 10687 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1091/1253 places, 2514/2762 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12299 ms. Remains : 1091/1253 places, 2514/2762 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-09
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-09 finished in 12359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&(X(p2)||F(p3)||p1))))'
Support contains 5 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 2762/2762 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1234 transition count 2737
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1234 transition count 2737
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 54 place count 1218 transition count 2685
Iterating global reduction 0 with 16 rules applied. Total rules applied 70 place count 1218 transition count 2685
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 1214 transition count 2669
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 1214 transition count 2669
Applied a total of 78 rules in 148 ms. Remains 1214 /1253 variables (removed 39) and now considering 2669/2762 (removed 93) transitions.
[2024-05-24 15:57:06] [INFO ] Flow matrix only has 2397 transitions (discarded 272 similar events)
// Phase 1: matrix 2397 rows 1214 cols
[2024-05-24 15:57:06] [INFO ] Computed 59 invariants in 25 ms
[2024-05-24 15:57:07] [INFO ] Implicit Places using invariants in 1000 ms returned [12, 99, 101, 241, 289, 343, 382, 423, 501, 540, 640, 723, 806, 841, 1104]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1002 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1199/1253 places, 2669/2762 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1184 transition count 2654
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1184 transition count 2654
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 1169 transition count 2639
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 1169 transition count 2639
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 75 place count 1154 transition count 2624
Iterating global reduction 0 with 15 rules applied. Total rules applied 90 place count 1154 transition count 2624
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 104 place count 1140 transition count 2568
Iterating global reduction 0 with 14 rules applied. Total rules applied 118 place count 1140 transition count 2568
Applied a total of 118 rules in 187 ms. Remains 1140 /1199 variables (removed 59) and now considering 2568/2669 (removed 101) transitions.
[2024-05-24 15:57:07] [INFO ] Flow matrix only has 2296 transitions (discarded 272 similar events)
// Phase 1: matrix 2296 rows 1140 cols
[2024-05-24 15:57:07] [INFO ] Computed 44 invariants in 26 ms
[2024-05-24 15:57:08] [INFO ] Implicit Places using invariants in 959 ms returned []
[2024-05-24 15:57:08] [INFO ] Flow matrix only has 2296 transitions (discarded 272 similar events)
[2024-05-24 15:57:08] [INFO ] Invariant cache hit.
[2024-05-24 15:57:09] [INFO ] State equation strengthened by 842 read => feed constraints.
[2024-05-24 15:57:21] [INFO ] Implicit Places using invariants and state equation in 12863 ms returned [1129]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 13827 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1139/1253 places, 2568/2762 transitions.
Applied a total of 0 rules in 36 ms. Remains 1139 /1139 variables (removed 0) and now considering 2568/2568 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 15204 ms. Remains : 1139/1253 places, 2568/2762 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p3) (NOT p2)), (NOT p3)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-10
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-10 finished in 15432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(X(!p1) U ((!p0&&X(!p1))||X(G(!p1))))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 2762/2762 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1232 transition count 2735
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1232 transition count 2735
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 60 place count 1214 transition count 2678
Iterating global reduction 0 with 18 rules applied. Total rules applied 78 place count 1214 transition count 2678
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 1209 transition count 2658
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 1209 transition count 2658
Applied a total of 88 rules in 160 ms. Remains 1209 /1253 variables (removed 44) and now considering 2658/2762 (removed 104) transitions.
[2024-05-24 15:57:22] [INFO ] Flow matrix only has 2386 transitions (discarded 272 similar events)
// Phase 1: matrix 2386 rows 1209 cols
[2024-05-24 15:57:22] [INFO ] Computed 59 invariants in 19 ms
[2024-05-24 15:57:23] [INFO ] Implicit Places using invariants in 1010 ms returned [12, 99, 101, 241, 289, 343, 382, 503, 542, 573, 598, 625, 635, 718, 801, 836, 1099]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1012 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1192/1253 places, 2658/2762 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1175 transition count 2641
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1175 transition count 2641
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 1158 transition count 2624
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 1158 transition count 2624
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 85 place count 1141 transition count 2607
Iterating global reduction 0 with 17 rules applied. Total rules applied 102 place count 1141 transition count 2607
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 118 place count 1125 transition count 2543
Iterating global reduction 0 with 16 rules applied. Total rules applied 134 place count 1125 transition count 2543
Applied a total of 134 rules in 198 ms. Remains 1125 /1192 variables (removed 67) and now considering 2543/2658 (removed 115) transitions.
[2024-05-24 15:57:23] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1125 cols
[2024-05-24 15:57:23] [INFO ] Computed 42 invariants in 28 ms
[2024-05-24 15:57:24] [INFO ] Implicit Places using invariants in 935 ms returned []
[2024-05-24 15:57:24] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2024-05-24 15:57:24] [INFO ] Invariant cache hit.
[2024-05-24 15:57:25] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-24 15:57:36] [INFO ] Implicit Places using invariants and state equation in 11820 ms returned [1101]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 12759 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1124/1253 places, 2543/2762 transitions.
Applied a total of 0 rules in 41 ms. Remains 1124 /1124 variables (removed 0) and now considering 2543/2543 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 14173 ms. Remains : 1124/1253 places, 2543/2762 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) p1), (NOT p0), p1, p1, true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-11
Stuttering criterion allowed to conclude after 42 steps with 1 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-11 finished in 14357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((!p0&&X(p1))))))'
Support contains 6 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 2762/2762 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1232 transition count 2735
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1232 transition count 2735
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 60 place count 1214 transition count 2678
Iterating global reduction 0 with 18 rules applied. Total rules applied 78 place count 1214 transition count 2678
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 1209 transition count 2658
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 1209 transition count 2658
Applied a total of 88 rules in 153 ms. Remains 1209 /1253 variables (removed 44) and now considering 2658/2762 (removed 104) transitions.
[2024-05-24 15:57:36] [INFO ] Flow matrix only has 2386 transitions (discarded 272 similar events)
// Phase 1: matrix 2386 rows 1209 cols
[2024-05-24 15:57:36] [INFO ] Computed 59 invariants in 24 ms
[2024-05-24 15:57:37] [INFO ] Implicit Places using invariants in 996 ms returned [101, 103, 243, 291, 345, 384, 425, 503, 542, 573, 598, 625, 635, 718, 801, 836, 1099]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 998 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1192/1253 places, 2658/2762 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1175 transition count 2641
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1175 transition count 2641
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 1158 transition count 2624
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 1158 transition count 2624
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 85 place count 1141 transition count 2607
Iterating global reduction 0 with 17 rules applied. Total rules applied 102 place count 1141 transition count 2607
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 118 place count 1125 transition count 2543
Iterating global reduction 0 with 16 rules applied. Total rules applied 134 place count 1125 transition count 2543
Applied a total of 134 rules in 187 ms. Remains 1125 /1192 variables (removed 67) and now considering 2543/2658 (removed 115) transitions.
[2024-05-24 15:57:37] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1125 cols
[2024-05-24 15:57:37] [INFO ] Computed 42 invariants in 30 ms
[2024-05-24 15:57:38] [INFO ] Implicit Places using invariants in 965 ms returned []
[2024-05-24 15:57:38] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2024-05-24 15:57:38] [INFO ] Invariant cache hit.
[2024-05-24 15:57:39] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-24 15:57:50] [INFO ] Implicit Places using invariants and state equation in 11460 ms returned [1114]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 12428 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1124/1253 places, 2543/2762 transitions.
Applied a total of 0 rules in 36 ms. Remains 1124 /1124 variables (removed 0) and now considering 2543/2543 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 13805 ms. Remains : 1124/1253 places, 2543/2762 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-13
Product exploration explored 100000 steps with 25000 reset in 771 ms.
Product exploration explored 100000 steps with 25000 reset in 750 ms.
Computed a total of 292 stabilizing places and 910 stable transitions
Computed a total of 292 stabilizing places and 910 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
RANDOM walk for 40000 steps (955 resets) in 441 ms. (90 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (244 resets) in 283 ms. (140 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (244 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
[2024-05-24 15:57:52] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1124 cols
[2024-05-24 15:57:52] [INFO ] Computed 41 invariants in 26 ms
[2024-05-24 15:57:52] [INFO ] State equation strengthened by 830 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 1042/1048 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1048 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/1091 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-24 15:57:53] [INFO ] Deduced a trap composed of 50 places in 451 ms of which 6 ms to minimize.
[2024-05-24 15:57:53] [INFO ] Deduced a trap composed of 99 places in 444 ms of which 7 ms to minimize.
[2024-05-24 15:57:54] [INFO ] Deduced a trap composed of 118 places in 446 ms of which 7 ms to minimize.
[2024-05-24 15:57:54] [INFO ] Deduced a trap composed of 83 places in 470 ms of which 7 ms to minimize.
[2024-05-24 15:57:55] [INFO ] Deduced a trap composed of 129 places in 455 ms of which 7 ms to minimize.
[2024-05-24 15:57:55] [INFO ] Deduced a trap composed of 89 places in 467 ms of which 7 ms to minimize.
[2024-05-24 15:57:56] [INFO ] Deduced a trap composed of 85 places in 474 ms of which 7 ms to minimize.
[2024-05-24 15:57:56] [INFO ] Deduced a trap composed of 98 places in 242 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1091 variables, 8/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1091 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 26/1117 variables, 26/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1117 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/1124 variables, 7/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1124 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2271/3395 variables, 1124/1173 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3395 variables, 830/2003 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3395 variables, 0/2003 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/3395 variables, 0/2003 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3395/3395 variables, and 2003 constraints, problems are : Problem set: 1 solved, 1 unsolved in 4720 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1124/1124 constraints, ReadFeed: 830/830 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1043/1045 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1045 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/1089 variables, 3/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1089 variables, 6/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-24 15:57:57] [INFO ] Deduced a trap composed of 88 places in 477 ms of which 7 ms to minimize.
[2024-05-24 15:57:58] [INFO ] Deduced a trap composed of 91 places in 457 ms of which 7 ms to minimize.
[2024-05-24 15:57:58] [INFO ] Deduced a trap composed of 91 places in 466 ms of which 7 ms to minimize.
[2024-05-24 15:57:59] [INFO ] Deduced a trap composed of 139 places in 456 ms of which 6 ms to minimize.
[2024-05-24 15:57:59] [INFO ] Deduced a trap composed of 139 places in 481 ms of which 7 ms to minimize.
[2024-05-24 15:58:00] [INFO ] Deduced a trap composed of 100 places in 448 ms of which 6 ms to minimize.
[2024-05-24 15:58:00] [INFO ] Deduced a trap composed of 111 places in 445 ms of which 7 ms to minimize.
[2024-05-24 15:58:01] [INFO ] Deduced a trap composed of 94 places in 467 ms of which 7 ms to minimize.
[2024-05-24 15:58:01] [INFO ] Deduced a trap composed of 164 places in 447 ms of which 7 ms to minimize.
[2024-05-24 15:58:02] [INFO ] Deduced a trap composed of 84 places in 481 ms of which 8 ms to minimize.
[2024-05-24 15:58:02] [INFO ] Deduced a trap composed of 90 places in 481 ms of which 7 ms to minimize.
SMT process timed out in 10252ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1124/1124 places, 2543/2543 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1124 transition count 2527
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 1108 transition count 2527
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 32 place count 1108 transition count 2518
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 50 place count 1099 transition count 2518
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 1098 transition count 2517
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 1098 transition count 2517
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 52 place count 1098 transition count 2516
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 1097 transition count 2516
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1096 transition count 2512
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1096 transition count 2512
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 88 place count 1080 transition count 2496
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 2 with 131 rules applied. Total rules applied 219 place count 1080 transition count 2767
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 2 with 131 rules applied. Total rules applied 350 place count 949 transition count 2767
Applied a total of 350 rules in 344 ms. Remains 949 /1124 variables (removed 175) and now considering 2767/2543 (removed -224) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 344 ms. Remains : 949/1124 places, 2767/2543 transitions.
RANDOM walk for 40000 steps (1572 resets) in 605 ms. (66 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (193 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 84849 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 1
Probabilistic random walk after 84849 steps, saw 35341 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-24 15:58:06] [INFO ] Flow matrix only has 2369 transitions (discarded 398 similar events)
// Phase 1: matrix 2369 rows 949 cols
[2024-05-24 15:58:06] [INFO ] Computed 41 invariants in 31 ms
[2024-05-24 15:58:06] [INFO ] State equation strengthened by 1229 read => feed constraints.
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) 867/869 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/869 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/887 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:58:06] [INFO ] Deduced a trap composed of 163 places in 397 ms of which 5 ms to minimize.
[2024-05-24 15:58:07] [INFO ] Deduced a trap composed of 222 places in 380 ms of which 6 ms to minimize.
[2024-05-24 15:58:07] [INFO ] Deduced a trap composed of 97 places in 397 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/887 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/887 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 27/914 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/914 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 28/942 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/942 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/949 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/949 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2369/3318 variables, 949/993 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3318 variables, 1229/2222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3318 variables, 0/2222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/3318 variables, 0/2222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3318/3318 variables, and 2222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2115 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 949/949 constraints, ReadFeed: 1229/1229 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 867/869 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/869 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/887 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/887 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/887 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 27/914 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:58:08] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 3 ms to minimize.
[2024-05-24 15:58:09] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 3 ms to minimize.
[2024-05-24 15:58:09] [INFO ] Deduced a trap composed of 46 places in 204 ms of which 4 ms to minimize.
[2024-05-24 15:58:09] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 3 ms to minimize.
[2024-05-24 15:58:09] [INFO ] Deduced a trap composed of 71 places in 198 ms of which 3 ms to minimize.
[2024-05-24 15:58:09] [INFO ] Deduced a trap composed of 62 places in 197 ms of which 4 ms to minimize.
[2024-05-24 15:58:10] [INFO ] Deduced a trap composed of 88 places in 198 ms of which 4 ms to minimize.
[2024-05-24 15:58:10] [INFO ] Deduced a trap composed of 95 places in 193 ms of which 4 ms to minimize.
[2024-05-24 15:58:10] [INFO ] Deduced a trap composed of 75 places in 195 ms of which 3 ms to minimize.
[2024-05-24 15:58:10] [INFO ] Deduced a trap composed of 92 places in 196 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/914 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/914 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/942 variables, 28/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:58:11] [INFO ] Deduced a trap composed of 58 places in 436 ms of which 6 ms to minimize.
[2024-05-24 15:58:11] [INFO ] Deduced a trap composed of 66 places in 427 ms of which 5 ms to minimize.
[2024-05-24 15:58:12] [INFO ] Deduced a trap composed of 58 places in 415 ms of which 5 ms to minimize.
[2024-05-24 15:58:12] [INFO ] Deduced a trap composed of 67 places in 405 ms of which 5 ms to minimize.
[2024-05-24 15:58:13] [INFO ] Deduced a trap composed of 71 places in 415 ms of which 5 ms to minimize.
[2024-05-24 15:58:13] [INFO ] Deduced a trap composed of 66 places in 409 ms of which 5 ms to minimize.
[2024-05-24 15:58:13] [INFO ] Deduced a trap composed of 73 places in 416 ms of which 5 ms to minimize.
[2024-05-24 15:58:14] [INFO ] Deduced a trap composed of 83 places in 419 ms of which 5 ms to minimize.
[2024-05-24 15:58:14] [INFO ] Deduced a trap composed of 55 places in 422 ms of which 6 ms to minimize.
[2024-05-24 15:58:15] [INFO ] Deduced a trap composed of 73 places in 409 ms of which 6 ms to minimize.
[2024-05-24 15:58:15] [INFO ] Deduced a trap composed of 69 places in 411 ms of which 6 ms to minimize.
[2024-05-24 15:58:16] [INFO ] Deduced a trap composed of 73 places in 417 ms of which 6 ms to minimize.
[2024-05-24 15:58:16] [INFO ] Deduced a trap composed of 66 places in 410 ms of which 6 ms to minimize.
[2024-05-24 15:58:16] [INFO ] Deduced a trap composed of 68 places in 418 ms of which 6 ms to minimize.
[2024-05-24 15:58:17] [INFO ] Deduced a trap composed of 68 places in 428 ms of which 6 ms to minimize.
[2024-05-24 15:58:17] [INFO ] Deduced a trap composed of 72 places in 421 ms of which 6 ms to minimize.
[2024-05-24 15:58:18] [INFO ] Deduced a trap composed of 67 places in 418 ms of which 6 ms to minimize.
[2024-05-24 15:58:18] [INFO ] Deduced a trap composed of 64 places in 436 ms of which 6 ms to minimize.
[2024-05-24 15:58:19] [INFO ] Deduced a trap composed of 126 places in 396 ms of which 5 ms to minimize.
[2024-05-24 15:58:19] [INFO ] Deduced a trap composed of 136 places in 403 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/942 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:58:19] [INFO ] Deduced a trap composed of 180 places in 394 ms of which 6 ms to minimize.
[2024-05-24 15:58:20] [INFO ] Deduced a trap composed of 190 places in 363 ms of which 5 ms to minimize.
[2024-05-24 15:58:20] [INFO ] Deduced a trap composed of 60 places in 410 ms of which 5 ms to minimize.
[2024-05-24 15:58:21] [INFO ] Deduced a trap composed of 181 places in 366 ms of which 6 ms to minimize.
[2024-05-24 15:58:21] [INFO ] Deduced a trap composed of 189 places in 363 ms of which 5 ms to minimize.
[2024-05-24 15:58:21] [INFO ] Deduced a trap composed of 61 places in 406 ms of which 5 ms to minimize.
[2024-05-24 15:58:22] [INFO ] Deduced a trap composed of 77 places in 405 ms of which 5 ms to minimize.
[2024-05-24 15:58:22] [INFO ] Deduced a trap composed of 61 places in 417 ms of which 5 ms to minimize.
[2024-05-24 15:58:23] [INFO ] Deduced a trap composed of 74 places in 419 ms of which 5 ms to minimize.
[2024-05-24 15:58:23] [INFO ] Deduced a trap composed of 87 places in 416 ms of which 5 ms to minimize.
[2024-05-24 15:58:24] [INFO ] Deduced a trap composed of 69 places in 411 ms of which 5 ms to minimize.
[2024-05-24 15:58:24] [INFO ] Deduced a trap composed of 60 places in 410 ms of which 6 ms to minimize.
[2024-05-24 15:58:24] [INFO ] Deduced a trap composed of 59 places in 410 ms of which 5 ms to minimize.
[2024-05-24 15:58:25] [INFO ] Deduced a trap composed of 191 places in 409 ms of which 5 ms to minimize.
[2024-05-24 15:58:25] [INFO ] Deduced a trap composed of 74 places in 423 ms of which 5 ms to minimize.
[2024-05-24 15:58:26] [INFO ] Deduced a trap composed of 86 places in 422 ms of which 6 ms to minimize.
[2024-05-24 15:58:26] [INFO ] Deduced a trap composed of 81 places in 415 ms of which 6 ms to minimize.
[2024-05-24 15:58:27] [INFO ] Deduced a trap composed of 74 places in 413 ms of which 5 ms to minimize.
[2024-05-24 15:58:27] [INFO ] Deduced a trap composed of 68 places in 443 ms of which 6 ms to minimize.
[2024-05-24 15:58:28] [INFO ] Deduced a trap composed of 85 places in 435 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/942 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:58:28] [INFO ] Deduced a trap composed of 68 places in 415 ms of which 5 ms to minimize.
[2024-05-24 15:58:28] [INFO ] Deduced a trap composed of 64 places in 415 ms of which 5 ms to minimize.
[2024-05-24 15:58:29] [INFO ] Deduced a trap composed of 106 places in 405 ms of which 6 ms to minimize.
[2024-05-24 15:58:29] [INFO ] Deduced a trap composed of 48 places in 438 ms of which 5 ms to minimize.
[2024-05-24 15:58:30] [INFO ] Deduced a trap composed of 85 places in 409 ms of which 5 ms to minimize.
[2024-05-24 15:58:30] [INFO ] Deduced a trap composed of 49 places in 399 ms of which 5 ms to minimize.
[2024-05-24 15:58:31] [INFO ] Deduced a trap composed of 60 places in 414 ms of which 6 ms to minimize.
[2024-05-24 15:58:31] [INFO ] Deduced a trap composed of 60 places in 408 ms of which 5 ms to minimize.
[2024-05-24 15:58:31] [INFO ] Deduced a trap composed of 76 places in 402 ms of which 6 ms to minimize.
[2024-05-24 15:58:32] [INFO ] Deduced a trap composed of 89 places in 422 ms of which 6 ms to minimize.
[2024-05-24 15:58:32] [INFO ] Deduced a trap composed of 62 places in 402 ms of which 6 ms to minimize.
[2024-05-24 15:58:33] [INFO ] Deduced a trap composed of 58 places in 417 ms of which 6 ms to minimize.
[2024-05-24 15:58:33] [INFO ] Deduced a trap composed of 58 places in 430 ms of which 6 ms to minimize.
[2024-05-24 15:58:34] [INFO ] Deduced a trap composed of 79 places in 414 ms of which 6 ms to minimize.
[2024-05-24 15:58:34] [INFO ] Deduced a trap composed of 65 places in 444 ms of which 5 ms to minimize.
[2024-05-24 15:58:34] [INFO ] Deduced a trap composed of 57 places in 413 ms of which 6 ms to minimize.
[2024-05-24 15:58:35] [INFO ] Deduced a trap composed of 70 places in 434 ms of which 5 ms to minimize.
[2024-05-24 15:58:35] [INFO ] Deduced a trap composed of 68 places in 413 ms of which 5 ms to minimize.
[2024-05-24 15:58:36] [INFO ] Deduced a trap composed of 70 places in 416 ms of which 6 ms to minimize.
[2024-05-24 15:58:36] [INFO ] Deduced a trap composed of 49 places in 415 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/942 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:58:37] [INFO ] Deduced a trap composed of 73 places in 408 ms of which 5 ms to minimize.
[2024-05-24 15:58:37] [INFO ] Deduced a trap composed of 72 places in 415 ms of which 5 ms to minimize.
[2024-05-24 15:58:38] [INFO ] Deduced a trap composed of 56 places in 418 ms of which 6 ms to minimize.
[2024-05-24 15:58:38] [INFO ] Deduced a trap composed of 48 places in 422 ms of which 5 ms to minimize.
[2024-05-24 15:58:38] [INFO ] Deduced a trap composed of 89 places in 425 ms of which 6 ms to minimize.
[2024-05-24 15:58:39] [INFO ] Deduced a trap composed of 72 places in 446 ms of which 6 ms to minimize.
[2024-05-24 15:58:39] [INFO ] Deduced a trap composed of 72 places in 421 ms of which 5 ms to minimize.
[2024-05-24 15:58:40] [INFO ] Deduced a trap composed of 64 places in 420 ms of which 5 ms to minimize.
[2024-05-24 15:58:40] [INFO ] Deduced a trap composed of 76 places in 433 ms of which 6 ms to minimize.
[2024-05-24 15:58:41] [INFO ] Deduced a trap composed of 76 places in 409 ms of which 6 ms to minimize.
[2024-05-24 15:58:41] [INFO ] Deduced a trap composed of 67 places in 450 ms of which 6 ms to minimize.
[2024-05-24 15:58:42] [INFO ] Deduced a trap composed of 85 places in 438 ms of which 5 ms to minimize.
[2024-05-24 15:58:42] [INFO ] Deduced a trap composed of 75 places in 440 ms of which 5 ms to minimize.
[2024-05-24 15:58:43] [INFO ] Deduced a trap composed of 89 places in 454 ms of which 6 ms to minimize.
[2024-05-24 15:58:43] [INFO ] Deduced a trap composed of 60 places in 433 ms of which 6 ms to minimize.
[2024-05-24 15:58:43] [INFO ] Deduced a trap composed of 59 places in 443 ms of which 6 ms to minimize.
[2024-05-24 15:58:44] [INFO ] Deduced a trap composed of 70 places in 437 ms of which 5 ms to minimize.
[2024-05-24 15:58:44] [INFO ] Deduced a trap composed of 61 places in 430 ms of which 6 ms to minimize.
[2024-05-24 15:58:45] [INFO ] Deduced a trap composed of 54 places in 434 ms of which 6 ms to minimize.
[2024-05-24 15:58:45] [INFO ] Deduced a trap composed of 188 places in 383 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/942 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:58:46] [INFO ] Deduced a trap composed of 47 places in 425 ms of which 6 ms to minimize.
[2024-05-24 15:58:46] [INFO ] Deduced a trap composed of 190 places in 370 ms of which 6 ms to minimize.
[2024-05-24 15:58:46] [INFO ] Deduced a trap composed of 80 places in 402 ms of which 5 ms to minimize.
[2024-05-24 15:58:47] [INFO ] Deduced a trap composed of 59 places in 420 ms of which 5 ms to minimize.
[2024-05-24 15:58:47] [INFO ] Deduced a trap composed of 159 places in 390 ms of which 6 ms to minimize.
[2024-05-24 15:58:48] [INFO ] Deduced a trap composed of 68 places in 449 ms of which 6 ms to minimize.
[2024-05-24 15:58:48] [INFO ] Deduced a trap composed of 61 places in 413 ms of which 6 ms to minimize.
[2024-05-24 15:58:49] [INFO ] Deduced a trap composed of 81 places in 430 ms of which 6 ms to minimize.
[2024-05-24 15:58:49] [INFO ] Deduced a trap composed of 77 places in 416 ms of which 6 ms to minimize.
[2024-05-24 15:58:50] [INFO ] Deduced a trap composed of 61 places in 419 ms of which 5 ms to minimize.
[2024-05-24 15:58:50] [INFO ] Deduced a trap composed of 198 places in 371 ms of which 5 ms to minimize.
[2024-05-24 15:58:50] [INFO ] Deduced a trap composed of 202 places in 360 ms of which 5 ms to minimize.
[2024-05-24 15:58:51] [INFO ] Deduced a trap composed of 77 places in 410 ms of which 5 ms to minimize.
[2024-05-24 15:58:51] [INFO ] Deduced a trap composed of 77 places in 416 ms of which 6 ms to minimize.
[2024-05-24 15:58:52] [INFO ] Deduced a trap composed of 58 places in 418 ms of which 6 ms to minimize.
[2024-05-24 15:58:52] [INFO ] Deduced a trap composed of 47 places in 414 ms of which 5 ms to minimize.
[2024-05-24 15:58:52] [INFO ] Deduced a trap composed of 199 places in 355 ms of which 5 ms to minimize.
[2024-05-24 15:58:53] [INFO ] Deduced a trap composed of 201 places in 350 ms of which 5 ms to minimize.
[2024-05-24 15:58:53] [INFO ] Deduced a trap composed of 78 places in 405 ms of which 5 ms to minimize.
SMT process timed out in 47350ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 949 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 949/949 places, 2767/2767 transitions.
Applied a total of 0 rules in 74 ms. Remains 949 /949 variables (removed 0) and now considering 2767/2767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 949/949 places, 2767/2767 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 949/949 places, 2767/2767 transitions.
Applied a total of 0 rules in 59 ms. Remains 949 /949 variables (removed 0) and now considering 2767/2767 (removed 0) transitions.
[2024-05-24 15:58:53] [INFO ] Flow matrix only has 2369 transitions (discarded 398 similar events)
[2024-05-24 15:58:53] [INFO ] Invariant cache hit.
[2024-05-24 15:58:54] [INFO ] Implicit Places using invariants in 861 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 865 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 948/949 places, 2767/2767 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 947 transition count 2766
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 947 transition count 2766
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 946 transition count 2765
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 946 transition count 2765
Applied a total of 4 rules in 108 ms. Remains 946 /948 variables (removed 2) and now considering 2765/2767 (removed 2) transitions.
[2024-05-24 15:58:54] [INFO ] Flow matrix only has 2367 transitions (discarded 398 similar events)
// Phase 1: matrix 2367 rows 946 cols
[2024-05-24 15:58:54] [INFO ] Computed 40 invariants in 21 ms
[2024-05-24 15:58:55] [INFO ] Implicit Places using invariants in 899 ms returned []
[2024-05-24 15:58:55] [INFO ] Flow matrix only has 2367 transitions (discarded 398 similar events)
[2024-05-24 15:58:55] [INFO ] Invariant cache hit.
[2024-05-24 15:58:56] [INFO ] State equation strengthened by 1229 read => feed constraints.
[2024-05-24 15:59:10] [INFO ] Implicit Places using invariants and state equation in 15249 ms returned []
Implicit Place search using SMT with State Equation took 16153 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 946/949 places, 2765/2767 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 17186 ms. Remains : 946/949 places, 2765/2767 transitions.
RANDOM walk for 40000 steps (1573 resets) in 395 ms. (101 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (192 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 83391 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 1
Probabilistic random walk after 83391 steps, saw 34707 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2024-05-24 15:59:14] [INFO ] Flow matrix only has 2367 transitions (discarded 398 similar events)
[2024-05-24 15:59:14] [INFO ] Invariant cache hit.
[2024-05-24 15:59:14] [INFO ] State equation strengthened by 1229 read => feed constraints.
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) 865/867 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/867 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/885 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:59:14] [INFO ] Deduced a trap composed of 208 places in 387 ms of which 6 ms to minimize.
[2024-05-24 15:59:15] [INFO ] Deduced a trap composed of 655 places in 403 ms of which 6 ms to minimize.
[2024-05-24 15:59:15] [INFO ] Deduced a trap composed of 359 places in 397 ms of which 6 ms to minimize.
[2024-05-24 15:59:15] [INFO ] Deduced a trap composed of 378 places in 401 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/885 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 26/911 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/911 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 28/939 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/939 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/946 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/946 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2367/3313 variables, 946/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3313 variables, 1229/2219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3313 variables, 0/2219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/3313 variables, 0/2219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3313/3313 variables, and 2219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2594 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 946/946 constraints, ReadFeed: 1229/1229 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 865/867 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/867 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/885 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/885 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/911 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:59:17] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 3 ms to minimize.
[2024-05-24 15:59:17] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 3 ms to minimize.
[2024-05-24 15:59:17] [INFO ] Deduced a trap composed of 27 places in 203 ms of which 4 ms to minimize.
[2024-05-24 15:59:17] [INFO ] Deduced a trap composed of 57 places in 198 ms of which 3 ms to minimize.
[2024-05-24 15:59:17] [INFO ] Deduced a trap composed of 46 places in 208 ms of which 3 ms to minimize.
[2024-05-24 15:59:18] [INFO ] Deduced a trap composed of 62 places in 207 ms of which 3 ms to minimize.
[2024-05-24 15:59:18] [INFO ] Deduced a trap composed of 78 places in 206 ms of which 4 ms to minimize.
[2024-05-24 15:59:18] [INFO ] Deduced a trap composed of 82 places in 199 ms of which 3 ms to minimize.
[2024-05-24 15:59:18] [INFO ] Deduced a trap composed of 78 places in 200 ms of which 4 ms to minimize.
[2024-05-24 15:59:19] [INFO ] Deduced a trap composed of 119 places in 205 ms of which 3 ms to minimize.
[2024-05-24 15:59:19] [INFO ] Deduced a trap composed of 92 places in 208 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/911 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/911 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/939 variables, 28/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:59:19] [INFO ] Deduced a trap composed of 56 places in 470 ms of which 6 ms to minimize.
[2024-05-24 15:59:20] [INFO ] Deduced a trap composed of 64 places in 449 ms of which 5 ms to minimize.
[2024-05-24 15:59:20] [INFO ] Deduced a trap composed of 73 places in 433 ms of which 6 ms to minimize.
[2024-05-24 15:59:21] [INFO ] Deduced a trap composed of 179 places in 396 ms of which 5 ms to minimize.
[2024-05-24 15:59:21] [INFO ] Deduced a trap composed of 73 places in 457 ms of which 6 ms to minimize.
[2024-05-24 15:59:22] [INFO ] Deduced a trap composed of 72 places in 444 ms of which 6 ms to minimize.
[2024-05-24 15:59:22] [INFO ] Deduced a trap composed of 169 places in 396 ms of which 6 ms to minimize.
[2024-05-24 15:59:22] [INFO ] Deduced a trap composed of 88 places in 464 ms of which 5 ms to minimize.
[2024-05-24 15:59:23] [INFO ] Deduced a trap composed of 86 places in 440 ms of which 6 ms to minimize.
[2024-05-24 15:59:23] [INFO ] Deduced a trap composed of 95 places in 471 ms of which 6 ms to minimize.
[2024-05-24 15:59:24] [INFO ] Deduced a trap composed of 73 places in 473 ms of which 6 ms to minimize.
[2024-05-24 15:59:24] [INFO ] Deduced a trap composed of 88 places in 474 ms of which 6 ms to minimize.
[2024-05-24 15:59:25] [INFO ] Deduced a trap composed of 163 places in 393 ms of which 5 ms to minimize.
[2024-05-24 15:59:25] [INFO ] Deduced a trap composed of 113 places in 462 ms of which 6 ms to minimize.
[2024-05-24 15:59:26] [INFO ] Deduced a trap composed of 70 places in 453 ms of which 6 ms to minimize.
[2024-05-24 15:59:26] [INFO ] Deduced a trap composed of 60 places in 449 ms of which 5 ms to minimize.
[2024-05-24 15:59:27] [INFO ] Deduced a trap composed of 164 places in 406 ms of which 5 ms to minimize.
[2024-05-24 15:59:27] [INFO ] Deduced a trap composed of 64 places in 441 ms of which 6 ms to minimize.
[2024-05-24 15:59:28] [INFO ] Deduced a trap composed of 180 places in 372 ms of which 6 ms to minimize.
[2024-05-24 15:59:28] [INFO ] Deduced a trap composed of 188 places in 383 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/939 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:59:28] [INFO ] Deduced a trap composed of 157 places in 397 ms of which 6 ms to minimize.
[2024-05-24 15:59:29] [INFO ] Deduced a trap composed of 58 places in 446 ms of which 6 ms to minimize.
[2024-05-24 15:59:29] [INFO ] Deduced a trap composed of 76 places in 441 ms of which 5 ms to minimize.
[2024-05-24 15:59:30] [INFO ] Deduced a trap composed of 48 places in 444 ms of which 6 ms to minimize.
[2024-05-24 15:59:30] [INFO ] Deduced a trap composed of 73 places in 431 ms of which 6 ms to minimize.
[2024-05-24 15:59:31] [INFO ] Deduced a trap composed of 65 places in 438 ms of which 6 ms to minimize.
[2024-05-24 15:59:31] [INFO ] Deduced a trap composed of 188 places in 436 ms of which 5 ms to minimize.
[2024-05-24 15:59:32] [INFO ] Deduced a trap composed of 59 places in 431 ms of which 8 ms to minimize.
[2024-05-24 15:59:32] [INFO ] Deduced a trap composed of 66 places in 440 ms of which 5 ms to minimize.
[2024-05-24 15:59:32] [INFO ] Deduced a trap composed of 58 places in 430 ms of which 5 ms to minimize.
[2024-05-24 15:59:33] [INFO ] Deduced a trap composed of 74 places in 433 ms of which 6 ms to minimize.
[2024-05-24 15:59:33] [INFO ] Deduced a trap composed of 89 places in 416 ms of which 5 ms to minimize.
[2024-05-24 15:59:34] [INFO ] Deduced a trap composed of 49 places in 407 ms of which 6 ms to minimize.
[2024-05-24 15:59:34] [INFO ] Deduced a trap composed of 89 places in 414 ms of which 5 ms to minimize.
[2024-05-24 15:59:35] [INFO ] Deduced a trap composed of 65 places in 410 ms of which 6 ms to minimize.
[2024-05-24 15:59:35] [INFO ] Deduced a trap composed of 88 places in 421 ms of which 5 ms to minimize.
[2024-05-24 15:59:35] [INFO ] Deduced a trap composed of 60 places in 399 ms of which 6 ms to minimize.
[2024-05-24 15:59:36] [INFO ] Deduced a trap composed of 85 places in 419 ms of which 6 ms to minimize.
[2024-05-24 15:59:36] [INFO ] Deduced a trap composed of 88 places in 416 ms of which 5 ms to minimize.
[2024-05-24 15:59:37] [INFO ] Deduced a trap composed of 67 places in 415 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/939 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:59:37] [INFO ] Deduced a trap composed of 66 places in 443 ms of which 5 ms to minimize.
[2024-05-24 15:59:38] [INFO ] Deduced a trap composed of 188 places in 414 ms of which 5 ms to minimize.
[2024-05-24 15:59:38] [INFO ] Deduced a trap composed of 67 places in 413 ms of which 5 ms to minimize.
[2024-05-24 15:59:39] [INFO ] Deduced a trap composed of 48 places in 408 ms of which 6 ms to minimize.
[2024-05-24 15:59:39] [INFO ] Deduced a trap composed of 67 places in 414 ms of which 6 ms to minimize.
[2024-05-24 15:59:39] [INFO ] Deduced a trap composed of 74 places in 402 ms of which 6 ms to minimize.
[2024-05-24 15:59:40] [INFO ] Deduced a trap composed of 57 places in 419 ms of which 6 ms to minimize.
[2024-05-24 15:59:40] [INFO ] Deduced a trap composed of 155 places in 385 ms of which 5 ms to minimize.
[2024-05-24 15:59:41] [INFO ] Deduced a trap composed of 148 places in 381 ms of which 5 ms to minimize.
[2024-05-24 15:59:41] [INFO ] Deduced a trap composed of 187 places in 366 ms of which 5 ms to minimize.
[2024-05-24 15:59:41] [INFO ] Deduced a trap composed of 95 places in 411 ms of which 6 ms to minimize.
[2024-05-24 15:59:42] [INFO ] Deduced a trap composed of 189 places in 361 ms of which 5 ms to minimize.
[2024-05-24 15:59:42] [INFO ] Deduced a trap composed of 189 places in 364 ms of which 5 ms to minimize.
[2024-05-24 15:59:43] [INFO ] Deduced a trap composed of 60 places in 396 ms of which 6 ms to minimize.
[2024-05-24 15:59:43] [INFO ] Deduced a trap composed of 48 places in 419 ms of which 5 ms to minimize.
[2024-05-24 15:59:43] [INFO ] Deduced a trap composed of 67 places in 413 ms of which 5 ms to minimize.
[2024-05-24 15:59:44] [INFO ] Deduced a trap composed of 73 places in 418 ms of which 5 ms to minimize.
[2024-05-24 15:59:44] [INFO ] Deduced a trap composed of 69 places in 418 ms of which 5 ms to minimize.
[2024-05-24 15:59:45] [INFO ] Deduced a trap composed of 56 places in 405 ms of which 6 ms to minimize.
[2024-05-24 15:59:45] [INFO ] Deduced a trap composed of 68 places in 410 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/939 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:59:46] [INFO ] Deduced a trap composed of 81 places in 406 ms of which 6 ms to minimize.
[2024-05-24 15:59:46] [INFO ] Deduced a trap composed of 73 places in 422 ms of which 5 ms to minimize.
[2024-05-24 15:59:46] [INFO ] Deduced a trap composed of 83 places in 404 ms of which 5 ms to minimize.
[2024-05-24 15:59:47] [INFO ] Deduced a trap composed of 81 places in 410 ms of which 5 ms to minimize.
[2024-05-24 15:59:47] [INFO ] Deduced a trap composed of 60 places in 409 ms of which 6 ms to minimize.
[2024-05-24 15:59:48] [INFO ] Deduced a trap composed of 65 places in 410 ms of which 5 ms to minimize.
[2024-05-24 15:59:48] [INFO ] Deduced a trap composed of 58 places in 441 ms of which 6 ms to minimize.
[2024-05-24 15:59:49] [INFO ] Deduced a trap composed of 65 places in 401 ms of which 6 ms to minimize.
[2024-05-24 15:59:49] [INFO ] Deduced a trap composed of 56 places in 414 ms of which 6 ms to minimize.
[2024-05-24 15:59:50] [INFO ] Deduced a trap composed of 72 places in 405 ms of which 5 ms to minimize.
[2024-05-24 15:59:50] [INFO ] Deduced a trap composed of 71 places in 421 ms of which 6 ms to minimize.
[2024-05-24 15:59:50] [INFO ] Deduced a trap composed of 73 places in 405 ms of which 5 ms to minimize.
[2024-05-24 15:59:51] [INFO ] Deduced a trap composed of 145 places in 377 ms of which 5 ms to minimize.
[2024-05-24 15:59:51] [INFO ] Deduced a trap composed of 152 places in 392 ms of which 6 ms to minimize.
[2024-05-24 15:59:52] [INFO ] Deduced a trap composed of 57 places in 404 ms of which 6 ms to minimize.
[2024-05-24 15:59:52] [INFO ] Deduced a trap composed of 151 places in 389 ms of which 6 ms to minimize.
[2024-05-24 15:59:52] [INFO ] Deduced a trap composed of 145 places in 378 ms of which 5 ms to minimize.
[2024-05-24 15:59:53] [INFO ] Deduced a trap composed of 65 places in 421 ms of which 5 ms to minimize.
[2024-05-24 15:59:53] [INFO ] Deduced a trap composed of 58 places in 437 ms of which 5 ms to minimize.
[2024-05-24 15:59:54] [INFO ] Deduced a trap composed of 58 places in 421 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/939 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:59:54] [INFO ] Deduced a trap composed of 74 places in 414 ms of which 5 ms to minimize.
[2024-05-24 15:59:55] [INFO ] Deduced a trap composed of 80 places in 416 ms of which 5 ms to minimize.
[2024-05-24 15:59:55] [INFO ] Deduced a trap composed of 57 places in 420 ms of which 5 ms to minimize.
[2024-05-24 15:59:55] [INFO ] Deduced a trap composed of 91 places in 405 ms of which 6 ms to minimize.
[2024-05-24 15:59:56] [INFO ] Deduced a trap composed of 70 places in 414 ms of which 5 ms to minimize.
[2024-05-24 15:59:56] [INFO ] Deduced a trap composed of 76 places in 419 ms of which 6 ms to minimize.
[2024-05-24 15:59:57] [INFO ] Deduced a trap composed of 61 places in 408 ms of which 5 ms to minimize.
[2024-05-24 15:59:57] [INFO ] Deduced a trap composed of 60 places in 418 ms of which 5 ms to minimize.
[2024-05-24 15:59:58] [INFO ] Deduced a trap composed of 58 places in 408 ms of which 6 ms to minimize.
[2024-05-24 15:59:58] [INFO ] Deduced a trap composed of 188 places in 366 ms of which 5 ms to minimize.
[2024-05-24 15:59:58] [INFO ] Deduced a trap composed of 187 places in 368 ms of which 5 ms to minimize.
[2024-05-24 15:59:59] [INFO ] Deduced a trap composed of 188 places in 363 ms of which 5 ms to minimize.
[2024-05-24 15:59:59] [INFO ] Deduced a trap composed of 187 places in 354 ms of which 5 ms to minimize.
[2024-05-24 16:00:00] [INFO ] Deduced a trap composed of 189 places in 346 ms of which 5 ms to minimize.
[2024-05-24 16:00:00] [INFO ] Deduced a trap composed of 180 places in 347 ms of which 6 ms to minimize.
[2024-05-24 16:00:00] [INFO ] Deduced a trap composed of 185 places in 410 ms of which 6 ms to minimize.
[2024-05-24 16:00:01] [INFO ] Deduced a trap composed of 71 places in 424 ms of which 6 ms to minimize.
[2024-05-24 16:00:01] [INFO ] Deduced a trap composed of 57 places in 419 ms of which 5 ms to minimize.
[2024-05-24 16:00:02] [INFO ] Deduced a trap composed of 48 places in 427 ms of which 5 ms to minimize.
[2024-05-24 16:00:02] [INFO ] Deduced a trap composed of 61 places in 414 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/939 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:00:03] [INFO ] Deduced a trap composed of 67 places in 407 ms of which 6 ms to minimize.
[2024-05-24 16:00:03] [INFO ] Deduced a trap composed of 77 places in 406 ms of which 5 ms to minimize.
[2024-05-24 16:00:04] [INFO ] Deduced a trap composed of 69 places in 403 ms of which 5 ms to minimize.
[2024-05-24 16:00:04] [INFO ] Deduced a trap composed of 67 places in 408 ms of which 5 ms to minimize.
[2024-05-24 16:00:04] [INFO ] Deduced a trap composed of 68 places in 407 ms of which 5 ms to minimize.
[2024-05-24 16:00:05] [INFO ] Deduced a trap composed of 86 places in 401 ms of which 5 ms to minimize.
[2024-05-24 16:00:05] [INFO ] Deduced a trap composed of 58 places in 431 ms of which 6 ms to minimize.
[2024-05-24 16:00:06] [INFO ] Deduced a trap composed of 46 places in 409 ms of which 6 ms to minimize.
[2024-05-24 16:00:06] [INFO ] Deduced a trap composed of 61 places in 408 ms of which 5 ms to minimize.
[2024-05-24 16:00:07] [INFO ] Deduced a trap composed of 184 places in 410 ms of which 5 ms to minimize.
[2024-05-24 16:00:07] [INFO ] Deduced a trap composed of 68 places in 418 ms of which 6 ms to minimize.
[2024-05-24 16:00:07] [INFO ] Deduced a trap composed of 59 places in 414 ms of which 5 ms to minimize.
[2024-05-24 16:00:08] [INFO ] Deduced a trap composed of 58 places in 409 ms of which 5 ms to minimize.
[2024-05-24 16:00:08] [INFO ] Deduced a trap composed of 72 places in 418 ms of which 5 ms to minimize.
[2024-05-24 16:00:09] [INFO ] Deduced a trap composed of 79 places in 405 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/939 variables, 15/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/939 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 7/946 variables, 7/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/946 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2367/3313 variables, 946/1116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 3313/3313 variables, and 2345 constraints, problems are : Problem set: 1 solved, 0 unsolved in 55482 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 946/946 constraints, ReadFeed: 1229/1229 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 130/130 constraints]
After SMT, in 58097ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (G (NOT p0)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 4 out of 1124 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1124/1124 places, 2543/2543 transitions.
Applied a total of 0 rules in 39 ms. Remains 1124 /1124 variables (removed 0) and now considering 2543/2543 (removed 0) transitions.
[2024-05-24 16:00:12] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1124 cols
[2024-05-24 16:00:12] [INFO ] Computed 41 invariants in 27 ms
[2024-05-24 16:00:13] [INFO ] Implicit Places using invariants in 925 ms returned []
[2024-05-24 16:00:13] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2024-05-24 16:00:13] [INFO ] Invariant cache hit.
[2024-05-24 16:00:14] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-24 16:00:26] [INFO ] Implicit Places using invariants and state equation in 12673 ms returned []
Implicit Place search using SMT with State Equation took 13601 ms to find 0 implicit places.
Running 2526 sub problems to find dead transitions.
[2024-05-24 16:00:26] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2024-05-24 16:00:26] [INFO ] Invariant cache hit.
[2024-05-24 16:00:26] [INFO ] State equation strengthened by 830 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1122 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2526 unsolved
SMT process timed out in 32357ms, After SMT, problems are : Problem set: 0 solved, 2526 unsolved
Search for dead transitions found 0 dead transitions in 32380ms
Finished structural reductions in LTL mode , in 1 iterations and 46026 ms. Remains : 1124/1124 places, 2543/2543 transitions.
Computed a total of 292 stabilizing places and 910 stable transitions
Computed a total of 292 stabilizing places and 910 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (956 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (244 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 83751 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 1
Probabilistic random walk after 83751 steps, saw 35627 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2024-05-24 16:01:02] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2024-05-24 16:01:02] [INFO ] Invariant cache hit.
[2024-05-24 16:01:02] [INFO ] State equation strengthened by 830 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) 1044/1048 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1048 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 43/1091 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1091 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/1117 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1117 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/1124 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1124 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2271/3395 variables, 1124/1165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3395 variables, 830/1995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3395 variables, 0/1995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/3395 variables, 0/1995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3395/3395 variables, and 1995 constraints, problems are : Problem set: 0 solved, 1 unsolved in 899 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1124/1124 constraints, ReadFeed: 830/830 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1044/1048 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1048 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/1091 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:01:03] [INFO ] Deduced a trap composed of 50 places in 490 ms of which 7 ms to minimize.
[2024-05-24 16:01:04] [INFO ] Deduced a trap composed of 144 places in 445 ms of which 7 ms to minimize.
[2024-05-24 16:01:04] [INFO ] Deduced a trap composed of 87 places in 455 ms of which 7 ms to minimize.
[2024-05-24 16:01:05] [INFO ] Deduced a trap composed of 72 places in 485 ms of which 7 ms to minimize.
[2024-05-24 16:01:05] [INFO ] Deduced a trap composed of 105 places in 537 ms of which 7 ms to minimize.
[2024-05-24 16:01:06] [INFO ] Deduced a trap composed of 88 places in 558 ms of which 7 ms to minimize.
[2024-05-24 16:01:06] [INFO ] Deduced a trap composed of 157 places in 495 ms of which 7 ms to minimize.
[2024-05-24 16:01:07] [INFO ] Deduced a trap composed of 82 places in 508 ms of which 8 ms to minimize.
[2024-05-24 16:01:07] [INFO ] Deduced a trap composed of 86 places in 500 ms of which 7 ms to minimize.
[2024-05-24 16:01:08] [INFO ] Deduced a trap composed of 145 places in 502 ms of which 6 ms to minimize.
SMT process timed out in 6239ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1124/1124 places, 2543/2543 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1124 transition count 2527
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 1108 transition count 2527
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 32 place count 1108 transition count 2519
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 48 place count 1100 transition count 2519
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 84 place count 1082 transition count 2501
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 2 with 133 rules applied. Total rules applied 217 place count 1082 transition count 3172
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 2 with 133 rules applied. Total rules applied 350 place count 949 transition count 3172
Applied a total of 350 rules in 221 ms. Remains 949 /1124 variables (removed 175) and now considering 3172/2543 (removed -629) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 222 ms. Remains : 949/1124 places, 3172/2543 transitions.
RANDOM walk for 38706 steps (1648 resets) in 540 ms. (71 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 800 ms.
Product exploration explored 100000 steps with 25000 reset in 842 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 4 out of 1124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1124/1124 places, 2543/2543 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1124 transition count 2543
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 16 place count 1124 transition count 2543
Deduced a syphon composed of 24 places in 2 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 1124 transition count 2543
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 1116 transition count 2535
Deduced a syphon composed of 16 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 1116 transition count 2535
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 34 places in 1 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 58 place count 1116 transition count 2535
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 1115 transition count 2534
Deduced a syphon composed of 33 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 1115 transition count 2534
Deduced a syphon composed of 33 places in 1 ms
Applied a total of 60 rules in 454 ms. Remains 1115 /1124 variables (removed 9) and now considering 2534/2543 (removed 9) transitions.
[2024-05-24 16:01:11] [INFO ] Redundant transitions in 56 ms returned []
Running 2517 sub problems to find dead transitions.
[2024-05-24 16:01:11] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1115 cols
[2024-05-24 16:01:11] [INFO ] Computed 41 invariants in 28 ms
[2024-05-24 16:01:11] [INFO ] State equation strengthened by 830 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1113 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2517 unsolved
SMT process timed out in 33209ms, After SMT, problems are : Problem set: 0 solved, 2517 unsolved
Search for dead transitions found 0 dead transitions in 33237ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1115/1124 places, 2534/2543 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33770 ms. Remains : 1115/1124 places, 2534/2543 transitions.
Support contains 4 out of 1124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1124/1124 places, 2543/2543 transitions.
Applied a total of 0 rules in 33 ms. Remains 1124 /1124 variables (removed 0) and now considering 2543/2543 (removed 0) transitions.
[2024-05-24 16:01:45] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1124 cols
[2024-05-24 16:01:45] [INFO ] Computed 41 invariants in 28 ms
[2024-05-24 16:01:46] [INFO ] Implicit Places using invariants in 954 ms returned []
[2024-05-24 16:01:46] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2024-05-24 16:01:46] [INFO ] Invariant cache hit.
[2024-05-24 16:01:46] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-24 16:01:56] [INFO ] Implicit Places using invariants and state equation in 10696 ms returned []
Implicit Place search using SMT with State Equation took 11651 ms to find 0 implicit places.
Running 2526 sub problems to find dead transitions.
[2024-05-24 16:01:56] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2024-05-24 16:01:56] [INFO ] Invariant cache hit.
[2024-05-24 16:01:56] [INFO ] State equation strengthened by 830 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1122 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2526 unsolved
SMT process timed out in 32413ms, After SMT, problems are : Problem set: 0 solved, 2526 unsolved
Search for dead transitions found 0 dead transitions in 32438ms
Finished structural reductions in LTL mode , in 1 iterations and 44128 ms. Remains : 1124/1124 places, 2543/2543 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-13 finished in 293113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 2762/2762 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 1253 transition count 2749
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 1240 transition count 2749
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 26 place count 1240 transition count 2728
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 68 place count 1219 transition count 2728
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 84 place count 1203 transition count 2706
Iterating global reduction 2 with 16 rules applied. Total rules applied 100 place count 1203 transition count 2706
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 100 place count 1203 transition count 2703
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 1200 transition count 2703
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 119 place count 1187 transition count 2651
Iterating global reduction 2 with 13 rules applied. Total rules applied 132 place count 1187 transition count 2651
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 184 place count 1161 transition count 2625
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 189 place count 1156 transition count 2620
Iterating global reduction 2 with 5 rules applied. Total rules applied 194 place count 1156 transition count 2620
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 199 place count 1151 transition count 2600
Iterating global reduction 2 with 5 rules applied. Total rules applied 204 place count 1151 transition count 2600
Applied a total of 204 rules in 370 ms. Remains 1151 /1253 variables (removed 102) and now considering 2600/2762 (removed 162) transitions.
[2024-05-24 16:02:29] [INFO ] Flow matrix only has 2328 transitions (discarded 272 similar events)
// Phase 1: matrix 2328 rows 1151 cols
[2024-05-24 16:02:29] [INFO ] Computed 59 invariants in 51 ms
[2024-05-24 16:02:30] [INFO ] Implicit Places using invariants in 1009 ms returned [9, 95, 96, 224, 268, 322, 357, 398, 472, 541, 564, 589, 599, 677, 758, 791, 1051]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1011 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1134/1253 places, 2600/2762 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1122 transition count 2588
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1122 transition count 2588
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1110 transition count 2576
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1110 transition count 2576
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 58 place count 1100 transition count 2536
Iterating global reduction 0 with 10 rules applied. Total rules applied 68 place count 1100 transition count 2536
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 78 place count 1095 transition count 2531
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 1090 transition count 2526
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 1090 transition count 2526
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 94 place count 1084 transition count 2502
Iterating global reduction 0 with 6 rules applied. Total rules applied 100 place count 1084 transition count 2502
Applied a total of 100 rules in 287 ms. Remains 1084 /1134 variables (removed 50) and now considering 2502/2600 (removed 98) transitions.
[2024-05-24 16:02:31] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
// Phase 1: matrix 2230 rows 1084 cols
[2024-05-24 16:02:31] [INFO ] Computed 42 invariants in 30 ms
[2024-05-24 16:02:32] [INFO ] Implicit Places using invariants in 962 ms returned []
[2024-05-24 16:02:32] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2024-05-24 16:02:32] [INFO ] Invariant cache hit.
[2024-05-24 16:02:32] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-24 16:02:42] [INFO ] Implicit Places using invariants and state equation in 9912 ms returned [1077]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10878 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1083/1253 places, 2502/2762 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1083 transition count 2501
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1082 transition count 2501
Applied a total of 2 rules in 75 ms. Remains 1082 /1083 variables (removed 1) and now considering 2501/2502 (removed 1) transitions.
[2024-05-24 16:02:42] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
// Phase 1: matrix 2229 rows 1082 cols
[2024-05-24 16:02:42] [INFO ] Computed 41 invariants in 28 ms
[2024-05-24 16:02:43] [INFO ] Implicit Places using invariants in 939 ms returned []
[2024-05-24 16:02:43] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2024-05-24 16:02:43] [INFO ] Invariant cache hit.
[2024-05-24 16:02:43] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-24 16:02:52] [INFO ] Implicit Places using invariants and state equation in 9788 ms returned []
Implicit Place search using SMT with State Equation took 10727 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1082/1253 places, 2501/2762 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 23348 ms. Remains : 1082/1253 places, 2501/2762 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-14
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-14 finished in 23396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 2762/2762 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 1253 transition count 2749
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 1240 transition count 2749
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 26 place count 1240 transition count 2727
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 70 place count 1218 transition count 2727
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 87 place count 1201 transition count 2704
Iterating global reduction 2 with 17 rules applied. Total rules applied 104 place count 1201 transition count 2704
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 104 place count 1201 transition count 2700
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 112 place count 1197 transition count 2700
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 126 place count 1183 transition count 2644
Iterating global reduction 2 with 14 rules applied. Total rules applied 140 place count 1183 transition count 2644
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 3 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 190 place count 1158 transition count 2619
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 195 place count 1153 transition count 2614
Iterating global reduction 2 with 5 rules applied. Total rules applied 200 place count 1153 transition count 2614
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 205 place count 1148 transition count 2594
Iterating global reduction 2 with 5 rules applied. Total rules applied 210 place count 1148 transition count 2594
Applied a total of 210 rules in 302 ms. Remains 1148 /1253 variables (removed 105) and now considering 2594/2762 (removed 168) transitions.
[2024-05-24 16:02:53] [INFO ] Flow matrix only has 2322 transitions (discarded 272 similar events)
// Phase 1: matrix 2322 rows 1148 cols
[2024-05-24 16:02:53] [INFO ] Computed 59 invariants in 27 ms
[2024-05-24 16:02:54] [INFO ] Implicit Places using invariants in 988 ms returned [9, 94, 95, 223, 267, 321, 356, 397, 471, 508, 537, 560, 585, 595, 673, 754, 787, 1047]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 990 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1130/1253 places, 2594/2762 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1116 transition count 2580
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1116 transition count 2580
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1102 transition count 2566
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1102 transition count 2566
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 68 place count 1090 transition count 2518
Iterating global reduction 0 with 12 rules applied. Total rules applied 80 place count 1090 transition count 2518
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 88 place count 1086 transition count 2514
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 92 place count 1082 transition count 2510
Iterating global reduction 0 with 4 rules applied. Total rules applied 96 place count 1082 transition count 2510
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 101 place count 1077 transition count 2490
Iterating global reduction 0 with 5 rules applied. Total rules applied 106 place count 1077 transition count 2490
Applied a total of 106 rules in 277 ms. Remains 1077 /1130 variables (removed 53) and now considering 2490/2594 (removed 104) transitions.
[2024-05-24 16:02:54] [INFO ] Flow matrix only has 2218 transitions (discarded 272 similar events)
// Phase 1: matrix 2218 rows 1077 cols
[2024-05-24 16:02:54] [INFO ] Computed 41 invariants in 26 ms
[2024-05-24 16:02:55] [INFO ] Implicit Places using invariants in 938 ms returned []
[2024-05-24 16:02:55] [INFO ] Flow matrix only has 2218 transitions (discarded 272 similar events)
[2024-05-24 16:02:55] [INFO ] Invariant cache hit.
[2024-05-24 16:02:56] [INFO ] State equation strengthened by 824 read => feed constraints.
[2024-05-24 16:03:04] [INFO ] Implicit Places using invariants and state equation in 9138 ms returned [1061, 1070]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10081 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1075/1253 places, 2490/2762 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1075 transition count 2488
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1073 transition count 2488
Applied a total of 4 rules in 68 ms. Remains 1073 /1075 variables (removed 2) and now considering 2488/2490 (removed 2) transitions.
[2024-05-24 16:03:04] [INFO ] Flow matrix only has 2216 transitions (discarded 272 similar events)
// Phase 1: matrix 2216 rows 1073 cols
[2024-05-24 16:03:04] [INFO ] Computed 39 invariants in 25 ms
[2024-05-24 16:03:05] [INFO ] Implicit Places using invariants in 901 ms returned []
[2024-05-24 16:03:05] [INFO ] Flow matrix only has 2216 transitions (discarded 272 similar events)
[2024-05-24 16:03:05] [INFO ] Invariant cache hit.
[2024-05-24 16:03:06] [INFO ] State equation strengthened by 824 read => feed constraints.
[2024-05-24 16:03:14] [INFO ] Implicit Places using invariants and state equation in 8793 ms returned []
Implicit Place search using SMT with State Equation took 9703 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1073/1253 places, 2488/2762 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 21421 ms. Remains : 1073/1253 places, 2488/2762 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-15
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-15 finished in 21503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((!p0&&X(p1))))))'
Found a Shortening insensitive property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-13
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Support contains 6 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1253/1253 places, 2762/2762 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 1253 transition count 2749
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 1240 transition count 2749
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 26 place count 1240 transition count 2728
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 68 place count 1219 transition count 2728
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 84 place count 1203 transition count 2706
Iterating global reduction 2 with 16 rules applied. Total rules applied 100 place count 1203 transition count 2706
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 100 place count 1203 transition count 2702
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 108 place count 1199 transition count 2702
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 121 place count 1186 transition count 2650
Iterating global reduction 2 with 13 rules applied. Total rules applied 134 place count 1186 transition count 2650
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 182 place count 1162 transition count 2626
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 187 place count 1157 transition count 2621
Iterating global reduction 2 with 5 rules applied. Total rules applied 192 place count 1157 transition count 2621
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 197 place count 1152 transition count 2601
Iterating global reduction 2 with 5 rules applied. Total rules applied 202 place count 1152 transition count 2601
Applied a total of 202 rules in 253 ms. Remains 1152 /1253 variables (removed 101) and now considering 2601/2762 (removed 161) transitions.
[2024-05-24 16:03:14] [INFO ] Flow matrix only has 2329 transitions (discarded 272 similar events)
// Phase 1: matrix 2329 rows 1152 cols
[2024-05-24 16:03:14] [INFO ] Computed 59 invariants in 25 ms
[2024-05-24 16:03:15] [INFO ] Implicit Places using invariants in 996 ms returned [96, 97, 226, 270, 324, 359, 400, 474, 511, 540, 563, 588, 598, 676, 757, 790, 1051]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 997 ms to find 17 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1135/1253 places, 2601/2762 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1122 transition count 2588
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1122 transition count 2588
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1109 transition count 2575
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1109 transition count 2575
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 63 place count 1098 transition count 2531
Iterating global reduction 0 with 11 rules applied. Total rules applied 74 place count 1098 transition count 2531
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 1094 transition count 2527
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 86 place count 1090 transition count 2523
Iterating global reduction 0 with 4 rules applied. Total rules applied 90 place count 1090 transition count 2523
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 95 place count 1085 transition count 2503
Iterating global reduction 0 with 5 rules applied. Total rules applied 100 place count 1085 transition count 2503
Applied a total of 100 rules in 256 ms. Remains 1085 /1135 variables (removed 50) and now considering 2503/2601 (removed 98) transitions.
[2024-05-24 16:03:16] [INFO ] Flow matrix only has 2231 transitions (discarded 272 similar events)
// Phase 1: matrix 2231 rows 1085 cols
[2024-05-24 16:03:16] [INFO ] Computed 42 invariants in 28 ms
[2024-05-24 16:03:17] [INFO ] Implicit Places using invariants in 928 ms returned []
[2024-05-24 16:03:17] [INFO ] Flow matrix only has 2231 transitions (discarded 272 similar events)
[2024-05-24 16:03:17] [INFO ] Invariant cache hit.
[2024-05-24 16:03:17] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-24 16:03:25] [INFO ] Implicit Places using invariants and state equation in 8699 ms returned [1078]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9630 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1084/1253 places, 2503/2762 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1084 transition count 2502
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1083 transition count 2502
Applied a total of 2 rules in 48 ms. Remains 1083 /1084 variables (removed 1) and now considering 2502/2503 (removed 1) transitions.
[2024-05-24 16:03:25] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
// Phase 1: matrix 2230 rows 1083 cols
[2024-05-24 16:03:25] [INFO ] Computed 41 invariants in 26 ms
[2024-05-24 16:03:26] [INFO ] Implicit Places using invariants in 911 ms returned []
[2024-05-24 16:03:26] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2024-05-24 16:03:26] [INFO ] Invariant cache hit.
[2024-05-24 16:03:27] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-24 16:03:36] [INFO ] Implicit Places using invariants and state equation in 9905 ms returned []
Implicit Place search using SMT with State Equation took 10818 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 1083/1253 places, 2502/2762 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 22003 ms. Remains : 1083/1253 places, 2502/2762 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-13
Product exploration explored 100000 steps with 25000 reset in 735 ms.
Product exploration explored 100000 steps with 25000 reset in 747 ms.
Computed a total of 267 stabilizing places and 885 stable transitions
Computed a total of 267 stabilizing places and 885 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
RANDOM walk for 40000 steps (1354 resets) in 323 ms. (123 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (265 resets) in 195 ms. (204 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (264 resets) in 202 ms. (197 steps per ms) remains 2/2 properties
[2024-05-24 16:03:38] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2024-05-24 16:03:38] [INFO ] Invariant cache hit.
[2024-05-24 16:03:38] [INFO ] State equation strengthened by 830 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 1001/1007 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1007 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/1050 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-24 16:03:39] [INFO ] Deduced a trap composed of 47 places in 441 ms of which 7 ms to minimize.
[2024-05-24 16:03:39] [INFO ] Deduced a trap composed of 93 places in 414 ms of which 6 ms to minimize.
[2024-05-24 16:03:40] [INFO ] Deduced a trap composed of 72 places in 442 ms of which 6 ms to minimize.
[2024-05-24 16:03:40] [INFO ] Deduced a trap composed of 88 places in 456 ms of which 6 ms to minimize.
[2024-05-24 16:03:41] [INFO ] Deduced a trap composed of 83 places in 435 ms of which 7 ms to minimize.
[2024-05-24 16:03:41] [INFO ] Deduced a trap composed of 68 places in 453 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1050 variables, 6/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1050 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 26/1076 variables, 26/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1076 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/1083 variables, 7/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1083 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2230/3313 variables, 1083/1130 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3313 variables, 830/1960 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3313 variables, 0/1960 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/3313 variables, 0/1960 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3313/3313 variables, and 1960 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3930 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1083/1083 constraints, ReadFeed: 830/830 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1002/1004 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1004 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/1048 variables, 3/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1048 variables, 5/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-24 16:03:43] [INFO ] Deduced a trap composed of 69 places in 415 ms of which 7 ms to minimize.
[2024-05-24 16:03:43] [INFO ] Deduced a trap composed of 64 places in 443 ms of which 6 ms to minimize.
[2024-05-24 16:03:44] [INFO ] Deduced a trap composed of 72 places in 438 ms of which 6 ms to minimize.
[2024-05-24 16:03:44] [INFO ] Deduced a trap composed of 74 places in 426 ms of which 6 ms to minimize.
[2024-05-24 16:03:44] [INFO ] Deduced a trap composed of 73 places in 412 ms of which 6 ms to minimize.
[2024-05-24 16:03:45] [INFO ] Deduced a trap composed of 93 places in 429 ms of which 7 ms to minimize.
[2024-05-24 16:03:45] [INFO ] Deduced a trap composed of 72 places in 433 ms of which 7 ms to minimize.
[2024-05-24 16:03:46] [INFO ] Deduced a trap composed of 75 places in 438 ms of which 7 ms to minimize.
[2024-05-24 16:03:46] [INFO ] Deduced a trap composed of 132 places in 436 ms of which 7 ms to minimize.
[2024-05-24 16:03:47] [INFO ] Deduced a trap composed of 67 places in 424 ms of which 6 ms to minimize.
[2024-05-24 16:03:47] [INFO ] Deduced a trap composed of 132 places in 423 ms of which 6 ms to minimize.
SMT process timed out in 9042ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 2502/2502 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1083 transition count 2501
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1082 transition count 2501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1081 transition count 2500
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1081 transition count 2500
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1080 transition count 2496
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1080 transition count 2496
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 0 with 131 rules applied. Total rules applied 137 place count 1080 transition count 2767
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 268 place count 949 transition count 2767
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 269 place count 949 transition count 2767
Applied a total of 269 rules in 276 ms. Remains 949 /1083 variables (removed 134) and now considering 2767/2502 (removed -265) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 949/1083 places, 2767/2502 transitions.
RANDOM walk for 40000 steps (1568 resets) in 496 ms. (80 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (193 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 84494 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 1
Probabilistic random walk after 84494 steps, saw 35201 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-24 16:03:51] [INFO ] Flow matrix only has 2369 transitions (discarded 398 similar events)
// Phase 1: matrix 2369 rows 949 cols
[2024-05-24 16:03:51] [INFO ] Computed 41 invariants in 24 ms
[2024-05-24 16:03:51] [INFO ] State equation strengthened by 1229 read => feed constraints.
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) 867/869 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/869 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/887 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:03:51] [INFO ] Deduced a trap composed of 66 places in 401 ms of which 6 ms to minimize.
[2024-05-24 16:03:52] [INFO ] Deduced a trap composed of 67 places in 404 ms of which 6 ms to minimize.
[2024-05-24 16:03:52] [INFO ] Deduced a trap composed of 222 places in 380 ms of which 5 ms to minimize.
[2024-05-24 16:03:52] [INFO ] Deduced a trap composed of 97 places in 398 ms of which 6 ms to minimize.
[2024-05-24 16:03:53] [INFO ] Deduced a trap composed of 67 places in 476 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/887 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/887 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 27/914 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/914 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 28/942 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/942 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/949 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/949 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2369/3318 variables, 949/995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3318 variables, 1229/2224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3318 variables, 0/2224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/3318 variables, 0/2224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3318/3318 variables, and 2224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3087 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 949/949 constraints, ReadFeed: 1229/1229 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 867/869 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/869 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/887 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/887 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/887 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 27/914 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:03:54] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 3 ms to minimize.
[2024-05-24 16:03:54] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 3 ms to minimize.
[2024-05-24 16:03:55] [INFO ] Deduced a trap composed of 57 places in 200 ms of which 3 ms to minimize.
[2024-05-24 16:03:55] [INFO ] Deduced a trap composed of 46 places in 199 ms of which 5 ms to minimize.
[2024-05-24 16:03:55] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 3 ms to minimize.
[2024-05-24 16:03:55] [INFO ] Deduced a trap composed of 62 places in 203 ms of which 3 ms to minimize.
[2024-05-24 16:03:55] [INFO ] Deduced a trap composed of 62 places in 200 ms of which 3 ms to minimize.
[2024-05-24 16:03:56] [INFO ] Deduced a trap composed of 82 places in 188 ms of which 3 ms to minimize.
[2024-05-24 16:03:56] [INFO ] Deduced a trap composed of 78 places in 203 ms of which 3 ms to minimize.
[2024-05-24 16:03:56] [INFO ] Deduced a trap composed of 96 places in 205 ms of which 4 ms to minimize.
[2024-05-24 16:03:56] [INFO ] Deduced a trap composed of 100 places in 203 ms of which 3 ms to minimize.
[2024-05-24 16:03:56] [INFO ] Deduced a trap composed of 87 places in 182 ms of which 3 ms to minimize.
[2024-05-24 16:03:57] [INFO ] Deduced a trap composed of 100 places in 194 ms of which 3 ms to minimize.
[2024-05-24 16:03:57] [INFO ] Deduced a trap composed of 46 places in 201 ms of which 4 ms to minimize.
[2024-05-24 16:03:57] [INFO ] Deduced a trap composed of 62 places in 198 ms of which 4 ms to minimize.
[2024-05-24 16:03:57] [INFO ] Deduced a trap composed of 71 places in 188 ms of which 4 ms to minimize.
[2024-05-24 16:03:58] [INFO ] Deduced a trap composed of 97 places in 193 ms of which 3 ms to minimize.
[2024-05-24 16:03:58] [INFO ] Deduced a trap composed of 78 places in 202 ms of which 3 ms to minimize.
[2024-05-24 16:03:58] [INFO ] Deduced a trap composed of 82 places in 196 ms of which 4 ms to minimize.
[2024-05-24 16:03:58] [INFO ] Deduced a trap composed of 97 places in 189 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/914 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:03:58] [INFO ] Deduced a trap composed of 143 places in 201 ms of which 4 ms to minimize.
[2024-05-24 16:03:59] [INFO ] Deduced a trap composed of 85 places in 194 ms of which 4 ms to minimize.
[2024-05-24 16:03:59] [INFO ] Deduced a trap composed of 86 places in 204 ms of which 3 ms to minimize.
[2024-05-24 16:03:59] [INFO ] Deduced a trap composed of 85 places in 178 ms of which 3 ms to minimize.
[2024-05-24 16:03:59] [INFO ] Deduced a trap composed of 96 places in 196 ms of which 4 ms to minimize.
[2024-05-24 16:03:59] [INFO ] Deduced a trap composed of 95 places in 170 ms of which 3 ms to minimize.
[2024-05-24 16:04:00] [INFO ] Deduced a trap composed of 75 places in 193 ms of which 3 ms to minimize.
[2024-05-24 16:04:00] [INFO ] Deduced a trap composed of 93 places in 192 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/914 variables, 8/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/914 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/942 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:04:00] [INFO ] Deduced a trap composed of 62 places in 430 ms of which 6 ms to minimize.
[2024-05-24 16:04:01] [INFO ] Deduced a trap composed of 74 places in 425 ms of which 6 ms to minimize.
[2024-05-24 16:04:01] [INFO ] Deduced a trap composed of 59 places in 434 ms of which 6 ms to minimize.
[2024-05-24 16:04:02] [INFO ] Deduced a trap composed of 59 places in 412 ms of which 5 ms to minimize.
[2024-05-24 16:04:02] [INFO ] Deduced a trap composed of 48 places in 426 ms of which 6 ms to minimize.
[2024-05-24 16:04:02] [INFO ] Deduced a trap composed of 168 places in 400 ms of which 5 ms to minimize.
[2024-05-24 16:04:03] [INFO ] Deduced a trap composed of 152 places in 404 ms of which 6 ms to minimize.
[2024-05-24 16:04:03] [INFO ] Deduced a trap composed of 69 places in 422 ms of which 6 ms to minimize.
[2024-05-24 16:04:04] [INFO ] Deduced a trap composed of 75 places in 413 ms of which 6 ms to minimize.
[2024-05-24 16:04:04] [INFO ] Deduced a trap composed of 90 places in 412 ms of which 6 ms to minimize.
[2024-05-24 16:04:05] [INFO ] Deduced a trap composed of 67 places in 405 ms of which 5 ms to minimize.
[2024-05-24 16:04:05] [INFO ] Deduced a trap composed of 58 places in 419 ms of which 6 ms to minimize.
[2024-05-24 16:04:05] [INFO ] Deduced a trap composed of 126 places in 388 ms of which 6 ms to minimize.
[2024-05-24 16:04:06] [INFO ] Deduced a trap composed of 69 places in 406 ms of which 6 ms to minimize.
[2024-05-24 16:04:06] [INFO ] Deduced a trap composed of 70 places in 432 ms of which 5 ms to minimize.
[2024-05-24 16:04:07] [INFO ] Deduced a trap composed of 187 places in 394 ms of which 6 ms to minimize.
[2024-05-24 16:04:07] [INFO ] Deduced a trap composed of 160 places in 377 ms of which 5 ms to minimize.
[2024-05-24 16:04:08] [INFO ] Deduced a trap composed of 59 places in 421 ms of which 5 ms to minimize.
[2024-05-24 16:04:08] [INFO ] Deduced a trap composed of 71 places in 418 ms of which 6 ms to minimize.
[2024-05-24 16:04:08] [INFO ] Deduced a trap composed of 189 places in 368 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/942 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:04:09] [INFO ] Deduced a trap composed of 49 places in 415 ms of which 6 ms to minimize.
[2024-05-24 16:04:09] [INFO ] Deduced a trap composed of 58 places in 413 ms of which 5 ms to minimize.
[2024-05-24 16:04:10] [INFO ] Deduced a trap composed of 71 places in 405 ms of which 5 ms to minimize.
[2024-05-24 16:04:10] [INFO ] Deduced a trap composed of 49 places in 410 ms of which 6 ms to minimize.
[2024-05-24 16:04:11] [INFO ] Deduced a trap composed of 171 places in 362 ms of which 5 ms to minimize.
[2024-05-24 16:04:11] [INFO ] Deduced a trap composed of 187 places in 356 ms of which 6 ms to minimize.
[2024-05-24 16:04:11] [INFO ] Deduced a trap composed of 171 places in 369 ms of which 6 ms to minimize.
[2024-05-24 16:04:12] [INFO ] Deduced a trap composed of 191 places in 369 ms of which 5 ms to minimize.
[2024-05-24 16:04:12] [INFO ] Deduced a trap composed of 67 places in 416 ms of which 6 ms to minimize.
[2024-05-24 16:04:13] [INFO ] Deduced a trap composed of 87 places in 436 ms of which 6 ms to minimize.
[2024-05-24 16:04:13] [INFO ] Deduced a trap composed of 164 places in 409 ms of which 6 ms to minimize.
[2024-05-24 16:04:13] [INFO ] Deduced a trap composed of 70 places in 416 ms of which 5 ms to minimize.
[2024-05-24 16:04:14] [INFO ] Deduced a trap composed of 88 places in 440 ms of which 6 ms to minimize.
[2024-05-24 16:04:14] [INFO ] Deduced a trap composed of 70 places in 417 ms of which 5 ms to minimize.
[2024-05-24 16:04:15] [INFO ] Deduced a trap composed of 81 places in 432 ms of which 6 ms to minimize.
[2024-05-24 16:04:15] [INFO ] Deduced a trap composed of 204 places in 422 ms of which 6 ms to minimize.
[2024-05-24 16:04:16] [INFO ] Deduced a trap composed of 61 places in 418 ms of which 5 ms to minimize.
[2024-05-24 16:04:16] [INFO ] Deduced a trap composed of 68 places in 427 ms of which 5 ms to minimize.
[2024-05-24 16:04:17] [INFO ] Deduced a trap composed of 72 places in 419 ms of which 6 ms to minimize.
[2024-05-24 16:04:17] [INFO ] Deduced a trap composed of 72 places in 418 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/942 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:04:18] [INFO ] Deduced a trap composed of 61 places in 457 ms of which 6 ms to minimize.
[2024-05-24 16:04:18] [INFO ] Deduced a trap composed of 85 places in 461 ms of which 6 ms to minimize.
[2024-05-24 16:04:18] [INFO ] Deduced a trap composed of 60 places in 453 ms of which 6 ms to minimize.
[2024-05-24 16:04:19] [INFO ] Deduced a trap composed of 86 places in 466 ms of which 6 ms to minimize.
[2024-05-24 16:04:19] [INFO ] Deduced a trap composed of 131 places in 456 ms of which 6 ms to minimize.
[2024-05-24 16:04:20] [INFO ] Deduced a trap composed of 70 places in 430 ms of which 6 ms to minimize.
[2024-05-24 16:04:20] [INFO ] Deduced a trap composed of 80 places in 470 ms of which 6 ms to minimize.
[2024-05-24 16:04:21] [INFO ] Deduced a trap composed of 89 places in 472 ms of which 6 ms to minimize.
[2024-05-24 16:04:21] [INFO ] Deduced a trap composed of 68 places in 452 ms of which 6 ms to minimize.
[2024-05-24 16:04:22] [INFO ] Deduced a trap composed of 59 places in 458 ms of which 6 ms to minimize.
[2024-05-24 16:04:22] [INFO ] Deduced a trap composed of 61 places in 465 ms of which 6 ms to minimize.
[2024-05-24 16:04:23] [INFO ] Deduced a trap composed of 89 places in 454 ms of which 5 ms to minimize.
[2024-05-24 16:04:23] [INFO ] Deduced a trap composed of 64 places in 450 ms of which 6 ms to minimize.
[2024-05-24 16:04:24] [INFO ] Deduced a trap composed of 76 places in 470 ms of which 6 ms to minimize.
[2024-05-24 16:04:24] [INFO ] Deduced a trap composed of 80 places in 467 ms of which 5 ms to minimize.
[2024-05-24 16:04:25] [INFO ] Deduced a trap composed of 60 places in 474 ms of which 6 ms to minimize.
[2024-05-24 16:04:25] [INFO ] Deduced a trap composed of 60 places in 466 ms of which 6 ms to minimize.
[2024-05-24 16:04:26] [INFO ] Deduced a trap composed of 66 places in 478 ms of which 6 ms to minimize.
[2024-05-24 16:04:26] [INFO ] Deduced a trap composed of 87 places in 414 ms of which 6 ms to minimize.
[2024-05-24 16:04:27] [INFO ] Deduced a trap composed of 50 places in 409 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/942 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:04:27] [INFO ] Deduced a trap composed of 195 places in 364 ms of which 5 ms to minimize.
[2024-05-24 16:04:27] [INFO ] Deduced a trap composed of 61 places in 409 ms of which 5 ms to minimize.
[2024-05-24 16:04:28] [INFO ] Deduced a trap composed of 82 places in 405 ms of which 5 ms to minimize.
[2024-05-24 16:04:28] [INFO ] Deduced a trap composed of 101 places in 421 ms of which 5 ms to minimize.
[2024-05-24 16:04:29] [INFO ] Deduced a trap composed of 86 places in 425 ms of which 6 ms to minimize.
[2024-05-24 16:04:29] [INFO ] Deduced a trap composed of 60 places in 434 ms of which 5 ms to minimize.
[2024-05-24 16:04:30] [INFO ] Deduced a trap composed of 205 places in 420 ms of which 6 ms to minimize.
[2024-05-24 16:04:30] [INFO ] Deduced a trap composed of 64 places in 445 ms of which 6 ms to minimize.
[2024-05-24 16:04:31] [INFO ] Deduced a trap composed of 67 places in 437 ms of which 5 ms to minimize.
[2024-05-24 16:04:31] [INFO ] Deduced a trap composed of 76 places in 424 ms of which 6 ms to minimize.
[2024-05-24 16:04:31] [INFO ] Deduced a trap composed of 50 places in 414 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/942 variables, 11/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/942 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 7/949 variables, 7/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/949 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2369/3318 variables, 949/1094 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 3318/3318 variables, and 2323 constraints, problems are : Problem set: 1 solved, 0 unsolved in 40851 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 949/949 constraints, ReadFeed: 1229/1229 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 104/104 constraints]
After SMT, in 43989ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (G (NOT p0)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 4 out of 1083 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1083/1083 places, 2502/2502 transitions.
Applied a total of 0 rules in 35 ms. Remains 1083 /1083 variables (removed 0) and now considering 2502/2502 (removed 0) transitions.
[2024-05-24 16:04:35] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
// Phase 1: matrix 2230 rows 1083 cols
[2024-05-24 16:04:35] [INFO ] Computed 41 invariants in 27 ms
[2024-05-24 16:04:36] [INFO ] Implicit Places using invariants in 906 ms returned []
[2024-05-24 16:04:36] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2024-05-24 16:04:36] [INFO ] Invariant cache hit.
[2024-05-24 16:04:37] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-24 16:04:46] [INFO ] Implicit Places using invariants and state equation in 10074 ms returned []
Implicit Place search using SMT with State Equation took 10983 ms to find 0 implicit places.
Running 2485 sub problems to find dead transitions.
[2024-05-24 16:04:46] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2024-05-24 16:04:46] [INFO ] Invariant cache hit.
[2024-05-24 16:04:46] [INFO ] State equation strengthened by 830 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2485 unsolved
SMT process timed out in 32536ms, After SMT, problems are : Problem set: 0 solved, 2485 unsolved
Search for dead transitions found 0 dead transitions in 32559ms
Finished structural reductions in LTL mode , in 1 iterations and 43585 ms. Remains : 1083/1083 places, 2502/2502 transitions.
Computed a total of 267 stabilizing places and 885 stable transitions
Computed a total of 267 stabilizing places and 885 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 24314 steps (820 resets) in 186 ms. (130 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 702 ms.
Product exploration explored 100000 steps with 25000 reset in 765 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 4 out of 1083 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1083/1083 places, 2502/2502 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1083 transition count 2502
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 99 ms. Remains 1083 /1083 variables (removed 0) and now considering 2502/2502 (removed 0) transitions.
[2024-05-24 16:05:22] [INFO ] Redundant transitions in 136 ms returned []
Running 2485 sub problems to find dead transitions.
[2024-05-24 16:05:22] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
// Phase 1: matrix 2230 rows 1083 cols
[2024-05-24 16:05:22] [INFO ] Computed 41 invariants in 23 ms
[2024-05-24 16:05:22] [INFO ] State equation strengthened by 830 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.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 1.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 1.0)
(s51 1.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 1.0)
(s66 1.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 1.0)
(s82 1.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 1.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 1.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 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.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 1.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 1.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 1.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 1.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 1.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 0.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.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 1.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 1.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 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 0.0)
(s404 0.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 1.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 1.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 0.0)
(s494 1.0)
(s495 0.0)
(s496 0.0)
(s497 1.0)
(s498 0.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 0.0)
(s508 0.0)
(s509 1.0)
(s510 0.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 0.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 0.0)
(s550 0.0)
(s551 1.0)
(s552 0.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 0.0)
(s572 0.0)
(s573 1.0)
(s574 0.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 0.0)
(s585 1.0)
(s586 0.0)
(s587 0.0)
(s588 1.0)
(s589 0.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 0.0)
(s598 0.0)
(s599 1.0)
(s600 0.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 0.0)
(s610 1.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 1.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 1.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 1.0)
(s624 0.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 0.0)
(s632 0.0)
(s633 1.0)
(s634 0.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)timeout

(s641 1.0)
(s642 0.0)
(s643 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2485 unsolved
SMT process timed out in 32792ms, After SMT, problems are : Problem set: 0 solved, 2485 unsolved
Search for dead transitions found 0 dead transitions in 32814ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1083/1083 places, 2502/2502 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33065 ms. Remains : 1083/1083 places, 2502/2502 transitions.
Support contains 4 out of 1083 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1083/1083 places, 2502/2502 transitions.
Applied a total of 0 rules in 32 ms. Remains 1083 /1083 variables (removed 0) and now considering 2502/2502 (removed 0) transitions.
[2024-05-24 16:05:54] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
// Phase 1: matrix 2230 rows 1083 cols
[2024-05-24 16:05:54] [INFO ] Computed 41 invariants in 26 ms
[2024-05-24 16:05:55] [INFO ] Implicit Places using invariants in 1005 ms returned []
[2024-05-24 16:05:55] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2024-05-24 16:05:55] [INFO ] Invariant cache hit.
[2024-05-24 16:05:56] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-24 16:06:05] [INFO ] Implicit Places using invariants and state equation in 9548 ms returned []
Implicit Place search using SMT with State Equation took 10555 ms to find 0 implicit places.
Running 2485 sub problems to find dead transitions.
[2024-05-24 16:06:05] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2024-05-24 16:06:05] [INFO ] Invariant cache hit.
[2024-05-24 16:06:05] [INFO ] State equation strengthened by 830 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2485 unsolved
SMT process timed out in 32712ms, After SMT, problems are : Problem set: 0 solved, 2485 unsolved
Search for dead transitions found 0 dead transitions in 32732ms
Finished structural reductions in LTL mode , in 1 iterations and 43325 ms. Remains : 1083/1083 places, 2502/2502 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-13 finished in 203842 ms.
[2024-05-24 16:06:38] [INFO ] Flatten gal took : 104 ms
[2024-05-24 16:06:38] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-24 16:06:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1253 places, 2762 transitions and 12206 arcs took 18 ms.
Total runtime 990943 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MultiCrashLeafsetExtension-PT-S16C04

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/407/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1253
TRANSITIONS: 2762
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.068s, Sys 0.000s]


SAVING FILE /home/mcc/execution/407/model (.net / .def) ...
EXPORT TIME: [User 0.009s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 3932
MODEL NAME: /home/mcc/execution/407/model
1253 places, 2762 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
EXITCODE: 80
----------------------------------------------------------------------

BK_STOP 1716567895015

--------------------
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
MEDDLY ERROR: Insufficient memory

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="MultiCrashLeafsetExtension-PT-S16C04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C04, 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 r245-tall-171654349000020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C04.tgz
mv MultiCrashLeafsetExtension-PT-S16C04 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 ;