About the Execution of ITS-Tools for EisenbergMcGuire-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16205.548 | 3600000.00 | 7145420.00 | 24942.70 | F??FFFFTT?TFTF?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r158-smll-171636266400203.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is EisenbergMcGuire-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636266400203
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.1M May 18 16:42 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 EisenbergMcGuire-PT-10-LTLCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716565984947
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-24 15:53:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 15:53:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:53:08] [INFO ] Load time of PNML (sax parser for PT used): 730 ms
[2024-05-24 15:53:08] [INFO ] Transformed 1090 places.
[2024-05-24 15:53:08] [INFO ] Transformed 5200 transitions.
[2024-05-24 15:53:08] [INFO ] Found NUPN structural information;
[2024-05-24 15:53:08] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 1058 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 1090 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 1000 transition count 4300
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 1000 transition count 4300
Applied a total of 180 rules in 390 ms. Remains 1000 /1090 variables (removed 90) and now considering 4300/5200 (removed 900) transitions.
[2024-05-24 15:53:09] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
// Phase 1: matrix 1430 rows 1000 cols
[2024-05-24 15:53:09] [INFO ] Computed 31 invariants in 82 ms
[2024-05-24 15:53:11] [INFO ] Implicit Places using invariants in 1734 ms returned []
[2024-05-24 15:53:11] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-05-24 15:53:11] [INFO ] Invariant cache hit.
[2024-05-24 15:53:12] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 15:53:25] [INFO ] Implicit Places using invariants and state equation in 14045 ms returned []
Implicit Place search using SMT with State Equation took 15846 ms to find 0 implicit places.
Running 4290 sub problems to find dead transitions.
[2024-05-24 15:53:25] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-05-24 15:53:25] [INFO ] Invariant cache hit.
[2024-05-24 15:53:25] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 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.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4290 unsolved
SMT process timed out in 34629ms, After SMT, problems are : Problem set: 0 solved, 4290 unsolved
Search for dead transitions found 0 dead transitions in 34737ms
Starting structural reductions in LTL mode, iteration 1 : 1000/1090 places, 4300/5200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51041 ms. Remains : 1000/1090 places, 4300/5200 transitions.
Support contains 14 out of 1000 places after structural reductions.
[2024-05-24 15:54:01] [INFO ] Flatten gal took : 524 ms
[2024-05-24 15:54:01] [INFO ] Flatten gal took : 213 ms
[2024-05-24 15:54:01] [INFO ] Input system was already deterministic with 4300 transitions.
RANDOM walk for 40000 steps (8 resets) in 1655 ms. (24 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
[2024-05-24 15:54:02] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-05-24 15:54:02] [INFO ] Invariant cache hit.
[2024-05-24 15:54:02] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 668/678 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/678 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/679 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/679 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 14/693 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/693 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1001/1694 variables, 693/714 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1694 variables, 140/854 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1694 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 64/1758 variables, 10/864 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1758 variables, 1/865 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1758 variables, 82/947 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1758 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 78/1836 variables, 36/983 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1836 variables, 27/1010 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1836 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 254/2090 variables, 5/1015 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2090 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 2/2092 variables, 1/1016 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2092 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 5/2097 variables, 3/1019 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2097 variables, 0/1019 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 333/2430 variables, 261/1280 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2430 variables, 187/1467 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2430 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (OVERLAPS) 0/2430 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2430/2430 variables, and 1467 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4603 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1000/1000 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 668/678 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/678 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/679 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/679 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 14/693 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-24 15:54:09] [INFO ] Deduced a trap composed of 3 places in 626 ms of which 69 ms to minimize.
[2024-05-24 15:54:10] [INFO ] Deduced a trap composed of 3 places in 793 ms of which 10 ms to minimize.
[2024-05-24 15:54:10] [INFO ] Deduced a trap composed of 48 places in 702 ms of which 8 ms to minimize.
[2024-05-24 15:54:11] [INFO ] Deduced a trap composed of 127 places in 595 ms of which 8 ms to minimize.
[2024-05-24 15:54:12] [INFO ] Deduced a trap composed of 84 places in 663 ms of which 7 ms to minimize.
[2024-05-24 15:54:12] [INFO ] Deduced a trap composed of 3 places in 617 ms of which 7 ms to minimize.
SMT process timed out in 9878ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1000 transition count 4290
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 990 transition count 4290
Performed 302 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 302 Pre rules applied. Total rules applied 20 place count 990 transition count 3988
Deduced a syphon composed of 302 places in 7 ms
Reduce places removed 302 places and 0 transitions.
Iterating global reduction 2 with 604 rules applied. Total rules applied 624 place count 688 transition count 3988
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 7 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 802 place count 599 transition count 3899
Applied a total of 802 rules in 760 ms. Remains 599 /1000 variables (removed 401) and now considering 3899/4300 (removed 401) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 762 ms. Remains : 599/1000 places, 3899/4300 transitions.
RANDOM walk for 40000 steps (8 resets) in 327 ms. (121 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 134563 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :5 out of 7
Probabilistic random walk after 134563 steps, saw 94567 distinct states, run finished after 3011 ms. (steps per millisecond=44 ) properties seen :5
[2024-05-24 15:54:16] [INFO ] Flow matrix only has 1029 transitions (discarded 2870 similar events)
// Phase 1: matrix 1029 rows 599 cols
[2024-05-24 15:54:16] [INFO ] Computed 31 invariants in 7 ms
[2024-05-24 15:54:16] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/170 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/171 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/177 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 309/486 variables, 177/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 24/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 136/622 variables, 10/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/622 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/622 variables, 36/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/622 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 182/804 variables, 84/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/804 variables, 39/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/804 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 314/1118 variables, 14/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1118 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 14/1132 variables, 7/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1132 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 496/1628 variables, 328/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1628 variables, 337/1066 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1628 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/1628 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1628/1628 variables, and 1066 constraints, problems are : Problem set: 0 solved, 2 unsolved in 845 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 599/599 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/170 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/171 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/177 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 15:54:18] [INFO ] Deduced a trap composed of 3 places in 233 ms of which 3 ms to minimize.
[2024-05-24 15:54:18] [INFO ] Deduced a trap composed of 3 places in 194 ms of which 2 ms to minimize.
[2024-05-24 15:54:18] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 309/486 variables, 177/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 24/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 136/622 variables, 10/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/622 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/622 variables, 36/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/622 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 182/804 variables, 84/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/804 variables, 39/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/804 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 314/1118 variables, 14/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1118 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 14/1132 variables, 7/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1132 variables, 2/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 15:54:20] [INFO ] Deduced a trap composed of 3 places in 892 ms of which 6 ms to minimize.
[2024-05-24 15:54:20] [INFO ] Deduced a trap composed of 3 places in 717 ms of which 6 ms to minimize.
[2024-05-24 15:54:21] [INFO ] Deduced a trap composed of 5 places in 284 ms of which 3 ms to minimize.
[2024-05-24 15:54:21] [INFO ] Deduced a trap composed of 3 places in 259 ms of which 3 ms to minimize.
[2024-05-24 15:54:21] [INFO ] Deduced a trap composed of 3 places in 223 ms of which 3 ms to minimize.
[2024-05-24 15:54:21] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 1 ms to minimize.
[2024-05-24 15:54:22] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-24 15:54:22] [INFO ] Deduced a trap composed of 59 places in 224 ms of which 2 ms to minimize.
[2024-05-24 15:54:22] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1132 variables, 9/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1132 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 496/1628 variables, 328/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1628 variables, 337/1080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1628 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1628 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1628/1628 variables, and 1080 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5446 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 599/599 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 12/12 constraints]
After SMT, in 6338ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 464 ms.
Support contains 1 out of 599 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 599/599 places, 3899/3899 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 599 transition count 3891
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 591 transition count 3891
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 590 transition count 3890
Applied a total of 18 rules in 381 ms. Remains 590 /599 variables (removed 9) and now considering 3890/3899 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 383 ms. Remains : 590/599 places, 3890/3899 transitions.
RANDOM walk for 40000 steps (8 resets) in 217 ms. (183 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 311245 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 1
Probabilistic random walk after 311245 steps, saw 210404 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
[2024-05-24 15:54:27] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 15:54:27] [INFO ] Computed 31 invariants in 6 ms
[2024-05-24 15:54:27] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:54:27] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/160 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 389/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1610 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1058 constraints, problems are : Problem set: 0 solved, 1 unsolved in 944 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/160 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:54:28] [INFO ] Deduced a trap composed of 3 places in 265 ms of which 2 ms to minimize.
[2024-05-24 15:54:29] [INFO ] Deduced a trap composed of 3 places in 223 ms of which 3 ms to minimize.
[2024-05-24 15:54:29] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 3 ms to minimize.
[2024-05-24 15:54:29] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/980 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 630/1610 variables, 414/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 389/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1063 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1799 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 2783ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 68 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=34 )
Parikh walk visited 1 properties in 12 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F(p1)))))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1000 transition count 4290
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 990 transition count 4290
Performed 309 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 309 Pre rules applied. Total rules applied 20 place count 990 transition count 3981
Deduced a syphon composed of 309 places in 6 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 2 with 618 rules applied. Total rules applied 638 place count 681 transition count 3981
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 6 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 818 place count 591 transition count 3891
Applied a total of 818 rules in 1035 ms. Remains 591 /1000 variables (removed 409) and now considering 3891/4300 (removed 409) transitions.
[2024-05-24 15:54:31] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2024-05-24 15:54:31] [INFO ] Computed 31 invariants in 18 ms
[2024-05-24 15:54:32] [INFO ] Implicit Places using invariants in 1600 ms returned []
[2024-05-24 15:54:32] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-05-24 15:54:32] [INFO ] Invariant cache hit.
[2024-05-24 15:54:33] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 15:54:38] [INFO ] Implicit Places using invariants and state equation in 5884 ms returned []
Implicit Place search using SMT with State Equation took 7495 ms to find 0 implicit places.
[2024-05-24 15:54:39] [INFO ] Redundant transitions in 555 ms returned []
Running 3881 sub problems to find dead transitions.
[2024-05-24 15:54:39] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-05-24 15:54:39] [INFO ] Invariant cache hit.
[2024-05-24 15:54:39] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3881 unsolved
SMT process timed out in 34039ms, After SMT, problems are : Problem set: 0 solved, 3881 unsolved
Search for dead transitions found 0 dead transitions in 34090ms
Starting structural reductions in SI_LTL mode, iteration 1 : 591/1000 places, 3891/4300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43210 ms. Remains : 591/1000 places, 3891/4300 transitions.
Stuttering acceptance computed with spot in 380 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 632 ms.
Product exploration explored 100000 steps with 0 reset in 561 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 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 331 ms. (120 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 272052 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :1 out of 2
Probabilistic random walk after 272052 steps, saw 185182 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :1
[2024-05-24 15:55:18] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-05-24 15:55:18] [INFO ] Invariant cache hit.
[2024-05-24 15:55:18] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:55:18] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/160 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 397/963 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/963 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/981 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/981 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 631/1612 variables, 415/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1612 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1612 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1612 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 1059 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1165 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 591/591 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/160 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 397/963 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/963 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/981 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/981 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:55:21] [INFO ] Deduced a trap composed of 13 places in 780 ms of which 7 ms to minimize.
[2024-05-24 15:55:21] [INFO ] Deduced a trap composed of 23 places in 654 ms of which 7 ms to minimize.
[2024-05-24 15:55:22] [INFO ] Deduced a trap composed of 25 places in 537 ms of which 5 ms to minimize.
[2024-05-24 15:55:22] [INFO ] Deduced a trap composed of 24 places in 438 ms of which 4 ms to minimize.
[2024-05-24 15:55:23] [INFO ] Deduced a trap composed of 19 places in 373 ms of which 4 ms to minimize.
[2024-05-24 15:55:24] [INFO ] Deduced a trap composed of 23 places in 892 ms of which 7 ms to minimize.
[2024-05-24 15:55:25] [INFO ] Deduced a trap composed of 105 places in 925 ms of which 7 ms to minimize.
SMT process timed out in 6481ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 591 transition count 3890
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 590 transition count 3890
Applied a total of 2 rules in 306 ms. Remains 590 /591 variables (removed 1) and now considering 3890/3891 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 590/591 places, 3890/3891 transitions.
RANDOM walk for 40000 steps (8 resets) in 281 ms. (141 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 269115 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 1
Probabilistic random walk after 269115 steps, saw 183036 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
[2024-05-24 15:55:28] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 15:55:28] [INFO ] Computed 31 invariants in 5 ms
[2024-05-24 15:55:28] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:55:28] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/160 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 389/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1610 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1058 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1102 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/160 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:55:30] [INFO ] Deduced a trap composed of 3 places in 678 ms of which 6 ms to minimize.
[2024-05-24 15:55:31] [INFO ] Deduced a trap composed of 3 places in 505 ms of which 7 ms to minimize.
[2024-05-24 15:55:31] [INFO ] Deduced a trap composed of 3 places in 367 ms of which 4 ms to minimize.
[2024-05-24 15:55:31] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/980 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 630/1610 variables, 414/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 389/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1063 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3149 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 4283ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 66 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 591 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 279 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
[2024-05-24 15:55:33] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2024-05-24 15:55:33] [INFO ] Computed 31 invariants in 7 ms
[2024-05-24 15:55:35] [INFO ] Implicit Places using invariants in 1672 ms returned []
[2024-05-24 15:55:35] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-05-24 15:55:35] [INFO ] Invariant cache hit.
[2024-05-24 15:55:35] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 15:55:42] [INFO ] Implicit Places using invariants and state equation in 7235 ms returned []
Implicit Place search using SMT with State Equation took 8911 ms to find 0 implicit places.
[2024-05-24 15:55:42] [INFO ] Redundant transitions in 526 ms returned []
Running 3881 sub problems to find dead transitions.
[2024-05-24 15:55:42] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-05-24 15:55:42] [INFO ] Invariant cache hit.
[2024-05-24 15:55:42] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3881 unsolved
SMT process timed out in 33548ms, After SMT, problems are : Problem set: 0 solved, 3881 unsolved
Search for dead transitions found 0 dead transitions in 33595ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43335 ms. Remains : 591/591 places, 3891/3891 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 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 479 ms. (83 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 240053 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :1 out of 2
Probabilistic random walk after 240053 steps, saw 165205 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :1
[2024-05-24 15:56:20] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-05-24 15:56:20] [INFO ] Invariant cache hit.
[2024-05-24 15:56:20] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:56:20] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/160 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 397/963 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/963 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/981 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/981 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 631/1612 variables, 415/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1612 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1612 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1612 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 1059 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1059 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 591/591 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/160 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 397/963 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/963 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/981 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/981 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:56:22] [INFO ] Deduced a trap composed of 13 places in 662 ms of which 7 ms to minimize.
[2024-05-24 15:56:22] [INFO ] Deduced a trap composed of 23 places in 662 ms of which 6 ms to minimize.
[2024-05-24 15:56:23] [INFO ] Deduced a trap composed of 25 places in 550 ms of which 5 ms to minimize.
[2024-05-24 15:56:23] [INFO ] Deduced a trap composed of 24 places in 444 ms of which 5 ms to minimize.
[2024-05-24 15:56:24] [INFO ] Deduced a trap composed of 19 places in 441 ms of which 5 ms to minimize.
[2024-05-24 15:56:25] [INFO ] Deduced a trap composed of 23 places in 889 ms of which 7 ms to minimize.
[2024-05-24 15:56:26] [INFO ] Deduced a trap composed of 105 places in 876 ms of which 7 ms to minimize.
SMT process timed out in 6227ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 591 transition count 3890
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 590 transition count 3890
Applied a total of 2 rules in 313 ms. Remains 590 /591 variables (removed 1) and now considering 3890/3891 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 320 ms. Remains : 590/591 places, 3890/3891 transitions.
RANDOM walk for 40000 steps (8 resets) in 232 ms. (171 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 297209 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 1
Probabilistic random walk after 297209 steps, saw 199972 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
[2024-05-24 15:56:29] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-05-24 15:56:29] [INFO ] Computed 31 invariants in 6 ms
[2024-05-24 15:56:29] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:56:29] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/160 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 389/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1610 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1058 constraints, problems are : Problem set: 0 solved, 1 unsolved in 791 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/160 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 15:56:31] [INFO ] Deduced a trap composed of 3 places in 653 ms of which 9 ms to minimize.
[2024-05-24 15:56:32] [INFO ] Deduced a trap composed of 3 places in 555 ms of which 6 ms to minimize.
[2024-05-24 15:56:32] [INFO ] Deduced a trap composed of 3 places in 355 ms of which 4 ms to minimize.
[2024-05-24 15:56:32] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/980 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 630/1610 variables, 414/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 389/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1063 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3150 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 3972ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 66 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 582 ms.
Product exploration explored 100000 steps with 0 reset in 554 ms.
Built C files in :
/tmp/ltsmin1515983794602099386
[2024-05-24 15:56:35] [INFO ] Too many transitions (3891) to apply POR reductions. Disabling POR matrices.
[2024-05-24 15:56:35] [INFO ] Built C files in 120ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1515983794602099386
Running compilation step : cd /tmp/ltsmin1515983794602099386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1515983794602099386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1515983794602099386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 591 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 274 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
[2024-05-24 15:56:38] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2024-05-24 15:56:38] [INFO ] Computed 31 invariants in 7 ms
[2024-05-24 15:56:40] [INFO ] Implicit Places using invariants in 1386 ms returned []
[2024-05-24 15:56:40] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-05-24 15:56:40] [INFO ] Invariant cache hit.
[2024-05-24 15:56:40] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 15:56:47] [INFO ] Implicit Places using invariants and state equation in 7080 ms returned []
Implicit Place search using SMT with State Equation took 8469 ms to find 0 implicit places.
[2024-05-24 15:56:47] [INFO ] Redundant transitions in 169 ms returned []
Running 3881 sub problems to find dead transitions.
[2024-05-24 15:56:47] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-05-24 15:56:47] [INFO ] Invariant cache hit.
[2024-05-24 15:56:47] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3881 unsolved
SMT process timed out in 33712ms, After SMT, problems are : Problem set: 0 solved, 3881 unsolved
Search for dead transitions found 0 dead transitions in 33754ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42696 ms. Remains : 591/591 places, 3891/3891 transitions.
Built C files in :
/tmp/ltsmin12780831264494243642
[2024-05-24 15:57:21] [INFO ] Too many transitions (3891) to apply POR reductions. Disabling POR matrices.
[2024-05-24 15:57:21] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12780831264494243642
Running compilation step : cd /tmp/ltsmin12780831264494243642;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12780831264494243642;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12780831264494243642;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 15:57:24] [INFO ] Flatten gal took : 159 ms
[2024-05-24 15:57:25] [INFO ] Flatten gal took : 153 ms
[2024-05-24 15:57:25] [INFO ] Time to serialize gal into /tmp/LTL17427834133856633418.gal : 113 ms
[2024-05-24 15:57:25] [INFO ] Time to serialize properties into /tmp/LTL8169703161949426112.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17427834133856633418.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18248269240632992981.hoa' '-atoms' '/tmp/LTL8169703161949426112.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8169703161949426112.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18248269240632992981.hoa
Detected timeout of ITS tools.
[2024-05-24 15:57:40] [INFO ] Flatten gal took : 192 ms
[2024-05-24 15:57:40] [INFO ] Flatten gal took : 185 ms
[2024-05-24 15:57:40] [INFO ] Time to serialize gal into /tmp/LTL17650564455186205786.gal : 56 ms
[2024-05-24 15:57:40] [INFO ] Time to serialize properties into /tmp/LTL15068147666329652335.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17650564455186205786.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15068147666329652335.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("(p25_4_6!=1)")||(X(F("(p34_9_3!=1)"))))))
Formula 0 simplified : F(!"(p25_4_6!=1)" & XG!"(p34_9_3!=1)")
Detected timeout of ITS tools.
[2024-05-24 15:57:56] [INFO ] Flatten gal took : 117 ms
[2024-05-24 15:57:56] [INFO ] Applying decomposition
[2024-05-24 15:57:56] [INFO ] Flatten gal took : 120 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11631211591534328005.txt' '-o' '/tmp/graph11631211591534328005.bin' '-w' '/tmp/graph11631211591534328005.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11631211591534328005.bin' '-l' '-1' '-v' '-w' '/tmp/graph11631211591534328005.weights' '-q' '0' '-e' '0.001'
[2024-05-24 15:57:56] [INFO ] Decomposing Gal with order
[2024-05-24 15:57:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 15:57:57] [INFO ] Removed a total of 8770 redundant transitions.
[2024-05-24 15:57:58] [INFO ] Flatten gal took : 1024 ms
[2024-05-24 15:57:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 876 labels/synchronizations in 271 ms.
[2024-05-24 15:57:58] [INFO ] Time to serialize gal into /tmp/LTL16247264739162382249.gal : 37 ms
[2024-05-24 15:57:58] [INFO ] Time to serialize properties into /tmp/LTL11292403577020044862.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16247264739162382249.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11292403577020044862.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(("(i3.u6.p25_4_6!=1)")||(X(F("(i17.u104.p34_9_3!=1)"))))))
Formula 0 simplified : F(!"(i3.u6.p25_4_6!=1)" & XG!"(i17.u104.p34_9_3!=1)")
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-10-LTLCardinality-01 finished in 223395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1000 transition count 4290
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 990 transition count 4290
Performed 308 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 308 Pre rules applied. Total rules applied 20 place count 990 transition count 3982
Deduced a syphon composed of 308 places in 4 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 2 with 616 rules applied. Total rules applied 636 place count 682 transition count 3982
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 4 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 814 place count 593 transition count 3893
Applied a total of 814 rules in 308 ms. Remains 593 /1000 variables (removed 407) and now considering 3893/4300 (removed 407) transitions.
[2024-05-24 15:58:13] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
// Phase 1: matrix 1023 rows 593 cols
[2024-05-24 15:58:13] [INFO ] Computed 31 invariants in 7 ms
[2024-05-24 15:58:15] [INFO ] Implicit Places using invariants in 1305 ms returned []
[2024-05-24 15:58:15] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2024-05-24 15:58:15] [INFO ] Invariant cache hit.
[2024-05-24 15:58:15] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 15:58:20] [INFO ] Implicit Places using invariants and state equation in 5727 ms returned []
Implicit Place search using SMT with State Equation took 7036 ms to find 0 implicit places.
[2024-05-24 15:58:21] [INFO ] Redundant transitions in 313 ms returned []
Running 3883 sub problems to find dead transitions.
[2024-05-24 15:58:21] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2024-05-24 15:58:21] [INFO ] Invariant cache hit.
[2024-05-24 15:58:21] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.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 1.0)
(s57 1.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 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.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 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 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.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3883 unsolved
SMT process timed out in 33777ms, After SMT, problems are : Problem set: 0 solved, 3883 unsolved
Search for dead transitions found 0 dead transitions in 33845ms
Starting structural reductions in SI_LTL mode, iteration 1 : 593/1000 places, 3893/4300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41524 ms. Remains : 593/1000 places, 3893/4300 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 554 ms.
Product exploration explored 100000 steps with 0 reset in 409 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 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 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 515 ms. (77 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 31326 steps, run visited all 1 properties in 506 ms. (steps per millisecond=61 )
Probabilistic random walk after 31326 steps, saw 24853 distinct states, run finished after 518 ms. (steps per millisecond=60 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 141 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 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 593 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 593/593 places, 3893/3893 transitions.
Applied a total of 0 rules in 268 ms. Remains 593 /593 variables (removed 0) and now considering 3893/3893 (removed 0) transitions.
[2024-05-24 15:58:57] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2024-05-24 15:58:57] [INFO ] Invariant cache hit.
[2024-05-24 15:58:59] [INFO ] Implicit Places using invariants in 1692 ms returned []
[2024-05-24 15:58:59] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2024-05-24 15:58:59] [INFO ] Invariant cache hit.
[2024-05-24 15:59:00] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 15:59:05] [INFO ] Implicit Places using invariants and state equation in 6050 ms returned []
Implicit Place search using SMT with State Equation took 7744 ms to find 0 implicit places.
[2024-05-24 15:59:05] [INFO ] Redundant transitions in 284 ms returned []
Running 3883 sub problems to find dead transitions.
[2024-05-24 15:59:05] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2024-05-24 15:59:05] [INFO ] Invariant cache hit.
[2024-05-24 15:59:05] [INFO ] State equation strengthened by 436 read => feed constraints.
(s264 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 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.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 1.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 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.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 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 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.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3883 unsolved
SMT process timed out in 34882ms, After SMT, problems are : Problem set: 0 solved, 3883 unsolved
Search for dead transitions found 0 dead transitions in 34952ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43272 ms. Remains : 593/593 places, 3893/3893 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 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 162 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 427 ms. (93 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 31326 steps, run visited all 1 properties in 358 ms. (steps per millisecond=87 )
Probabilistic random walk after 31326 steps, saw 24853 distinct states, run finished after 359 ms. (steps per millisecond=87 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 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 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 503 ms.
Product exploration explored 100000 steps with 0 reset in 529 ms.
Built C files in :
/tmp/ltsmin11636551139399903106
[2024-05-24 15:59:43] [INFO ] Too many transitions (3893) to apply POR reductions. Disabling POR matrices.
[2024-05-24 15:59:43] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11636551139399903106
Running compilation step : cd /tmp/ltsmin11636551139399903106;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11636551139399903106;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11636551139399903106;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 593 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 593/593 places, 3893/3893 transitions.
Applied a total of 0 rules in 262 ms. Remains 593 /593 variables (removed 0) and now considering 3893/3893 (removed 0) transitions.
[2024-05-24 15:59:46] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2024-05-24 15:59:46] [INFO ] Invariant cache hit.
[2024-05-24 15:59:48] [INFO ] Implicit Places using invariants in 1734 ms returned []
[2024-05-24 15:59:48] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2024-05-24 15:59:48] [INFO ] Invariant cache hit.
[2024-05-24 15:59:48] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 15:59:56] [INFO ] Implicit Places using invariants and state equation in 8032 ms returned []
Implicit Place search using SMT with State Equation took 9768 ms to find 0 implicit places.
[2024-05-24 15:59:56] [INFO ] Redundant transitions in 287 ms returned []
Running 3883 sub problems to find dead transitions.
[2024-05-24 15:59:56] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2024-05-24 15:59:56] [INFO ] Invariant cache hit.
[2024-05-24 15:59:56] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3883 unsolved
SMT process timed out in 34464ms, After SMT, problems are : Problem set: 0 solved, 3883 unsolved
Search for dead transitions found 0 dead transitions in 34529ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44877 ms. Remains : 593/593 places, 3893/3893 transitions.
Built C files in :
/tmp/ltsmin3838832619050352598
[2024-05-24 16:00:31] [INFO ] Too many transitions (3893) to apply POR reductions. Disabling POR matrices.
[2024-05-24 16:00:31] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3838832619050352598
Running compilation step : cd /tmp/ltsmin3838832619050352598;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3838832619050352598;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3838832619050352598;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 16:00:34] [INFO ] Flatten gal took : 137 ms
[2024-05-24 16:00:34] [INFO ] Flatten gal took : 143 ms
[2024-05-24 16:00:34] [INFO ] Time to serialize gal into /tmp/LTL2029139619077452818.gal : 30 ms
[2024-05-24 16:00:34] [INFO ] Time to serialize properties into /tmp/LTL10064971552774833221.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2029139619077452818.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10764320418757046985.hoa' '-atoms' '/tmp/LTL10064971552774833221.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10064971552774833221.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10764320418757046985.hoa
Detected timeout of ITS tools.
[2024-05-24 16:00:49] [INFO ] Flatten gal took : 118 ms
[2024-05-24 16:00:49] [INFO ] Flatten gal took : 131 ms
[2024-05-24 16:00:49] [INFO ] Time to serialize gal into /tmp/LTL14314755531450329059.gal : 24 ms
[2024-05-24 16:00:49] [INFO ] Time to serialize properties into /tmp/LTL8653573608012370204.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14314755531450329059.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8653573608012370204.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p34_4_0==0)||(p08_0_0==1))"))))
Formula 0 simplified : FG!"((p34_4_0==0)||(p08_0_0==1))"
Detected timeout of ITS tools.
[2024-05-24 16:01:05] [INFO ] Flatten gal took : 116 ms
[2024-05-24 16:01:05] [INFO ] Applying decomposition
[2024-05-24 16:01:05] [INFO ] Flatten gal took : 121 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5239227985611747935.txt' '-o' '/tmp/graph5239227985611747935.bin' '-w' '/tmp/graph5239227985611747935.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5239227985611747935.bin' '-l' '-1' '-v' '-w' '/tmp/graph5239227985611747935.weights' '-q' '0' '-e' '0.001'
[2024-05-24 16:01:05] [INFO ] Decomposing Gal with order
[2024-05-24 16:01:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 16:01:05] [INFO ] Removed a total of 8726 redundant transitions.
[2024-05-24 16:01:06] [INFO ] Flatten gal took : 335 ms
[2024-05-24 16:01:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 720 labels/synchronizations in 134 ms.
[2024-05-24 16:01:06] [INFO ] Time to serialize gal into /tmp/LTL16608770780981121048.gal : 31 ms
[2024-05-24 16:01:06] [INFO ] Time to serialize properties into /tmp/LTL8441397542608258019.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16608770780981121048.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8441397542608258019.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i17.u93.p34_4_0==0)||(i6.u16.p08_0_0==1))"))))
Formula 0 simplified : FG!"((i17.u93.p34_4_0==0)||(i6.u16.p08_0_0==1))"
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-10-LTLCardinality-02 finished in 187761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1000 transition count 4290
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 990 transition count 4290
Performed 309 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 309 Pre rules applied. Total rules applied 20 place count 990 transition count 3981
Deduced a syphon composed of 309 places in 6 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 2 with 618 rules applied. Total rules applied 638 place count 681 transition count 3981
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 5 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 818 place count 591 transition count 3891
Applied a total of 818 rules in 405 ms. Remains 591 /1000 variables (removed 409) and now considering 3891/4300 (removed 409) transitions.
[2024-05-24 16:01:21] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2024-05-24 16:01:21] [INFO ] Computed 31 invariants in 4 ms
[2024-05-24 16:01:23] [INFO ] Implicit Places using invariants in 1531 ms returned []
[2024-05-24 16:01:23] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-05-24 16:01:23] [INFO ] Invariant cache hit.
[2024-05-24 16:01:24] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 16:01:29] [INFO ] Implicit Places using invariants and state equation in 6410 ms returned []
Implicit Place search using SMT with State Equation took 7944 ms to find 0 implicit places.
[2024-05-24 16:01:29] [INFO ] Redundant transitions in 188 ms returned []
Running 3881 sub problems to find dead transitions.
[2024-05-24 16:01:29] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-05-24 16:01:29] [INFO ] Invariant cache hit.
[2024-05-24 16:01:29] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3881 unsolved
SMT process timed out in 34125ms, After SMT, problems are : Problem set: 0 solved, 3881 unsolved
Search for dead transitions found 0 dead transitions in 34168ms
Starting structural reductions in SI_LTL mode, iteration 1 : 591/1000 places, 3891/4300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42718 ms. Remains : 591/1000 places, 3891/4300 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 667 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 6 ms.
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLCardinality-06 finished in 43496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1000 transition count 4290
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 990 transition count 4290
Performed 309 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 309 Pre rules applied. Total rules applied 20 place count 990 transition count 3981
Deduced a syphon composed of 309 places in 7 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 2 with 618 rules applied. Total rules applied 638 place count 681 transition count 3981
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 6 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 818 place count 591 transition count 3891
Applied a total of 818 rules in 444 ms. Remains 591 /1000 variables (removed 409) and now considering 3891/4300 (removed 409) transitions.
[2024-05-24 16:02:05] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2024-05-24 16:02:05] [INFO ] Computed 31 invariants in 5 ms
[2024-05-24 16:02:06] [INFO ] Implicit Places using invariants in 1579 ms returned []
[2024-05-24 16:02:06] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-05-24 16:02:06] [INFO ] Invariant cache hit.
[2024-05-24 16:02:07] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 16:02:13] [INFO ] Implicit Places using invariants and state equation in 6538 ms returned []
Implicit Place search using SMT with State Equation took 8124 ms to find 0 implicit places.
[2024-05-24 16:02:13] [INFO ] Redundant transitions in 309 ms returned []
Running 3881 sub problems to find dead transitions.
[2024-05-24 16:02:13] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-05-24 16:02:13] [INFO ] Invariant cache hit.
[2024-05-24 16:02:13] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3881 unsolved
SMT process timed out in 34262ms, After SMT, problems are : Problem set: 0 solved, 3881 unsolved
Search for dead transitions found 0 dead transitions in 34331ms
Starting structural reductions in SI_LTL mode, iteration 1 : 591/1000 places, 3891/4300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43229 ms. Remains : 591/1000 places, 3891/4300 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 605 ms.
Product exploration explored 100000 steps with 0 reset in 433 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 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 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 276 ms. (144 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 57495 steps, run visited all 1 properties in 567 ms. (steps per millisecond=101 )
Probabilistic random walk after 57495 steps, saw 43707 distinct states, run finished after 567 ms. (steps per millisecond=101 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 144 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 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 591 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 167 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
[2024-05-24 16:02:50] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-05-24 16:02:50] [INFO ] Invariant cache hit.
[2024-05-24 16:02:51] [INFO ] Implicit Places using invariants in 1180 ms returned []
[2024-05-24 16:02:51] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-05-24 16:02:51] [INFO ] Invariant cache hit.
[2024-05-24 16:02:52] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 16:02:58] [INFO ] Implicit Places using invariants and state equation in 6432 ms returned []
Implicit Place search using SMT with State Equation took 7617 ms to find 0 implicit places.
[2024-05-24 16:02:58] [INFO ] Redundant transitions in 292 ms returned []
Running 3881 sub problems to find dead transitions.
[2024-05-24 16:02:58] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-05-24 16:02:58] [INFO ] Invariant cache hit.
[2024-05-24 16:02:58] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3881 unsolved
SMT process timed out in 33917ms, After SMT, problems are : Problem set: 0 solved, 3881 unsolved
Search for dead transitions found 0 dead transitions in 33987ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42092 ms. Remains : 591/591 places, 3891/3891 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 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 106 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 57495 steps, run visited all 1 properties in 761 ms. (steps per millisecond=75 )
Probabilistic random walk after 57495 steps, saw 43707 distinct states, run finished after 761 ms. (steps per millisecond=75 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 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 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 342 ms.
Product exploration explored 100000 steps with 0 reset in 537 ms.
Built C files in :
/tmp/ltsmin16185107852589782177
[2024-05-24 16:03:34] [INFO ] Too many transitions (3891) to apply POR reductions. Disabling POR matrices.
[2024-05-24 16:03:34] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16185107852589782177
Running compilation step : cd /tmp/ltsmin16185107852589782177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16185107852589782177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16185107852589782177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 1 out of 591 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 163 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
[2024-05-24 16:03:38] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-05-24 16:03:38] [INFO ] Invariant cache hit.
[2024-05-24 16:03:39] [INFO ] Implicit Places using invariants in 1441 ms returned []
[2024-05-24 16:03:39] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-05-24 16:03:39] [INFO ] Invariant cache hit.
[2024-05-24 16:03:40] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 16:03:46] [INFO ] Implicit Places using invariants and state equation in 6851 ms returned []
Implicit Place search using SMT with State Equation took 8298 ms to find 0 implicit places.
[2024-05-24 16:03:46] [INFO ] Redundant transitions in 243 ms returned []
Running 3881 sub problems to find dead transitions.
[2024-05-24 16:03:46] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2024-05-24 16:03:46] [INFO ] Invariant cache hit.
[2024-05-24 16:03:46] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3881 unsolved
SMT process timed out in 33809ms, After SMT, problems are : Problem set: 0 solved, 3881 unsolved
Search for dead transitions found 0 dead transitions in 33868ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42590 ms. Remains : 591/591 places, 3891/3891 transitions.
Built C files in :
/tmp/ltsmin1246391446449739574
[2024-05-24 16:04:20] [INFO ] Too many transitions (3891) to apply POR reductions. Disabling POR matrices.
[2024-05-24 16:04:20] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1246391446449739574
Running compilation step : cd /tmp/ltsmin1246391446449739574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1246391446449739574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1246391446449739574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 16:04:24] [INFO ] Flatten gal took : 162 ms
[2024-05-24 16:04:24] [INFO ] Flatten gal took : 163 ms
[2024-05-24 16:04:24] [INFO ] Time to serialize gal into /tmp/LTL8708947242884979345.gal : 23 ms
[2024-05-24 16:04:24] [INFO ] Time to serialize properties into /tmp/LTL7792906240927391323.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8708947242884979345.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17716919577143120553.hoa' '-atoms' '/tmp/LTL7792906240927391323.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7792906240927391323.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17716919577143120553.hoa
Detected timeout of ITS tools.
[2024-05-24 16:04:39] [INFO ] Flatten gal took : 160 ms
[2024-05-24 16:04:39] [INFO ] Flatten gal took : 164 ms
[2024-05-24 16:04:39] [INFO ] Time to serialize gal into /tmp/LTL2438739934132188746.gal : 23 ms
[2024-05-24 16:04:39] [INFO ] Time to serialize properties into /tmp/LTL14983719225817235540.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2438739934132188746.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14983719225817235540.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(p33_3_7!=1)"))))
Formula 0 simplified : FG!"(p33_3_7!=1)"
Detected timeout of ITS tools.
[2024-05-24 16:04:54] [INFO ] Flatten gal took : 103 ms
[2024-05-24 16:04:54] [INFO ] Applying decomposition
[2024-05-24 16:04:55] [INFO ] Flatten gal took : 121 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2276312757432892030.txt' '-o' '/tmp/graph2276312757432892030.bin' '-w' '/tmp/graph2276312757432892030.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2276312757432892030.bin' '-l' '-1' '-v' '-w' '/tmp/graph2276312757432892030.weights' '-q' '0' '-e' '0.001'
[2024-05-24 16:04:55] [INFO ] Decomposing Gal with order
[2024-05-24 16:04:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 16:04:55] [INFO ] Removed a total of 8743 redundant transitions.
[2024-05-24 16:04:55] [INFO ] Flatten gal took : 322 ms
[2024-05-24 16:04:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 729 labels/synchronizations in 101 ms.
[2024-05-24 16:04:55] [INFO ] Time to serialize gal into /tmp/LTL11604967544889235835.gal : 25 ms
[2024-05-24 16:04:55] [INFO ] Time to serialize properties into /tmp/LTL8935499920093658164.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11604967544889235835.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8935499920093658164.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(i14.u38.p33_3_7!=1)"))))
Formula 0 simplified : FG!"(i14.u38.p33_3_7!=1)"
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-10-LTLCardinality-09 finished in 186058 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((F(p0)&&X(X(F(p1))))))))'
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Applied a total of 0 rules in 40 ms. Remains 1000 /1000 variables (removed 0) and now considering 4300/4300 (removed 0) transitions.
[2024-05-24 16:05:10] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
// Phase 1: matrix 1430 rows 1000 cols
[2024-05-24 16:05:10] [INFO ] Computed 31 invariants in 7 ms
[2024-05-24 16:05:12] [INFO ] Implicit Places using invariants in 1358 ms returned []
[2024-05-24 16:05:12] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-05-24 16:05:12] [INFO ] Invariant cache hit.
[2024-05-24 16:05:13] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 16:05:24] [INFO ] Implicit Places using invariants and state equation in 11963 ms returned []
Implicit Place search using SMT with State Equation took 13323 ms to find 0 implicit places.
Running 4290 sub problems to find dead transitions.
[2024-05-24 16:05:24] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-05-24 16:05:24] [INFO ] Invariant cache hit.
[2024-05-24 16:05:24] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4290 unsolved
SMT process timed out in 34058ms, After SMT, problems are : Problem set: 0 solved, 4290 unsolved
Search for dead transitions found 0 dead transitions in 34103ms
Finished structural reductions in LTL mode , in 1 iterations and 47478 ms. Remains : 1000/1000 places, 4300/4300 transitions.
Stuttering acceptance computed with spot in 419 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLCardinality-10
Product exploration explored 100000 steps with 16666 reset in 1148 ms.
Product exploration explored 100000 steps with 16666 reset in 931 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 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 224 ms. (177 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
[2024-05-24 16:06:01] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-05-24 16:06:01] [INFO ] Invariant cache hit.
[2024-05-24 16:06:01] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 192/194 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/198 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 286/484 variables, 198/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 10/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 154/638 variables, 10/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/638 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/638 variables, 24/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/638 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 208/846 variables, 96/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/846 variables, 30/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/846 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 679/1525 variables, 15/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1525 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1527 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1527 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 15/1542 variables, 8/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1542 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 888/2430 variables, 696/1095 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2430 variables, 372/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2430 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2430 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2430/2430 variables, and 1467 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1615 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1000/1000 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 192/194 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/198 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:06:03] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 286/484 variables, 198/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 10/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 154/638 variables, 10/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/638 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/638 variables, 24/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/638 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 208/846 variables, 96/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/846 variables, 30/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/846 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 679/1525 variables, 15/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1525 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1527 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:06:04] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1527 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1527 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 15/1542 variables, 8/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1542 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:06:04] [INFO ] Deduced a trap composed of 35 places in 391 ms of which 5 ms to minimize.
[2024-05-24 16:06:05] [INFO ] Deduced a trap composed of 29 places in 241 ms of which 4 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1542 variables, 2/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1542 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 888/2430 variables, 696/1100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2430 variables, 372/1472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:06:06] [INFO ] Deduced a trap composed of 3 places in 404 ms of which 5 ms to minimize.
[2024-05-24 16:06:06] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 4 ms to minimize.
[2024-05-24 16:06:07] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 7 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/2430 variables, 3/1475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2430 variables, 0/1475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2430 variables, 0/1475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2430/2430 variables, and 1475 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4410 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1000/1000 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 6068ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 361 ms.
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1000 transition count 4290
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 990 transition count 4290
Performed 308 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 308 Pre rules applied. Total rules applied 20 place count 990 transition count 3982
Deduced a syphon composed of 308 places in 7 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 2 with 616 rules applied. Total rules applied 636 place count 682 transition count 3982
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 6 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 816 place count 592 transition count 3892
Applied a total of 816 rules in 460 ms. Remains 592 /1000 variables (removed 408) and now considering 3892/4300 (removed 408) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 461 ms. Remains : 592/1000 places, 3892/4300 transitions.
RANDOM walk for 40000 steps (8 resets) in 243 ms. (163 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 90396 steps, run visited all 1 properties in 944 ms. (steps per millisecond=95 )
Probabilistic random walk after 90396 steps, saw 66872 distinct states, run finished after 947 ms. (steps per millisecond=95 ) properties seen :1
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 165 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 340 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 381 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Applied a total of 0 rules in 52 ms. Remains 1000 /1000 variables (removed 0) and now considering 4300/4300 (removed 0) transitions.
[2024-05-24 16:06:10] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-05-24 16:06:10] [INFO ] Invariant cache hit.
[2024-05-24 16:06:12] [INFO ] Implicit Places using invariants in 1909 ms returned []
[2024-05-24 16:06:12] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-05-24 16:06:12] [INFO ] Invariant cache hit.
[2024-05-24 16:06:13] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 16:06:24] [INFO ] Implicit Places using invariants and state equation in 12639 ms returned []
Implicit Place search using SMT with State Equation took 14555 ms to find 0 implicit places.
Running 4290 sub problems to find dead transitions.
[2024-05-24 16:06:25] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-05-24 16:06:25] [INFO ] Invariant cache hit.
[2024-05-24 16:06:25] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4290 unsolved
SMT process timed out in 34167ms, After SMT, problems are : Problem set: 0 solved, 4290 unsolved
Search for dead transitions found 0 dead transitions in 34219ms
Finished structural reductions in LTL mode , in 1 iterations and 48837 ms. Remains : 1000/1000 places, 4300/4300 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 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 130 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 375 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 247 ms. (161 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
[2024-05-24 16:06:59] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-05-24 16:06:59] [INFO ] Invariant cache hit.
[2024-05-24 16:06:59] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 192/194 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/198 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 286/484 variables, 198/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 10/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 154/638 variables, 10/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/638 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/638 variables, 24/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/638 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 208/846 variables, 96/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/846 variables, 30/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/846 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 679/1525 variables, 15/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1525 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1527 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1527 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 15/1542 variables, 8/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1542 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 888/2430 variables, 696/1095 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2430 variables, 372/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2430 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2430 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2430/2430 variables, and 1467 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1330 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1000/1000 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 192/194 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/198 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:07:01] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 286/484 variables, 198/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 10/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 154/638 variables, 10/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/638 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/638 variables, 24/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/638 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 208/846 variables, 96/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/846 variables, 30/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/846 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 679/1525 variables, 15/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1525 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1527 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:07:02] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1527 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1527 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 15/1542 variables, 8/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1542 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:07:02] [INFO ] Deduced a trap composed of 35 places in 334 ms of which 5 ms to minimize.
[2024-05-24 16:07:02] [INFO ] Deduced a trap composed of 29 places in 211 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1542 variables, 2/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1542 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 888/2430 variables, 696/1100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2430 variables, 372/1472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:07:04] [INFO ] Deduced a trap composed of 3 places in 365 ms of which 3 ms to minimize.
[2024-05-24 16:07:04] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 4 ms to minimize.
[2024-05-24 16:07:04] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 3 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/2430 variables, 3/1475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2430 variables, 0/1475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2430 variables, 0/1475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2430/2430 variables, and 1475 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3765 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1000/1000 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 5135ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 437 ms.
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1000 transition count 4290
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 990 transition count 4290
Performed 308 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 308 Pre rules applied. Total rules applied 20 place count 990 transition count 3982
Deduced a syphon composed of 308 places in 8 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 2 with 616 rules applied. Total rules applied 636 place count 682 transition count 3982
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 8 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 816 place count 592 transition count 3892
Applied a total of 816 rules in 487 ms. Remains 592 /1000 variables (removed 408) and now considering 3892/4300 (removed 408) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 487 ms. Remains : 592/1000 places, 3892/4300 transitions.
RANDOM walk for 40000 steps (8 resets) in 445 ms. (89 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 90396 steps, run visited all 1 properties in 913 ms. (steps per millisecond=99 )
Probabilistic random walk after 90396 steps, saw 66872 distinct states, run finished after 913 ms. (steps per millisecond=99 ) properties seen :1
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 204 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 367 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 364 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 355 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 16666 reset in 855 ms.
Product exploration explored 100000 steps with 16666 reset in 825 ms.
Applying partial POR strategy [false, false, false, false, true, false, true]
Stuttering acceptance computed with spot in 375 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1000 transition count 4300
Performed 297 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 297 Pre rules applied. Total rules applied 10 place count 1000 transition count 4816
Deduced a syphon composed of 307 places in 4 ms
Iterating global reduction 1 with 297 rules applied. Total rules applied 307 place count 1000 transition count 4816
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 406 places in 4 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 406 place count 1000 transition count 4816
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 416 place count 990 transition count 4806
Deduced a syphon composed of 396 places in 4 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 426 place count 990 transition count 4806
Deduced a syphon composed of 396 places in 4 ms
Applied a total of 426 rules in 629 ms. Remains 990 /1000 variables (removed 10) and now considering 4806/4300 (removed -506) transitions.
[2024-05-24 16:07:11] [INFO ] Redundant transitions in 274 ms returned []
Running 4796 sub problems to find dead transitions.
[2024-05-24 16:07:11] [INFO ] Flow matrix only has 1678 transitions (discarded 3128 similar events)
// Phase 1: matrix 1678 rows 990 cols
[2024-05-24 16:07:11] [INFO ] Computed 31 invariants in 16 ms
[2024-05-24 16:07:11] [INFO ] State equation strengthened by 722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/990 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4796 unsolved
SMT process timed out in 34668ms, After SMT, problems are : Problem set: 0 solved, 4796 unsolved
Search for dead transitions found 0 dead transitions in 34724ms
Starting structural reductions in SI_LTL mode, iteration 1 : 990/1000 places, 4806/4300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35648 ms. Remains : 990/1000 places, 4806/4300 transitions.
Built C files in :
/tmp/ltsmin12573110979801078214
[2024-05-24 16:07:46] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12573110979801078214
Running compilation step : cd /tmp/ltsmin12573110979801078214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12573110979801078214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12573110979801078214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Applied a total of 0 rules in 39 ms. Remains 1000 /1000 variables (removed 0) and now considering 4300/4300 (removed 0) transitions.
[2024-05-24 16:07:49] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
// Phase 1: matrix 1430 rows 1000 cols
[2024-05-24 16:07:49] [INFO ] Computed 31 invariants in 13 ms
[2024-05-24 16:07:51] [INFO ] Implicit Places using invariants in 1708 ms returned []
[2024-05-24 16:07:51] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-05-24 16:07:51] [INFO ] Invariant cache hit.
[2024-05-24 16:07:52] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 16:08:05] [INFO ] Implicit Places using invariants and state equation in 14134 ms returned []
Implicit Place search using SMT with State Equation took 15848 ms to find 0 implicit places.
Running 4290 sub problems to find dead transitions.
[2024-05-24 16:08:05] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2024-05-24 16:08:05] [INFO ] Invariant cache hit.
[2024-05-24 16:08:05] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4290 unsolved
SMT process timed out in 34723ms, After SMT, problems are : Problem set: 0 solved, 4290 unsolved
Search for dead transitions found 0 dead transitions in 34780ms
Finished structural reductions in LTL mode , in 1 iterations and 50679 ms. Remains : 1000/1000 places, 4300/4300 transitions.
Built C files in :
/tmp/ltsmin13021407582248864136
[2024-05-24 16:08:40] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13021407582248864136
Running compilation step : cd /tmp/ltsmin13021407582248864136;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13021407582248864136;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13021407582248864136;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 16:08:43] [INFO ] Flatten gal took : 111 ms
[2024-05-24 16:08:43] [INFO ] Flatten gal took : 120 ms
[2024-05-24 16:08:43] [INFO ] Time to serialize gal into /tmp/LTL15303655821046504143.gal : 21 ms
[2024-05-24 16:08:43] [INFO ] Time to serialize properties into /tmp/LTL12970656096538432586.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15303655821046504143.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12493272166294531640.hoa' '-atoms' '/tmp/LTL12970656096538432586.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12970656096538432586.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12493272166294531640.hoa
Detected timeout of ITS tools.
[2024-05-24 16:08:59] [INFO ] Flatten gal took : 114 ms
[2024-05-24 16:08:59] [INFO ] Flatten gal took : 123 ms
[2024-05-24 16:08:59] [INFO ] Time to serialize gal into /tmp/LTL14301059079597532905.gal : 21 ms
[2024-05-24 16:08:59] [INFO ] Time to serialize properties into /tmp/LTL9617352469539185442.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14301059079597532905.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9617352469539185442.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F("((p18_3_4==0)||(p12_5_4==1))"))&&(X(X(F("((p34_2_3==0)||(p33_4_4==1))")))))))))
Formula 0 simplified : XXX(G!"((p18_3_4==0)||(p12_5_4==1))" | XXG!"((p34_2_3==0)||(p33_4_4==1))")
Detected timeout of ITS tools.
[2024-05-24 16:09:14] [INFO ] Flatten gal took : 114 ms
[2024-05-24 16:09:14] [INFO ] Applying decomposition
[2024-05-24 16:09:14] [INFO ] Flatten gal took : 124 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17660808732661344303.txt' '-o' '/tmp/graph17660808732661344303.bin' '-w' '/tmp/graph17660808732661344303.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17660808732661344303.bin' '-l' '-1' '-v' '-w' '/tmp/graph17660808732661344303.weights' '-q' '0' '-e' '0.001'
[2024-05-24 16:09:14] [INFO ] Decomposing Gal with order
[2024-05-24 16:09:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 16:09:15] [INFO ] Removed a total of 9056 redundant transitions.
[2024-05-24 16:09:15] [INFO ] Flatten gal took : 427 ms
[2024-05-24 16:09:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 824 labels/synchronizations in 108 ms.
[2024-05-24 16:09:15] [INFO ] Time to serialize gal into /tmp/LTL2813611224460561451.gal : 26 ms
[2024-05-24 16:09:15] [INFO ] Time to serialize properties into /tmp/LTL1588564600593589618.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2813611224460561451.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1588564600593589618.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F("((i14.u228.p18_3_4==0)||(i21.u153.p12_5_4==1))"))&&(X(X(F("((i23.u269.p34_2_3==0)||(i22.u124.p33_4_4==1))")))))))))
Formula 0 simplified : XXX(G!"((i14.u228.p18_3_4==0)||(i21.u153.p12_5_4==1))" | XXG!"((i23.u269.p34_2_3==0)||(i22.u124.p33_4_4==1))")
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-10-LTLCardinality-10 finished in 259788 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((G(p1)||p0))))'
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1000 transition count 4290
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 990 transition count 4290
Performed 308 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 308 Pre rules applied. Total rules applied 20 place count 990 transition count 3982
Deduced a syphon composed of 308 places in 4 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 2 with 616 rules applied. Total rules applied 636 place count 682 transition count 3982
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 3 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 814 place count 593 transition count 3893
Applied a total of 814 rules in 375 ms. Remains 593 /1000 variables (removed 407) and now considering 3893/4300 (removed 407) transitions.
[2024-05-24 16:09:31] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
// Phase 1: matrix 1023 rows 593 cols
[2024-05-24 16:09:31] [INFO ] Computed 31 invariants in 4 ms
[2024-05-24 16:09:32] [INFO ] Implicit Places using invariants in 1772 ms returned []
[2024-05-24 16:09:32] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2024-05-24 16:09:32] [INFO ] Invariant cache hit.
[2024-05-24 16:09:33] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 16:09:40] [INFO ] Implicit Places using invariants and state equation in 8063 ms returned []
Implicit Place search using SMT with State Equation took 9843 ms to find 0 implicit places.
[2024-05-24 16:09:41] [INFO ] Redundant transitions in 312 ms returned []
Running 3883 sub problems to find dead transitions.
[2024-05-24 16:09:41] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2024-05-24 16:09:41] [INFO ] Invariant cache hit.
[2024-05-24 16:09:41] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3883 unsolved
SMT process timed out in 33710ms, After SMT, problems are : Problem set: 0 solved, 3883 unsolved
Search for dead transitions found 0 dead transitions in 33774ms
Starting structural reductions in SI_LTL mode, iteration 1 : 593/1000 places, 3893/4300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44317 ms. Remains : 593/1000 places, 3893/4300 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 537 ms.
Product exploration explored 100000 steps with 0 reset in 577 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 p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 112 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 562 ms. (71 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 360 ms. (110 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 3/3 properties
[2024-05-24 16:10:17] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2024-05-24 16:10:17] [INFO ] Invariant cache hit.
[2024-05-24 16:10:17] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/227 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/235 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 411/646 variables, 235/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 44/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 118/764 variables, 10/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/764 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 48/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 156/920 variables, 72/422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/920 variables, 39/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/920 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 264/1184 variables, 12/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1184 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 12/1196 variables, 6/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1196 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 420/1616 variables, 276/755 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1616 variables, 305/1060 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1616 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/1616 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1616/1616 variables, and 1060 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1474 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 593/593 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/227 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/235 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:10:18] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:10:19] [INFO ] Deduced a trap composed of 33 places in 286 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 411/646 variables, 235/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 44/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 118/764 variables, 10/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 48/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/764 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 156/920 variables, 72/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/920 variables, 39/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:10:19] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/920 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/920 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 264/1184 variables, 12/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1184 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 12/1196 variables, 6/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1196 variables, 3/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:10:21] [INFO ] Deduced a trap composed of 3 places in 583 ms of which 4 ms to minimize.
[2024-05-24 16:10:21] [INFO ] Deduced a trap composed of 3 places in 609 ms of which 6 ms to minimize.
[2024-05-24 16:10:22] [INFO ] Deduced a trap composed of 3 places in 411 ms of which 5 ms to minimize.
[2024-05-24 16:10:22] [INFO ] Deduced a trap composed of 21 places in 408 ms of which 4 ms to minimize.
[2024-05-24 16:10:22] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1196 variables, 5/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1196 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 420/1616 variables, 276/766 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1616 variables, 305/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 1)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 1)
(s25 1)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 1)
(s40 1)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 1)
(s47 0)
(s48 0)
(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 0)
(s63 0)
(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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1616/1616 variables, and 1071 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 593/593 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints]
After SMT, in 6524ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 3893/3893 transitions.
Applied a total of 0 rules in 266 ms. Remains 593 /593 variables (removed 0) and now considering 3893/3893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 267 ms. Remains : 593/593 places, 3893/3893 transitions.
RANDOM walk for 40000 steps (8 resets) in 1420 ms. (28 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 147763 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 3
Probabilistic random walk after 147763 steps, saw 105264 distinct states, run finished after 3002 ms. (steps per millisecond=49 ) properties seen :0
[2024-05-24 16:10:27] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2024-05-24 16:10:27] [INFO ] Invariant cache hit.
[2024-05-24 16:10:27] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/227 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/235 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 411/646 variables, 235/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 44/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 118/764 variables, 10/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/764 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 48/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 156/920 variables, 72/422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/920 variables, 39/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/920 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 264/1184 variables, 12/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1184 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 12/1196 variables, 6/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1196 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 420/1616 variables, 276/755 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1616 variables, 305/1060 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1616 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/1616 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1616/1616 variables, and 1060 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1421 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 593/593 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/227 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/235 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:10:29] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2024-05-24 16:10:29] [INFO ] Deduced a trap composed of 33 places in 281 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 411/646 variables, 235/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 44/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 118/764 variables, 10/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 48/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/764 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 156/920 variables, 72/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/920 variables, 39/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:10:30] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/920 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/920 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 264/1184 variables, 12/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1184 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 12/1196 variables, 6/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1196 variables, 3/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:10:31] [INFO ] Deduced a trap composed of 3 places in 493 ms of which 4 ms to minimize.
[2024-05-24 16:10:31] [INFO ] Deduced a trap composed of 3 places in 565 ms of which 5 ms to minimize.
[2024-05-24 16:10:32] [INFO ] Deduced a trap composed of 3 places in 467 ms of which 5 ms to minimize.
[2024-05-24 16:10:32] [INFO ] Deduced a trap composed of 21 places in 365 ms of which 3 ms to minimize.
[2024-05-24 16:10:32] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1196 variables, 5/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1196 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 420/1616 variables, 276/766 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1616 variables, 305/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1616 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 0/1616 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1616/1616 variables, and 1071 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5349 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 593/593 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints]
After SMT, in 6818ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 256 ms.
Support contains 4 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 3893/3893 transitions.
Applied a total of 0 rules in 266 ms. Remains 593 /593 variables (removed 0) and now considering 3893/3893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266 ms. Remains : 593/593 places, 3893/3893 transitions.
RANDOM walk for 40000 steps (8 resets) in 434 ms. (91 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 292402 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 1
Probabilistic random walk after 292402 steps, saw 198529 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
[2024-05-24 16:10:37] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2024-05-24 16:10:37] [INFO ] Invariant cache hit.
[2024-05-24 16:10:37] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/227 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/235 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 411/646 variables, 235/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 44/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 118/764 variables, 10/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/764 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 48/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 156/920 variables, 72/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/920 variables, 39/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/920 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 264/1184 variables, 12/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1184 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 12/1196 variables, 6/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1196 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 420/1616 variables, 276/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1616 variables, 305/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1616 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1616 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1616/1616 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 776 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 593/593 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/227 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/235 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 411/646 variables, 235/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 44/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 118/764 variables, 10/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/764 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 48/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 156/920 variables, 72/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/920 variables, 39/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/920 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 264/1184 variables, 12/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1184 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 12/1196 variables, 6/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1196 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:10:40] [INFO ] Deduced a trap composed of 3 places in 953 ms of which 9 ms to minimize.
[2024-05-24 16:10:41] [INFO ] Deduced a trap composed of 3 places in 1010 ms of which 8 ms to minimize.
[2024-05-24 16:10:41] [INFO ] Deduced a trap composed of 3 places in 476 ms of which 5 ms to minimize.
[2024-05-24 16:10:42] [INFO ] Deduced a trap composed of 3 places in 196 ms of which 2 ms to minimize.
[2024-05-24 16:10:42] [INFO ] Deduced a trap composed of 3 places in 278 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1196 variables, 5/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:10:42] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1196 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:10:42] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1196 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1196 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 420/1616 variables, 276/763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1616 variables, 305/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1616 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1616 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1616/1616 variables, and 1068 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4820 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 593/593 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 5621ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 206 ms.
Support contains 4 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 3893/3893 transitions.
Applied a total of 0 rules in 277 ms. Remains 593 /593 variables (removed 0) and now considering 3893/3893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 593/593 places, 3893/3893 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 3893/3893 transitions.
Applied a total of 0 rules in 271 ms. Remains 593 /593 variables (removed 0) and now considering 3893/3893 (removed 0) transitions.
[2024-05-24 16:10:44] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2024-05-24 16:10:44] [INFO ] Invariant cache hit.
[2024-05-24 16:10:45] [INFO ] Implicit Places using invariants in 1557 ms returned []
[2024-05-24 16:10:45] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2024-05-24 16:10:45] [INFO ] Invariant cache hit.
[2024-05-24 16:10:46] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 16:10:52] [INFO ] Implicit Places using invariants and state equation in 6576 ms returned []
Implicit Place search using SMT with State Equation took 8140 ms to find 0 implicit places.
[2024-05-24 16:10:52] [INFO ] Redundant transitions in 180 ms returned []
Running 3883 sub problems to find dead transitions.
[2024-05-24 16:10:52] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2024-05-24 16:10:52] [INFO ] Invariant cache hit.
[2024-05-24 16:10:52] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3883 unsolved
SMT process timed out in 33898ms, After SMT, problems are : Problem set: 0 solved, 3883 unsolved
Search for dead transitions found 0 dead transitions in 33938ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42553 ms. Remains : 593/593 places, 3893/3893 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3635 edges and 593 vertex of which 99 / 593 are part of one of the 10 SCC in 8 ms
Free SCC test removed 89 places
Drop transitions (Empty/Sink Transition effects.) removed 345 transitions
Ensure Unique test removed 2792 transitions
Reduce isomorphic transitions removed 3137 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 504 transition count 639
Reduce places removed 117 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 118 rules applied. Total rules applied 236 place count 387 transition count 638
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 237 place count 386 transition count 638
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 237 place count 386 transition count 619
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 283 place count 359 transition count 619
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 639 place count 181 transition count 441
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 3 with 87 rules applied. Total rules applied 726 place count 181 transition count 354
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 744 place count 172 transition count 355
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 752 place count 172 transition count 347
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 761 place count 172 transition count 338
Free-agglomeration rule applied 92 times.
Iterating global reduction 5 with 92 rules applied. Total rules applied 853 place count 172 transition count 246
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 5 with 92 rules applied. Total rules applied 945 place count 80 transition count 246
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 955 place count 80 transition count 246
Applied a total of 955 rules in 150 ms. Remains 80 /593 variables (removed 513) and now considering 246/3893 (removed 3647) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 246 rows 80 cols
[2024-05-24 16:11:26] [INFO ] Computed 23 invariants in 2 ms
[2024-05-24 16:11:26] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 16:11:26] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2024-05-24 16:11:26] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-24 16:11:27] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 16:11:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 16:11:27] [INFO ] After 18ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 16:11:27] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 16:11:27] [INFO ] After 258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 491 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 288 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 593 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 593/593 places, 3893/3893 transitions.
Applied a total of 0 rules in 433 ms. Remains 593 /593 variables (removed 0) and now considering 3893/3893 (removed 0) transitions.
[2024-05-24 16:11:28] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
// Phase 1: matrix 1023 rows 593 cols
[2024-05-24 16:11:28] [INFO ] Computed 31 invariants in 9 ms
[2024-05-24 16:11:29] [INFO ] Implicit Places using invariants in 1228 ms returned []
[2024-05-24 16:11:29] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2024-05-24 16:11:29] [INFO ] Invariant cache hit.
[2024-05-24 16:11:30] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 16:11:37] [INFO ] Implicit Places using invariants and state equation in 8167 ms returned []
Implicit Place search using SMT with State Equation took 9397 ms to find 0 implicit places.
[2024-05-24 16:11:37] [INFO ] Redundant transitions in 239 ms returned []
Running 3883 sub problems to find dead transitions.
[2024-05-24 16:11:37] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2024-05-24 16:11:37] [INFO ] Invariant cache hit.
[2024-05-24 16:11:37] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3883 unsolved
SMT process timed out in 33794ms, After SMT, problems are : Problem set: 0 solved, 3883 unsolved
Search for dead transitions found 0 dead transitions in 33847ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43935 ms. Remains : 593/593 places, 3893/3893 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 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 161 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 1166 ms. (34 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 3/3 properties
[2024-05-24 16:12:12] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2024-05-24 16:12:12] [INFO ] Invariant cache hit.
[2024-05-24 16:12:12] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/227 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/235 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 411/646 variables, 235/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 44/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 118/764 variables, 10/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/764 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 48/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 156/920 variables, 72/422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/920 variables, 39/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/920 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 264/1184 variables, 12/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1184 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 12/1196 variables, 6/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1196 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 420/1616 variables, 276/755 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1616 variables, 305/1060 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1616 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/1616 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1616/1616 variables, and 1060 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1534 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 593/593 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/227 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/235 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:12:14] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 2 ms to minimize.
[2024-05-24 16:12:14] [INFO ] Deduced a trap composed of 33 places in 285 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 411/646 variables, 235/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 44/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 118/764 variables, 10/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 48/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/764 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 156/920 variables, 72/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/920 variables, 39/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:12:15] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/920 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/920 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 264/1184 variables, 12/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1184 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 12/1196 variables, 6/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1196 variables, 3/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:12:16] [INFO ] Deduced a trap composed of 3 places in 704 ms of which 6 ms to minimize.
[2024-05-24 16:12:17] [INFO ] Deduced a trap composed of 3 places in 483 ms of which 5 ms to minimize.
[2024-05-24 16:12:17] [INFO ] Deduced a trap composed of 3 places in 460 ms of which 5 ms to minimize.
[2024-05-24 16:12:18] [INFO ] Deduced a trap composed of 21 places in 378 ms of which 4 ms to minimize.
[2024-05-24 16:12:18] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1196 variables, 5/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1196 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 420/1616 variables, 276/766 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1616 variables, 305/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1616/1616 variables, and 1071 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 593/593 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints]
After SMT, in 6581ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 3893/3893 transitions.
Applied a total of 0 rules in 260 ms. Remains 593 /593 variables (removed 0) and now considering 3893/3893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 261 ms. Remains : 593/593 places, 3893/3893 transitions.
RANDOM walk for 40000 steps (8 resets) in 1533 ms. (26 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 99583 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 3
Probabilistic random walk after 99583 steps, saw 73143 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
[2024-05-24 16:12:22] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2024-05-24 16:12:22] [INFO ] Invariant cache hit.
[2024-05-24 16:12:22] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/227 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/235 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 411/646 variables, 235/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 44/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 118/764 variables, 10/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/764 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 48/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 156/920 variables, 72/422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/920 variables, 39/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/920 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 264/1184 variables, 12/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1184 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 12/1196 variables, 6/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1196 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 420/1616 variables, 276/755 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1616 variables, 305/1060 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1616 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/1616 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1616/1616 variables, and 1060 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1420 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 593/593 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/227 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/235 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:12:24] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
[2024-05-24 16:12:24] [INFO ] Deduced a trap composed of 33 places in 294 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 411/646 variables, 235/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 44/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 118/764 variables, 10/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 48/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/764 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 156/920 variables, 72/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/920 variables, 39/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:12:25] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/920 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/920 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 264/1184 variables, 12/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1184 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 12/1196 variables, 6/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1196 variables, 3/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 16:12:26] [INFO ] Deduced a trap composed of 3 places in 703 ms of which 6 ms to minimize.
[2024-05-24 16:12:27] [INFO ] Deduced a trap composed of 3 places in 491 ms of which 6 ms to minimize.
[2024-05-24 16:12:27] [INFO ] Deduced a trap composed of 3 places in 478 ms of which 5 ms to minimize.
[2024-05-24 16:12:28] [INFO ] Deduced a trap composed of 21 places in 337 ms of which 4 ms to minimize.
[2024-05-24 16:12:28] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1196 variables, 5/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1196 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 420/1616 variables, 276/766 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1616 variables, 305/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1616 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 0/1616 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1616/1616 variables, and 1071 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5081 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 593/593 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints]
After SMT, in 6524ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 163 ms.
Support contains 4 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 3893/3893 transitions.
Applied a total of 0 rules in 167 ms. Remains 593 /593 variables (removed 0) and now considering 3893/3893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 593/593 places, 3893/3893 transitions.
RANDOM walk for 40000 steps (8 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 275748 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 1
Probabilistic random walk after 275748 steps, saw 187959 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
[2024-05-24 16:12:32] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2024-05-24 16:12:32] [INFO ] Invariant cache hit.
[2024-05-24 16:12:32] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/227 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/235 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 411/646 variables, 235/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 44/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 118/764 variables, 10/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/764 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 48/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 156/920 variables, 72/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/920 variables, 39/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/920 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 264/1184 variables, 12/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1184 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 12/1196 variables, 6/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1196 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 420/1616 variables, 276/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1616 variables, 305/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1616 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1616 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1616/1616 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1 unsolved in 778 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 593/593 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/227 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/235 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 411/646 variables, 235/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 44/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 118/764 variables, 10/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/764 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 48/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 156/920 variables, 72/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/920 variables, 39/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/920 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 264/1184 variables, 12/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1184 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 12/1196 variables, 6/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1196 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:12:35] [INFO ] Deduced a trap composed of 3 places in 810 ms of which 5 ms to minimize.
[2024-05-24 16:12:36] [INFO ] Deduced a trap composed of 3 places in 786 ms of which 6 ms to minimize.
[2024-05-24 16:12:36] [INFO ] Deduced a trap composed of 3 places in 466 ms of which 5 ms to minimize.
[2024-05-24 16:12:36] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 1 ms to minimize.
[2024-05-24 16:12:36] [INFO ] Deduced a trap composed of 3 places in 207 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1196 variables, 5/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:12:37] [INFO ] Deduced a trap composed of 7 places in 207 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1196 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:12:37] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1196 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1196 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 420/1616 variables, 276/763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1616 variables, 305/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1616 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1616 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1616/1616 variables, and 1068 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4487 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 593/593 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 5287ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 205 ms.
Support contains 4 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 3893/3893 transitions.
Applied a total of 0 rules in 286 ms. Remains 593 /593 variables (removed 0) and now considering 3893/3893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 286 ms. Remains : 593/593 places, 3893/3893 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 3893/3893 transitions.
Applied a total of 0 rules in 254 ms. Remains 593 /593 variables (removed 0) and now considering 3893/3893 (removed 0) transitions.
[2024-05-24 16:12:38] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2024-05-24 16:12:38] [INFO ] Invariant cache hit.
[2024-05-24 16:12:40] [INFO ] Implicit Places using invariants in 1198 ms returned []
[2024-05-24 16:12:40] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2024-05-24 16:12:40] [INFO ] Invariant cache hit.
[2024-05-24 16:12:40] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 16:12:45] [INFO ] Implicit Places using invariants and state equation in 5576 ms returned []
Implicit Place search using SMT with State Equation took 6775 ms to find 0 implicit places.
[2024-05-24 16:12:45] [INFO ] Redundant transitions in 187 ms returned []
Running 3883 sub problems to find dead transitions.
[2024-05-24 16:12:45] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2024-05-24 16:12:45] [INFO ] Invariant cache hit.
[2024-05-24 16:12:45] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3883 unsolved
SMT process timed out in 34164ms, After SMT, problems are : Problem set: 0 solved, 3883 unsolved
Search for dead transitions found 0 dead transitions in 34230ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41483 ms. Remains : 593/593 places, 3893/3893 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3635 edges and 593 vertex of which 99 / 593 are part of one of the 10 SCC in 2 ms
Free SCC test removed 89 places
Drop transitions (Empty/Sink Transition effects.) removed 345 transitions
Ensure Unique test removed 2792 transitions
Reduce isomorphic transitions removed 3137 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 504 transition count 639
Reduce places removed 117 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 118 rules applied. Total rules applied 236 place count 387 transition count 638
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 237 place count 386 transition count 638
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 237 place count 386 transition count 619
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 283 place count 359 transition count 619
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 639 place count 181 transition count 441
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 3 with 87 rules applied. Total rules applied 726 place count 181 transition count 354
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 744 place count 172 transition count 355
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 752 place count 172 transition count 347
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 761 place count 172 transition count 338
Free-agglomeration rule applied 92 times.
Iterating global reduction 5 with 92 rules applied. Total rules applied 853 place count 172 transition count 246
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 5 with 92 rules applied. Total rules applied 945 place count 80 transition count 246
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 955 place count 80 transition count 246
Applied a total of 955 rules in 88 ms. Remains 80 /593 variables (removed 513) and now considering 246/3893 (removed 3647) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 246 rows 80 cols
[2024-05-24 16:13:20] [INFO ] Computed 23 invariants in 2 ms
[2024-05-24 16:13:20] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 16:13:20] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2024-05-24 16:13:20] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-24 16:13:20] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 16:13:20] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 16:13:20] [INFO ] After 17ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 16:13:20] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 16:13:20] [INFO ] After 244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 396 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 295 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 510 ms.
Product exploration explored 100000 steps with 0 reset in 583 ms.
Built C files in :
/tmp/ltsmin13090881176119683317
[2024-05-24 16:13:22] [INFO ] Too many transitions (3893) to apply POR reductions. Disabling POR matrices.
[2024-05-24 16:13:22] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13090881176119683317
Running compilation step : cd /tmp/ltsmin13090881176119683317;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13090881176119683317;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13090881176119683317;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 593 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 593/593 places, 3893/3893 transitions.
Applied a total of 0 rules in 163 ms. Remains 593 /593 variables (removed 0) and now considering 3893/3893 (removed 0) transitions.
[2024-05-24 16:13:25] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
// Phase 1: matrix 1023 rows 593 cols
[2024-05-24 16:13:25] [INFO ] Computed 31 invariants in 4 ms
[2024-05-24 16:13:27] [INFO ] Implicit Places using invariants in 1547 ms returned []
[2024-05-24 16:13:27] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2024-05-24 16:13:27] [INFO ] Invariant cache hit.
[2024-05-24 16:13:27] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 16:13:33] [INFO ] Implicit Places using invariants and state equation in 6912 ms returned []
Implicit Place search using SMT with State Equation took 8467 ms to find 0 implicit places.
[2024-05-24 16:13:34] [INFO ] Redundant transitions in 168 ms returned []
Running 3883 sub problems to find dead transitions.
[2024-05-24 16:13:34] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2024-05-24 16:13:34] [INFO ] Invariant cache hit.
[2024-05-24 16:13:34] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3883 unsolved
SMT process timed out in 33732ms, After SMT, problems are : Problem set: 0 solved, 3883 unsolved
Search for dead transitions found 0 dead transitions in 33771ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42585 ms. Remains : 593/593 places, 3893/3893 transitions.
Built C files in :
/tmp/ltsmin18241967302656022783
[2024-05-24 16:14:07] [INFO ] Too many transitions (3893) to apply POR reductions. Disabling POR matrices.
[2024-05-24 16:14:08] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18241967302656022783
Running compilation step : cd /tmp/ltsmin18241967302656022783;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18241967302656022783;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18241967302656022783;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 16:14:11] [INFO ] Flatten gal took : 102 ms
[2024-05-24 16:14:11] [INFO ] Flatten gal took : 109 ms
[2024-05-24 16:14:11] [INFO ] Time to serialize gal into /tmp/LTL18016060120354580113.gal : 20 ms
[2024-05-24 16:14:11] [INFO ] Time to serialize properties into /tmp/LTL13823496378529105933.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18016060120354580113.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16385433796162884593.hoa' '-atoms' '/tmp/LTL13823496378529105933.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL13823496378529105933.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16385433796162884593.hoa
Detected timeout of ITS tools.
[2024-05-24 16:14:26] [INFO ] Flatten gal took : 103 ms
[2024-05-24 16:14:26] [INFO ] Flatten gal took : 109 ms
[2024-05-24 16:14:26] [INFO ] Time to serialize gal into /tmp/LTL12423158525097111377.gal : 16 ms
[2024-05-24 16:14:26] [INFO ] Time to serialize properties into /tmp/LTL9383945497881535133.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12423158525097111377.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9383945497881535133.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p25_1_2==0)||(p09_8_9==1))")||(G("((p12_7_8==0)||(p18_4_9==1))"))))))
Formula 0 simplified : G(F!"((p12_7_8==0)||(p18_4_9==1))" & FG!"((p25_1_2==0)||(p09_8_9==1))")
Detected timeout of ITS tools.
[2024-05-24 16:14:41] [INFO ] Flatten gal took : 104 ms
[2024-05-24 16:14:41] [INFO ] Applying decomposition
[2024-05-24 16:14:41] [INFO ] Flatten gal took : 145 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16290959353475205940.txt' '-o' '/tmp/graph16290959353475205940.bin' '-w' '/tmp/graph16290959353475205940.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16290959353475205940.bin' '-l' '-1' '-v' '-w' '/tmp/graph16290959353475205940.weights' '-q' '0' '-e' '0.001'
[2024-05-24 16:14:42] [INFO ] Decomposing Gal with order
[2024-05-24 16:14:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 16:14:42] [INFO ] Removed a total of 8671 redundant transitions.
[2024-05-24 16:14:42] [INFO ] Flatten gal took : 440 ms
[2024-05-24 16:14:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 821 labels/synchronizations in 92 ms.
[2024-05-24 16:14:43] [INFO ] Time to serialize gal into /tmp/LTL17540027547840557210.gal : 19 ms
[2024-05-24 16:14:43] [INFO ] Time to serialize properties into /tmp/LTL15897553273688892080.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17540027547840557210.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15897553273688892080.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i1.u2.p25_1_2==0)||(i17.u18.p09_8_9==1))")||(G("((u17.p12_7_8==0)||(i2.u5.p18_4_9==1))"))))))
Formula 0 simplified : G(F!"((u17.p12_7_8==0)||(i2.u5.p18_4_9==1))" & FG!"((i1.u2.p25_1_2==0)||(i17.u18.p09_8_9==1))")
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-10-LTLCardinality-14 finished in 327340 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
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((F(p0)&&X(X(F(p1))))))))'
Found a Shortening insensitive property : EisenbergMcGuire-PT-10-LTLCardinality-10
Stuttering acceptance computed with spot in 368 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1000 transition count 4290
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 990 transition count 4290
Performed 307 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 307 Pre rules applied. Total rules applied 20 place count 990 transition count 3983
Deduced a syphon composed of 307 places in 6 ms
Reduce places removed 307 places and 0 transitions.
Iterating global reduction 2 with 614 rules applied. Total rules applied 634 place count 683 transition count 3983
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 7 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 812 place count 594 transition count 3894
Applied a total of 812 rules in 260 ms. Remains 594 /1000 variables (removed 406) and now considering 3894/4300 (removed 406) transitions.
[2024-05-24 16:14:59] [INFO ] Flow matrix only has 1024 transitions (discarded 2870 similar events)
// Phase 1: matrix 1024 rows 594 cols
[2024-05-24 16:14:59] [INFO ] Computed 31 invariants in 5 ms
[2024-05-24 16:15:00] [INFO ] Implicit Places using invariants in 1603 ms returned []
[2024-05-24 16:15:00] [INFO ] Flow matrix only has 1024 transitions (discarded 2870 similar events)
[2024-05-24 16:15:00] [INFO ] Invariant cache hit.
[2024-05-24 16:15:01] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 16:15:08] [INFO ] Implicit Places using invariants and state equation in 7454 ms returned []
Implicit Place search using SMT with State Equation took 9059 ms to find 0 implicit places.
Running 3884 sub problems to find dead transitions.
[2024-05-24 16:15:08] [INFO ] Flow matrix only has 1024 transitions (discarded 2870 similar events)
[2024-05-24 16:15:08] [INFO ] Invariant cache hit.
[2024-05-24 16:15:08] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3884 unsolved
SMT process timed out in 34514ms, After SMT, problems are : Problem set: 0 solved, 3884 unsolved
Search for dead transitions found 0 dead transitions in 34581ms
Starting structural reductions in LI_LTL mode, iteration 1 : 594/1000 places, 3894/4300 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 43906 ms. Remains : 594/1000 places, 3894/4300 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLCardinality-10
Product exploration explored 100000 steps with 16666 reset in 1199 ms.
Product exploration explored 100000 steps with 16666 reset in 936 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 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 165 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 314 ms. (126 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
[2024-05-24 16:15:45] [INFO ] Flow matrix only has 1024 transitions (discarded 2870 similar events)
[2024-05-24 16:15:45] [INFO ] Invariant cache hit.
[2024-05-24 16:15:45] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 112/114 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/118 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 206/324 variables, 118/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 154/478 variables, 10/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 24/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/478 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 208/686 variables, 96/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/686 variables, 37/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/686 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 354/1040 variables, 16/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1040 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/1056 variables, 8/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1056 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 562/1618 variables, 370/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1618 variables, 365/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1618 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1618 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1618/1618 variables, and 1061 constraints, problems are : Problem set: 0 solved, 1 unsolved in 794 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 594/594 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 112/114 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/118 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:15:46] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 206/324 variables, 118/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 10/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 154/478 variables, 10/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/478 variables, 24/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/478 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 208/686 variables, 96/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/686 variables, 37/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/686 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 354/1040 variables, 16/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1040 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/1056 variables, 8/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1056 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:15:47] [INFO ] Deduced a trap composed of 3 places in 291 ms of which 3 ms to minimize.
[2024-05-24 16:15:47] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1056 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1056 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 562/1618 variables, 370/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1618 variables, 365/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1618 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1618 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1618/1618 variables, and 1065 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1774 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 594/594 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 2609ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 19620 steps, including 408 resets, run visited all 1 properties in 165 ms. (steps per millisecond=118 )
Parikh walk visited 1 properties in 167 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 189 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 360 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 4 out of 594 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 594/594 places, 3894/3894 transitions.
Applied a total of 0 rules in 23 ms. Remains 594 /594 variables (removed 0) and now considering 3894/3894 (removed 0) transitions.
[2024-05-24 16:15:49] [INFO ] Flow matrix only has 1024 transitions (discarded 2870 similar events)
[2024-05-24 16:15:49] [INFO ] Invariant cache hit.
[2024-05-24 16:15:50] [INFO ] Implicit Places using invariants in 1197 ms returned []
[2024-05-24 16:15:50] [INFO ] Flow matrix only has 1024 transitions (discarded 2870 similar events)
[2024-05-24 16:15:50] [INFO ] Invariant cache hit.
[2024-05-24 16:15:51] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 16:15:57] [INFO ] Implicit Places using invariants and state equation in 6747 ms returned []
Implicit Place search using SMT with State Equation took 7946 ms to find 0 implicit places.
Running 3884 sub problems to find dead transitions.
[2024-05-24 16:15:57] [INFO ] Flow matrix only has 1024 transitions (discarded 2870 similar events)
[2024-05-24 16:15:57] [INFO ] Invariant cache hit.
[2024-05-24 16:15:57] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3884 unsolved
SMT process timed out in 33472ms, After SMT, problems are : Problem set: 0 solved, 3884 unsolved
Search for dead transitions found 0 dead transitions in 33510ms
Finished structural reductions in LTL mode , in 1 iterations and 41483 ms. Remains : 594/594 places, 3894/3894 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 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 152 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 390 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 222 ms. (179 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
[2024-05-24 16:16:31] [INFO ] Flow matrix only has 1024 transitions (discarded 2870 similar events)
[2024-05-24 16:16:31] [INFO ] Invariant cache hit.
[2024-05-24 16:16:31] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 112/114 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/118 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 206/324 variables, 118/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 154/478 variables, 10/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 24/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/478 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 208/686 variables, 96/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/686 variables, 37/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/686 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 354/1040 variables, 16/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1040 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/1056 variables, 8/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1056 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 562/1618 variables, 370/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1618 variables, 365/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1618 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1618 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1618/1618 variables, and 1061 constraints, problems are : Problem set: 0 solved, 1 unsolved in 936 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 594/594 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 112/114 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/118 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:16:32] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 206/324 variables, 118/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 10/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 154/478 variables, 10/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/478 variables, 24/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/478 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 208/686 variables, 96/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/686 variables, 37/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/686 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 354/1040 variables, 16/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1040 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/1056 variables, 8/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1056 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:16:33] [INFO ] Deduced a trap composed of 3 places in 222 ms of which 3 ms to minimize.
[2024-05-24 16:16:33] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1056 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1056 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 562/1618 variables, 370/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1618 variables, 365/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1618 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1618 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1618/1618 variables, and 1065 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1670 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 594/594 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 2641ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 171 ms.
Support contains 2 out of 594 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 594/594 places, 3894/3894 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 594 transition count 3893
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 593 transition count 3893
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 592 transition count 3892
Applied a total of 4 rules in 339 ms. Remains 592 /594 variables (removed 2) and now considering 3892/3894 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 339 ms. Remains : 592/594 places, 3892/3894 transitions.
RANDOM walk for 40000 steps (8 resets) in 223 ms. (178 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 90396 steps, run visited all 1 properties in 874 ms. (steps per millisecond=103 )
Probabilistic random walk after 90396 steps, saw 66872 distinct states, run finished after 874 ms. (steps per millisecond=103 ) properties seen :1
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 129 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 440 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 339 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 16666 reset in 1116 ms.
Product exploration explored 100000 steps with 16666 reset in 831 ms.
Applying partial POR strategy [false, false, false, false, true, false, true]
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 4 out of 594 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 594/594 places, 3894/3894 transitions.
Applied a total of 0 rules in 213 ms. Remains 594 /594 variables (removed 0) and now considering 3894/3894 (removed 0) transitions.
[2024-05-24 16:16:39] [INFO ] Redundant transitions in 285 ms returned []
Running 3884 sub problems to find dead transitions.
[2024-05-24 16:16:39] [INFO ] Flow matrix only has 1024 transitions (discarded 2870 similar events)
[2024-05-24 16:16:39] [INFO ] Invariant cache hit.
[2024-05-24 16:16:39] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3884 unsolved
SMT process timed out in 33783ms, After SMT, problems are : Problem set: 0 solved, 3884 unsolved
Search for dead transitions found 0 dead transitions in 33848ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34361 ms. Remains : 594/594 places, 3894/3894 transitions.
Built C files in :
/tmp/ltsmin12531192988730126776
[2024-05-24 16:17:13] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12531192988730126776
Running compilation step : cd /tmp/ltsmin12531192988730126776;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12531192988730126776;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12531192988730126776;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 594 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 594/594 places, 3894/3894 transitions.
Applied a total of 0 rules in 23 ms. Remains 594 /594 variables (removed 0) and now considering 3894/3894 (removed 0) transitions.
[2024-05-24 16:17:16] [INFO ] Flow matrix only has 1024 transitions (discarded 2870 similar events)
[2024-05-24 16:17:16] [INFO ] Invariant cache hit.
[2024-05-24 16:17:18] [INFO ] Implicit Places using invariants in 1558 ms returned []
[2024-05-24 16:17:18] [INFO ] Flow matrix only has 1024 transitions (discarded 2870 similar events)
[2024-05-24 16:17:18] [INFO ] Invariant cache hit.
[2024-05-24 16:17:18] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-05-24 16:17:24] [INFO ] Implicit Places using invariants and state equation in 6618 ms returned []
Implicit Place search using SMT with State Equation took 8178 ms to find 0 implicit places.
Running 3884 sub problems to find dead transitions.
[2024-05-24 16:17:24] [INFO ] Flow matrix only has 1024 transitions (discarded 2870 similar events)
[2024-05-24 16:17:24] [INFO ] Invariant cache hit.
[2024-05-24 16:17:24] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3884 unsolved
SMT process timed out in 33490ms, After SMT, problems are : Problem set: 0 solved, 3884 unsolved
Search for dead transitions found 0 dead transitions in 33529ms
Finished structural reductions in LTL mode , in 1 iterations and 41737 ms. Remains : 594/594 places, 3894/3894 transitions.
Built C files in :
/tmp/ltsmin4548627498950618431
[2024-05-24 16:17:58] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4548627498950618431
Running compilation step : cd /tmp/ltsmin4548627498950618431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4548627498950618431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4548627498950618431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 16:18:01] [INFO ] Flatten gal took : 96 ms
[2024-05-24 16:18:01] [INFO ] Flatten gal took : 100 ms
[2024-05-24 16:18:01] [INFO ] Time to serialize gal into /tmp/LTL4844893008748359788.gal : 32 ms
[2024-05-24 16:18:01] [INFO ] Time to serialize properties into /tmp/LTL16609310346589552460.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4844893008748359788.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10444048877544343681.hoa' '-atoms' '/tmp/LTL16609310346589552460.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16609310346589552460.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10444048877544343681.hoa
Detected timeout of ITS tools.
[2024-05-24 16:18:17] [INFO ] Flatten gal took : 97 ms
[2024-05-24 16:18:17] [INFO ] Flatten gal took : 107 ms
[2024-05-24 16:18:17] [INFO ] Time to serialize gal into /tmp/LTL2312613136280944942.gal : 15 ms
[2024-05-24 16:18:17] [INFO ] Time to serialize properties into /tmp/LTL14364317438811986226.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2312613136280944942.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14364317438811986226.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F("((p18_3_4==0)||(p12_5_4==1))"))&&(X(X(F("((p34_2_3==0)||(p33_4_4==1))")))))))))
Formula 0 simplified : XXX(G!"((p18_3_4==0)||(p12_5_4==1))" | XXG!"((p34_2_3==0)||(p33_4_4==1))")
Detected timeout of ITS tools.
[2024-05-24 16:18:32] [INFO ] Flatten gal took : 95 ms
[2024-05-24 16:18:32] [INFO ] Applying decomposition
[2024-05-24 16:18:32] [INFO ] Flatten gal took : 308 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2858948099941543618.txt' '-o' '/tmp/graph2858948099941543618.bin' '-w' '/tmp/graph2858948099941543618.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2858948099941543618.bin' '-l' '-1' '-v' '-w' '/tmp/graph2858948099941543618.weights' '-q' '0' '-e' '0.001'
[2024-05-24 16:18:32] [INFO ] Decomposing Gal with order
[2024-05-24 16:18:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 16:18:33] [INFO ] Removed a total of 8765 redundant transitions.
[2024-05-24 16:18:33] [INFO ] Flatten gal took : 360 ms
[2024-05-24 16:18:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 733 labels/synchronizations in 129 ms.
[2024-05-24 16:18:33] [INFO ] Time to serialize gal into /tmp/LTL9914202745512531305.gal : 29 ms
[2024-05-24 16:18:33] [INFO ] Time to serialize properties into /tmp/LTL12852354053591155259.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9914202745512531305.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12852354053591155259.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F("((i2.u3.p18_3_4==0)||(i6.u18.p12_5_4==1))"))&&(X(X(F("((i1.u86.p34_2_3==0)||(i1.u88.p33_4_4==1))")))))))))
Formula 0 simplified : XXX(G!"((i2.u3.p18_3_4==0)||(i6.u18.p12_5_4==1))" | XXG!"((i1.u86.p34_2_3==0)||(i1.u88.p33_4_4==1))")
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-10-LTLCardinality-10 finished in 230141 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((G(p1)||p0))))'
[2024-05-24 16:18:48] [INFO ] Flatten gal took : 140 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12274183035292923351
[2024-05-24 16:18:49] [INFO ] Too many transitions (4300) to apply POR reductions. Disabling POR matrices.
[2024-05-24 16:18:49] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12274183035292923351
Running compilation step : cd /tmp/ltsmin12274183035292923351;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-24 16:18:49] [INFO ] Applying decomposition
[2024-05-24 16:18:49] [INFO ] Flatten gal took : 181 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4531386624263211760.txt' '-o' '/tmp/graph4531386624263211760.bin' '-w' '/tmp/graph4531386624263211760.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4531386624263211760.bin' '-l' '-1' '-v' '-w' '/tmp/graph4531386624263211760.weights' '-q' '0' '-e' '0.001'
[2024-05-24 16:18:49] [INFO ] Decomposing Gal with order
[2024-05-24 16:18:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 16:18:49] [INFO ] Removed a total of 8897 redundant transitions.
[2024-05-24 16:18:50] [INFO ] Flatten gal took : 330 ms
[2024-05-24 16:18:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 919 labels/synchronizations in 106 ms.
[2024-05-24 16:18:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality6814372289519401606.gal : 25 ms
[2024-05-24 16:18:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality7119505926638946077.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6814372289519401606.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7119505926638946077.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 5 LTL properties
Checking formula 0 : !((G(("(i18.u233.p25_4_6!=1)")||(X(F("(i17.u125.p34_9_3!=1)"))))))
Formula 0 simplified : F(!"(i18.u233.p25_4_6!=1)" & XG!"(i17.u125.p34_9_3!=1)")
Compilation finished in 26443 ms.
Running link step : cd /tmp/ltsmin12274183035292923351;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 89 ms.
Running LTSmin : cd /tmp/ltsmin12274183035292923351;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X(<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin12274183035292923351;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X(<>((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12274183035292923351;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin12274183035292923351;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12274183035292923351;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin12274183035292923351;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12274183035292923351;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X((<>((LTLAPp4==true))&&X(X(<>((LTLAPp5==true))))))))' '--buchi-type=spotba'
LTSmin run took 2628 ms.
FORMULA EisenbergMcGuire-PT-10-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin12274183035292923351;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp7==true))||(LTLAPp6==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin12274183035292923351;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp7==true))||(LTLAPp6==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 5760 s
Running LTSmin : cd /tmp/ltsmin12274183035292923351;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X(<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1152 s) on command cd /tmp/ltsmin12274183035292923351;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X(<>((LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
Running LTSmin : cd /tmp/ltsmin12274183035292923351;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
[2024-05-24 16:49:15] [INFO ] Applying decomposition
[2024-05-24 16:49:16] [INFO ] Flatten gal took : 136 ms
[2024-05-24 16:49:16] [INFO ] Decomposing Gal with order
[2024-05-24 16:49:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 16:49:17] [INFO ] Removed a total of 10389 redundant transitions.
[2024-05-24 16:49:17] [INFO ] Flatten gal took : 1311 ms
[2024-05-24 16:49:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 333 labels/synchronizations in 135 ms.
[2024-05-24 16:49:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality11400579560046035249.gal : 50 ms
[2024-05-24 16:49:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality8202467085759356817.ltl : 16 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11400579560046035249.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8202467085759356817.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 4 LTL properties
Checking formula 0 : !((G(("(i0.u24.p25_4_6!=1)")||(X(F("(i0.u23.p34_9_3!=1)"))))))
Formula 0 simplified : F(!"(i0.u24.p25_4_6!=1)" & XG!"(i0.u23.p34_9_3!=1)")
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is EisenbergMcGuire-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r158-smll-171636266400203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-10.tgz
mv EisenbergMcGuire-PT-10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;