MCC'2024- Execution of r516-tajo-171654446700244

About the Execution of LTSMin+red for PolyORBLF-PT-S02J06T06

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
2130.292	2008911.00	3375004.00	347.50	FFT?FFTFFTFFFFFF	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 22K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.9K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 43K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 216K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 601K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717252944143

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:42:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:42:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:42:25] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2024-06-01 14:42:25] [INFO ] Transformed 536 places.
[2024-06-01 14:42:25] [INFO ] Transformed 1064 transitions.
[2024-06-01 14:42:25] [INFO ] Parsed PT model containing 536 places and 1064 transitions and 4866 arcs in 260 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
[2024-06-01 14:42:25] [INFO ] Reduced 6 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 267 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Applied a total of 2 rules in 49 ms. Remains 534 /536 variables (removed 2) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2024-06-01 14:42:26] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 534 cols
[2024-06-01 14:42:26] [INFO ] Computed 48 invariants in 61 ms
[2024-06-01 14:42:26] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-06-01 14:42:34] [INFO ] Deduced a trap composed of 74 places in 211 ms of which 22 ms to minimize.
[2024-06-01 14:42:34] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 3 ms to minimize.
[2024-06-01 14:42:35] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 2 ms to minimize.
[2024-06-01 14:42:35] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 3 ms to minimize.
[2024-06-01 14:42:35] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:42:35] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:42:35] [INFO ] Deduced a trap composed of 73 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:42:35] [INFO ] Deduced a trap composed of 75 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:42:36] [INFO ] Deduced a trap composed of 258 places in 249 ms of which 3 ms to minimize.
[2024-06-01 14:42:36] [INFO ] Deduced a trap composed of 98 places in 241 ms of which 4 ms to minimize.
[2024-06-01 14:42:36] [INFO ] Deduced a trap composed of 136 places in 203 ms of which 3 ms to minimize.
[2024-06-01 14:42:39] [INFO ] Deduced a trap composed of 266 places in 246 ms of which 4 ms to minimize.
[2024-06-01 14:42:39] [INFO ] Deduced a trap composed of 247 places in 223 ms of which 4 ms to minimize.
[2024-06-01 14:42:40] [INFO ] Deduced a trap composed of 267 places in 228 ms of which 3 ms to minimize.
[2024-06-01 14:42:41] [INFO ] Deduced a trap composed of 270 places in 283 ms of which 4 ms to minimize.
[2024-06-01 14:42:42] [INFO ] Deduced a trap composed of 236 places in 282 ms of which 4 ms to minimize.
[2024-06-01 14:42:42] [INFO ] Deduced a trap composed of 289 places in 268 ms of which 4 ms to minimize.
[2024-06-01 14:42:46] [INFO ] Deduced a trap composed of 45 places in 261 ms of which 4 ms to minimize.
(s201 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 10.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 3.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 1.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 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1490 variables, and 64 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20077 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/534 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-06-01 14:43:00] [INFO ] Deduced a trap composed of 259 places in 250 ms of which 4 ms to minimize.
[2024-06-01 14:43:04] [INFO ] Deduced a trap composed of 289 places in 247 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1490 variables, and 66 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/534 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 20/20 constraints]
After SMT, in 41252ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 41288ms
[2024-06-01 14:43:07] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-06-01 14:43:07] [INFO ] Invariant cache hit.
[2024-06-01 14:43:07] [INFO ] Implicit Places using invariants in 233 ms returned [96, 111, 240, 253, 495]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 239 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 529/536 places, 968/968 transitions.
Applied a total of 0 rules in 10 ms. Remains 529 /529 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41631 ms. Remains : 529/536 places, 968/968 transitions.
Support contains 267 out of 529 places after structural reductions.
[2024-06-01 14:43:07] [INFO ] Flatten gal took : 97 ms
[2024-06-01 14:43:07] [INFO ] Flatten gal took : 68 ms
[2024-06-01 14:43:08] [INFO ] Input system was already deterministic with 968 transitions.
Support contains 266 out of 529 places (down from 267) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 39 to 36
RANDOM walk for 40000 steps (10 resets) in 1923 ms. (20 steps per ms) remains 9/36 properties
BEST_FIRST walk for 40001 steps (15 resets) in 462 ms. (86 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (44 resets) in 313 ms. (127 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (12 resets) in 247 ms. (161 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (9 resets) in 314 ms. (126 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (9 resets) in 271 ms. (147 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (11 resets) in 206 ms. (193 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (14 resets) in 194 ms. (205 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 173 ms. (229 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (9 resets) in 147 ms. (270 steps per ms) remains 9/9 properties
[2024-06-01 14:43:09] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 529 cols
[2024-06-01 14:43:09] [INFO ] Computed 43 invariants in 31 ms
[2024-06-01 14:43:09] [INFO ] State equation strengthened by 72 read => feed constraints.
Problem AtomicPropp32 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 2 (OVERLAPS) 71/151 variables, 5/7 constraints. Problems are: Problem set: 2 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp38 is UNSAT
At refinement iteration 5 (OVERLAPS) 361/512 variables, 19/27 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/27 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 13/525 variables, 12/39 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 0/39 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 4/529 variables, 4/43 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 0/43 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 956/1485 variables, 529/572 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1485 variables, 72/644 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1485 variables, 0/644 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1485 variables, 0/644 constraints. Problems are: Problem set: 6 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1485/1485 variables, and 644 constraints, problems are : Problem set: 6 solved, 3 unsolved in 2395 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 529/529 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/56 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 341/397 variables, 5/7 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 0/7 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 63/460 variables, 15/22 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 0/22 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 66/526 variables, 19/41 constraints. Problems are: Problem set: 6 solved, 3 unsolved
[2024-06-01 14:43:12] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 2 ms to minimize.
[2024-06-01 14:43:12] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 14 ms to minimize.
[2024-06-01 14:43:12] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 1 ms to minimize.
[2024-06-01 14:43:12] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:43:12] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 5/46 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/526 variables, 0/46 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/527 variables, 1/47 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/527 variables, 0/47 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 956/1483 variables, 527/574 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1483 variables, 72/646 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1483 variables, 3/649 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1483 variables, 0/649 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/1485 variables, 2/651 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1485 variables, 1/652 constraints. Problems are: Problem set: 6 solved, 3 unsolved
[2024-06-01 14:43:15] [INFO ] Deduced a trap composed of 15 places in 250 ms of which 3 ms to minimize.
[2024-06-01 14:43:15] [INFO ] Deduced a trap composed of 294 places in 221 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1485 variables, 2/654 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1485 variables, 0/654 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1485 variables, 0/654 constraints. Problems are: Problem set: 6 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1485/1485 variables, and 654 constraints, problems are : Problem set: 6 solved, 3 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 529/529 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/9 constraints, Known Traps: 7/7 constraints]
After SMT, in 7494ms problems are : Problem set: 6 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 782 ms.
Support contains 19 out of 529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 529 transition count 926
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 487 transition count 920
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 481 transition count 920
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 96 place count 481 transition count 860
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 216 place count 421 transition count 860
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 219 place count 418 transition count 857
Iterating global reduction 3 with 3 rules applied. Total rules applied 222 place count 418 transition count 857
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 318 place count 370 transition count 809
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 330 place count 370 transition count 797
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 342 place count 358 transition count 797
Applied a total of 342 rules in 191 ms. Remains 358 /529 variables (removed 171) and now considering 797/968 (removed 171) transitions.
Running 795 sub problems to find dead transitions.
[2024-06-01 14:43:18] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
// Phase 1: matrix 785 rows 358 cols
[2024-06-01 14:43:18] [INFO ] Computed 43 invariants in 32 ms
[2024-06-01 14:43:18] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2024-06-01 14:43:23] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 2 ms to minimize.
[2024-06-01 14:43:24] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 2 ms to minimize.
[2024-06-01 14:43:24] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:43:24] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:43:24] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 3 ms to minimize.
[2024-06-01 14:43:24] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:43:24] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-06-01 14:43:24] [INFO ] Deduced a trap composed of 114 places in 125 ms of which 2 ms to minimize.
[2024-06-01 14:43:25] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:43:25] [INFO ] Deduced a trap composed of 122 places in 182 ms of which 2 ms to minimize.
[2024-06-01 14:43:25] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 1 ms to minimize.
[2024-06-01 14:43:25] [INFO ] Deduced a trap composed of 153 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:43:28] [INFO ] Deduced a trap composed of 167 places in 180 ms of which 4 ms to minimize.
[2024-06-01 14:43:28] [INFO ] Deduced a trap composed of 131 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:43:29] [INFO ] Deduced a trap composed of 154 places in 183 ms of which 3 ms to minimize.
[2024-06-01 14:43:29] [INFO ] Deduced a trap composed of 122 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:43:29] [INFO ] Deduced a trap composed of 134 places in 216 ms of which 2 ms to minimize.
[2024-06-01 14:43:30] [INFO ] Deduced a trap composed of 169 places in 193 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 795 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 795 unsolved
SMT process timed out in 21259ms, After SMT, problems are : Problem set: 0 solved, 795 unsolved
Search for dead transitions found 0 dead transitions in 21270ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21464 ms. Remains : 358/529 places, 797/968 transitions.
RANDOM walk for 40000 steps (23 resets) in 635 ms. (62 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (13 resets) in 235 ms. (169 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (10 resets) in 294 ms. (135 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (13 resets) in 177 ms. (224 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 196084 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 3
Probabilistic random walk after 196084 steps, saw 113623 distinct states, run finished after 3004 ms. (steps per millisecond=65 ) properties seen :0
[2024-06-01 14:43:42] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
[2024-06-01 14:43:42] [INFO ] Invariant cache hit.
[2024-06-01 14:43:42] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 226/264 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 53/317 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 39/356 variables, 21/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 14:43:42] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 14 ms to minimize.
[2024-06-01 14:43:42] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:43:43] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:43:43] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 785/1141 variables, 356/402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1141 variables, 72/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1141 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/1143 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1143 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1143 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 14:43:45] [INFO ] Deduced a trap composed of 143 places in 266 ms of which 3 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/1143 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1143 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1143 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1143/1143 variables, and 478 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3939 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 358/358 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 226/264 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 53/317 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 39/356 variables, 21/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 14:43:46] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 785/1141 variables, 356/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1141 variables, 72/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1141 variables, 3/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1141 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/1143 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1143 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 14:43:55] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 3 ms to minimize.
[2024-06-01 14:43:56] [INFO ] Deduced a trap composed of 129 places in 193 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1143 variables, 2/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1143 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1143 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1143/1143 variables, and 484 constraints, problems are : Problem set: 0 solved, 3 unsolved in 9984 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 358/358 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints]
After SMT, in 13934ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1725 ms.
Support contains 19 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 797/797 transitions.
Applied a total of 0 rules in 25 ms. Remains 358 /358 variables (removed 0) and now considering 797/797 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 358/358 places, 797/797 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 797/797 transitions.
Applied a total of 0 rules in 23 ms. Remains 358 /358 variables (removed 0) and now considering 797/797 (removed 0) transitions.
[2024-06-01 14:43:58] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
[2024-06-01 14:43:58] [INFO ] Invariant cache hit.
[2024-06-01 14:43:58] [INFO ] Implicit Places using invariants in 471 ms returned [205]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 473 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 357/358 places, 797/797 transitions.
Applied a total of 0 rules in 16 ms. Remains 357 /357 variables (removed 0) and now considering 797/797 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 513 ms. Remains : 357/358 places, 797/797 transitions.
RANDOM walk for 40000 steps (14 resets) in 415 ms. (96 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (12 resets) in 232 ms. (171 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (13 resets) in 186 ms. (213 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (14 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 186180 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 3
Probabilistic random walk after 186180 steps, saw 108458 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2024-06-01 14:44:02] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
// Phase 1: matrix 785 rows 357 cols
[2024-06-01 14:44:02] [INFO ] Computed 42 invariants in 18 ms
[2024-06-01 14:44:02] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 222/260 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 20/280 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 74/354 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 14:44:02] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:44:02] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:44:02] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:44:02] [INFO ] Deduced a trap composed of 45 places in 29 ms of which 3 ms to minimize.
[2024-06-01 14:44:02] [INFO ] Deduced a trap composed of 46 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/355 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 785/1140 variables, 355/401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1140 variables, 72/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1140 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/1142 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1142 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1142 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1142 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1142/1142 variables, and 476 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2361 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 357/357 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 222/260 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 20/280 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 74/354 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 14:44:04] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/355 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 785/1140 variables, 355/402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1140 variables, 72/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1140 variables, 3/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 14:44:10] [INFO ] Deduced a trap composed of 48 places in 192 ms of which 3 ms to minimize.
[2024-06-01 14:44:11] [INFO ] Deduced a trap composed of 131 places in 210 ms of which 5 ms to minimize.
[2024-06-01 14:44:11] [INFO ] Deduced a trap composed of 143 places in 189 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1140 variables, 3/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1140 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/1142 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1142 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1142 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/1142 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1142/1142 variables, and 483 constraints, problems are : Problem set: 0 solved, 3 unsolved in 15426 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 357/357 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 17816ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 11428 ms.
Support contains 19 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 797/797 transitions.
Applied a total of 0 rules in 14 ms. Remains 357 /357 variables (removed 0) and now considering 797/797 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 357/357 places, 797/797 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 797/797 transitions.
Applied a total of 0 rules in 15 ms. Remains 357 /357 variables (removed 0) and now considering 797/797 (removed 0) transitions.
[2024-06-01 14:44:31] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
[2024-06-01 14:44:31] [INFO ] Invariant cache hit.
[2024-06-01 14:44:31] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-06-01 14:44:31] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
[2024-06-01 14:44:31] [INFO ] Invariant cache hit.
[2024-06-01 14:44:32] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:44:34] [INFO ] Implicit Places using invariants and state equation in 2734 ms returned []
Implicit Place search using SMT with State Equation took 3080 ms to find 0 implicit places.
[2024-06-01 14:44:34] [INFO ] Redundant transitions in 79 ms returned []
Running 795 sub problems to find dead transitions.
[2024-06-01 14:44:34] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
[2024-06-01 14:44:34] [INFO ] Invariant cache hit.
[2024-06-01 14:44:34] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2024-06-01 14:44:40] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:44:40] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 2 ms to minimize.
[2024-06-01 14:44:40] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:44:40] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:44:40] [INFO ] Deduced a trap composed of 45 places in 30 ms of which 1 ms to minimize.
[2024-06-01 14:44:40] [INFO ] Deduced a trap composed of 45 places in 28 ms of which 0 ms to minimize.
[2024-06-01 14:44:40] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:44:40] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:44:41] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 3 ms to minimize.
[2024-06-01 14:44:41] [INFO ] Deduced a trap composed of 55 places in 176 ms of which 3 ms to minimize.
[2024-06-01 14:44:43] [INFO ] Deduced a trap composed of 122 places in 202 ms of which 3 ms to minimize.
[2024-06-01 14:44:44] [INFO ] Deduced a trap composed of 220 places in 160 ms of which 2 ms to minimize.
[2024-06-01 14:44:44] [INFO ] Deduced a trap composed of 218 places in 174 ms of which 2 ms to minimize.
[2024-06-01 14:44:44] [INFO ] Deduced a trap composed of 114 places in 155 ms of which 2 ms to minimize.
[2024-06-01 14:44:45] [INFO ] Deduced a trap composed of 129 places in 175 ms of which 2 ms to minimize.
[2024-06-01 14:44:45] [INFO ] Deduced a trap composed of 143 places in 173 ms of which 3 ms to minimize.
[2024-06-01 14:44:46] [INFO ] Deduced a trap composed of 139 places in 183 ms of which 3 ms to minimize.
[2024-06-01 14:44:46] [INFO ] Deduced a trap composed of 127 places in 179 ms of which 3 ms to minimize.
[2024-06-01 14:44:46] [INFO ] Deduced a trap composed of 171 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:44:46] [INFO ] Deduced a trap composed of 161 places in 147 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2024-06-01 14:44:51] [INFO ] Deduced a trap composed of 159 places in 133 ms of which 2 ms to minimize.
[2024-06-01 14:44:51] [INFO ] Deduced a trap composed of 148 places in 128 ms of which 2 ms to minimize.
[2024-06-01 14:44:53] [INFO ] Deduced a trap composed of 154 places in 128 ms of which 2 ms to minimize.
[2024-06-01 14:44:53] [INFO ] Deduced a trap composed of 143 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 795 unsolved
Problem TDEAD708 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/357 variables, 2/66 constraints. Problems are: Problem set: 66 solved, 729 unsolved
[2024-06-01 14:45:04] [INFO ] Deduced a trap composed of 112 places in 190 ms of which 3 ms to minimize.
[2024-06-01 14:45:04] [INFO ] Deduced a trap composed of 62 places in 146 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 357/1142 variables, and 68 constraints, problems are : Problem set: 66 solved, 729 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/357 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 795/795 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 66 solved, 729 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 16/16 constraints. Problems are: Problem set: 66 solved, 729 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 24/40 constraints. Problems are: Problem set: 66 solved, 729 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 24/64 constraints. Problems are: Problem set: 66 solved, 729 unsolved
[2024-06-01 14:45:29] [INFO ] Deduced a trap composed of 200 places in 203 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 1/65 constraints. Problems are: Problem set: 66 solved, 729 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/1142 variables, and 65 constraints, problems are : Problem set: 66 solved, 729 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/357 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/795 constraints, Known Traps: 25/27 constraints]
After SMT, in 61264ms problems are : Problem set: 66 solved, 729 unsolved
Search for dead transitions found 66 dead transitions in 61276ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 357/357 places, 731/797 transitions.
Reduce places removed 1 places and 12 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 356 transition count 719
Reduce places removed 0 places and 12 transitions.
Deduced a syphon composed of 13 places in 1 ms
Applied a total of 1 rules in 17 ms. Remains 356 /357 variables (removed 1) and now considering 707/731 (removed 24) transitions.
[2024-06-01 14:45:36] [INFO ] Flow matrix only has 695 transitions (discarded 12 similar events)
// Phase 1: matrix 695 rows 356 cols
[2024-06-01 14:45:36] [INFO ] Computed 55 invariants in 16 ms
[2024-06-01 14:45:36] [INFO ] Implicit Places using invariants in 524 ms returned []
[2024-06-01 14:45:36] [INFO ] Flow matrix only has 695 transitions (discarded 12 similar events)
[2024-06-01 14:45:36] [INFO ] Invariant cache hit.
[2024-06-01 14:45:36] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:45:38] [INFO ] Implicit Places using invariants and state equation in 2202 ms returned []
Implicit Place search using SMT with State Equation took 2728 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 356/357 places, 707/797 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 67203 ms. Remains : 356/357 places, 707/797 transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Successfully simplified 9 atomic propositions for a total of 14 simplifications.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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((X(p1)||p0)) U G(p2)))'
Support contains 21 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 523 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 523 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 517 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 517 transition count 956
Applied a total of 24 rules in 19 ms. Remains 517 /529 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-06-01 14:45:39] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 517 cols
[2024-06-01 14:45:39] [INFO ] Computed 43 invariants in 22 ms
[2024-06-01 14:45:39] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:45:46] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:45:46] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 2 ms to minimize.
[2024-06-01 14:45:47] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 2 ms to minimize.
[2024-06-01 14:45:47] [INFO ] Deduced a trap composed of 73 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:45:47] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:45:47] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:45:47] [INFO ] Deduced a trap composed of 72 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:45:47] [INFO ] Deduced a trap composed of 246 places in 175 ms of which 2 ms to minimize.
[2024-06-01 14:45:47] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:45:48] [INFO ] Deduced a trap composed of 86 places in 209 ms of which 4 ms to minimize.
[2024-06-01 14:45:48] [INFO ] Deduced a trap composed of 127 places in 177 ms of which 3 ms to minimize.
[2024-06-01 14:45:48] [INFO ] Deduced a trap composed of 151 places in 172 ms of which 3 ms to minimize.
[2024-06-01 14:45:49] [INFO ] Deduced a trap composed of 121 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:45:52] [INFO ] Deduced a trap composed of 241 places in 247 ms of which 4 ms to minimize.
[2024-06-01 14:45:53] [INFO ] Deduced a trap composed of 246 places in 264 ms of which 4 ms to minimize.
[2024-06-01 14:45:55] [INFO ] Deduced a trap composed of 277 places in 235 ms of which 4 ms to minimize.
[2024-06-01 14:45:58] [INFO ] Deduced a trap composed of 306 places in 170 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 515/1461 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:46:08] [INFO ] Deduced a trap composed of 306 places in 267 ms of which 3 ms to minimize.
[2024-06-01 14:46:08] [INFO ] Deduced a trap composed of 272 places in 221 ms of which 3 ms to minimize.
[2024-06-01 14:46:16] [INFO ] Deduced a trap composed of 42 places in 274 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 515/1461 variables, and 61 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 20/20 constraints]
After SMT, in 40880ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40890ms
[2024-06-01 14:46:20] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-06-01 14:46:20] [INFO ] Invariant cache hit.
[2024-06-01 14:46:20] [INFO ] Implicit Places using invariants in 464 ms returned [296]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 466 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/529 places, 956/968 transitions.
Applied a total of 0 rules in 10 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41388 ms. Remains : 516/529 places, 956/968 transitions.
Stuttering acceptance computed with spot in 353 ms :[(NOT p2), (NOT p1), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-00
Entered a terminal (fully accepting) state of product in 6 steps with 2 reset in 2 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-00 finished in 41812 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((X(p1)&&p0))))'
Support contains 19 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 968/968 transitions.
Applied a total of 0 rules in 7 ms. Remains 529 /529 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2024-06-01 14:46:20] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 529 cols
[2024-06-01 14:46:20] [INFO ] Computed 43 invariants in 19 ms
[2024-06-01 14:46:20] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-06-01 14:46:28] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 3 ms to minimize.
[2024-06-01 14:46:28] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 1 ms to minimize.
[2024-06-01 14:46:28] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:46:28] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:46:28] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:46:28] [INFO ] Deduced a trap composed of 73 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:46:29] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:46:29] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 2 ms to minimize.
[2024-06-01 14:46:29] [INFO ] Deduced a trap composed of 247 places in 276 ms of which 4 ms to minimize.
[2024-06-01 14:46:30] [INFO ] Deduced a trap composed of 137 places in 238 ms of which 3 ms to minimize.
[2024-06-01 14:46:30] [INFO ] Deduced a trap composed of 130 places in 176 ms of which 3 ms to minimize.
[2024-06-01 14:46:31] [INFO ] Deduced a trap composed of 276 places in 184 ms of which 3 ms to minimize.
[2024-06-01 14:46:33] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:46:33] [INFO ] Deduced a trap composed of 267 places in 209 ms of which 4 ms to minimize.
[2024-06-01 14:46:34] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 3 ms to minimize.
[2024-06-01 14:46:34] [INFO ] Deduced a trap composed of 264 places in 230 ms of which 4 ms to minimize.
[2024-06-01 14:46:39] [INFO ] Deduced a trap composed of 264 places in 234 ms of which 3 ms to minimize.
[2024-06-01 14:46:40] [INFO ] Deduced a trap composed of 257 places in 229 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/1485 variables, and 59 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/529 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-06-01 14:46:49] [INFO ] Deduced a trap composed of 258 places in 223 ms of which 3 ms to minimize.
[2024-06-01 14:47:00] [INFO ] Deduced a trap composed of 242 places in 258 ms of which 4 ms to minimize.
[2024-06-01 14:47:01] [INFO ] Deduced a trap composed of 125 places in 183 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/1485 variables, and 62 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/529 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 21/21 constraints]
After SMT, in 40949ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 40959ms
[2024-06-01 14:47:01] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-06-01 14:47:01] [INFO ] Invariant cache hit.
[2024-06-01 14:47:02] [INFO ] Implicit Places using invariants in 373 ms returned [302]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 375 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 528/529 places, 968/968 transitions.
Applied a total of 0 rules in 5 ms. Remains 528 /528 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41351 ms. Remains : 528/529 places, 968/968 transitions.
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-03
Product exploration explored 100000 steps with 4586 reset in 613 ms.
Product exploration explored 100000 steps with 4575 reset in 526 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 101 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 213 steps (0 resets) in 6 ms. (30 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 159 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-06-01 14:47:04] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 528 cols
[2024-06-01 14:47:04] [INFO ] Computed 42 invariants in 13 ms
[2024-06-01 14:47:04] [INFO ] [Real]Absence check using 18 positive place invariants in 27 ms returned sat
[2024-06-01 14:47:04] [INFO ] [Real]Absence check using 18 positive and 24 generalized place invariants in 70 ms returned sat
[2024-06-01 14:47:06] [INFO ] [Real]Absence check using state equation in 1844 ms returned sat
[2024-06-01 14:47:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:47:06] [INFO ] [Nat]Absence check using 18 positive place invariants in 19 ms returned sat
[2024-06-01 14:47:06] [INFO ] [Nat]Absence check using 18 positive and 24 generalized place invariants in 28 ms returned sat
[2024-06-01 14:47:10] [INFO ] [Nat]Absence check using state equation in 3377 ms returned sat
[2024-06-01 14:47:10] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:47:10] [INFO ] [Nat]Added 72 Read/Feed constraints in 713 ms returned sat
[2024-06-01 14:47:11] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 3 ms to minimize.
[2024-06-01 14:47:11] [INFO ] Deduced a trap composed of 278 places in 240 ms of which 3 ms to minimize.
[2024-06-01 14:47:12] [INFO ] Deduced a trap composed of 74 places in 272 ms of which 3 ms to minimize.
[2024-06-01 14:47:12] [INFO ] Deduced a trap composed of 74 places in 251 ms of which 3 ms to minimize.
[2024-06-01 14:47:13] [INFO ] Deduced a trap composed of 74 places in 233 ms of which 4 ms to minimize.
[2024-06-01 14:47:13] [INFO ] Deduced a trap composed of 74 places in 213 ms of which 4 ms to minimize.
[2024-06-01 14:47:13] [INFO ] Deduced a trap composed of 266 places in 210 ms of which 3 ms to minimize.
[2024-06-01 14:47:14] [INFO ] Deduced a trap composed of 15 places in 272 ms of which 4 ms to minimize.
[2024-06-01 14:47:14] [INFO ] Deduced a trap composed of 74 places in 240 ms of which 3 ms to minimize.
[2024-06-01 14:47:14] [INFO ] Deduced a trap composed of 274 places in 242 ms of which 3 ms to minimize.
[2024-06-01 14:47:15] [INFO ] Deduced a trap composed of 313 places in 278 ms of which 4 ms to minimize.
[2024-06-01 14:47:15] [INFO ] Deduced a trap composed of 283 places in 268 ms of which 4 ms to minimize.
[2024-06-01 14:47:16] [INFO ] Deduced a trap composed of 295 places in 275 ms of which 5 ms to minimize.
[2024-06-01 14:47:16] [INFO ] Deduced a trap composed of 323 places in 266 ms of which 3 ms to minimize.
[2024-06-01 14:47:16] [INFO ] Deduced a trap composed of 287 places in 269 ms of which 4 ms to minimize.
[2024-06-01 14:47:17] [INFO ] Deduced a trap composed of 328 places in 253 ms of which 4 ms to minimize.
[2024-06-01 14:47:17] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 6558 ms
[2024-06-01 14:47:17] [INFO ] Computed and/alt/rep : 630/2205/624 causal constraints (skipped 330 transitions) in 77 ms.
[2024-06-01 14:47:21] [INFO ] Added : 220 causal constraints over 44 iterations in 3870 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 19 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Applied a total of 0 rules in 7 ms. Remains 528 /528 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2024-06-01 14:47:21] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-06-01 14:47:21] [INFO ] Invariant cache hit.
[2024-06-01 14:47:21] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-06-01 14:47:29] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-06-01 14:47:30] [INFO ] Deduced a trap composed of 133 places in 108 ms of which 2 ms to minimize.
[2024-06-01 14:47:31] [INFO ] Deduced a trap composed of 253 places in 177 ms of which 3 ms to minimize.
[2024-06-01 14:47:31] [INFO ] Deduced a trap composed of 263 places in 144 ms of which 2 ms to minimize.
[2024-06-01 14:47:31] [INFO ] Deduced a trap composed of 250 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:47:32] [INFO ] Deduced a trap composed of 258 places in 117 ms of which 2 ms to minimize.
[2024-06-01 14:47:32] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 2 ms to minimize.
[2024-06-01 14:47:33] [INFO ] Deduced a trap composed of 98 places in 166 ms of which 3 ms to minimize.
[2024-06-01 14:47:34] [INFO ] Deduced a trap composed of 266 places in 184 ms of which 3 ms to minimize.
[2024-06-01 14:47:34] [INFO ] Deduced a trap composed of 260 places in 167 ms of which 3 ms to minimize.
[2024-06-01 14:47:38] [INFO ] Deduced a trap composed of 253 places in 171 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1484 variables, and 50 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-06-01 14:47:48] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 2 ms to minimize.
[2024-06-01 14:47:48] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:47:49] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 2 ms to minimize.
[2024-06-01 14:47:49] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 2 ms to minimize.
[2024-06-01 14:47:50] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:47:56] [INFO ] Deduced a trap composed of 42 places in 248 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1484 variables, and 56 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 17/17 constraints]
After SMT, in 40983ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 40995ms
[2024-06-01 14:48:02] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-06-01 14:48:02] [INFO ] Invariant cache hit.
[2024-06-01 14:48:02] [INFO ] Implicit Places using invariants in 506 ms returned []
[2024-06-01 14:48:02] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-06-01 14:48:02] [INFO ] Invariant cache hit.
[2024-06-01 14:48:03] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:48:09] [INFO ] Implicit Places using invariants and state equation in 6719 ms returned []
Implicit Place search using SMT with State Equation took 7227 ms to find 0 implicit places.
Running 966 sub problems to find dead transitions.
[2024-06-01 14:48:09] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-06-01 14:48:09] [INFO ] Invariant cache hit.
[2024-06-01 14:48:09] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-06-01 14:48:17] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-06-01 14:48:18] [INFO ] Deduced a trap composed of 133 places in 154 ms of which 2 ms to minimize.
[2024-06-01 14:48:19] [INFO ] Deduced a trap composed of 253 places in 202 ms of which 3 ms to minimize.
[2024-06-01 14:48:19] [INFO ] Deduced a trap composed of 263 places in 182 ms of which 3 ms to minimize.
[2024-06-01 14:48:20] [INFO ] Deduced a trap composed of 250 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:48:20] [INFO ] Deduced a trap composed of 258 places in 165 ms of which 3 ms to minimize.
[2024-06-01 14:48:21] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:48:21] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 3 ms to minimize.
[2024-06-01 14:48:22] [INFO ] Deduced a trap composed of 266 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:48:22] [INFO ] Deduced a trap composed of 260 places in 166 ms of which 3 ms to minimize.
[2024-06-01 14:48:26] [INFO ] Deduced a trap composed of 253 places in 130 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-06-01 14:48:37] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1484 variables, and 51 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-06-01 14:48:54] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 2 ms to minimize.
[2024-06-01 14:48:54] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 1 ms to minimize.
[2024-06-01 14:48:54] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:48:56] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:49:02] [INFO ] Deduced a trap composed of 75 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:49:02] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1484 variables, and 57 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 18/18 constraints]
After SMT, in 60977ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 60994ms
Finished structural reductions in LTL mode , in 1 iterations and 109231 ms. Remains : 528/528 places, 968/968 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 132 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 291 steps (0 resets) in 7 ms. (36 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 222 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-06-01 14:49:11] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-06-01 14:49:11] [INFO ] Invariant cache hit.
[2024-06-01 14:49:11] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2024-06-01 14:49:11] [INFO ] [Real]Absence check using 18 positive and 24 generalized place invariants in 68 ms returned sat
[2024-06-01 14:49:13] [INFO ] [Real]Absence check using state equation in 1910 ms returned sat
[2024-06-01 14:49:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:49:14] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2024-06-01 14:49:14] [INFO ] [Nat]Absence check using 18 positive and 24 generalized place invariants in 42 ms returned sat
[2024-06-01 14:49:16] [INFO ] [Nat]Absence check using state equation in 2530 ms returned sat
[2024-06-01 14:49:16] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:49:16] [INFO ] [Nat]Added 72 Read/Feed constraints in 152 ms returned sat
[2024-06-01 14:49:17] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 2 ms to minimize.
[2024-06-01 14:49:18] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1589 ms
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 4575 reset in 566 ms.
Product exploration explored 100000 steps with 4569 reset in 525 ms.
Support contains 19 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Applied a total of 0 rules in 6 ms. Remains 528 /528 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2024-06-01 14:49:19] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-06-01 14:49:19] [INFO ] Invariant cache hit.
[2024-06-01 14:49:19] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-06-01 14:49:27] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:49:29] [INFO ] Deduced a trap composed of 133 places in 149 ms of which 2 ms to minimize.
[2024-06-01 14:49:29] [INFO ] Deduced a trap composed of 253 places in 144 ms of which 2 ms to minimize.
[2024-06-01 14:49:29] [INFO ] Deduced a trap composed of 263 places in 161 ms of which 3 ms to minimize.
[2024-06-01 14:49:30] [INFO ] Deduced a trap composed of 250 places in 132 ms of which 2 ms to minimize.
[2024-06-01 14:49:30] [INFO ] Deduced a trap composed of 258 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:49:31] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:49:31] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 3 ms to minimize.
[2024-06-01 14:49:32] [INFO ] Deduced a trap composed of 266 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:49:32] [INFO ] Deduced a trap composed of 260 places in 136 ms of which 2 ms to minimize.
[2024-06-01 14:49:36] [INFO ] Deduced a trap composed of 253 places in 124 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1484 variables, and 50 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-06-01 14:49:47] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:49:47] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:49:47] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 2 ms to minimize.
[2024-06-01 14:49:47] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:49:48] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:49:53] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 3 ms to minimize.
[2024-06-01 14:49:58] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:50:00] [INFO ] Deduced a trap composed of 250 places in 204 ms of which 3 ms to minimize.
[2024-06-01 14:50:00] [INFO ] Deduced a trap composed of 241 places in 165 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 10)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 10)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 2)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 5)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 1)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 1)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 2)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 1)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 1)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 2)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 1)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 1)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1484 variables, and 59 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 20/20 constraints]
After SMT, in 41037ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 41048ms
[2024-06-01 14:50:01] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-06-01 14:50:01] [INFO ] Invariant cache hit.
[2024-06-01 14:50:01] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-06-01 14:50:01] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-06-01 14:50:01] [INFO ] Invariant cache hit.
[2024-06-01 14:50:02] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:50:08] [INFO ] Implicit Places using invariants and state equation in 6816 ms returned []
Implicit Place search using SMT with State Equation took 7329 ms to find 0 implicit places.
Running 966 sub problems to find dead transitions.
[2024-06-01 14:50:08] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-06-01 14:50:08] [INFO ] Invariant cache hit.
[2024-06-01 14:50:08] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-06-01 14:50:16] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-06-01 14:50:18] [INFO ] Deduced a trap composed of 133 places in 117 ms of which 2 ms to minimize.
[2024-06-01 14:50:18] [INFO ] Deduced a trap composed of 253 places in 182 ms of which 3 ms to minimize.
[2024-06-01 14:50:18] [INFO ] Deduced a trap composed of 263 places in 160 ms of which 3 ms to minimize.
[2024-06-01 14:50:19] [INFO ] Deduced a trap composed of 250 places in 141 ms of which 3 ms to minimize.
[2024-06-01 14:50:19] [INFO ] Deduced a trap composed of 258 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:50:20] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 2 ms to minimize.
[2024-06-01 14:50:20] [INFO ] Deduced a trap composed of 98 places in 159 ms of which 3 ms to minimize.
[2024-06-01 14:50:21] [INFO ] Deduced a trap composed of 266 places in 163 ms of which 3 ms to minimize.
[2024-06-01 14:50:21] [INFO ] Deduced a trap composed of 260 places in 190 ms of which 4 ms to minimize.
[2024-06-01 14:50:26] [INFO ] Deduced a trap composed of 253 places in 155 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-06-01 14:50:38] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1484 variables, and 51 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-06-01 14:50:54] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:50:54] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 1 ms to minimize.
[2024-06-01 14:50:54] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 2 ms to minimize.
[2024-06-01 14:50:55] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 2 ms to minimize.
[2024-06-01 14:51:03] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:51:03] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1484 variables, and 57 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 18/18 constraints]
After SMT, in 60842ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 60858ms
Finished structural reductions in LTL mode , in 1 iterations and 109249 ms. Remains : 528/528 places, 968/968 transitions.
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-03 finished in 288580 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 12 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 523 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 523 transition count 962
Applied a total of 12 rules in 13 ms. Remains 523 /529 variables (removed 6) and now considering 962/968 (removed 6) transitions.
Running 960 sub problems to find dead transitions.
[2024-06-01 14:51:09] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
// Phase 1: matrix 950 rows 523 cols
[2024-06-01 14:51:09] [INFO ] Computed 43 invariants in 13 ms
[2024-06-01 14:51:09] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 14:51:16] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-06-01 14:51:17] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 3 ms to minimize.
[2024-06-01 14:51:19] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-06-01 14:51:20] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 1 ms to minimize.
[2024-06-01 14:51:24] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 521/1473 variables, and 38 constraints, problems are : Problem set: 0 solved, 960 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 16/26 constraints, State Equation: 0/523 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-06-01 14:51:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 14:51:32] [INFO ] Deduced a trap composed of 3 places in 216 ms of which 3 ms to minimize.
[2024-06-01 14:51:32] [INFO ] Deduced a trap composed of 73 places in 214 ms of which 3 ms to minimize.
[2024-06-01 14:51:33] [INFO ] Deduced a trap composed of 56 places in 184 ms of which 3 ms to minimize.
[2024-06-01 14:51:33] [INFO ] Deduced a trap composed of 82 places in 195 ms of which 4 ms to minimize.
[2024-06-01 14:51:33] [INFO ] Deduced a trap composed of 119 places in 154 ms of which 2 ms to minimize.
[2024-06-01 14:51:33] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 3 ms to minimize.
[2024-06-01 14:51:33] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:51:34] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-06-01 14:51:35] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 2 ms to minimize.
[2024-06-01 14:51:35] [INFO ] Deduced a trap composed of 74 places in 37 ms of which 0 ms to minimize.
[2024-06-01 14:51:41] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 2 ms to minimize.
[2024-06-01 14:51:42] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/521 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 2)
(s1 0)
(s2 0)
(s3 0)
(s4 9)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 1)
(s18 1)
(s19 0)
(s20 1)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 1)
(s26 1)
(s27 0)
(s28 1)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 0)
(s38 1)
(s39 1)
(s40 1)
(s41 0)
(s42 1)
(s43 0)
(s44 1)
(s45 1)
(s46 1)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 1)
(s59 1)
(s60 0)
(s61 0)
(s62 1)
(s63 1)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 1)
(s70 0)
(s71 1)
(s72 1)
(s73 0)
(s74 1)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 1)
(s84 1)
(s85 0)
(s86 1)
(s87 2)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 1)
(s93 1)
(s94 1)
(s95 0)
(s96 1)
(s97 1)
(s98 1)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 1)
(s116 0)
(s117 1)
(s118 0)
(s119 1)
(s120 1)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 1)
(s128 1)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 0)
(s144 1)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 1)
(s151 1)
(s152 1)
(s153 0)
(s154 1)
(s155 1)
(s156 1)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 1)
(s165 0)
(s166 1)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 1)
(s179 0)
(s180 1)
(s181 0)
(s182 1)
(s183 1)
(s184 0)
(s185 1)
(s186 0)
(s187 0)
(s188 1)
(s189 0)
(s190 1)
(s191 0)
(s192 1)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 1)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 1)
(s204 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 521/1473 variables, and 51 constraints, problems are : Problem set: 0 solved, 960 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 16/26 constraints, State Equation: 0/523 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 18/18 constraints]
After SMT, in 40965ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 40976ms
[2024-06-01 14:51:50] [INFO ] Flow matrix only has 950 transitions (discarded 12 similar events)
[2024-06-01 14:51:50] [INFO ] Invariant cache hit.
[2024-06-01 14:51:50] [INFO ] Implicit Places using invariants in 437 ms returned [299]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 439 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 522/529 places, 962/968 transitions.
Applied a total of 0 rules in 6 ms. Remains 522 /522 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41436 ms. Remains : 522/529 places, 962/968 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-04 finished in 41539 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(!X(p0)) U G(p1))) U p2))'
Support contains 58 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 523 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 523 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 517 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 517 transition count 956
Applied a total of 24 rules in 27 ms. Remains 517 /529 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-06-01 14:51:51] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 517 cols
[2024-06-01 14:51:51] [INFO ] Computed 43 invariants in 20 ms
[2024-06-01 14:51:51] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:51:58] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-06-01 14:51:58] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 2 ms to minimize.
[2024-06-01 14:51:58] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:51:59] [INFO ] Deduced a trap composed of 73 places in 33 ms of which 0 ms to minimize.
[2024-06-01 14:51:59] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:51:59] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:51:59] [INFO ] Deduced a trap composed of 72 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:51:59] [INFO ] Deduced a trap composed of 246 places in 207 ms of which 3 ms to minimize.
[2024-06-01 14:51:59] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:52:00] [INFO ] Deduced a trap composed of 86 places in 148 ms of which 3 ms to minimize.
[2024-06-01 14:52:00] [INFO ] Deduced a trap composed of 127 places in 158 ms of which 3 ms to minimize.
[2024-06-01 14:52:00] [INFO ] Deduced a trap composed of 151 places in 140 ms of which 3 ms to minimize.
[2024-06-01 14:52:00] [INFO ] Deduced a trap composed of 121 places in 170 ms of which 3 ms to minimize.
[2024-06-01 14:52:04] [INFO ] Deduced a trap composed of 241 places in 231 ms of which 3 ms to minimize.
[2024-06-01 14:52:05] [INFO ] Deduced a trap composed of 246 places in 261 ms of which 4 ms to minimize.
[2024-06-01 14:52:07] [INFO ] Deduced a trap composed of 277 places in 229 ms of which 3 ms to minimize.
[2024-06-01 14:52:09] [INFO ] Deduced a trap composed of 306 places in 158 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 515/1461 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:52:21] [INFO ] Deduced a trap composed of 306 places in 259 ms of which 6 ms to minimize.
[2024-06-01 14:52:21] [INFO ] Deduced a trap composed of 272 places in 212 ms of which 3 ms to minimize.
[2024-06-01 14:52:29] [INFO ] Deduced a trap composed of 42 places in 218 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 515/1461 variables, and 61 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 20/20 constraints]
After SMT, in 41065ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41075ms
[2024-06-01 14:52:32] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-06-01 14:52:32] [INFO ] Invariant cache hit.
[2024-06-01 14:52:32] [INFO ] Implicit Places using invariants in 498 ms returned [296]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 503 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/529 places, 956/968 transitions.
Applied a total of 0 rules in 10 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41618 ms. Remains : 516/529 places, 956/968 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p2), (OR (NOT p2) p1), p1, (AND (NOT p0) p1), (AND p1 (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-05
Stuttering criterion allowed to conclude after 12760 steps with 222 reset in 89 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-05 finished in 41909 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)))'
Support contains 12 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 523 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 523 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 517 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 517 transition count 956
Applied a total of 24 rules in 20 ms. Remains 517 /529 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-06-01 14:52:32] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-06-01 14:52:32] [INFO ] Invariant cache hit.
[2024-06-01 14:52:32] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:52:41] [INFO ] Deduced a trap composed of 72 places in 164 ms of which 3 ms to minimize.
[2024-06-01 14:52:41] [INFO ] Deduced a trap composed of 72 places in 153 ms of which 3 ms to minimize.
[2024-06-01 14:52:41] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 2 ms to minimize.
[2024-06-01 14:52:41] [INFO ] Deduced a trap composed of 73 places in 31 ms of which 1 ms to minimize.
[2024-06-01 14:52:41] [INFO ] Deduced a trap composed of 72 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:52:41] [INFO ] Deduced a trap composed of 72 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:52:42] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-06-01 14:52:42] [INFO ] Deduced a trap composed of 72 places in 33 ms of which 0 ms to minimize.
[2024-06-01 14:52:42] [INFO ] Deduced a trap composed of 246 places in 214 ms of which 3 ms to minimize.
[2024-06-01 14:52:43] [INFO ] Deduced a trap composed of 127 places in 239 ms of which 4 ms to minimize.
[2024-06-01 14:52:44] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 2 ms to minimize.
[2024-06-01 14:52:44] [INFO ] Deduced a trap composed of 348 places in 243 ms of which 3 ms to minimize.
[2024-06-01 14:52:45] [INFO ] Deduced a trap composed of 140 places in 158 ms of which 2 ms to minimize.
[2024-06-01 14:52:47] [INFO ] Deduced a trap composed of 241 places in 248 ms of which 4 ms to minimize.
[2024-06-01 14:52:48] [INFO ] Deduced a trap composed of 218 places in 225 ms of which 4 ms to minimize.
[2024-06-01 14:52:48] [INFO ] Deduced a trap composed of 266 places in 204 ms of which 3 ms to minimize.
[2024-06-01 14:52:49] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 4 ms to minimize.
[2024-06-01 14:52:54] [INFO ] Deduced a trap composed of 264 places in 248 ms of which 4 ms to minimize.
SMT process timed out in 21110ms, After SMT, problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 21120ms
[2024-06-01 14:52:54] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-06-01 14:52:54] [INFO ] Invariant cache hit.
[2024-06-01 14:52:54] [INFO ] Implicit Places using invariants in 472 ms returned [296]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 473 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/529 places, 956/968 transitions.
Applied a total of 0 rules in 5 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21620 ms. Remains : 516/529 places, 956/968 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-06
Product exploration explored 100000 steps with 1847 reset in 308 ms.
Product exploration explored 100000 steps with 1848 reset in 333 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 207 steps (0 resets) in 7 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
[2024-06-01 14:52:55] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 516 cols
[2024-06-01 14:52:55] [INFO ] Computed 42 invariants in 11 ms
[2024-06-01 14:52:55] [INFO ] [Real]Absence check using 16 positive place invariants in 18 ms returned sat
[2024-06-01 14:52:55] [INFO ] [Real]Absence check using 16 positive and 26 generalized place invariants in 61 ms returned sat
[2024-06-01 14:52:56] [INFO ] [Real]Absence check using state equation in 802 ms returned sat
[2024-06-01 14:52:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:52:57] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-06-01 14:52:57] [INFO ] [Nat]Absence check using 16 positive and 26 generalized place invariants in 46 ms returned sat
[2024-06-01 14:52:59] [INFO ] [Nat]Absence check using state equation in 2511 ms returned sat
[2024-06-01 14:52:59] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:53:00] [INFO ] [Nat]Added 72 Read/Feed constraints in 590 ms returned sat
[2024-06-01 14:53:00] [INFO ] Deduced a trap composed of 72 places in 209 ms of which 3 ms to minimize.
[2024-06-01 14:53:01] [INFO ] Deduced a trap composed of 95 places in 251 ms of which 3 ms to minimize.
[2024-06-01 14:53:01] [INFO ] Deduced a trap composed of 73 places in 243 ms of which 4 ms to minimize.
[2024-06-01 14:53:02] [INFO ] Deduced a trap composed of 76 places in 248 ms of which 3 ms to minimize.
[2024-06-01 14:53:02] [INFO ] Deduced a trap composed of 72 places in 238 ms of which 4 ms to minimize.
[2024-06-01 14:53:03] [INFO ] Deduced a trap composed of 124 places in 254 ms of which 5 ms to minimize.
[2024-06-01 14:53:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3223 ms
[2024-06-01 14:53:03] [INFO ] Computed and/alt/rep : 618/2193/612 causal constraints (skipped 330 transitions) in 104 ms.
[2024-06-01 14:53:11] [INFO ] Added : 445 causal constraints over 89 iterations in 8154 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 12 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 956/956 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 516 transition count 914
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 474 transition count 914
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 84 place count 474 transition count 854
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 204 place count 414 transition count 854
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 276 place count 378 transition count 818
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 279 place count 375 transition count 815
Iterating global reduction 2 with 3 rules applied. Total rules applied 282 place count 375 transition count 815
Applied a total of 282 rules in 102 ms. Remains 375 /516 variables (removed 141) and now considering 815/956 (removed 141) transitions.
Running 813 sub problems to find dead transitions.
[2024-06-01 14:53:11] [INFO ] Flow matrix only has 803 transitions (discarded 12 similar events)
// Phase 1: matrix 803 rows 375 cols
[2024-06-01 14:53:11] [INFO ] Computed 42 invariants in 21 ms
[2024-06-01 14:53:11] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/373 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 813 unsolved
[2024-06-01 14:53:17] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:53:17] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-06-01 14:53:17] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:53:17] [INFO ] Deduced a trap composed of 133 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:53:18] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-06-01 14:53:18] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 6 ms to minimize.
[2024-06-01 14:53:18] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:53:20] [INFO ] Deduced a trap composed of 113 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:53:23] [INFO ] Deduced a trap composed of 136 places in 113 ms of which 2 ms to minimize.
[2024-06-01 14:53:23] [INFO ] Deduced a trap composed of 127 places in 125 ms of which 3 ms to minimize.
[2024-06-01 14:53:23] [INFO ] Deduced a trap composed of 132 places in 154 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 813 unsolved
SMT process timed out in 21143ms, After SMT, problems are : Problem set: 0 solved, 813 unsolved
Search for dead transitions found 0 dead transitions in 21153ms
[2024-06-01 14:53:33] [INFO ] Flow matrix only has 803 transitions (discarded 12 similar events)
[2024-06-01 14:53:33] [INFO ] Invariant cache hit.
[2024-06-01 14:53:33] [INFO ] Implicit Places using invariants in 412 ms returned []
[2024-06-01 14:53:33] [INFO ] Flow matrix only has 803 transitions (discarded 12 similar events)
[2024-06-01 14:53:33] [INFO ] Invariant cache hit.
[2024-06-01 14:53:34] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:53:37] [INFO ] Implicit Places using invariants and state equation in 4162 ms returned []
Implicit Place search using SMT with State Equation took 4575 ms to find 0 implicit places.
[2024-06-01 14:53:37] [INFO ] Redundant transitions in 31 ms returned []
Running 813 sub problems to find dead transitions.
[2024-06-01 14:53:37] [INFO ] Flow matrix only has 803 transitions (discarded 12 similar events)
[2024-06-01 14:53:37] [INFO ] Invariant cache hit.
[2024-06-01 14:53:37] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/373 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 813 unsolved
[2024-06-01 14:53:43] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 2 ms to minimize.
[2024-06-01 14:53:43] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:53:43] [INFO ] Deduced a trap composed of 138 places in 112 ms of which 2 ms to minimize.
[2024-06-01 14:53:44] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-06-01 14:53:44] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:53:44] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 3 ms to minimize.
[2024-06-01 14:53:45] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 2 ms to minimize.
[2024-06-01 14:53:45] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2024-06-01 14:53:45] [INFO ] Deduced a trap composed of 68 places in 155 ms of which 2 ms to minimize.
[2024-06-01 14:53:45] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:53:47] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-06-01 14:53:49] [INFO ] Deduced a trap composed of 135 places in 96 ms of which 1 ms to minimize.
[2024-06-01 14:53:49] [INFO ] Deduced a trap composed of 127 places in 99 ms of which 2 ms to minimize.
[2024-06-01 14:53:50] [INFO ] Deduced a trap composed of 132 places in 128 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 14/53 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 813 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/375 variables, 3/56 constraints. Problems are: Problem set: 66 solved, 747 unsolved
[2024-06-01 14:54:03] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 2 ms to minimize.
[2024-06-01 14:54:03] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 2 ms to minimize.
[2024-06-01 14:54:03] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:54:03] [INFO ] Deduced a trap composed of 48 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:54:03] [INFO ] Deduced a trap composed of 49 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:54:03] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:54:03] [INFO ] Deduced a trap composed of 158 places in 145 ms of which 5 ms to minimize.
[2024-06-01 14:54:04] [INFO ] Deduced a trap composed of 55 places in 137 ms of which 3 ms to minimize.
[2024-06-01 14:54:05] [INFO ] Deduced a trap composed of 52 places in 154 ms of which 3 ms to minimize.
[2024-06-01 14:54:06] [INFO ] Deduced a trap composed of 200 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:54:06] [INFO ] Deduced a trap composed of 179 places in 139 ms of which 2 ms to minimize.
[2024-06-01 14:54:07] [INFO ] Deduced a trap composed of 130 places in 199 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 375/1178 variables, and 68 constraints, problems are : Problem set: 66 solved, 747 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/375 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 813/813 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 66 solved, 747 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 17/17 constraints. Problems are: Problem set: 66 solved, 747 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/373 variables, 22/39 constraints. Problems are: Problem set: 66 solved, 747 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 22/61 constraints. Problems are: Problem set: 66 solved, 747 unsolved
[2024-06-01 14:54:11] [INFO ] Deduced a trap composed of 184 places in 193 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 1/62 constraints. Problems are: Problem set: 66 solved, 747 unsolved
[2024-06-01 14:54:22] [INFO ] Deduced a trap composed of 118 places in 164 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 1/63 constraints. Problems are: Problem set: 66 solved, 747 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 0/63 constraints. Problems are: Problem set: 66 solved, 747 unsolved
At refinement iteration 6 (OVERLAPS) 2/375 variables, 3/66 constraints. Problems are: Problem set: 66 solved, 747 unsolved
SMT process timed out in 61153ms, After SMT, problems are : Problem set: 66 solved, 747 unsolved
Search for dead transitions found 66 dead transitions in 61161ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 375/516 places, 749/956 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 361 transition count 725
Applied a total of 12 rules in 27 ms. Remains 361 /375 variables (removed 14) and now considering 725/749 (removed 24) transitions.
[2024-06-01 14:54:38] [INFO ] Flow matrix only has 713 transitions (discarded 12 similar events)
// Phase 1: matrix 713 rows 361 cols
[2024-06-01 14:54:38] [INFO ] Computed 42 invariants in 11 ms
[2024-06-01 14:54:39] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-06-01 14:54:39] [INFO ] Flow matrix only has 713 transitions (discarded 12 similar events)
[2024-06-01 14:54:39] [INFO ] Invariant cache hit.
[2024-06-01 14:54:39] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:54:43] [INFO ] Implicit Places using invariants and state equation in 3880 ms returned []
Implicit Place search using SMT with State Equation took 4287 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 361/516 places, 725/956 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 91348 ms. Remains : 361/516 places, 725/956 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 162 steps (0 resets) in 6 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
[2024-06-01 14:54:43] [INFO ] Flow matrix only has 713 transitions (discarded 12 similar events)
[2024-06-01 14:54:43] [INFO ] Invariant cache hit.
[2024-06-01 14:54:43] [INFO ] [Real]Absence check using 18 positive place invariants in 16 ms returned sat
[2024-06-01 14:54:43] [INFO ] [Real]Absence check using 18 positive and 24 generalized place invariants in 52 ms returned sat
[2024-06-01 14:54:44] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2024-06-01 14:54:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:54:44] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-06-01 14:54:44] [INFO ] [Nat]Absence check using 18 positive and 24 generalized place invariants in 70 ms returned sat
[2024-06-01 14:54:45] [INFO ] [Nat]Absence check using state equation in 1059 ms returned sat
[2024-06-01 14:54:45] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:54:45] [INFO ] [Nat]Added 72 Read/Feed constraints in 111 ms returned sat
[2024-06-01 14:54:46] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:54:46] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:54:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 352 ms
[2024-06-01 14:54:46] [INFO ] Computed and/alt/rep : 441/1956/435 causal constraints (skipped 276 transitions) in 65 ms.
[2024-06-01 14:54:48] [INFO ] Added : 158 causal constraints over 32 iterations in 1931 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2639 reset in 443 ms.
Product exploration explored 100000 steps with 2636 reset in 449 ms.
Support contains 12 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 725/725 transitions.
Applied a total of 0 rules in 15 ms. Remains 361 /361 variables (removed 0) and now considering 725/725 (removed 0) transitions.
Running 723 sub problems to find dead transitions.
[2024-06-01 14:54:49] [INFO ] Flow matrix only has 713 transitions (discarded 12 similar events)
[2024-06-01 14:54:49] [INFO ] Invariant cache hit.
[2024-06-01 14:54:49] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-01 14:54:53] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 2 ms to minimize.
[2024-06-01 14:54:53] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 2 ms to minimize.
[2024-06-01 14:54:53] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
[2024-06-01 14:54:53] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:54:54] [INFO ] Deduced a trap composed of 46 places in 28 ms of which 1 ms to minimize.
[2024-06-01 14:54:54] [INFO ] Deduced a trap composed of 46 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:54:54] [INFO ] Deduced a trap composed of 144 places in 192 ms of which 2 ms to minimize.
[2024-06-01 14:54:54] [INFO ] Deduced a trap composed of 168 places in 209 ms of which 3 ms to minimize.
[2024-06-01 14:54:54] [INFO ] Deduced a trap composed of 150 places in 201 ms of which 2 ms to minimize.
[2024-06-01 14:54:55] [INFO ] Deduced a trap composed of 47 places in 207 ms of which 3 ms to minimize.
[2024-06-01 14:54:55] [INFO ] Deduced a trap composed of 130 places in 185 ms of which 4 ms to minimize.
[2024-06-01 14:54:55] [INFO ] Deduced a trap composed of 112 places in 193 ms of which 3 ms to minimize.
[2024-06-01 14:54:55] [INFO ] Deduced a trap composed of 112 places in 180 ms of which 3 ms to minimize.
[2024-06-01 14:54:56] [INFO ] Deduced a trap composed of 223 places in 154 ms of which 2 ms to minimize.
[2024-06-01 14:54:56] [INFO ] Deduced a trap composed of 159 places in 159 ms of which 2 ms to minimize.
[2024-06-01 14:54:56] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 3 ms to minimize.
[2024-06-01 14:54:56] [INFO ] Deduced a trap composed of 185 places in 179 ms of which 2 ms to minimize.
[2024-06-01 14:54:56] [INFO ] Deduced a trap composed of 112 places in 188 ms of which 2 ms to minimize.
[2024-06-01 14:54:57] [INFO ] Deduced a trap composed of 151 places in 161 ms of which 3 ms to minimize.
[2024-06-01 14:54:57] [INFO ] Deduced a trap composed of 186 places in 153 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-01 14:54:57] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 2 ms to minimize.
[2024-06-01 14:54:58] [INFO ] Deduced a trap composed of 171 places in 147 ms of which 2 ms to minimize.
[2024-06-01 14:54:58] [INFO ] Deduced a trap composed of 148 places in 143 ms of which 2 ms to minimize.
[2024-06-01 14:54:58] [INFO ] Deduced a trap composed of 161 places in 144 ms of which 3 ms to minimize.
[2024-06-01 14:54:58] [INFO ] Deduced a trap composed of 158 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:54:58] [INFO ] Deduced a trap composed of 166 places in 116 ms of which 2 ms to minimize.
[2024-06-01 14:54:59] [INFO ] Deduced a trap composed of 177 places in 198 ms of which 3 ms to minimize.
[2024-06-01 14:54:59] [INFO ] Deduced a trap composed of 172 places in 144 ms of which 2 ms to minimize.
[2024-06-01 14:54:59] [INFO ] Deduced a trap composed of 172 places in 109 ms of which 2 ms to minimize.
[2024-06-01 14:54:59] [INFO ] Deduced a trap composed of 190 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:54:59] [INFO ] Deduced a trap composed of 187 places in 116 ms of which 1 ms to minimize.
[2024-06-01 14:54:59] [INFO ] Deduced a trap composed of 190 places in 117 ms of which 2 ms to minimize.
[2024-06-01 14:54:59] [INFO ] Deduced a trap composed of 173 places in 116 ms of which 2 ms to minimize.
[2024-06-01 14:55:00] [INFO ] Deduced a trap composed of 198 places in 142 ms of which 3 ms to minimize.
[2024-06-01 14:55:00] [INFO ] Deduced a trap composed of 113 places in 142 ms of which 2 ms to minimize.
[2024-06-01 14:55:00] [INFO ] Deduced a trap composed of 112 places in 162 ms of which 3 ms to minimize.
[2024-06-01 14:55:00] [INFO ] Deduced a trap composed of 205 places in 190 ms of which 2 ms to minimize.
[2024-06-01 14:55:00] [INFO ] Deduced a trap composed of 190 places in 157 ms of which 2 ms to minimize.
[2024-06-01 14:55:01] [INFO ] Deduced a trap composed of 205 places in 155 ms of which 2 ms to minimize.
[2024-06-01 14:55:01] [INFO ] Deduced a trap composed of 183 places in 152 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-01 14:55:06] [INFO ] Deduced a trap composed of 162 places in 181 ms of which 2 ms to minimize.
[2024-06-01 14:55:06] [INFO ] Deduced a trap composed of 177 places in 188 ms of which 2 ms to minimize.
[2024-06-01 14:55:06] [INFO ] Deduced a trap composed of 173 places in 140 ms of which 2 ms to minimize.
[2024-06-01 14:55:06] [INFO ] Deduced a trap composed of 179 places in 189 ms of which 2 ms to minimize.
[2024-06-01 14:55:07] [INFO ] Deduced a trap composed of 135 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:55:07] [INFO ] Deduced a trap composed of 118 places in 164 ms of which 3 ms to minimize.
[2024-06-01 14:55:07] [INFO ] Deduced a trap composed of 53 places in 211 ms of which 3 ms to minimize.
[2024-06-01 14:55:08] [INFO ] Deduced a trap composed of 200 places in 185 ms of which 2 ms to minimize.
[2024-06-01 14:55:08] [INFO ] Deduced a trap composed of 164 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:55:08] [INFO ] Deduced a trap composed of 209 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:55:08] [INFO ] Deduced a trap composed of 138 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:55:08] [INFO ] Deduced a trap composed of 185 places in 153 ms of which 2 ms to minimize.
[2024-06-01 14:55:09] [INFO ] Deduced a trap composed of 179 places in 165 ms of which 3 ms to minimize.
[2024-06-01 14:55:09] [INFO ] Deduced a trap composed of 224 places in 147 ms of which 3 ms to minimize.
[2024-06-01 14:55:09] [INFO ] Deduced a trap composed of 221 places in 195 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 359/1074 variables, and 94 constraints, problems are : Problem set: 0 solved, 723 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/361 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 723 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 55/94 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-01 14:55:12] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 14:55:16] [INFO ] Deduced a trap composed of 180 places in 210 ms of which 2 ms to minimize.
[2024-06-01 14:55:16] [INFO ] Deduced a trap composed of 153 places in 178 ms of which 3 ms to minimize.
[2024-06-01 14:55:16] [INFO ] Deduced a trap composed of 169 places in 192 ms of which 2 ms to minimize.
[2024-06-01 14:55:17] [INFO ] Deduced a trap composed of 208 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:55:17] [INFO ] Deduced a trap composed of 212 places in 164 ms of which 3 ms to minimize.
[2024-06-01 14:55:17] [INFO ] Deduced a trap composed of 178 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:55:17] [INFO ] Deduced a trap composed of 179 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:55:17] [INFO ] Deduced a trap composed of 225 places in 112 ms of which 2 ms to minimize.
[2024-06-01 14:55:17] [INFO ] Deduced a trap composed of 222 places in 113 ms of which 2 ms to minimize.
[2024-06-01 14:55:18] [INFO ] Deduced a trap composed of 180 places in 134 ms of which 2 ms to minimize.
[2024-06-01 14:55:18] [INFO ] Deduced a trap composed of 191 places in 152 ms of which 2 ms to minimize.
[2024-06-01 14:55:18] [INFO ] Deduced a trap composed of 186 places in 119 ms of which 2 ms to minimize.
[2024-06-01 14:55:18] [INFO ] Deduced a trap composed of 187 places in 146 ms of which 3 ms to minimize.
[2024-06-01 14:55:18] [INFO ] Deduced a trap composed of 210 places in 140 ms of which 2 ms to minimize.
[2024-06-01 14:55:18] [INFO ] Deduced a trap composed of 164 places in 152 ms of which 2 ms to minimize.
[2024-06-01 14:55:19] [INFO ] Deduced a trap composed of 191 places in 140 ms of which 3 ms to minimize.
[2024-06-01 14:55:19] [INFO ] Deduced a trap composed of 166 places in 142 ms of which 2 ms to minimize.
[2024-06-01 14:55:19] [INFO ] Deduced a trap composed of 166 places in 143 ms of which 2 ms to minimize.
[2024-06-01 14:55:19] [INFO ] Deduced a trap composed of 158 places in 129 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 359/1074 variables, and 114 constraints, problems are : Problem set: 0 solved, 723 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/361 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/723 constraints, Known Traps: 75/75 constraints]
After SMT, in 40729ms problems are : Problem set: 0 solved, 723 unsolved
Search for dead transitions found 0 dead transitions in 40736ms
[2024-06-01 14:55:29] [INFO ] Flow matrix only has 713 transitions (discarded 12 similar events)
[2024-06-01 14:55:29] [INFO ] Invariant cache hit.
[2024-06-01 14:55:30] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-06-01 14:55:30] [INFO ] Flow matrix only has 713 transitions (discarded 12 similar events)
[2024-06-01 14:55:30] [INFO ] Invariant cache hit.
[2024-06-01 14:55:30] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:55:34] [INFO ] Implicit Places using invariants and state equation in 4366 ms returned []
Implicit Place search using SMT with State Equation took 4782 ms to find 0 implicit places.
[2024-06-01 14:55:34] [INFO ] Redundant transitions in 20 ms returned []
Running 723 sub problems to find dead transitions.
[2024-06-01 14:55:34] [INFO ] Flow matrix only has 713 transitions (discarded 12 similar events)
[2024-06-01 14:55:34] [INFO ] Invariant cache hit.
[2024-06-01 14:55:34] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-01 14:55:40] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 2 ms to minimize.
[2024-06-01 14:55:40] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:55:40] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
[2024-06-01 14:55:40] [INFO ] Deduced a trap composed of 47 places in 32 ms of which 0 ms to minimize.
[2024-06-01 14:55:40] [INFO ] Deduced a trap composed of 46 places in 29 ms of which 1 ms to minimize.
[2024-06-01 14:55:40] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 1 ms to minimize.
[2024-06-01 14:55:41] [INFO ] Deduced a trap composed of 144 places in 132 ms of which 2 ms to minimize.
[2024-06-01 14:55:41] [INFO ] Deduced a trap composed of 168 places in 136 ms of which 2 ms to minimize.
[2024-06-01 14:55:41] [INFO ] Deduced a trap composed of 150 places in 141 ms of which 3 ms to minimize.
[2024-06-01 14:55:41] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 2 ms to minimize.
[2024-06-01 14:55:41] [INFO ] Deduced a trap composed of 130 places in 125 ms of which 2 ms to minimize.
[2024-06-01 14:55:41] [INFO ] Deduced a trap composed of 112 places in 181 ms of which 3 ms to minimize.
[2024-06-01 14:55:42] [INFO ] Deduced a trap composed of 112 places in 141 ms of which 3 ms to minimize.
[2024-06-01 14:55:42] [INFO ] Deduced a trap composed of 223 places in 129 ms of which 3 ms to minimize.
[2024-06-01 14:55:42] [INFO ] Deduced a trap composed of 159 places in 106 ms of which 1 ms to minimize.
[2024-06-01 14:55:42] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 3 ms to minimize.
[2024-06-01 14:55:42] [INFO ] Deduced a trap composed of 185 places in 120 ms of which 2 ms to minimize.
[2024-06-01 14:55:42] [INFO ] Deduced a trap composed of 112 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:55:42] [INFO ] Deduced a trap composed of 151 places in 122 ms of which 1 ms to minimize.
[2024-06-01 14:55:43] [INFO ] Deduced a trap composed of 186 places in 112 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-01 14:55:43] [INFO ] Deduced a trap composed of 164 places in 114 ms of which 2 ms to minimize.
[2024-06-01 14:55:43] [INFO ] Deduced a trap composed of 171 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:55:43] [INFO ] Deduced a trap composed of 148 places in 144 ms of which 2 ms to minimize.
[2024-06-01 14:55:43] [INFO ] Deduced a trap composed of 161 places in 144 ms of which 3 ms to minimize.
[2024-06-01 14:55:44] [INFO ] Deduced a trap composed of 158 places in 122 ms of which 2 ms to minimize.
[2024-06-01 14:55:44] [INFO ] Deduced a trap composed of 166 places in 146 ms of which 3 ms to minimize.
[2024-06-01 14:55:44] [INFO ] Deduced a trap composed of 177 places in 123 ms of which 2 ms to minimize.
[2024-06-01 14:55:44] [INFO ] Deduced a trap composed of 172 places in 111 ms of which 2 ms to minimize.
[2024-06-01 14:55:44] [INFO ] Deduced a trap composed of 172 places in 107 ms of which 2 ms to minimize.
[2024-06-01 14:55:44] [INFO ] Deduced a trap composed of 190 places in 112 ms of which 2 ms to minimize.
[2024-06-01 14:55:45] [INFO ] Deduced a trap composed of 187 places in 112 ms of which 2 ms to minimize.
[2024-06-01 14:55:45] [INFO ] Deduced a trap composed of 190 places in 119 ms of which 2 ms to minimize.
[2024-06-01 14:55:45] [INFO ] Deduced a trap composed of 173 places in 127 ms of which 2 ms to minimize.
[2024-06-01 14:55:45] [INFO ] Deduced a trap composed of 198 places in 175 ms of which 3 ms to minimize.
[2024-06-01 14:55:45] [INFO ] Deduced a trap composed of 113 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:55:45] [INFO ] Deduced a trap composed of 112 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:55:46] [INFO ] Deduced a trap composed of 205 places in 152 ms of which 3 ms to minimize.
[2024-06-01 14:55:46] [INFO ] Deduced a trap composed of 190 places in 129 ms of which 2 ms to minimize.
[2024-06-01 14:55:46] [INFO ] Deduced a trap composed of 205 places in 128 ms of which 2 ms to minimize.
[2024-06-01 14:55:46] [INFO ] Deduced a trap composed of 183 places in 126 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-01 14:55:51] [INFO ] Deduced a trap composed of 162 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:55:51] [INFO ] Deduced a trap composed of 177 places in 121 ms of which 2 ms to minimize.
[2024-06-01 14:55:51] [INFO ] Deduced a trap composed of 173 places in 135 ms of which 2 ms to minimize.
[2024-06-01 14:55:51] [INFO ] Deduced a trap composed of 179 places in 137 ms of which 2 ms to minimize.
[2024-06-01 14:55:52] [INFO ] Deduced a trap composed of 135 places in 144 ms of which 2 ms to minimize.
[2024-06-01 14:55:52] [INFO ] Deduced a trap composed of 118 places in 159 ms of which 2 ms to minimize.
[2024-06-01 14:55:52] [INFO ] Deduced a trap composed of 53 places in 120 ms of which 2 ms to minimize.
[2024-06-01 14:55:52] [INFO ] Deduced a trap composed of 200 places in 117 ms of which 2 ms to minimize.
[2024-06-01 14:55:53] [INFO ] Deduced a trap composed of 164 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:55:53] [INFO ] Deduced a trap composed of 209 places in 122 ms of which 2 ms to minimize.
[2024-06-01 14:55:53] [INFO ] Deduced a trap composed of 138 places in 122 ms of which 2 ms to minimize.
[2024-06-01 14:55:53] [INFO ] Deduced a trap composed of 185 places in 123 ms of which 2 ms to minimize.
[2024-06-01 14:55:53] [INFO ] Deduced a trap composed of 179 places in 130 ms of which 3 ms to minimize.
[2024-06-01 14:55:53] [INFO ] Deduced a trap composed of 224 places in 129 ms of which 2 ms to minimize.
[2024-06-01 14:55:53] [INFO ] Deduced a trap composed of 221 places in 129 ms of which 2 ms to minimize.
[2024-06-01 14:55:54] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 2 ms to minimize.
[2024-06-01 14:55:55] [INFO ] Deduced a trap composed of 188 places in 122 ms of which 2 ms to minimize.
[2024-06-01 14:55:55] [INFO ] Deduced a trap composed of 188 places in 120 ms of which 2 ms to minimize.
[2024-06-01 14:55:55] [INFO ] Deduced a trap composed of 172 places in 125 ms of which 2 ms to minimize.
[2024-06-01 14:55:56] [INFO ] Deduced a trap composed of 191 places in 134 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-01 14:55:57] [INFO ] Deduced a trap composed of 143 places in 124 ms of which 2 ms to minimize.
[2024-06-01 14:55:57] [INFO ] Deduced a trap composed of 180 places in 123 ms of which 2 ms to minimize.
[2024-06-01 14:55:57] [INFO ] Deduced a trap composed of 173 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:55:58] [INFO ] Deduced a trap composed of 113 places in 173 ms of which 2 ms to minimize.
[2024-06-01 14:55:58] [INFO ] Deduced a trap composed of 142 places in 175 ms of which 3 ms to minimize.
[2024-06-01 14:55:59] [INFO ] Deduced a trap composed of 147 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:55:59] [INFO ] Deduced a trap composed of 183 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:55:59] [INFO ] Deduced a trap composed of 196 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:55:59] [INFO ] Deduced a trap composed of 164 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:56:00] [INFO ] Deduced a trap composed of 148 places in 136 ms of which 1 ms to minimize.
[2024-06-01 14:56:00] [INFO ] Deduced a trap composed of 184 places in 125 ms of which 2 ms to minimize.
[2024-06-01 14:56:00] [INFO ] Deduced a trap composed of 184 places in 112 ms of which 1 ms to minimize.
[2024-06-01 14:56:00] [INFO ] Deduced a trap composed of 179 places in 115 ms of which 2 ms to minimize.
[2024-06-01 14:56:00] [INFO ] Deduced a trap composed of 181 places in 126 ms of which 2 ms to minimize.
[2024-06-01 14:56:00] [INFO ] Deduced a trap composed of 192 places in 113 ms of which 2 ms to minimize.
[2024-06-01 14:56:00] [INFO ] Deduced a trap composed of 182 places in 112 ms of which 2 ms to minimize.
[2024-06-01 14:56:01] [INFO ] Deduced a trap composed of 171 places in 119 ms of which 2 ms to minimize.
[2024-06-01 14:56:01] [INFO ] Deduced a trap composed of 187 places in 113 ms of which 1 ms to minimize.
[2024-06-01 14:56:02] [INFO ] Deduced a trap composed of 177 places in 117 ms of which 2 ms to minimize.
[2024-06-01 14:56:02] [INFO ] Deduced a trap composed of 197 places in 149 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-01 14:56:03] [INFO ] Deduced a trap composed of 172 places in 176 ms of which 3 ms to minimize.
[2024-06-01 14:56:04] [INFO ] Deduced a trap composed of 146 places in 163 ms of which 3 ms to minimize.
[2024-06-01 14:56:04] [INFO ] Deduced a trap composed of 170 places in 142 ms of which 2 ms to minimize.
[2024-06-01 14:56:04] [INFO ] Deduced a trap composed of 165 places in 133 ms of which 3 ms to minimize.
[2024-06-01 14:56:05] [INFO ] Deduced a trap composed of 112 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:56:05] [INFO ] Deduced a trap composed of 153 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:56:05] [INFO ] Deduced a trap composed of 175 places in 128 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 359/1074 variables, and 126 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/361 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 87/87 constraints]
Escalating to Integer solving :Problem set: 0 solved, 723 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 87/126 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-01 14:56:23] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 14:56:24] [INFO ] Deduced a trap composed of 224 places in 117 ms of which 1 ms to minimize.
[2024-06-01 14:56:24] [INFO ] Deduced a trap composed of 199 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:56:24] [INFO ] Deduced a trap composed of 193 places in 121 ms of which 2 ms to minimize.
[2024-06-01 14:56:24] [INFO ] Deduced a trap composed of 197 places in 132 ms of which 2 ms to minimize.
[2024-06-01 14:56:25] [INFO ] Deduced a trap composed of 186 places in 199 ms of which 2 ms to minimize.
[2024-06-01 14:56:25] [INFO ] Deduced a trap composed of 186 places in 173 ms of which 2 ms to minimize.
[2024-06-01 14:56:25] [INFO ] Deduced a trap composed of 184 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:56:25] [INFO ] Deduced a trap composed of 184 places in 161 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 359/1074 variables, and 135 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/361 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/723 constraints, Known Traps: 96/96 constraints]
After SMT, in 60883ms problems are : Problem set: 0 solved, 723 unsolved
Search for dead transitions found 0 dead transitions in 60895ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 106462 ms. Remains : 361/361 places, 725/725 transitions.
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-06 finished in 242808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1)&&(G(p1)||p2))))'
Support contains 63 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 523 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 523 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 517 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 517 transition count 956
Applied a total of 24 rules in 24 ms. Remains 517 /529 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-06-01 14:56:35] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 517 cols
[2024-06-01 14:56:35] [INFO ] Computed 43 invariants in 23 ms
[2024-06-01 14:56:35] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:56:44] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 3 ms to minimize.
[2024-06-01 14:56:44] [INFO ] Deduced a trap composed of 73 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:56:44] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 2 ms to minimize.
[2024-06-01 14:56:44] [INFO ] Deduced a trap composed of 73 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:56:44] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 0 ms to minimize.
[2024-06-01 14:56:44] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:56:44] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:56:44] [INFO ] Deduced a trap composed of 246 places in 224 ms of which 3 ms to minimize.
[2024-06-01 14:56:45] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:56:46] [INFO ] Deduced a trap composed of 86 places in 192 ms of which 4 ms to minimize.
[2024-06-01 14:56:46] [INFO ] Deduced a trap composed of 127 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:56:46] [INFO ] Deduced a trap composed of 151 places in 147 ms of which 3 ms to minimize.
[2024-06-01 14:56:46] [INFO ] Deduced a trap composed of 121 places in 147 ms of which 3 ms to minimize.
[2024-06-01 14:56:49] [INFO ] Deduced a trap composed of 241 places in 198 ms of which 3 ms to minimize.
[2024-06-01 14:56:50] [INFO ] Deduced a trap composed of 246 places in 269 ms of which 3 ms to minimize.
[2024-06-01 14:56:52] [INFO ] Deduced a trap composed of 277 places in 241 ms of which 3 ms to minimize.
[2024-06-01 14:56:56] [INFO ] Deduced a trap composed of 306 places in 222 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 515/1461 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:57:06] [INFO ] Deduced a trap composed of 306 places in 228 ms of which 3 ms to minimize.
[2024-06-01 14:57:06] [INFO ] Deduced a trap composed of 272 places in 208 ms of which 3 ms to minimize.
[2024-06-01 14:57:15] [INFO ] Deduced a trap composed of 42 places in 274 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 515/1461 variables, and 61 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 20/20 constraints]
After SMT, in 41139ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41150ms
[2024-06-01 14:57:16] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-06-01 14:57:16] [INFO ] Invariant cache hit.
[2024-06-01 14:57:17] [INFO ] Implicit Places using invariants in 422 ms returned [296]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 423 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/529 places, 956/968 transitions.
Applied a total of 0 rules in 4 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41605 ms. Remains : 516/529 places, 956/968 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-07 finished in 41777 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 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 523 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 523 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 517 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 517 transition count 956
Applied a total of 24 rules in 19 ms. Remains 517 /529 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-06-01 14:57:17] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-06-01 14:57:17] [INFO ] Invariant cache hit.
[2024-06-01 14:57:17] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:57:25] [INFO ] Deduced a trap composed of 72 places in 142 ms of which 3 ms to minimize.
[2024-06-01 14:57:25] [INFO ] Deduced a trap composed of 72 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:57:25] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
[2024-06-01 14:57:25] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 0 ms to minimize.
[2024-06-01 14:57:25] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:57:26] [INFO ] Deduced a trap composed of 72 places in 32 ms of which 0 ms to minimize.
[2024-06-01 14:57:26] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-06-01 14:57:26] [INFO ] Deduced a trap composed of 72 places in 31 ms of which 1 ms to minimize.
[2024-06-01 14:57:26] [INFO ] Deduced a trap composed of 246 places in 163 ms of which 3 ms to minimize.
[2024-06-01 14:57:27] [INFO ] Deduced a trap composed of 127 places in 229 ms of which 3 ms to minimize.
[2024-06-01 14:57:27] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 3 ms to minimize.
[2024-06-01 14:57:28] [INFO ] Deduced a trap composed of 348 places in 204 ms of which 3 ms to minimize.
[2024-06-01 14:57:29] [INFO ] Deduced a trap composed of 140 places in 212 ms of which 3 ms to minimize.
[2024-06-01 14:57:31] [INFO ] Deduced a trap composed of 241 places in 263 ms of which 4 ms to minimize.
[2024-06-01 14:57:32] [INFO ] Deduced a trap composed of 218 places in 183 ms of which 3 ms to minimize.
[2024-06-01 14:57:32] [INFO ] Deduced a trap composed of 266 places in 176 ms of which 3 ms to minimize.
[2024-06-01 14:57:32] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:57:37] [INFO ] Deduced a trap composed of 264 places in 167 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 9.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 4.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 515/1461 variables, and 59 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 515/1461 variables, and 59 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 18/18 constraints]
After SMT, in 41054ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41064ms
[2024-06-01 14:57:58] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-06-01 14:57:58] [INFO ] Invariant cache hit.
[2024-06-01 14:57:58] [INFO ] Implicit Places using invariants in 402 ms returned [296]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 404 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/529 places, 956/968 transitions.
Applied a total of 0 rules in 7 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41498 ms. Remains : 516/529 places, 956/968 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-08
Stuttering criterion allowed to conclude after 265 steps with 1 reset in 1 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-08 finished in 41608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0||G(p1)))))))'
Support contains 10 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 523 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 523 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 517 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 517 transition count 956
Applied a total of 24 rules in 21 ms. Remains 517 /529 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-06-01 14:57:59] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-06-01 14:57:59] [INFO ] Invariant cache hit.
[2024-06-01 14:57:59] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:58:07] [INFO ] Deduced a trap composed of 72 places in 229 ms of which 3 ms to minimize.
[2024-06-01 14:58:07] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 2 ms to minimize.
[2024-06-01 14:58:07] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 2 ms to minimize.
[2024-06-01 14:58:07] [INFO ] Deduced a trap composed of 73 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:58:07] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:58:08] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:58:08] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-06-01 14:58:08] [INFO ] Deduced a trap composed of 72 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:58:08] [INFO ] Deduced a trap composed of 246 places in 198 ms of which 3 ms to minimize.
[2024-06-01 14:58:09] [INFO ] Deduced a trap composed of 127 places in 233 ms of which 4 ms to minimize.
[2024-06-01 14:58:09] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 2 ms to minimize.
[2024-06-01 14:58:10] [INFO ] Deduced a trap composed of 348 places in 233 ms of which 3 ms to minimize.
[2024-06-01 14:58:11] [INFO ] Deduced a trap composed of 140 places in 224 ms of which 3 ms to minimize.
[2024-06-01 14:58:13] [INFO ] Deduced a trap composed of 241 places in 179 ms of which 3 ms to minimize.
[2024-06-01 14:58:14] [INFO ] Deduced a trap composed of 218 places in 210 ms of which 4 ms to minimize.
[2024-06-01 14:58:14] [INFO ] Deduced a trap composed of 266 places in 182 ms of which 2 ms to minimize.
[2024-06-01 14:58:15] [INFO ] Deduced a trap composed of 42 places in 266 ms of which 4 ms to minimize.
[2024-06-01 14:58:19] [INFO ] Deduced a trap composed of 264 places in 225 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 515/1461 variables, and 59 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 515/1461 variables, and 59 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 18/18 constraints]
After SMT, in 41002ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41013ms
[2024-06-01 14:58:40] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-06-01 14:58:40] [INFO ] Invariant cache hit.
[2024-06-01 14:58:40] [INFO ] Implicit Places using invariants in 513 ms returned []
[2024-06-01 14:58:40] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-06-01 14:58:40] [INFO ] Invariant cache hit.
[2024-06-01 14:58:41] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:58:49] [INFO ] Implicit Places using invariants and state equation in 8399 ms returned []
Implicit Place search using SMT with State Equation took 8913 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2024-06-01 14:58:49] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-06-01 14:58:49] [INFO ] Invariant cache hit.
[2024-06-01 14:58:49] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:58:56] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 2 ms to minimize.
[2024-06-01 14:58:56] [INFO ] Deduced a trap composed of 72 places in 171 ms of which 3 ms to minimize.
[2024-06-01 14:58:56] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 2 ms to minimize.
[2024-06-01 14:58:56] [INFO ] Deduced a trap composed of 73 places in 37 ms of which 0 ms to minimize.
[2024-06-01 14:58:56] [INFO ] Deduced a trap composed of 72 places in 34 ms of which 0 ms to minimize.
[2024-06-01 14:58:57] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 0 ms to minimize.
[2024-06-01 14:58:57] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2024-06-01 14:58:57] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:58:57] [INFO ] Deduced a trap composed of 246 places in 187 ms of which 3 ms to minimize.
[2024-06-01 14:58:58] [INFO ] Deduced a trap composed of 127 places in 226 ms of which 3 ms to minimize.
[2024-06-01 14:58:58] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 2 ms to minimize.
[2024-06-01 14:58:59] [INFO ] Deduced a trap composed of 348 places in 162 ms of which 3 ms to minimize.
[2024-06-01 14:59:00] [INFO ] Deduced a trap composed of 140 places in 174 ms of which 2 ms to minimize.
[2024-06-01 14:59:02] [INFO ] Deduced a trap composed of 241 places in 179 ms of which 3 ms to minimize.
[2024-06-01 14:59:02] [INFO ] Deduced a trap composed of 218 places in 186 ms of which 3 ms to minimize.
[2024-06-01 14:59:03] [INFO ] Deduced a trap composed of 266 places in 182 ms of which 3 ms to minimize.
[2024-06-01 14:59:03] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 4 ms to minimize.
[2024-06-01 14:59:08] [INFO ] Deduced a trap composed of 264 places in 221 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 954 unsolved
SMT process timed out in 30946ms, After SMT, problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 30954ms
Starting structural reductions in LTL mode, iteration 1 : 517/529 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80905 ms. Remains : 517/529 places, 956/968 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-10 finished in 81098 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 3 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 523 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 523 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 517 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 517 transition count 956
Applied a total of 24 rules in 20 ms. Remains 517 /529 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-06-01 14:59:20] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-06-01 14:59:20] [INFO ] Invariant cache hit.
[2024-06-01 14:59:20] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 14:59:27] [INFO ] Deduced a trap composed of 72 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:59:28] [INFO ] Deduced a trap composed of 72 places in 137 ms of which 2 ms to minimize.
[2024-06-01 14:59:28] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 2 ms to minimize.
[2024-06-01 14:59:28] [INFO ] Deduced a trap composed of 73 places in 35 ms of which 0 ms to minimize.
[2024-06-01 14:59:28] [INFO ] Deduced a trap composed of 72 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:59:28] [INFO ] Deduced a trap composed of 72 places in 32 ms of which 0 ms to minimize.
[2024-06-01 14:59:28] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 2 ms to minimize.
[2024-06-01 14:59:28] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:59:28] [INFO ] Deduced a trap composed of 246 places in 220 ms of which 3 ms to minimize.
[2024-06-01 14:59:29] [INFO ] Deduced a trap composed of 127 places in 247 ms of which 4 ms to minimize.
[2024-06-01 14:59:30] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:59:30] [INFO ] Deduced a trap composed of 348 places in 211 ms of which 3 ms to minimize.
[2024-06-01 14:59:32] [INFO ] Deduced a trap composed of 140 places in 223 ms of which 4 ms to minimize.
[2024-06-01 14:59:33] [INFO ] Deduced a trap composed of 241 places in 218 ms of which 4 ms to minimize.
[2024-06-01 14:59:34] [INFO ] Deduced a trap composed of 218 places in 232 ms of which 4 ms to minimize.
[2024-06-01 14:59:34] [INFO ] Deduced a trap composed of 266 places in 212 ms of which 3 ms to minimize.
[2024-06-01 14:59:35] [INFO ] Deduced a trap composed of 42 places in 230 ms of which 3 ms to minimize.
[2024-06-01 14:59:39] [INFO ] Deduced a trap composed of 264 places in 254 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 515/1461 variables, and 59 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 515/1461 variables, and 59 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 18/18 constraints]
After SMT, in 40894ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40904ms
[2024-06-01 15:00:01] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-06-01 15:00:01] [INFO ] Invariant cache hit.
[2024-06-01 15:00:01] [INFO ] Implicit Places using invariants in 342 ms returned [296]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 343 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/529 places, 956/968 transitions.
Applied a total of 0 rules in 5 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41275 ms. Remains : 516/529 places, 956/968 transitions.
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-11
Entered a terminal (fully accepting) state of product in 157 steps with 1 reset in 1 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-11 finished in 41354 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 3 out of 529 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 529/529 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 529 transition count 914
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 475 transition count 914
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 108 place count 475 transition count 855
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 226 place count 416 transition count 855
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 229 place count 413 transition count 852
Iterating global reduction 2 with 3 rules applied. Total rules applied 232 place count 413 transition count 852
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 328 place count 365 transition count 804
Applied a total of 328 rules in 42 ms. Remains 365 /529 variables (removed 164) and now considering 804/968 (removed 164) transitions.
Running 802 sub problems to find dead transitions.
[2024-06-01 15:00:01] [INFO ] Flow matrix only has 792 transitions (discarded 12 similar events)
// Phase 1: matrix 792 rows 365 cols
[2024-06-01 15:00:01] [INFO ] Computed 43 invariants in 7 ms
[2024-06-01 15:00:01] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 802 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 802 unsolved
[2024-06-01 15:00:07] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:00:07] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-06-01 15:00:07] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 0 ms to minimize.
[2024-06-01 15:00:07] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:00:07] [INFO ] Deduced a trap composed of 121 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:00:07] [INFO ] Deduced a trap composed of 46 places in 24 ms of which 0 ms to minimize.
[2024-06-01 15:00:07] [INFO ] Deduced a trap composed of 47 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:00:08] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:00:08] [INFO ] Deduced a trap composed of 62 places in 184 ms of which 3 ms to minimize.
[2024-06-01 15:00:08] [INFO ] Deduced a trap composed of 55 places in 158 ms of which 3 ms to minimize.
[2024-06-01 15:00:09] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:00:10] [INFO ] Deduced a trap composed of 216 places in 197 ms of which 2 ms to minimize.
[2024-06-01 15:00:11] [INFO ] Deduced a trap composed of 131 places in 179 ms of which 3 ms to minimize.
[2024-06-01 15:00:12] [INFO ] Deduced a trap composed of 113 places in 135 ms of which 2 ms to minimize.
[2024-06-01 15:00:13] [INFO ] Deduced a trap composed of 140 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:00:13] [INFO ] Deduced a trap composed of 151 places in 177 ms of which 3 ms to minimize.
[2024-06-01 15:00:13] [INFO ] Deduced a trap composed of 146 places in 222 ms of which 3 ms to minimize.
[2024-06-01 15:00:14] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 802 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 10.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 (/ 1.0 3.0))
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 6.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 (/ 2.0 3.0))
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 (/ 2.0 3.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 1.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 802 unsolved
SMT process timed out in 20865ms, After SMT, problems are : Problem set: 0 solved, 802 unsolved
Search for dead transitions found 0 dead transitions in 20871ms
[2024-06-01 15:00:22] [INFO ] Flow matrix only has 792 transitions (discarded 12 similar events)
[2024-06-01 15:00:22] [INFO ] Invariant cache hit.
[2024-06-01 15:00:22] [INFO ] Implicit Places using invariants in 369 ms returned [209]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 370 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 364/529 places, 804/968 transitions.
Applied a total of 0 rules in 11 ms. Remains 364 /364 variables (removed 0) and now considering 804/804 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21298 ms. Remains : 364/529 places, 804/968 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-13
Stuttering criterion allowed to conclude after 2564 steps with 3 reset in 9 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-13 finished in 21349 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((p2&&X(F(p3))))))'
Support contains 7 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 523 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 523 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 517 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 517 transition count 956
Applied a total of 24 rules in 19 ms. Remains 517 /529 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-06-01 15:00:22] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 517 cols
[2024-06-01 15:00:22] [INFO ] Computed 43 invariants in 10 ms
[2024-06-01 15:00:22] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 15:00:30] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 3 ms to minimize.
[2024-06-01 15:00:30] [INFO ] Deduced a trap composed of 73 places in 165 ms of which 3 ms to minimize.
[2024-06-01 15:00:30] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:00:30] [INFO ] Deduced a trap composed of 73 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:00:31] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:00:31] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:00:31] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 0 ms to minimize.
[2024-06-01 15:00:31] [INFO ] Deduced a trap composed of 246 places in 185 ms of which 3 ms to minimize.
[2024-06-01 15:00:31] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:00:32] [INFO ] Deduced a trap composed of 86 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:00:32] [INFO ] Deduced a trap composed of 127 places in 174 ms of which 3 ms to minimize.
[2024-06-01 15:00:32] [INFO ] Deduced a trap composed of 151 places in 184 ms of which 4 ms to minimize.
[2024-06-01 15:00:32] [INFO ] Deduced a trap composed of 121 places in 150 ms of which 3 ms to minimize.
[2024-06-01 15:00:36] [INFO ] Deduced a trap composed of 241 places in 241 ms of which 4 ms to minimize.
[2024-06-01 15:00:36] [INFO ] Deduced a trap composed of 246 places in 269 ms of which 4 ms to minimize.
[2024-06-01 15:00:39] [INFO ] Deduced a trap composed of 277 places in 272 ms of which 3 ms to minimize.
[2024-06-01 15:00:42] [INFO ] Deduced a trap composed of 306 places in 250 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 515/1461 variables, and 58 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 15:00:52] [INFO ] Deduced a trap composed of 306 places in 271 ms of which 3 ms to minimize.
[2024-06-01 15:00:52] [INFO ] Deduced a trap composed of 272 places in 217 ms of which 4 ms to minimize.
[2024-06-01 15:01:00] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 515/1461 variables, and 61 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 20/20 constraints]
After SMT, in 40967ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40976ms
[2024-06-01 15:01:03] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-06-01 15:01:03] [INFO ] Invariant cache hit.
[2024-06-01 15:01:04] [INFO ] Implicit Places using invariants in 497 ms returned [296]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 499 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/529 places, 956/968 transitions.
Applied a total of 0 rules in 6 ms. Remains 516 /516 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41502 ms. Remains : 516/529 places, 956/968 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p1) (NOT p3) (NOT p2)), true, (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-14 finished in 41684 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((X(p1)&&p0))))'
Found a Shortening insensitive property : PolyORBLF-PT-S02J06T06-LTLFireability-03
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 19 out of 529 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 529/529 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 529 transition count 920
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 481 transition count 920
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 96 place count 481 transition count 872
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 192 place count 433 transition count 872
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 195 place count 430 transition count 869
Iterating global reduction 2 with 3 rules applied. Total rules applied 198 place count 430 transition count 869
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 282 place count 388 transition count 827
Applied a total of 282 rules in 44 ms. Remains 388 /529 variables (removed 141) and now considering 827/968 (removed 141) transitions.
Running 825 sub problems to find dead transitions.
[2024-06-01 15:01:04] [INFO ] Flow matrix only has 815 transitions (discarded 12 similar events)
// Phase 1: matrix 815 rows 388 cols
[2024-06-01 15:01:04] [INFO ] Computed 43 invariants in 16 ms
[2024-06-01 15:01:04] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 825 unsolved
[2024-06-01 15:01:10] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 2 ms to minimize.
[2024-06-01 15:01:11] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2024-06-01 15:01:14] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2024-06-01 15:01:14] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 825 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/388 variables, 10/47 constraints. Problems are: Problem set: 11 solved, 814 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/1203 variables, and 47 constraints, problems are : Problem set: 11 solved, 814 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/388 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 825/825 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 11 solved, 814 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 14/14 constraints. Problems are: Problem set: 11 solved, 814 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 19/33 constraints. Problems are: Problem set: 11 solved, 814 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 4/37 constraints. Problems are: Problem set: 11 solved, 814 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 0/37 constraints. Problems are: Problem set: 11 solved, 814 unsolved
Problem TDEAD149 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/388 variables, 10/47 constraints. Problems are: Problem set: 66 solved, 759 unsolved
[2024-06-01 15:01:36] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:01:36] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-06-01 15:01:36] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 0 ms to minimize.
[2024-06-01 15:01:37] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:01:37] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:01:37] [INFO ] Deduced a trap composed of 51 places in 33 ms of which 0 ms to minimize.
[2024-06-01 15:01:37] [INFO ] Deduced a trap composed of 178 places in 192 ms of which 3 ms to minimize.
[2024-06-01 15:01:38] [INFO ] Deduced a trap composed of 136 places in 196 ms of which 3 ms to minimize.
[2024-06-01 15:01:38] [INFO ] Deduced a trap composed of 139 places in 189 ms of which 2 ms to minimize.
[2024-06-01 15:01:38] [INFO ] Deduced a trap composed of 186 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:01:39] [INFO ] Deduced a trap composed of 167 places in 190 ms of which 2 ms to minimize.
[2024-06-01 15:01:39] [INFO ] Deduced a trap composed of 143 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:01:39] [INFO ] Deduced a trap composed of 116 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:01:39] [INFO ] Deduced a trap composed of 178 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:01:40] [INFO ] Deduced a trap composed of 148 places in 225 ms of which 2 ms to minimize.
[2024-06-01 15:01:40] [INFO ] Deduced a trap composed of 69 places in 160 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/1203 variables, and 63 constraints, problems are : Problem set: 66 solved, 759 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/388 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/825 constraints, Known Traps: 20/20 constraints]
After SMT, in 40941ms problems are : Problem set: 66 solved, 759 unsolved
Search for dead transitions found 66 dead transitions in 40950ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
[2024-06-01 15:01:45] [INFO ] Flow matrix only has 749 transitions (discarded 12 similar events)
// Phase 1: matrix 749 rows 388 cols
[2024-06-01 15:01:45] [INFO ] Computed 43 invariants in 16 ms
[2024-06-01 15:01:46] [INFO ] Implicit Places using invariants in 437 ms returned [223]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 439 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 387/529 places, 761/968 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 373 transition count 737
Applied a total of 12 rules in 14 ms. Remains 373 /387 variables (removed 14) and now considering 737/761 (removed 24) transitions.
[2024-06-01 15:01:46] [INFO ] Flow matrix only has 725 transitions (discarded 12 similar events)
// Phase 1: matrix 725 rows 373 cols
[2024-06-01 15:01:46] [INFO ] Computed 42 invariants in 7 ms
[2024-06-01 15:01:46] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-06-01 15:01:46] [INFO ] Flow matrix only has 725 transitions (discarded 12 similar events)
[2024-06-01 15:01:46] [INFO ] Invariant cache hit.
[2024-06-01 15:01:46] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 15:01:51] [INFO ] Implicit Places using invariants and state equation in 5251 ms returned []
Implicit Place search using SMT with State Equation took 5570 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 373/529 places, 737/968 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 47020 ms. Remains : 373/529 places, 737/968 transitions.
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-03
Product exploration explored 100000 steps with 5737 reset in 487 ms.
Product exploration explored 100000 steps with 5751 reset in 384 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 134 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 332 steps (0 resets) in 6 ms. (47 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 189 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-06-01 15:01:53] [INFO ] Flow matrix only has 725 transitions (discarded 12 similar events)
[2024-06-01 15:01:53] [INFO ] Invariant cache hit.
[2024-06-01 15:01:53] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-06-01 15:01:53] [INFO ] [Real]Absence check using 16 positive and 26 generalized place invariants in 46 ms returned sat
[2024-06-01 15:01:54] [INFO ] [Real]Absence check using state equation in 1044 ms returned sat
[2024-06-01 15:01:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:01:55] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-06-01 15:01:55] [INFO ] [Nat]Absence check using 16 positive and 26 generalized place invariants in 47 ms returned sat
[2024-06-01 15:01:56] [INFO ] [Nat]Absence check using state equation in 776 ms returned sat
[2024-06-01 15:01:56] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 15:01:56] [INFO ] [Nat]Added 72 Read/Feed constraints in 147 ms returned sat
[2024-06-01 15:01:56] [INFO ] Deduced a trap composed of 195 places in 193 ms of which 3 ms to minimize.
[2024-06-01 15:01:56] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:01:56] [INFO ] Deduced a trap composed of 48 places in 211 ms of which 3 ms to minimize.
[2024-06-01 15:01:57] [INFO ] Deduced a trap composed of 49 places in 220 ms of which 3 ms to minimize.
[2024-06-01 15:01:57] [INFO ] Deduced a trap composed of 48 places in 162 ms of which 3 ms to minimize.
[2024-06-01 15:01:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1310 ms
[2024-06-01 15:01:57] [INFO ] Computed and/alt/rep : 465/2052/459 causal constraints (skipped 264 transitions) in 67 ms.
[2024-06-01 15:02:01] [INFO ] Added : 307 causal constraints over 62 iterations in 3740 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 19 out of 373 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 737/737 transitions.
Applied a total of 0 rules in 6 ms. Remains 373 /373 variables (removed 0) and now considering 737/737 (removed 0) transitions.
Running 735 sub problems to find dead transitions.
[2024-06-01 15:02:01] [INFO ] Flow matrix only has 725 transitions (discarded 12 similar events)
[2024-06-01 15:02:01] [INFO ] Invariant cache hit.
[2024-06-01 15:02:01] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-06-01 15:02:06] [INFO ] Deduced a trap composed of 122 places in 94 ms of which 2 ms to minimize.
[2024-06-01 15:02:06] [INFO ] Deduced a trap composed of 112 places in 84 ms of which 2 ms to minimize.
[2024-06-01 15:02:06] [INFO ] Deduced a trap composed of 123 places in 80 ms of which 1 ms to minimize.
[2024-06-01 15:02:06] [INFO ] Deduced a trap composed of 117 places in 68 ms of which 2 ms to minimize.
[2024-06-01 15:02:06] [INFO ] Deduced a trap composed of 112 places in 85 ms of which 2 ms to minimize.
[2024-06-01 15:02:07] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-06-01 15:02:07] [INFO ] Deduced a trap composed of 123 places in 90 ms of which 1 ms to minimize.
[2024-06-01 15:02:08] [INFO ] Deduced a trap composed of 112 places in 102 ms of which 1 ms to minimize.
[2024-06-01 15:02:08] [INFO ] Deduced a trap composed of 123 places in 101 ms of which 2 ms to minimize.
[2024-06-01 15:02:08] [INFO ] Deduced a trap composed of 123 places in 77 ms of which 1 ms to minimize.
[2024-06-01 15:02:09] [INFO ] Deduced a trap composed of 123 places in 117 ms of which 2 ms to minimize.
[2024-06-01 15:02:09] [INFO ] Deduced a trap composed of 140 places in 85 ms of which 1 ms to minimize.
[2024-06-01 15:02:11] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 2 ms to minimize.
[2024-06-01 15:02:11] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-06-01 15:02:14] [INFO ] Deduced a trap composed of 112 places in 69 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 371/1098 variables, and 48 constraints, problems are : Problem set: 0 solved, 735 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/373 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 735 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 15/48 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-06-01 15:02:24] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:02:24] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 2 ms to minimize.
[2024-06-01 15:02:24] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:02:24] [INFO ] Deduced a trap composed of 48 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:02:24] [INFO ] Deduced a trap composed of 49 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 5 (OVERLAPS) 1/372 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-06-01 15:02:38] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:02:39] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/1098 variables, and 56 constraints, problems are : Problem set: 0 solved, 735 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/373 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/735 constraints, Known Traps: 22/22 constraints]
After SMT, in 40777ms problems are : Problem set: 0 solved, 735 unsolved
Search for dead transitions found 0 dead transitions in 40786ms
[2024-06-01 15:02:42] [INFO ] Flow matrix only has 725 transitions (discarded 12 similar events)
[2024-06-01 15:02:42] [INFO ] Invariant cache hit.
[2024-06-01 15:02:42] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-06-01 15:02:42] [INFO ] Flow matrix only has 725 transitions (discarded 12 similar events)
[2024-06-01 15:02:42] [INFO ] Invariant cache hit.
[2024-06-01 15:02:42] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 15:02:48] [INFO ] Implicit Places using invariants and state equation in 5729 ms returned []
Implicit Place search using SMT with State Equation took 6083 ms to find 0 implicit places.
Running 735 sub problems to find dead transitions.
[2024-06-01 15:02:48] [INFO ] Flow matrix only has 725 transitions (discarded 12 similar events)
[2024-06-01 15:02:48] [INFO ] Invariant cache hit.
[2024-06-01 15:02:48] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-06-01 15:02:52] [INFO ] Deduced a trap composed of 122 places in 65 ms of which 2 ms to minimize.
[2024-06-01 15:02:53] [INFO ] Deduced a trap composed of 112 places in 66 ms of which 2 ms to minimize.
[2024-06-01 15:02:53] [INFO ] Deduced a trap composed of 123 places in 66 ms of which 2 ms to minimize.
[2024-06-01 15:02:53] [INFO ] Deduced a trap composed of 117 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:02:53] [INFO ] Deduced a trap composed of 112 places in 84 ms of which 2 ms to minimize.
[2024-06-01 15:02:53] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:02:54] [INFO ] Deduced a trap composed of 123 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:02:54] [INFO ] Deduced a trap composed of 112 places in 85 ms of which 1 ms to minimize.
[2024-06-01 15:02:55] [INFO ] Deduced a trap composed of 123 places in 77 ms of which 2 ms to minimize.
[2024-06-01 15:02:55] [INFO ] Deduced a trap composed of 123 places in 86 ms of which 1 ms to minimize.
[2024-06-01 15:02:56] [INFO ] Deduced a trap composed of 123 places in 82 ms of which 2 ms to minimize.
[2024-06-01 15:02:56] [INFO ] Deduced a trap composed of 140 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:02:57] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 2 ms to minimize.
[2024-06-01 15:02:57] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-06-01 15:03:00] [INFO ] Deduced a trap composed of 112 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 5 (OVERLAPS) 1/372 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-06-01 15:03:13] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 2 ms to minimize.
[2024-06-01 15:03:13] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:03:13] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-06-01 15:03:13] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:03:14] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 1 ms to minimize.
[2024-06-01 15:03:14] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 1 ms to minimize.
[2024-06-01 15:03:15] [INFO ] Deduced a trap composed of 54 places in 120 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 372/1098 variables, and 56 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/373 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 735 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 15/48 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-06-01 15:03:21] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:03:21] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 2 ms to minimize.
[2024-06-01 15:03:21] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:03:21] [INFO ] Deduced a trap composed of 48 places in 25 ms of which 0 ms to minimize.
[2024-06-01 15:03:21] [INFO ] Deduced a trap composed of 49 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 5 (OVERLAPS) 1/372 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 8 (OVERLAPS) 1/373 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-06-01 15:03:42] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2024-06-01 15:03:42] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:03:42] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:03:42] [INFO ] Deduced a trap composed of 119 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:03:42] [INFO ] Deduced a trap composed of 142 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:03:42] [INFO ] Deduced a trap composed of 171 places in 143 ms of which 2 ms to minimize.
[2024-06-01 15:03:43] [INFO ] Deduced a trap composed of 173 places in 187 ms of which 2 ms to minimize.
[2024-06-01 15:03:44] [INFO ] Deduced a trap composed of 84 places in 185 ms of which 2 ms to minimize.
[2024-06-01 15:03:44] [INFO ] Deduced a trap composed of 74 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:03:44] [INFO ] Deduced a trap composed of 89 places in 148 ms of which 2 ms to minimize.
[2024-06-01 15:03:44] [INFO ] Deduced a trap composed of 136 places in 176 ms of which 2 ms to minimize.
[2024-06-01 15:03:45] [INFO ] Deduced a trap composed of 74 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:03:45] [INFO ] Deduced a trap composed of 98 places in 207 ms of which 2 ms to minimize.
[2024-06-01 15:03:45] [INFO ] Deduced a trap composed of 89 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:03:46] [INFO ] Deduced a trap composed of 134 places in 198 ms of which 3 ms to minimize.
[2024-06-01 15:03:46] [INFO ] Deduced a trap composed of 183 places in 183 ms of which 3 ms to minimize.
[2024-06-01 15:03:46] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 3 ms to minimize.
[2024-06-01 15:03:46] [INFO ] Deduced a trap composed of 121 places in 168 ms of which 3 ms to minimize.
[2024-06-01 15:03:47] [INFO ] Deduced a trap composed of 59 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:03:47] [INFO ] Deduced a trap composed of 159 places in 173 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/1098 variables, and 89 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/373 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/735 constraints, Known Traps: 47/47 constraints]
After SMT, in 60754ms problems are : Problem set: 0 solved, 735 unsolved
Search for dead transitions found 0 dead transitions in 60760ms
Finished structural reductions in LTL mode , in 1 iterations and 107641 ms. Remains : 373/373 places, 737/737 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 101 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 169 steps (0 resets) in 6 ms. (24 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 198 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-06-01 15:03:49] [INFO ] Flow matrix only has 725 transitions (discarded 12 similar events)
[2024-06-01 15:03:49] [INFO ] Invariant cache hit.
[2024-06-01 15:03:49] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-06-01 15:03:49] [INFO ] [Real]Absence check using 16 positive and 26 generalized place invariants in 48 ms returned sat
[2024-06-01 15:03:50] [INFO ] [Real]Absence check using state equation in 985 ms returned sat
[2024-06-01 15:03:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:03:51] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-06-01 15:03:51] [INFO ] [Nat]Absence check using 16 positive and 26 generalized place invariants in 47 ms returned sat
[2024-06-01 15:03:51] [INFO ] [Nat]Absence check using state equation in 785 ms returned sat
[2024-06-01 15:03:51] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 15:03:52] [INFO ] [Nat]Added 72 Read/Feed constraints in 131 ms returned sat
[2024-06-01 15:03:52] [INFO ] Deduced a trap composed of 195 places in 157 ms of which 3 ms to minimize.
[2024-06-01 15:03:52] [INFO ] Deduced a trap composed of 48 places in 174 ms of which 3 ms to minimize.
[2024-06-01 15:03:52] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 3 ms to minimize.
[2024-06-01 15:03:52] [INFO ] Deduced a trap composed of 49 places in 163 ms of which 3 ms to minimize.
[2024-06-01 15:03:53] [INFO ] Deduced a trap composed of 48 places in 199 ms of which 2 ms to minimize.
[2024-06-01 15:03:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1152 ms
[2024-06-01 15:03:53] [INFO ] Computed and/alt/rep : 465/2052/459 causal constraints (skipped 264 transitions) in 44 ms.
[2024-06-01 15:03:56] [INFO ] Added : 307 causal constraints over 62 iterations in 3797 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 5747 reset in 484 ms.
Product exploration explored 100000 steps with 5739 reset in 515 ms.
Support contains 19 out of 373 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 737/737 transitions.
Applied a total of 0 rules in 6 ms. Remains 373 /373 variables (removed 0) and now considering 737/737 (removed 0) transitions.
Running 735 sub problems to find dead transitions.
[2024-06-01 15:03:58] [INFO ] Flow matrix only has 725 transitions (discarded 12 similar events)
[2024-06-01 15:03:58] [INFO ] Invariant cache hit.
[2024-06-01 15:03:58] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-06-01 15:04:03] [INFO ] Deduced a trap composed of 122 places in 104 ms of which 2 ms to minimize.
[2024-06-01 15:04:03] [INFO ] Deduced a trap composed of 112 places in 82 ms of which 2 ms to minimize.
[2024-06-01 15:04:03] [INFO ] Deduced a trap composed of 123 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:04:04] [INFO ] Deduced a trap composed of 117 places in 70 ms of which 2 ms to minimize.
[2024-06-01 15:04:04] [INFO ] Deduced a trap composed of 112 places in 81 ms of which 1 ms to minimize.
[2024-06-01 15:04:04] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:04:05] [INFO ] Deduced a trap composed of 123 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:04:05] [INFO ] Deduced a trap composed of 112 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:04:06] [INFO ] Deduced a trap composed of 123 places in 98 ms of which 2 ms to minimize.
[2024-06-01 15:04:06] [INFO ] Deduced a trap composed of 123 places in 75 ms of which 2 ms to minimize.
[2024-06-01 15:04:07] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 1 ms to minimize.
[2024-06-01 15:04:07] [INFO ] Deduced a trap composed of 140 places in 97 ms of which 2 ms to minimize.
[2024-06-01 15:04:08] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:04:08] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-06-01 15:04:11] [INFO ] Deduced a trap composed of 112 places in 97 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 371/1098 variables, and 48 constraints, problems are : Problem set: 0 solved, 735 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/373 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 735 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 15/48 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-06-01 15:04:21] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 2 ms to minimize.
[2024-06-01 15:04:21] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
[2024-06-01 15:04:21] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:04:21] [INFO ] Deduced a trap composed of 48 places in 31 ms of which 0 ms to minimize.
[2024-06-01 15:04:21] [INFO ] Deduced a trap composed of 49 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 5 (OVERLAPS) 1/372 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-06-01 15:04:34] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-06-01 15:04:35] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-06-01 15:04:38] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/1098 variables, and 57 constraints, problems are : Problem set: 0 solved, 735 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/373 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/735 constraints, Known Traps: 23/23 constraints]
After SMT, in 40826ms problems are : Problem set: 0 solved, 735 unsolved
Search for dead transitions found 0 dead transitions in 40838ms
[2024-06-01 15:04:39] [INFO ] Flow matrix only has 725 transitions (discarded 12 similar events)
[2024-06-01 15:04:39] [INFO ] Invariant cache hit.
[2024-06-01 15:04:39] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-06-01 15:04:39] [INFO ] Flow matrix only has 725 transitions (discarded 12 similar events)
[2024-06-01 15:04:39] [INFO ] Invariant cache hit.
[2024-06-01 15:04:39] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 15:04:44] [INFO ] Implicit Places using invariants and state equation in 5576 ms returned []
Implicit Place search using SMT with State Equation took 5909 ms to find 0 implicit places.
Running 735 sub problems to find dead transitions.
[2024-06-01 15:04:44] [INFO ] Flow matrix only has 725 transitions (discarded 12 similar events)
[2024-06-01 15:04:44] [INFO ] Invariant cache hit.
[2024-06-01 15:04:44] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-06-01 15:04:49] [INFO ] Deduced a trap composed of 122 places in 105 ms of which 2 ms to minimize.
[2024-06-01 15:04:49] [INFO ] Deduced a trap composed of 112 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:04:49] [INFO ] Deduced a trap composed of 123 places in 81 ms of which 2 ms to minimize.
[2024-06-01 15:04:50] [INFO ] Deduced a trap composed of 117 places in 105 ms of which 1 ms to minimize.
[2024-06-01 15:04:50] [INFO ] Deduced a trap composed of 112 places in 99 ms of which 2 ms to minimize.
[2024-06-01 15:04:50] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 1 ms to minimize.
[2024-06-01 15:04:51] [INFO ] Deduced a trap composed of 123 places in 98 ms of which 2 ms to minimize.
[2024-06-01 15:04:51] [INFO ] Deduced a trap composed of 112 places in 107 ms of which 2 ms to minimize.
[2024-06-01 15:04:52] [INFO ] Deduced a trap composed of 123 places in 77 ms of which 1 ms to minimize.
[2024-06-01 15:04:52] [INFO ] Deduced a trap composed of 123 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:04:53] [INFO ] Deduced a trap composed of 123 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:04:53] [INFO ] Deduced a trap composed of 140 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:04:54] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2024-06-01 15:04:54] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-06-01 15:04:57] [INFO ] Deduced a trap composed of 112 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 5 (OVERLAPS) 1/372 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-06-01 15:05:08] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-06-01 15:05:08] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 1 ms to minimize.
[2024-06-01 15:05:08] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-06-01 15:05:08] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 2 ms to minimize.
[2024-06-01 15:05:09] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 1 ms to minimize.
[2024-06-01 15:05:09] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:05:10] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 2.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 9.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 (/ 1.0 20.0))
(s67 1.0)
(s68 2.0)
(s69 1.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 (/ 1.0 2.0))
(s100 0.0)
(s101 1.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 (/ 9.0 20.0))
(s112 1.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 372/1098 variables, and 56 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/373 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 735 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 15/48 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-06-01 15:05:17] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:05:17] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 1 ms to minimize.
[2024-06-01 15:05:17] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:05:17] [INFO ] Deduced a trap composed of 48 places in 25 ms of which 0 ms to minimize.
[2024-06-01 15:05:18] [INFO ] Deduced a trap composed of 49 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 5 (OVERLAPS) 1/372 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 8 (OVERLAPS) 1/373 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 735 unsolved
[2024-06-01 15:05:37] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:05:37] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 0 ms to minimize.
[2024-06-01 15:05:37] [INFO ] Deduced a trap composed of 48 places in 32 ms of which 0 ms to minimize.
[2024-06-01 15:05:37] [INFO ] Deduced a trap composed of 119 places in 138 ms of which 2 ms to minimize.
[2024-06-01 15:05:37] [INFO ] Deduced a trap composed of 142 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:05:37] [INFO ] Deduced a trap composed of 171 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:05:38] [INFO ] Deduced a trap composed of 173 places in 129 ms of which 2 ms to minimize.
[2024-06-01 15:05:38] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:05:38] [INFO ] Deduced a trap composed of 74 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:05:38] [INFO ] Deduced a trap composed of 89 places in 147 ms of which 3 ms to minimize.
[2024-06-01 15:05:39] [INFO ] Deduced a trap composed of 136 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:05:39] [INFO ] Deduced a trap composed of 74 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:05:39] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 3 ms to minimize.
[2024-06-01 15:05:39] [INFO ] Deduced a trap composed of 89 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:05:40] [INFO ] Deduced a trap composed of 134 places in 226 ms of which 3 ms to minimize.
[2024-06-01 15:05:40] [INFO ] Deduced a trap composed of 183 places in 194 ms of which 3 ms to minimize.
[2024-06-01 15:05:40] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:05:40] [INFO ] Deduced a trap composed of 121 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:05:41] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 1 ms to minimize.
[2024-06-01 15:05:41] [INFO ] Deduced a trap composed of 159 places in 175 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/1098 variables, and 89 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/373 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/735 constraints, Known Traps: 47/47 constraints]
After SMT, in 60679ms problems are : Problem set: 0 solved, 735 unsolved
Search for dead transitions found 0 dead transitions in 60686ms
Finished structural reductions in LTL mode , in 1 iterations and 107445 ms. Remains : 373/373 places, 737/737 transitions.
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-03 finished in 281157 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)))'
Found a Shortening insensitive property : PolyORBLF-PT-S02J06T06-LTLFireability-06
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 12 out of 529 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 529/529 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 529 transition count 914
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 475 transition count 914
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 475 transition count 854
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 415 transition count 854
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 231 place count 412 transition count 851
Iterating global reduction 2 with 3 rules applied. Total rules applied 234 place count 412 transition count 851
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 306 place count 376 transition count 815
Applied a total of 306 rules in 32 ms. Remains 376 /529 variables (removed 153) and now considering 815/968 (removed 153) transitions.
Running 813 sub problems to find dead transitions.
[2024-06-01 15:05:45] [INFO ] Flow matrix only has 803 transitions (discarded 12 similar events)
// Phase 1: matrix 803 rows 376 cols
[2024-06-01 15:05:45] [INFO ] Computed 43 invariants in 8 ms
[2024-06-01 15:05:45] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 25/41 constraints. Problems are: Problem set: 0 solved, 813 unsolved
[2024-06-01 15:05:51] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2024-06-01 15:05:51] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 0 ms to minimize.
[2024-06-01 15:05:51] [INFO ] Deduced a trap composed of 48 places in 25 ms of which 0 ms to minimize.
[2024-06-01 15:05:51] [INFO ] Deduced a trap composed of 49 places in 25 ms of which 1 ms to minimize.
[2024-06-01 15:05:51] [INFO ] Deduced a trap composed of 48 places in 27 ms of which 0 ms to minimize.
[2024-06-01 15:05:51] [INFO ] Deduced a trap composed of 49 places in 28 ms of which 1 ms to minimize.
[2024-06-01 15:05:51] [INFO ] Deduced a trap composed of 140 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:05:52] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:05:52] [INFO ] Deduced a trap composed of 149 places in 140 ms of which 2 ms to minimize.
[2024-06-01 15:05:52] [INFO ] Deduced a trap composed of 48 places in 25 ms of which 0 ms to minimize.
[2024-06-01 15:05:52] [INFO ] Deduced a trap composed of 186 places in 135 ms of which 2 ms to minimize.
[2024-06-01 15:05:52] [INFO ] Deduced a trap composed of 132 places in 143 ms of which 2 ms to minimize.
[2024-06-01 15:05:53] [INFO ] Deduced a trap composed of 140 places in 149 ms of which 2 ms to minimize.
[2024-06-01 15:05:53] [INFO ] Deduced a trap composed of 56 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:05:53] [INFO ] Deduced a trap composed of 73 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:05:54] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:05:58] [INFO ] Deduced a trap composed of 148 places in 221 ms of which 2 ms to minimize.
[2024-06-01 15:05:59] [INFO ] Deduced a trap composed of 210 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:05:59] [INFO ] Deduced a trap composed of 205 places in 151 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 813 unsolved
[2024-06-01 15:06:02] [INFO ] Deduced a trap composed of 146 places in 148 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/374 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 813 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 374/1179 variables, and 61 constraints, problems are : Problem set: 0 solved, 813 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/376 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 813/813 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 813 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 25/41 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 813 unsolved
[2024-06-01 15:06:12] [INFO ] Deduced a trap composed of 243 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:06:17] [INFO ] Deduced a trap composed of 236 places in 159 ms of which 2 ms to minimize.
[2024-06-01 15:06:18] [INFO ] Deduced a trap composed of 167 places in 161 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/374 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 813 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/1179 variables, and 64 constraints, problems are : Problem set: 0 solved, 813 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/376 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/813 constraints, Known Traps: 23/23 constraints]
After SMT, in 41130ms problems are : Problem set: 0 solved, 813 unsolved
Search for dead transitions found 0 dead transitions in 41137ms
[2024-06-01 15:06:27] [INFO ] Flow matrix only has 803 transitions (discarded 12 similar events)
[2024-06-01 15:06:27] [INFO ] Invariant cache hit.
[2024-06-01 15:06:27] [INFO ] Implicit Places using invariants in 337 ms returned [217]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 338 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 375/529 places, 815/968 transitions.
Applied a total of 0 rules in 6 ms. Remains 375 /375 variables (removed 0) and now considering 815/815 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 41516 ms. Remains : 375/529 places, 815/968 transitions.
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-06
Product exploration explored 100000 steps with 2643 reset in 347 ms.
Product exploration explored 100000 steps with 2635 reset in 367 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 151 steps (0 resets) in 4 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:06:28] [INFO ] Flow matrix only has 803 transitions (discarded 12 similar events)
// Phase 1: matrix 803 rows 375 cols
[2024-06-01 15:06:28] [INFO ] Computed 42 invariants in 10 ms
[2024-06-01 15:06:28] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-06-01 15:06:28] [INFO ] [Real]Absence check using 17 positive and 25 generalized place invariants in 39 ms returned sat
[2024-06-01 15:06:29] [INFO ] [Real]Absence check using state equation in 774 ms returned sat
[2024-06-01 15:06:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:06:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-06-01 15:06:29] [INFO ] [Nat]Absence check using 17 positive and 25 generalized place invariants in 26 ms returned sat
[2024-06-01 15:06:31] [INFO ] [Nat]Absence check using state equation in 1994 ms returned sat
[2024-06-01 15:06:31] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 15:06:32] [INFO ] [Nat]Added 72 Read/Feed constraints in 443 ms returned sat
[2024-06-01 15:06:32] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 2 ms to minimize.
[2024-06-01 15:06:33] [INFO ] Deduced a trap composed of 52 places in 192 ms of which 2 ms to minimize.
[2024-06-01 15:06:34] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:06:35] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:06:36] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:06:37] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:06:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 5112 ms
[2024-06-01 15:06:37] [INFO ] Computed and/alt/rep : 429/1932/423 causal constraints (skipped 378 transitions) in 54 ms.
[2024-06-01 15:06:40] [INFO ] Added : 104 causal constraints over 21 iterations in 2510 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 12 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 815/815 transitions.
Applied a total of 0 rules in 19 ms. Remains 375 /375 variables (removed 0) and now considering 815/815 (removed 0) transitions.
Running 813 sub problems to find dead transitions.
[2024-06-01 15:06:40] [INFO ] Flow matrix only has 803 transitions (discarded 12 similar events)
[2024-06-01 15:06:40] [INFO ] Invariant cache hit.
[2024-06-01 15:06:40] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/373 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 813 unsolved
[2024-06-01 15:06:45] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 2 ms to minimize.
[2024-06-01 15:06:45] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:06:45] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:06:45] [INFO ] Deduced a trap composed of 133 places in 128 ms of which 2 ms to minimize.
[2024-06-01 15:06:46] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 1 ms to minimize.
[2024-06-01 15:06:46] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 1 ms to minimize.
[2024-06-01 15:06:46] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:06:47] [INFO ] Deduced a trap composed of 118 places in 104 ms of which 2 ms to minimize.
[2024-06-01 15:06:50] [INFO ] Deduced a trap composed of 136 places in 101 ms of which 2 ms to minimize.
[2024-06-01 15:06:50] [INFO ] Deduced a trap composed of 132 places in 102 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 813 unsolved
SMT process timed out in 21009ms, After SMT, problems are : Problem set: 0 solved, 813 unsolved
Search for dead transitions found 0 dead transitions in 21021ms
[2024-06-01 15:07:01] [INFO ] Flow matrix only has 803 transitions (discarded 12 similar events)
[2024-06-01 15:07:01] [INFO ] Invariant cache hit.
[2024-06-01 15:07:01] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-06-01 15:07:01] [INFO ] Flow matrix only has 803 transitions (discarded 12 similar events)
[2024-06-01 15:07:01] [INFO ] Invariant cache hit.
[2024-06-01 15:07:01] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 15:07:04] [INFO ] Implicit Places using invariants and state equation in 3413 ms returned []
Implicit Place search using SMT with State Equation took 3726 ms to find 0 implicit places.
[2024-06-01 15:07:04] [INFO ] Redundant transitions in 9 ms returned []
Running 813 sub problems to find dead transitions.
[2024-06-01 15:07:04] [INFO ] Flow matrix only has 803 transitions (discarded 12 similar events)
[2024-06-01 15:07:04] [INFO ] Invariant cache hit.
[2024-06-01 15:07:04] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/373 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 813 unsolved
[2024-06-01 15:07:09] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 1 ms to minimize.
[2024-06-01 15:07:09] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2024-06-01 15:07:09] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:07:09] [INFO ] Deduced a trap composed of 133 places in 100 ms of which 1 ms to minimize.
[2024-06-01 15:07:10] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 2 ms to minimize.
[2024-06-01 15:07:10] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 1 ms to minimize.
[2024-06-01 15:07:10] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:07:11] [INFO ] Deduced a trap composed of 118 places in 90 ms of which 1 ms to minimize.
[2024-06-01 15:07:14] [INFO ] Deduced a trap composed of 136 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:07:14] [INFO ] Deduced a trap composed of 132 places in 132 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 813 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/375 variables, 3/52 constraints. Problems are: Problem set: 66 solved, 747 unsolved
[2024-06-01 15:07:26] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 2 ms to minimize.
[2024-06-01 15:07:26] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 0 ms to minimize.
[2024-06-01 15:07:26] [INFO ] Deduced a trap composed of 48 places in 27 ms of which 1 ms to minimize.
[2024-06-01 15:07:26] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:07:26] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:07:26] [INFO ] Deduced a trap composed of 48 places in 30 ms of which 1 ms to minimize.
[2024-06-01 15:07:27] [INFO ] Deduced a trap composed of 66 places in 202 ms of which 3 ms to minimize.
[2024-06-01 15:07:27] [INFO ] Deduced a trap composed of 151 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:07:27] [INFO ] Deduced a trap composed of 161 places in 164 ms of which 3 ms to minimize.
[2024-06-01 15:07:28] [INFO ] Deduced a trap composed of 52 places in 174 ms of which 2 ms to minimize.
[2024-06-01 15:07:29] [INFO ] Deduced a trap composed of 168 places in 192 ms of which 3 ms to minimize.
[2024-06-01 15:07:29] [INFO ] Deduced a trap composed of 143 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:07:29] [INFO ] Deduced a trap composed of 74 places in 176 ms of which 3 ms to minimize.
[2024-06-01 15:07:31] [INFO ] Deduced a trap composed of 72 places in 162 ms of which 3 ms to minimize.
[2024-06-01 15:07:33] [INFO ] Deduced a trap composed of 130 places in 162 ms of which 3 ms to minimize.
[2024-06-01 15:07:33] [INFO ] Deduced a trap composed of 135 places in 128 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 16/68 constraints. Problems are: Problem set: 66 solved, 747 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 375/1178 variables, and 68 constraints, problems are : Problem set: 66 solved, 747 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/375 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 813/813 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 66 solved, 747 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 17/17 constraints. Problems are: Problem set: 66 solved, 747 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/373 variables, 22/39 constraints. Problems are: Problem set: 66 solved, 747 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 21/60 constraints. Problems are: Problem set: 66 solved, 747 unsolved
[2024-06-01 15:07:39] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 1/61 constraints. Problems are: Problem set: 66 solved, 747 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/61 constraints. Problems are: Problem set: 66 solved, 747 unsolved
At refinement iteration 5 (OVERLAPS) 2/375 variables, 3/64 constraints. Problems are: Problem set: 66 solved, 747 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 5/69 constraints. Problems are: Problem set: 66 solved, 747 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/1178 variables, and 69 constraints, problems are : Problem set: 66 solved, 747 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/375 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/813 constraints, Known Traps: 27/27 constraints]
After SMT, in 60912ms problems are : Problem set: 66 solved, 747 unsolved
Search for dead transitions found 66 dead transitions in 60919ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 375/375 places, 749/815 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 361 transition count 725
Applied a total of 12 rules in 26 ms. Remains 361 /375 variables (removed 14) and now considering 725/749 (removed 24) transitions.
[2024-06-01 15:08:05] [INFO ] Flow matrix only has 713 transitions (discarded 12 similar events)
// Phase 1: matrix 713 rows 361 cols
[2024-06-01 15:08:05] [INFO ] Computed 42 invariants in 11 ms
[2024-06-01 15:08:06] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-06-01 15:08:06] [INFO ] Flow matrix only has 713 transitions (discarded 12 similar events)
[2024-06-01 15:08:06] [INFO ] Invariant cache hit.
[2024-06-01 15:08:06] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 15:08:10] [INFO ] Implicit Places using invariants and state equation in 4694 ms returned []
Implicit Place search using SMT with State Equation took 5119 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 361/375 places, 725/815 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 90848 ms. Remains : 361/375 places, 725/815 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 157 steps (0 resets) in 5 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:08:11] [INFO ] Flow matrix only has 713 transitions (discarded 12 similar events)
[2024-06-01 15:08:11] [INFO ] Invariant cache hit.
[2024-06-01 15:08:11] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
[2024-06-01 15:08:11] [INFO ] [Real]Absence check using 18 positive and 24 generalized place invariants in 54 ms returned sat
[2024-06-01 15:08:12] [INFO ] [Real]Absence check using state equation in 1061 ms returned sat
[2024-06-01 15:08:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:08:13] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2024-06-01 15:08:13] [INFO ] [Nat]Absence check using 18 positive and 24 generalized place invariants in 20 ms returned sat
[2024-06-01 15:08:13] [INFO ] [Nat]Absence check using state equation in 765 ms returned sat
[2024-06-01 15:08:13] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 15:08:13] [INFO ] [Nat]Added 72 Read/Feed constraints in 61 ms returned sat
[2024-06-01 15:08:14] [INFO ] Deduced a trap composed of 46 places in 199 ms of which 3 ms to minimize.
[2024-06-01 15:08:14] [INFO ] Deduced a trap composed of 55 places in 151 ms of which 3 ms to minimize.
[2024-06-01 15:08:14] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 3 ms to minimize.
[2024-06-01 15:08:14] [INFO ] Deduced a trap composed of 47 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:08:15] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:08:15] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:08:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1449 ms
[2024-06-01 15:08:15] [INFO ] Computed and/alt/rep : 441/1956/435 causal constraints (skipped 276 transitions) in 54 ms.
[2024-06-01 15:08:18] [INFO ] Added : 298 causal constraints over 60 iterations in 3681 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2632 reset in 435 ms.
Product exploration explored 100000 steps with 2630 reset in 480 ms.
Support contains 12 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 725/725 transitions.
Applied a total of 0 rules in 17 ms. Remains 361 /361 variables (removed 0) and now considering 725/725 (removed 0) transitions.
Running 723 sub problems to find dead transitions.
[2024-06-01 15:08:20] [INFO ] Flow matrix only has 713 transitions (discarded 12 similar events)
[2024-06-01 15:08:20] [INFO ] Invariant cache hit.
[2024-06-01 15:08:20] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-01 15:08:25] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 2 ms to minimize.
[2024-06-01 15:08:25] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 0 ms to minimize.
[2024-06-01 15:08:25] [INFO ] Deduced a trap composed of 178 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:08:25] [INFO ] Deduced a trap composed of 46 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:08:25] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:08:25] [INFO ] Deduced a trap composed of 175 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:08:26] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:08:26] [INFO ] Deduced a trap composed of 163 places in 150 ms of which 3 ms to minimize.
[2024-06-01 15:08:26] [INFO ] Deduced a trap composed of 155 places in 146 ms of which 3 ms to minimize.
[2024-06-01 15:08:26] [INFO ] Deduced a trap composed of 154 places in 135 ms of which 2 ms to minimize.
[2024-06-01 15:08:26] [INFO ] Deduced a trap composed of 47 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:08:26] [INFO ] Deduced a trap composed of 150 places in 117 ms of which 2 ms to minimize.
[2024-06-01 15:08:26] [INFO ] Deduced a trap composed of 55 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:08:27] [INFO ] Deduced a trap composed of 46 places in 27 ms of which 0 ms to minimize.
[2024-06-01 15:08:27] [INFO ] Deduced a trap composed of 112 places in 143 ms of which 2 ms to minimize.
[2024-06-01 15:08:27] [INFO ] Deduced a trap composed of 112 places in 118 ms of which 2 ms to minimize.
[2024-06-01 15:08:27] [INFO ] Deduced a trap composed of 191 places in 118 ms of which 2 ms to minimize.
[2024-06-01 15:08:27] [INFO ] Deduced a trap composed of 170 places in 113 ms of which 2 ms to minimize.
[2024-06-01 15:08:27] [INFO ] Deduced a trap composed of 118 places in 116 ms of which 2 ms to minimize.
[2024-06-01 15:08:27] [INFO ] Deduced a trap composed of 122 places in 121 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-01 15:08:28] [INFO ] Deduced a trap composed of 150 places in 113 ms of which 2 ms to minimize.
[2024-06-01 15:08:28] [INFO ] Deduced a trap composed of 230 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:08:28] [INFO ] Deduced a trap composed of 211 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:08:28] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:08:29] [INFO ] Deduced a trap composed of 143 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:08:29] [INFO ] Deduced a trap composed of 146 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:08:29] [INFO ] Deduced a trap composed of 112 places in 113 ms of which 2 ms to minimize.
[2024-06-01 15:08:29] [INFO ] Deduced a trap composed of 112 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:08:29] [INFO ] Deduced a trap composed of 158 places in 115 ms of which 2 ms to minimize.
[2024-06-01 15:08:29] [INFO ] Deduced a trap composed of 176 places in 148 ms of which 3 ms to minimize.
[2024-06-01 15:08:30] [INFO ] Deduced a trap composed of 180 places in 143 ms of which 3 ms to minimize.
[2024-06-01 15:08:30] [INFO ] Deduced a trap composed of 183 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:08:30] [INFO ] Deduced a trap composed of 118 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:08:30] [INFO ] Deduced a trap composed of 153 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:08:30] [INFO ] Deduced a trap composed of 183 places in 123 ms of which 1 ms to minimize.
[2024-06-01 15:08:30] [INFO ] Deduced a trap composed of 112 places in 162 ms of which 3 ms to minimize.
[2024-06-01 15:08:31] [INFO ] Deduced a trap composed of 204 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:08:31] [INFO ] Deduced a trap composed of 206 places in 143 ms of which 3 ms to minimize.
[2024-06-01 15:08:31] [INFO ] Deduced a trap composed of 199 places in 156 ms of which 3 ms to minimize.
[2024-06-01 15:08:31] [INFO ] Deduced a trap composed of 204 places in 140 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-01 15:08:37] [INFO ] Deduced a trap composed of 186 places in 135 ms of which 2 ms to minimize.
[2024-06-01 15:08:37] [INFO ] Deduced a trap composed of 165 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:08:38] [INFO ] Deduced a trap composed of 193 places in 179 ms of which 3 ms to minimize.
[2024-06-01 15:08:38] [INFO ] Deduced a trap composed of 175 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:08:38] [INFO ] Deduced a trap composed of 124 places in 175 ms of which 2 ms to minimize.
[2024-06-01 15:08:39] [INFO ] Deduced a trap composed of 183 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:08:39] [INFO ] Deduced a trap composed of 174 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:08:40] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:08:40] [INFO ] Deduced a trap composed of 196 places in 135 ms of which 2 ms to minimize.
SMT process timed out in 20783ms, After SMT, problems are : Problem set: 0 solved, 723 unsolved
Search for dead transitions found 0 dead transitions in 20792ms
[2024-06-01 15:08:40] [INFO ] Flow matrix only has 713 transitions (discarded 12 similar events)
[2024-06-01 15:08:40] [INFO ] Invariant cache hit.
[2024-06-01 15:08:41] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-06-01 15:08:41] [INFO ] Flow matrix only has 713 transitions (discarded 12 similar events)
[2024-06-01 15:08:41] [INFO ] Invariant cache hit.
[2024-06-01 15:08:41] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 15:08:45] [INFO ] Implicit Places using invariants and state equation in 4570 ms returned []
Implicit Place search using SMT with State Equation took 4957 ms to find 0 implicit places.
[2024-06-01 15:08:45] [INFO ] Redundant transitions in 9 ms returned []
Running 723 sub problems to find dead transitions.
[2024-06-01 15:08:45] [INFO ] Flow matrix only has 713 transitions (discarded 12 similar events)
[2024-06-01 15:08:45] [INFO ] Invariant cache hit.
[2024-06-01 15:08:45] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-01 15:08:50] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:08:50] [INFO ] Deduced a trap composed of 47 places in 28 ms of which 1 ms to minimize.
[2024-06-01 15:08:50] [INFO ] Deduced a trap composed of 178 places in 159 ms of which 2 ms to minimize.
[2024-06-01 15:08:50] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:08:50] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 3 ms to minimize.
[2024-06-01 15:08:50] [INFO ] Deduced a trap composed of 175 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:08:51] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-06-01 15:08:51] [INFO ] Deduced a trap composed of 163 places in 134 ms of which 2 ms to minimize.
[2024-06-01 15:08:51] [INFO ] Deduced a trap composed of 155 places in 130 ms of which 1 ms to minimize.
[2024-06-01 15:08:51] [INFO ] Deduced a trap composed of 154 places in 121 ms of which 2 ms to minimize.
[2024-06-01 15:08:51] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 2 ms to minimize.
[2024-06-01 15:08:51] [INFO ] Deduced a trap composed of 150 places in 116 ms of which 2 ms to minimize.
[2024-06-01 15:08:51] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 2 ms to minimize.
[2024-06-01 15:08:51] [INFO ] Deduced a trap composed of 46 places in 24 ms of which 0 ms to minimize.
[2024-06-01 15:08:52] [INFO ] Deduced a trap composed of 112 places in 119 ms of which 2 ms to minimize.
[2024-06-01 15:08:52] [INFO ] Deduced a trap composed of 112 places in 116 ms of which 1 ms to minimize.
[2024-06-01 15:08:52] [INFO ] Deduced a trap composed of 191 places in 112 ms of which 1 ms to minimize.
[2024-06-01 15:08:52] [INFO ] Deduced a trap composed of 170 places in 118 ms of which 2 ms to minimize.
[2024-06-01 15:08:52] [INFO ] Deduced a trap composed of 118 places in 121 ms of which 1 ms to minimize.
[2024-06-01 15:08:52] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-01 15:08:53] [INFO ] Deduced a trap composed of 150 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:08:53] [INFO ] Deduced a trap composed of 230 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:08:53] [INFO ] Deduced a trap composed of 211 places in 143 ms of which 2 ms to minimize.
[2024-06-01 15:08:53] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:08:54] [INFO ] Deduced a trap composed of 143 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:08:54] [INFO ] Deduced a trap composed of 146 places in 122 ms of which 2 ms to minimize.
[2024-06-01 15:08:54] [INFO ] Deduced a trap composed of 112 places in 122 ms of which 2 ms to minimize.
[2024-06-01 15:08:54] [INFO ] Deduced a trap composed of 112 places in 151 ms of which 1 ms to minimize.
[2024-06-01 15:08:54] [INFO ] Deduced a trap composed of 158 places in 133 ms of which 1 ms to minimize.
[2024-06-01 15:08:54] [INFO ] Deduced a trap composed of 176 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:08:54] [INFO ] Deduced a trap composed of 180 places in 143 ms of which 2 ms to minimize.
[2024-06-01 15:08:55] [INFO ] Deduced a trap composed of 183 places in 115 ms of which 1 ms to minimize.
[2024-06-01 15:08:55] [INFO ] Deduced a trap composed of 118 places in 120 ms of which 2 ms to minimize.
[2024-06-01 15:08:55] [INFO ] Deduced a trap composed of 153 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:08:55] [INFO ] Deduced a trap composed of 183 places in 147 ms of which 3 ms to minimize.
[2024-06-01 15:08:55] [INFO ] Deduced a trap composed of 112 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:08:56] [INFO ] Deduced a trap composed of 204 places in 138 ms of which 2 ms to minimize.
[2024-06-01 15:08:56] [INFO ] Deduced a trap composed of 206 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:08:56] [INFO ] Deduced a trap composed of 199 places in 143 ms of which 2 ms to minimize.
[2024-06-01 15:08:56] [INFO ] Deduced a trap composed of 204 places in 136 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-01 15:09:01] [INFO ] Deduced a trap composed of 186 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:09:01] [INFO ] Deduced a trap composed of 165 places in 125 ms of which 2 ms to minimize.
[2024-06-01 15:09:02] [INFO ] Deduced a trap composed of 193 places in 113 ms of which 2 ms to minimize.
[2024-06-01 15:09:02] [INFO ] Deduced a trap composed of 175 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:09:02] [INFO ] Deduced a trap composed of 124 places in 112 ms of which 2 ms to minimize.
[2024-06-01 15:09:03] [INFO ] Deduced a trap composed of 183 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:09:03] [INFO ] Deduced a trap composed of 174 places in 145 ms of which 3 ms to minimize.
[2024-06-01 15:09:04] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 3 ms to minimize.
[2024-06-01 15:09:05] [INFO ] Deduced a trap composed of 196 places in 197 ms of which 2 ms to minimize.
[2024-06-01 15:09:05] [INFO ] Deduced a trap composed of 194 places in 129 ms of which 2 ms to minimize.
[2024-06-01 15:09:05] [INFO ] Deduced a trap composed of 196 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:09:05] [INFO ] Deduced a trap composed of 196 places in 135 ms of which 2 ms to minimize.
[2024-06-01 15:09:05] [INFO ] Deduced a trap composed of 190 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:09:06] [INFO ] Deduced a trap composed of 192 places in 148 ms of which 2 ms to minimize.
[2024-06-01 15:09:06] [INFO ] Deduced a trap composed of 190 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:09:06] [INFO ] Deduced a trap composed of 208 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:09:06] [INFO ] Deduced a trap composed of 155 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:09:06] [INFO ] Deduced a trap composed of 160 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:09:07] [INFO ] Deduced a trap composed of 194 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:09:07] [INFO ] Deduced a trap composed of 158 places in 143 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-01 15:09:08] [INFO ] Deduced a trap composed of 183 places in 138 ms of which 2 ms to minimize.
[2024-06-01 15:09:08] [INFO ] Deduced a trap composed of 174 places in 132 ms of which 1 ms to minimize.
[2024-06-01 15:09:08] [INFO ] Deduced a trap composed of 182 places in 117 ms of which 2 ms to minimize.
[2024-06-01 15:09:08] [INFO ] Deduced a trap composed of 180 places in 117 ms of which 2 ms to minimize.
[2024-06-01 15:09:08] [INFO ] Deduced a trap composed of 221 places in 118 ms of which 2 ms to minimize.
[2024-06-01 15:09:09] [INFO ] Deduced a trap composed of 191 places in 118 ms of which 2 ms to minimize.
[2024-06-01 15:09:09] [INFO ] Deduced a trap composed of 223 places in 115 ms of which 2 ms to minimize.
[2024-06-01 15:09:09] [INFO ] Deduced a trap composed of 190 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:09:09] [INFO ] Deduced a trap composed of 182 places in 125 ms of which 2 ms to minimize.
[2024-06-01 15:09:09] [INFO ] Deduced a trap composed of 184 places in 117 ms of which 2 ms to minimize.
[2024-06-01 15:09:09] [INFO ] Deduced a trap composed of 188 places in 117 ms of which 2 ms to minimize.
[2024-06-01 15:09:09] [INFO ] Deduced a trap composed of 184 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:09:10] [INFO ] Deduced a trap composed of 171 places in 113 ms of which 2 ms to minimize.
[2024-06-01 15:09:10] [INFO ] Deduced a trap composed of 177 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:09:10] [INFO ] Deduced a trap composed of 179 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:09:10] [INFO ] Deduced a trap composed of 179 places in 120 ms of which 2 ms to minimize.
[2024-06-01 15:09:11] [INFO ] Deduced a trap composed of 155 places in 197 ms of which 2 ms to minimize.
[2024-06-01 15:09:11] [INFO ] Deduced a trap composed of 189 places in 181 ms of which 3 ms to minimize.
[2024-06-01 15:09:12] [INFO ] Deduced a trap composed of 164 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:09:12] [INFO ] Deduced a trap composed of 195 places in 131 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-01 15:09:13] [INFO ] Deduced a trap composed of 173 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:09:13] [INFO ] Deduced a trap composed of 178 places in 149 ms of which 2 ms to minimize.
[2024-06-01 15:09:13] [INFO ] Deduced a trap composed of 185 places in 132 ms of which 1 ms to minimize.
[2024-06-01 15:09:14] [INFO ] Deduced a trap composed of 155 places in 166 ms of which 2 ms to minimize.
[2024-06-01 15:09:14] [INFO ] Deduced a trap composed of 190 places in 152 ms of which 2 ms to minimize.
[2024-06-01 15:09:14] [INFO ] Deduced a trap composed of 179 places in 130 ms of which 2 ms to minimize.
[2024-06-01 15:09:14] [INFO ] Deduced a trap composed of 159 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:09:14] [INFO ] Deduced a trap composed of 182 places in 128 ms of which 2 ms to minimize.
[2024-06-01 15:09:14] [INFO ] Deduced a trap composed of 175 places in 136 ms of which 2 ms to minimize.
[2024-06-01 15:09:15] [INFO ] Deduced a trap composed of 174 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:09:16] [INFO ] Deduced a trap composed of 112 places in 191 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 359/1074 variables, and 130 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/361 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 91/91 constraints]
Escalating to Integer solving :Problem set: 0 solved, 723 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 91/130 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-01 15:09:20] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 15:09:21] [INFO ] Deduced a trap composed of 219 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:09:21] [INFO ] Deduced a trap composed of 139 places in 118 ms of which 2 ms to minimize.
[2024-06-01 15:09:22] [INFO ] Deduced a trap composed of 149 places in 112 ms of which 2 ms to minimize.
[2024-06-01 15:09:28] [INFO ] Deduced a trap composed of 137 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:09:29] [INFO ] Deduced a trap composed of 134 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:09:30] [INFO ] Deduced a trap composed of 157 places in 140 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 7/137 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-01 15:09:37] [INFO ] Deduced a trap composed of 162 places in 149 ms of which 2 ms to minimize.
[2024-06-01 15:09:37] [INFO ] Deduced a trap composed of 190 places in 140 ms of which 3 ms to minimize.
[2024-06-01 15:09:39] [INFO ] Deduced a trap composed of 196 places in 125 ms of which 1 ms to minimize.
[2024-06-01 15:09:40] [INFO ] Deduced a trap composed of 124 places in 104 ms of which 2 ms to minimize.
[2024-06-01 15:09:45] [INFO ] Deduced a trap composed of 177 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:09:45] [INFO ] Deduced a trap composed of 208 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:09:45] [INFO ] Deduced a trap composed of 184 places in 133 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 7/144 constraints. Problems are: Problem set: 0 solved, 723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 359/1074 variables, and 144 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/361 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/723 constraints, Known Traps: 105/105 constraints]
After SMT, in 60687ms problems are : Problem set: 0 solved, 723 unsolved
Search for dead transitions found 0 dead transitions in 60695ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 86480 ms. Remains : 361/361 places, 725/725 transitions.
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-06 finished in 240793 ms.
[2024-06-01 15:09:46] [INFO ] Flatten gal took : 64 ms
[2024-06-01 15:09:46] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 15:09:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 529 places, 968 transitions and 4170 arcs took 9 ms.
Total runtime 1641185 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : PolyORBLF-PT-S02J06T06-LTLFireability-03
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717254953054

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBLF-PT-S02J06T06-LTLFireability-03
ltl formula formula --ltl=/tmp/4792/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 529 places, 968 transitions and 4170 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.030 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4792/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4792/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4792/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4792/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 544 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 530, there are 1011 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~26 levels ~10000 states ~31256 transitions
pnml2lts-mc( 2/ 4): ~26 levels ~20000 states ~64916 transitions
pnml2lts-mc( 0/ 4): ~79 levels ~40000 states ~131724 transitions
pnml2lts-mc( 0/ 4): ~79 levels ~80000 states ~269532 transitions
pnml2lts-mc( 0/ 4): ~83 levels ~160000 states ~553428 transitions
pnml2lts-mc( 0/ 4): ~83 levels ~320000 states ~1100808 transitions
pnml2lts-mc( 0/ 4): ~83 levels ~640000 states ~2385756 transitions
pnml2lts-mc( 0/ 4): ~83 levels ~1280000 states ~4965904 transitions
pnml2lts-mc( 0/ 4): ~163 levels ~2560000 states ~10033020 transitions
pnml2lts-mc( 0/ 4): ~163 levels ~5120000 states ~21876660 transitions
pnml2lts-mc( 1/ 4): ~294 levels ~10240000 states ~49608804 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 15639122
pnml2lts-mc( 0/ 4): unique states count: 15641755
pnml2lts-mc( 0/ 4): unique transitions count: 77070174
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 61425778
pnml2lts-mc( 0/ 4): - claim found count: 59
pnml2lts-mc( 0/ 4): - claim success count: 15642388
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2589
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 15642388 states 77074477 transitions, fanout: 4.927
pnml2lts-mc( 0/ 4): Total exploration time 363.540 sec (363.510 sec minimum, 363.520 sec on average)
pnml2lts-mc( 0/ 4): States per second: 43028, Transitions per second: 212011
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 183.4MB, 12.3 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 46.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 998 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 183.4MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S02J06T06-LTLFireability-06
ltl formula formula --ltl=/tmp/4792/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 529 places, 968 transitions and 4170 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4792/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4792/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.030 user 0.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4792/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4792/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 544 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 530, there are 970 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~66 levels ~10000 states ~10968 transitions
pnml2lts-mc( 2/ 4): ~66 levels ~20000 states ~22000 transitions
pnml2lts-mc( 2/ 4): ~66 levels ~40000 states ~45168 transitions
pnml2lts-mc( 2/ 4): ~66 levels ~80000 states ~111700 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 61881
pnml2lts-mc( 0/ 4): unique states count: 61881
pnml2lts-mc( 0/ 4): unique transitions count: 86530
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 24847
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 62343
pnml2lts-mc( 0/ 4): - cum. max stack depth: 253
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 62343 states 87543 transitions, fanout: 1.404
pnml2lts-mc( 0/ 4): Total exploration time 1.780 sec (1.780 sec minimum, 1.780 sec on average)
pnml2lts-mc( 0/ 4): States per second: 35024, Transitions per second: 49181
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.0MB, 16.8 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 998 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-PT-S02J06T06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446700244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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