About the Execution of LTSMin+red for Peterson-PT-6
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1667.695 | 3600000.00 | 15002121.00 | 1703.50 | F?TFTFFFFFFTFFFT | 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.r512-smll-171654407300283.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 ltsminxred
Input is Peterson-PT-6, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407300283
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.9M
-rw-r--r-- 1 mcc users 150K Apr 12 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 608K Apr 12 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 135K Apr 12 02:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 633K Apr 12 02:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 84K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 254K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 65K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 220K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 294K Apr 12 03:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Apr 12 03:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 432K Apr 12 03:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.9M Apr 12 03:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 877K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-PT-6-LTLCardinality-00
FORMULA_NAME Peterson-PT-6-LTLCardinality-01
FORMULA_NAME Peterson-PT-6-LTLCardinality-02
FORMULA_NAME Peterson-PT-6-LTLCardinality-03
FORMULA_NAME Peterson-PT-6-LTLCardinality-04
FORMULA_NAME Peterson-PT-6-LTLCardinality-05
FORMULA_NAME Peterson-PT-6-LTLCardinality-06
FORMULA_NAME Peterson-PT-6-LTLCardinality-07
FORMULA_NAME Peterson-PT-6-LTLCardinality-08
FORMULA_NAME Peterson-PT-6-LTLCardinality-09
FORMULA_NAME Peterson-PT-6-LTLCardinality-10
FORMULA_NAME Peterson-PT-6-LTLCardinality-11
FORMULA_NAME Peterson-PT-6-LTLCardinality-12
FORMULA_NAME Peterson-PT-6-LTLCardinality-13
FORMULA_NAME Peterson-PT-6-LTLCardinality-14
FORMULA_NAME Peterson-PT-6-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717274143289
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-6
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:35:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 20:35:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:35:46] [INFO ] Load time of PNML (sax parser for PT used): 437 ms
[2024-06-01 20:35:46] [INFO ] Transformed 1330 places.
[2024-06-01 20:35:46] [INFO ] Transformed 2030 transitions.
[2024-06-01 20:35:46] [INFO ] Found NUPN structural information;
[2024-06-01 20:35:46] [INFO ] Parsed PT model containing 1330 places and 2030 transitions and 6272 arcs in 648 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 59 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Peterson-PT-6-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1276 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 57 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:35:46] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-06-01 20:35:46] [INFO ] Computed 27 invariants in 62 ms
[2024-06-01 20:35:47] [INFO ] Implicit Places using invariants in 1093 ms returned []
[2024-06-01 20:35:47] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:35:47] [INFO ] Invariant cache hit.
[2024-06-01 20:35:49] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:35:51] [INFO ] Implicit Places using invariants and state equation in 3455 ms returned []
Implicit Place search using SMT with State Equation took 4602 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-06-01 20:35:51] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:35:51] [INFO ] Invariant cache hit.
[2024-06-01 20:35:51] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.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 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 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 31376ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 31469ms
Finished structural reductions in LTL mode , in 1 iterations and 36189 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Support contains 1276 out of 1330 places after structural reductions.
[2024-06-01 20:36:23] [INFO ] Flatten gal took : 208 ms
[2024-06-01 20:36:23] [INFO ] Flatten gal took : 127 ms
[2024-06-01 20:36:23] [INFO ] Input system was already deterministic with 2030 transitions.
RANDOM walk for 40000 steps (8 resets) in 2054 ms. (19 steps per ms) remains 2/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1165 ms. (34 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 2/2 properties
[2024-06-01 20:36:25] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:36:25] [INFO ] Invariant cache hit.
[2024-06-01 20:36:25] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 588/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/588 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 688/1276 variables, 9/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1276 variables, 688/1285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1276 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/1281 variables, 5/1290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1281 variables, 5/1295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1281 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/1288 variables, 7/1302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1288 variables, 7/1309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1288 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1820/3108 variables, 1288/2597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3108 variables, 330/2927 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3108 variables, 0/2927 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 42/3150 variables, 42/2969 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3150 variables, 42/3011 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3150 variables, 6/3017 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3150 variables, 0/3017 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/3150 variables, 0/3017 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3150/3150 variables, and 3017 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3658 ms.
Refiners :[Domain max(s): 1330/1330 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1330/1330 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 588/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/588 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 688/1276 variables, 9/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1276 variables, 688/1285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1276 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/1281 variables, 5/1290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1281 variables, 5/1295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1281 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/1288 variables, 7/1302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1288 variables, 7/1309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1288 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1820/3108 variables, 1288/2597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3108 variables, 330/2927 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3108 variables, 1/2928 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3108 variables, 0/2928 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 42/3150 variables, 42/2970 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3150 variables, 42/3012 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3150 variables, 6/3018 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:36:33] [INFO ] Deduced a trap composed of 42 places in 1381 ms of which 183 ms to minimize.
[2024-06-01 20:36:34] [INFO ] Deduced a trap composed of 37 places in 1547 ms of which 19 ms to minimize.
SMT process timed out in 9589ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 588 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 1330 transition count 1988
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 1288 transition count 1988
Applied a total of 84 rules in 335 ms. Remains 1288 /1330 variables (removed 42) and now considering 1988/2030 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 337 ms. Remains : 1288/1330 places, 1988/2030 transitions.
RANDOM walk for 40000 steps (8 resets) in 1858 ms. (21 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 691 ms. (57 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
[2024-06-01 20:36:35] [INFO ] Flow matrix only has 1778 transitions (discarded 210 similar events)
// Phase 1: matrix 1778 rows 1288 cols
[2024-06-01 20:36:35] [INFO ] Computed 27 invariants in 19 ms
[2024-06-01 20:36:35] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 175/176 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 175/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/177 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/178 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 254/432 variables, 178/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/432 variables, 12/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/432 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 258/690 variables, 42/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/690 variables, 42/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/690 variables, 6/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/690 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 432/1122 variables, 72/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1122 variables, 72/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1122 variables, 318/923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1122 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 985/2107 variables, 7/930 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2107 variables, 985/1915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2107 variables, 0/1915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 5/2112 variables, 5/1920 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2112 variables, 5/1925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2112 variables, 0/1925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 6/2118 variables, 6/1931 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2118 variables, 6/1937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2118 variables, 0/1937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 948/3066 variables, 996/2933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/3066 variables, 0/2933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/3066 variables, 0/2933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3066/3066 variables, and 2933 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1517 ms.
Refiners :[Domain max(s): 1288/1288 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1288/1288 constraints, ReadFeed: 330/330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 175/176 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 175/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/177 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/178 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 254/432 variables, 178/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/432 variables, 12/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/432 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/432 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 258/690 variables, 42/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/690 variables, 42/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/690 variables, 6/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/690 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 432/1122 variables, 72/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1122 variables, 72/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1122 variables, 318/924 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1122 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 985/2107 variables, 7/931 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2107 variables, 985/1916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2107 variables, 0/1916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 5/2112 variables, 5/1921 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2112 variables, 5/1926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2112 variables, 0/1926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 6/2118 variables, 6/1932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2118 variables, 6/1938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:36:40] [INFO ] Deduced a trap composed of 100 places in 1523 ms of which 13 ms to minimize.
[2024-06-01 20:36:41] [INFO ] Deduced a trap composed of 12 places in 1109 ms of which 12 ms to minimize.
[2024-06-01 20:36:42] [INFO ] Deduced a trap composed of 24 places in 1488 ms of which 17 ms to minimize.
[2024-06-01 20:36:44] [INFO ] Deduced a trap composed of 16 places in 1740 ms of which 18 ms to minimize.
[2024-06-01 20:36:45] [INFO ] Deduced a trap composed of 83 places in 1100 ms of which 10 ms to minimize.
[2024-06-01 20:36:46] [INFO ] Deduced a trap composed of 115 places in 961 ms of which 18 ms to minimize.
[2024-06-01 20:36:48] [INFO ] Deduced a trap composed of 28 places in 1522 ms of which 16 ms to minimize.
[2024-06-01 20:36:49] [INFO ] Deduced a trap composed of 34 places in 1235 ms of which 15 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/2118 variables, 8/1946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2118 variables, 0/1946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 948/3066 variables, 996/2942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/3066 variables, 0/2942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/3066 variables, 0/2942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3066/3066 variables, and 2942 constraints, problems are : Problem set: 0 solved, 1 unsolved in 13478 ms.
Refiners :[Domain max(s): 1288/1288 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1288/1288 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 15046ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 77 ms.
Support contains 1 out of 1288 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1288/1288 places, 1988/1988 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 543 transitions
Trivial Post-agglo rules discarded 543 transitions
Performed 543 trivial Post agglomeration. Transition count delta: 543
Iterating post reduction 0 with 543 rules applied. Total rules applied 543 place count 1288 transition count 1445
Reduce places removed 543 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 544 rules applied. Total rules applied 1087 place count 745 transition count 1444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1088 place count 744 transition count 1444
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 294 Pre rules applied. Total rules applied 1088 place count 744 transition count 1150
Deduced a syphon composed of 294 places in 2 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 3 with 588 rules applied. Total rules applied 1676 place count 450 transition count 1150
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 3 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1760 place count 408 transition count 1108
Applied a total of 1760 rules in 287 ms. Remains 408 /1288 variables (removed 880) and now considering 1108/1988 (removed 880) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 288 ms. Remains : 408/1288 places, 1108/1988 transitions.
RANDOM walk for 40000 steps (8 resets) in 282 ms. (141 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 667904 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :0 out of 1
Probabilistic random walk after 667904 steps, saw 89172 distinct states, run finished after 3007 ms. (steps per millisecond=222 ) properties seen :0
[2024-06-01 20:36:54] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 408 cols
[2024-06-01 20:36:54] [INFO ] Computed 27 invariants in 5 ms
[2024-06-01 20:36:54] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 51/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/53 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/54 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/54 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 130/184 variables, 54/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 12/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 258/442 variables, 42/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/442 variables, 42/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/442 variables, 6/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/442 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 432/874 variables, 72/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/874 variables, 72/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/874 variables, 318/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/874 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 228/1102 variables, 6/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1102 variables, 228/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1102 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 6/1108 variables, 6/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1108 variables, 6/921 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1108 variables, 0/921 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 6/1114 variables, 6/927 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1114 variables, 6/933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1114 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 192/1306 variables, 240/1173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1306 variables, 0/1173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/1306 variables, 0/1173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1306/1306 variables, and 1173 constraints, problems are : Problem set: 0 solved, 1 unsolved in 664 ms.
Refiners :[Domain max(s): 408/408 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 408/408 constraints, ReadFeed: 330/330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 51/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/53 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/54 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/54 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 130/184 variables, 54/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 12/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/184 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 258/442 variables, 42/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/442 variables, 42/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/442 variables, 6/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/442 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 432/874 variables, 72/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/874 variables, 72/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/874 variables, 318/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/874 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 228/1102 variables, 6/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1102 variables, 228/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1102 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 6/1108 variables, 6/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1108 variables, 6/922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1108 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 6/1114 variables, 6/928 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1114 variables, 6/934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:36:56] [INFO ] Deduced a trap composed of 19 places in 443 ms of which 9 ms to minimize.
[2024-06-01 20:36:56] [INFO ] Deduced a trap composed of 42 places in 507 ms of which 6 ms to minimize.
[2024-06-01 20:36:57] [INFO ] Deduced a trap composed of 37 places in 528 ms of which 8 ms to minimize.
[2024-06-01 20:36:57] [INFO ] Deduced a trap composed of 76 places in 541 ms of which 7 ms to minimize.
[2024-06-01 20:36:58] [INFO ] Deduced a trap composed of 78 places in 545 ms of which 7 ms to minimize.
[2024-06-01 20:36:58] [INFO ] Deduced a trap composed of 10 places in 543 ms of which 7 ms to minimize.
[2024-06-01 20:36:59] [INFO ] Deduced a trap composed of 14 places in 540 ms of which 7 ms to minimize.
[2024-06-01 20:36:59] [INFO ] Deduced a trap composed of 20 places in 547 ms of which 6 ms to minimize.
[2024-06-01 20:37:00] [INFO ] Deduced a trap composed of 21 places in 452 ms of which 5 ms to minimize.
[2024-06-01 20:37:00] [INFO ] Deduced a trap composed of 24 places in 525 ms of which 6 ms to minimize.
[2024-06-01 20:37:01] [INFO ] Deduced a trap composed of 11 places in 538 ms of which 6 ms to minimize.
[2024-06-01 20:37:02] [INFO ] Deduced a trap composed of 38 places in 490 ms of which 7 ms to minimize.
[2024-06-01 20:37:02] [INFO ] Deduced a trap composed of 40 places in 477 ms of which 6 ms to minimize.
[2024-06-01 20:37:03] [INFO ] Deduced a trap composed of 13 places in 501 ms of which 6 ms to minimize.
[2024-06-01 20:37:03] [INFO ] Deduced a trap composed of 13 places in 440 ms of which 6 ms to minimize.
[2024-06-01 20:37:03] [INFO ] Deduced a trap composed of 15 places in 274 ms of which 4 ms to minimize.
[2024-06-01 20:37:04] [INFO ] Deduced a trap composed of 54 places in 266 ms of which 4 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/1114 variables, 17/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1114 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 192/1306 variables, 240/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1306 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/1306 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1306/1306 variables, and 1191 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9330 ms.
Refiners :[Domain max(s): 408/408 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 408/408 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints]
After SMT, in 10017ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 1108/1108 transitions.
Applied a total of 0 rules in 33 ms. Remains 408 /408 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 408/408 places, 1108/1108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 1108/1108 transitions.
Applied a total of 0 rules in 31 ms. Remains 408 /408 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
[2024-06-01 20:37:04] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
[2024-06-01 20:37:04] [INFO ] Invariant cache hit.
[2024-06-01 20:37:05] [INFO ] Implicit Places using invariants in 609 ms returned [389, 390, 392, 400, 401, 402, 403]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 621 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 401/408 places, 1108/1108 transitions.
Applied a total of 0 rules in 41 ms. Remains 401 /401 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 695 ms. Remains : 401/408 places, 1108/1108 transitions.
RANDOM walk for 40000 steps (8 resets) in 193 ms. (206 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 750312 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :0 out of 1
Probabilistic random walk after 750312 steps, saw 100998 distinct states, run finished after 3001 ms. (steps per millisecond=250 ) properties seen :0
[2024-06-01 20:37:08] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 401 cols
[2024-06-01 20:37:08] [INFO ] Computed 20 invariants in 10 ms
[2024-06-01 20:37:08] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 51/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/53 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 130/183 variables, 53/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 12/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 258/441 variables, 42/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/441 variables, 42/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/441 variables, 6/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/441 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 432/873 variables, 72/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/873 variables, 72/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 318/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/873 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 228/1101 variables, 6/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1101 variables, 228/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1101 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1107 variables, 6/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1107 variables, 6/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1107 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 192/1299 variables, 234/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1299 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1299 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1299/1299 variables, and 1152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 777 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 401/401 constraints, ReadFeed: 330/330 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 51/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/53 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 130/183 variables, 53/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 12/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 258/441 variables, 42/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/441 variables, 42/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/441 variables, 6/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/441 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 432/873 variables, 72/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 72/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/873 variables, 318/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/873 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 228/1101 variables, 6/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1101 variables, 228/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:37:10] [INFO ] Deduced a trap composed of 30 places in 531 ms of which 7 ms to minimize.
[2024-06-01 20:37:10] [INFO ] Deduced a trap composed of 29 places in 426 ms of which 6 ms to minimize.
[2024-06-01 20:37:11] [INFO ] Deduced a trap composed of 21 places in 524 ms of which 7 ms to minimize.
[2024-06-01 20:37:11] [INFO ] Deduced a trap composed of 39 places in 498 ms of which 6 ms to minimize.
[2024-06-01 20:37:12] [INFO ] Deduced a trap composed of 29 places in 501 ms of which 7 ms to minimize.
[2024-06-01 20:37:12] [INFO ] Deduced a trap composed of 66 places in 524 ms of which 6 ms to minimize.
[2024-06-01 20:37:13] [INFO ] Deduced a trap composed of 51 places in 523 ms of which 7 ms to minimize.
[2024-06-01 20:37:13] [INFO ] Deduced a trap composed of 14 places in 425 ms of which 6 ms to minimize.
[2024-06-01 20:37:14] [INFO ] Deduced a trap composed of 31 places in 477 ms of which 6 ms to minimize.
[2024-06-01 20:37:14] [INFO ] Deduced a trap composed of 10 places in 381 ms of which 6 ms to minimize.
[2024-06-01 20:37:15] [INFO ] Deduced a trap composed of 12 places in 470 ms of which 6 ms to minimize.
[2024-06-01 20:37:15] [INFO ] Deduced a trap composed of 11 places in 497 ms of which 7 ms to minimize.
[2024-06-01 20:37:16] [INFO ] Deduced a trap composed of 13 places in 453 ms of which 8 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1101 variables, 13/920 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1101 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 6/1107 variables, 6/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1107 variables, 6/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1107 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 192/1299 variables, 234/1166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1299 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1299 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1299/1299 variables, and 1166 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7591 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 401/401 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 8399ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 1108/1108 transitions.
Applied a total of 0 rules in 37 ms. Remains 401 /401 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 401/401 places, 1108/1108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 1108/1108 transitions.
Applied a total of 0 rules in 42 ms. Remains 401 /401 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
[2024-06-01 20:37:16] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
[2024-06-01 20:37:16] [INFO ] Invariant cache hit.
[2024-06-01 20:37:17] [INFO ] Implicit Places using invariants in 656 ms returned []
[2024-06-01 20:37:17] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
[2024-06-01 20:37:17] [INFO ] Invariant cache hit.
[2024-06-01 20:37:17] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:37:20] [INFO ] Implicit Places using invariants and state equation in 2968 ms returned []
Implicit Place search using SMT with State Equation took 3631 ms to find 0 implicit places.
[2024-06-01 20:37:20] [INFO ] Redundant transitions in 133 ms returned []
Running 1101 sub problems to find dead transitions.
[2024-06-01 20:37:20] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
[2024-06-01 20:37:20] [INFO ] Invariant cache hit.
[2024-06-01 20:37:20] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 401/401 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 20/421 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 20:37:36] [INFO ] Deduced a trap composed of 13 places in 302 ms of which 4 ms to minimize.
[2024-06-01 20:37:36] [INFO ] Deduced a trap composed of 50 places in 274 ms of which 3 ms to minimize.
[2024-06-01 20:37:37] [INFO ] Deduced a trap composed of 31 places in 277 ms of which 4 ms to minimize.
[2024-06-01 20:37:37] [INFO ] Deduced a trap composed of 63 places in 307 ms of which 4 ms to minimize.
[2024-06-01 20:37:37] [INFO ] Deduced a trap composed of 40 places in 424 ms of which 6 ms to minimize.
[2024-06-01 20:37:38] [INFO ] Deduced a trap composed of 18 places in 349 ms of which 4 ms to minimize.
[2024-06-01 20:37:38] [INFO ] Deduced a trap composed of 22 places in 281 ms of which 4 ms to minimize.
[2024-06-01 20:37:38] [INFO ] Deduced a trap composed of 19 places in 288 ms of which 3 ms to minimize.
[2024-06-01 20:37:39] [INFO ] Deduced a trap composed of 25 places in 286 ms of which 6 ms to minimize.
[2024-06-01 20:37:39] [INFO ] Deduced a trap composed of 29 places in 491 ms of which 6 ms to minimize.
[2024-06-01 20:37:40] [INFO ] Deduced a trap composed of 63 places in 457 ms of which 6 ms to minimize.
[2024-06-01 20:37:40] [INFO ] Deduced a trap composed of 54 places in 396 ms of which 5 ms to minimize.
[2024-06-01 20:37:40] [INFO ] Deduced a trap composed of 60 places in 377 ms of which 5 ms to minimize.
[2024-06-01 20:37:41] [INFO ] Deduced a trap composed of 64 places in 343 ms of which 4 ms to minimize.
[2024-06-01 20:37:41] [INFO ] Deduced a trap composed of 54 places in 272 ms of which 3 ms to minimize.
[2024-06-01 20:37:41] [INFO ] Deduced a trap composed of 30 places in 356 ms of which 5 ms to minimize.
[2024-06-01 20:37:42] [INFO ] Deduced a trap composed of 21 places in 360 ms of which 14 ms to minimize.
[2024-06-01 20:37:42] [INFO ] Deduced a trap composed of 46 places in 203 ms of which 3 ms to minimize.
[2024-06-01 20:37:42] [INFO ] Deduced a trap composed of 77 places in 209 ms of which 3 ms to minimize.
[2024-06-01 20:37:42] [INFO ] Deduced a trap composed of 43 places in 195 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/441 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 20:37:44] [INFO ] Deduced a trap composed of 20 places in 556 ms of which 6 ms to minimize.
[2024-06-01 20:37:44] [INFO ] Deduced a trap composed of 10 places in 480 ms of which 3 ms to minimize.
[2024-06-01 20:37:44] [INFO ] Deduced a trap composed of 10 places in 313 ms of which 4 ms to minimize.
[2024-06-01 20:37:45] [INFO ] Deduced a trap composed of 13 places in 319 ms of which 4 ms to minimize.
[2024-06-01 20:37:45] [INFO ] Deduced a trap composed of 13 places in 306 ms of which 3 ms to minimize.
[2024-06-01 20:37:45] [INFO ] Deduced a trap composed of 10 places in 303 ms of which 4 ms to minimize.
[2024-06-01 20:37:46] [INFO ] Deduced a trap composed of 35 places in 388 ms of which 6 ms to minimize.
[2024-06-01 20:37:46] [INFO ] Deduced a trap composed of 20 places in 496 ms of which 6 ms to minimize.
[2024-06-01 20:37:47] [INFO ] Deduced a trap composed of 20 places in 505 ms of which 7 ms to minimize.
[2024-06-01 20:37:47] [INFO ] Deduced a trap composed of 26 places in 510 ms of which 6 ms to minimize.
[2024-06-01 20:37:48] [INFO ] Deduced a trap composed of 18 places in 385 ms of which 4 ms to minimize.
[2024-06-01 20:37:48] [INFO ] Deduced a trap composed of 13 places in 271 ms of which 4 ms to minimize.
[2024-06-01 20:37:48] [INFO ] Deduced a trap composed of 10 places in 432 ms of which 5 ms to minimize.
[2024-06-01 20:37:49] [INFO ] Deduced a trap composed of 18 places in 324 ms of which 4 ms to minimize.
[2024-06-01 20:37:49] [INFO ] Deduced a trap composed of 79 places in 261 ms of which 4 ms to minimize.
[2024-06-01 20:37:49] [INFO ] Deduced a trap composed of 38 places in 264 ms of which 5 ms to minimize.
[2024-06-01 20:37:50] [INFO ] Deduced a trap composed of 59 places in 274 ms of which 5 ms to minimize.
[2024-06-01 20:37:50] [INFO ] Deduced a trap composed of 20 places in 405 ms of which 5 ms to minimize.
[2024-06-01 20:37:50] [INFO ] Deduced a trap composed of 21 places in 394 ms of which 5 ms to minimize.
[2024-06-01 20:37:51] [INFO ] Deduced a trap composed of 54 places in 380 ms of which 5 ms to minimize.
SMT process timed out in 30822ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 30846ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34672 ms. Remains : 401/401 places, 1108/1108 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 840 edges and 401 vertex of which 293 / 401 are part of one of the 42 SCC in 6 ms
Free SCC test removed 251 places
Drop transitions (Empty/Sink Transition effects.) removed 502 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 753 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 150 transition count 314
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 109 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 85 place count 108 transition count 313
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 23 rules applied. Total rules applied 108 place count 93 transition count 312
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 50 edges and 93 vertex of which 49 / 93 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 110 place count 51 transition count 311
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 268 edges and 45 vertex of which 10 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.1 ms
Discarding 35 places :
Also discarding 180 output transitions
Drop transitions (Output transitions of discarded places.) removed 180 transitions
Graph (trivial) has 67 edges and 10 vertex of which 6 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 1 with 57 rules applied. Total rules applied 167 place count 5 transition count 82
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 2 with 75 rules applied. Total rules applied 242 place count 5 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 245 place count 3 transition count 6
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 247 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 249 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 250 place count 2 transition count 2
Applied a total of 250 rules in 49 ms. Remains 2 /401 variables (removed 399) and now considering 2/1108 (removed 1106) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 20:37:51] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 20:37:51] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 20:37:51] [INFO ] After 5ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 20:37:51] [INFO ] After 18ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-01 20:37:51] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 111 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' '!(X(F(p0)))'
Support contains 588 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 32 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:37:51] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-06-01 20:37:51] [INFO ] Computed 27 invariants in 15 ms
[2024-06-01 20:37:52] [INFO ] Implicit Places using invariants in 970 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 973 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 38 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1043 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 338 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 1792 ms.
Stack based approach found an accepted trace after 259 steps with 0 reset with depth 260 and stack size 260 in 5 ms.
FORMULA Peterson-PT-6-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLCardinality-00 finished in 3276 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||G(p1))) U X(X(p2)))))'
Support contains 595 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 21 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:37:55] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:37:55] [INFO ] Invariant cache hit.
[2024-06-01 20:37:55] [INFO ] Implicit Places using invariants in 625 ms returned []
[2024-06-01 20:37:55] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:37:55] [INFO ] Invariant cache hit.
[2024-06-01 20:37:57] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:37:59] [INFO ] Implicit Places using invariants and state equation in 3767 ms returned []
Implicit Place search using SMT with State Equation took 4397 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-06-01 20:37:59] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:37:59] [INFO ] Invariant cache hit.
[2024-06-01 20:37:59] [INFO ] State equation strengthened by 330 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/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 31080ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 31115ms
Finished structural reductions in LTL mode , in 1 iterations and 35549 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 443 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-01
Product exploration explored 100000 steps with 26812 reset in 1636 ms.
Product exploration explored 100000 steps with 26766 reset in 1208 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 p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 486 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
RANDOM walk for 26359 steps (5 resets) in 761 ms. (34 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR p0 p2))), (F (NOT (OR p1 p0))), (F (NOT p2)), (F (NOT (OR (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 444 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 401 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 410 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 595 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 32 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:38:36] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:38:36] [INFO ] Invariant cache hit.
[2024-06-01 20:38:37] [INFO ] Implicit Places using invariants in 839 ms returned []
[2024-06-01 20:38:37] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:38:37] [INFO ] Invariant cache hit.
[2024-06-01 20:38:38] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:38:41] [INFO ] Implicit Places using invariants and state equation in 4060 ms returned []
Implicit Place search using SMT with State Equation took 4902 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-06-01 20:38:41] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:38:41] [INFO ] Invariant cache hit.
[2024-06-01 20:38:41] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30853ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30881ms
Finished structural reductions in LTL mode , in 1 iterations and 35821 ms. Remains : 1330/1330 places, 2030/2030 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 p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 225 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 401 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
RANDOM walk for 33109 steps (6 resets) in 1223 ms. (27 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR p0 p2))), (F (NOT (OR p1 p0))), (F (NOT p2)), (F (NOT (OR (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 443 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 400 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 394 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 395 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 26839 reset in 1647 ms.
Product exploration explored 100000 steps with 26812 reset in 1278 ms.
Applying partial POR strategy [false, false, false, true, false, false, true]
Stuttering acceptance computed with spot in 387 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 595 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1330 transition count 2030
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 252 place count 1330 transition count 2030
Deduced a syphon composed of 301 places in 2 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 301 place count 1330 transition count 2030
Deduced a syphon composed of 301 places in 2 ms
Applied a total of 301 rules in 310 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:39:19] [INFO ] Redundant transitions in 286 ms returned []
Running 2023 sub problems to find dead transitions.
[2024-06-01 20:39:19] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-06-01 20:39:19] [INFO ] Computed 27 invariants in 18 ms
[2024-06-01 20:39:19] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.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 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 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 31102ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 31139ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1330/1330 places, 2030/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31755 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Support contains 595 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 37 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:39:50] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-06-01 20:39:50] [INFO ] Computed 27 invariants in 14 ms
[2024-06-01 20:39:51] [INFO ] Implicit Places using invariants in 857 ms returned []
[2024-06-01 20:39:51] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:39:51] [INFO ] Invariant cache hit.
[2024-06-01 20:39:53] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:39:55] [INFO ] Implicit Places using invariants and state equation in 4372 ms returned []
Implicit Place search using SMT with State Equation took 5231 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-06-01 20:39:55] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:39:55] [INFO ] Invariant cache hit.
[2024-06-01 20:39:55] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 31171ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 31207ms
Finished structural reductions in LTL mode , in 1 iterations and 36482 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Treatment of property Peterson-PT-6-LTLCardinality-01 finished in 152420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(((X(p0)&&F(p1)) U p2))) U p3)))'
Support contains 602 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 30 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:40:27] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:40:27] [INFO ] Invariant cache hit.
[2024-06-01 20:40:28] [INFO ] Implicit Places using invariants in 795 ms returned []
[2024-06-01 20:40:28] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:40:28] [INFO ] Invariant cache hit.
[2024-06-01 20:40:30] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:40:32] [INFO ] Implicit Places using invariants and state equation in 4289 ms returned []
Implicit Place search using SMT with State Equation took 5090 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-06-01 20:40:32] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:40:32] [INFO ] Invariant cache hit.
[2024-06-01 20:40:32] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.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 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 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30896ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30932ms
Finished structural reductions in LTL mode , in 1 iterations and 36060 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 331 ms :[(NOT p3), (NOT p3), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 2057 ms.
Product exploration explored 100000 steps with 50000 reset in 1591 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 p3 p2 p1 p0), (X p2), (X p3), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 24 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-6-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-6-LTLCardinality-02 finished in 40168 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)&&G(p1))))))'
Support contains 882 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 16 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:41:07] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:41:07] [INFO ] Invariant cache hit.
[2024-06-01 20:41:08] [INFO ] Implicit Places using invariants in 804 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 807 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 16 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 840 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-6-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLCardinality-03 finished in 1107 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 49 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 582 transitions
Trivial Post-agglo rules discarded 582 transitions
Performed 582 trivial Post agglomeration. Transition count delta: 582
Iterating post reduction 0 with 582 rules applied. Total rules applied 582 place count 1330 transition count 1448
Reduce places removed 582 places and 0 transitions.
Iterating post reduction 1 with 582 rules applied. Total rules applied 1164 place count 748 transition count 1448
Performed 258 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 258 Pre rules applied. Total rules applied 1164 place count 748 transition count 1190
Deduced a syphon composed of 258 places in 1 ms
Reduce places removed 258 places and 0 transitions.
Iterating global reduction 2 with 516 rules applied. Total rules applied 1680 place count 490 transition count 1190
Applied a total of 1680 rules in 104 ms. Remains 490 /1330 variables (removed 840) and now considering 1190/2030 (removed 840) transitions.
[2024-06-01 20:41:08] [INFO ] Flow matrix only has 980 transitions (discarded 210 similar events)
// Phase 1: matrix 980 rows 490 cols
[2024-06-01 20:41:08] [INFO ] Computed 27 invariants in 12 ms
[2024-06-01 20:41:09] [INFO ] Implicit Places using invariants in 673 ms returned [429, 430, 432, 461, 462, 463, 464]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 676 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 483/1330 places, 1190/2030 transitions.
Applied a total of 0 rules in 20 ms. Remains 483 /483 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 801 ms. Remains : 483/1330 places, 1190/2030 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 600 ms.
Stack based approach found an accepted trace after 205 steps with 0 reset with depth 206 and stack size 181 in 1 ms.
FORMULA Peterson-PT-6-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLCardinality-05 finished in 1468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(G(p1)))))'
Support contains 56 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 37 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:41:10] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-06-01 20:41:10] [INFO ] Computed 27 invariants in 8 ms
[2024-06-01 20:41:11] [INFO ] Implicit Places using invariants in 918 ms returned []
[2024-06-01 20:41:11] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:41:11] [INFO ] Invariant cache hit.
[2024-06-01 20:41:12] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:41:19] [INFO ] Implicit Places using invariants and state equation in 8504 ms returned []
Implicit Place search using SMT with State Equation took 9423 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-06-01 20:41:19] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:41:19] [INFO ] Invariant cache hit.
[2024-06-01 20:41:19] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30724ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30746ms
Finished structural reductions in LTL mode , in 1 iterations and 40212 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-6-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLCardinality-06 finished in 40424 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 84 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 582 transitions
Trivial Post-agglo rules discarded 582 transitions
Performed 582 trivial Post agglomeration. Transition count delta: 582
Iterating post reduction 0 with 582 rules applied. Total rules applied 582 place count 1330 transition count 1448
Reduce places removed 582 places and 0 transitions.
Iterating post reduction 1 with 582 rules applied. Total rules applied 1164 place count 748 transition count 1448
Performed 258 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 258 Pre rules applied. Total rules applied 1164 place count 748 transition count 1190
Deduced a syphon composed of 258 places in 0 ms
Reduce places removed 258 places and 0 transitions.
Iterating global reduction 2 with 516 rules applied. Total rules applied 1680 place count 490 transition count 1190
Applied a total of 1680 rules in 105 ms. Remains 490 /1330 variables (removed 840) and now considering 1190/2030 (removed 840) transitions.
[2024-06-01 20:41:50] [INFO ] Flow matrix only has 980 transitions (discarded 210 similar events)
// Phase 1: matrix 980 rows 490 cols
[2024-06-01 20:41:50] [INFO ] Computed 27 invariants in 5 ms
[2024-06-01 20:41:51] [INFO ] Implicit Places using invariants in 621 ms returned [429, 430, 432, 461, 462, 463, 464]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 624 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 483/1330 places, 1190/2030 transitions.
Applied a total of 0 rules in 20 ms. Remains 483 /483 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 750 ms. Remains : 483/1330 places, 1190/2030 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-07
Product exploration explored 100000 steps with 8048 reset in 456 ms.
Stack based approach found an accepted trace after 71 steps with 6 reset with depth 6 and stack size 6 in 0 ms.
FORMULA Peterson-PT-6-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLCardinality-07 finished in 1297 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) U p1))'
Support contains 3 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 585 transitions
Trivial Post-agglo rules discarded 585 transitions
Performed 585 trivial Post agglomeration. Transition count delta: 585
Iterating post reduction 0 with 585 rules applied. Total rules applied 585 place count 1330 transition count 1445
Reduce places removed 585 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 586 rules applied. Total rules applied 1171 place count 745 transition count 1444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1172 place count 744 transition count 1444
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 294 Pre rules applied. Total rules applied 1172 place count 744 transition count 1150
Deduced a syphon composed of 294 places in 0 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 3 with 588 rules applied. Total rules applied 1760 place count 450 transition count 1150
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1844 place count 408 transition count 1108
Applied a total of 1844 rules in 73 ms. Remains 408 /1330 variables (removed 922) and now considering 1108/2030 (removed 922) transitions.
[2024-06-01 20:41:52] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 408 cols
[2024-06-01 20:41:52] [INFO ] Computed 27 invariants in 3 ms
[2024-06-01 20:41:52] [INFO ] Implicit Places using invariants in 866 ms returned [389, 392, 400, 401, 402, 403]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 870 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 402/1330 places, 1108/2030 transitions.
Applied a total of 0 rules in 26 ms. Remains 402 /402 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 970 ms. Remains : 402/1330 places, 1108/2030 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 381 ms.
Product exploration explored 100000 steps with 0 reset in 465 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 (NOT p1) p0), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 375 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 416 ms. (95 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 2/2 properties
[2024-06-01 20:41:54] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 402 cols
[2024-06-01 20:41:54] [INFO ] Computed 21 invariants in 4 ms
[2024-06-01 20:41:54] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 102/105 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 102/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 50/155 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 50/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/156 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 386/542 variables, 156/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/542 variables, 72/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/542 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 186/728 variables, 42/433 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/728 variables, 42/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/728 variables, 6/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/728 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 288/1016 variables, 48/529 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1016 variables, 48/577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1016 variables, 258/835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1016 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 152/1168 variables, 4/839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1168 variables, 152/991 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1168 variables, 0/991 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 4/1172 variables, 4/995 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1172 variables, 4/999 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1172 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 128/1300 variables, 156/1155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1300 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/1300 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1300/1300 variables, and 1155 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1004 ms.
Refiners :[Domain max(s): 402/402 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 402/402 constraints, ReadFeed: 330/330 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, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 102/105 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 102/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 50/155 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 50/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/156 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 386/542 variables, 156/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/542 variables, 72/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/542 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 186/728 variables, 42/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/728 variables, 42/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/728 variables, 6/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:41:56] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 3 ms to minimize.
[2024-06-01 20:41:56] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 2 ms to minimize.
[2024-06-01 20:41:56] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 2 ms to minimize.
[2024-06-01 20:41:56] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/728 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/728 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 288/1016 variables, 48/535 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1016 variables, 48/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1016 variables, 258/841 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:41:57] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2024-06-01 20:41:57] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1016 variables, 2/843 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1016 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 152/1168 variables, 4/847 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1168 variables, 152/999 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:41:57] [INFO ] Deduced a trap composed of 45 places in 317 ms of which 6 ms to minimize.
[2024-06-01 20:41:58] [INFO ] Deduced a trap composed of 34 places in 521 ms of which 6 ms to minimize.
[2024-06-01 20:41:58] [INFO ] Deduced a trap composed of 10 places in 452 ms of which 4 ms to minimize.
[2024-06-01 20:41:58] [INFO ] Deduced a trap composed of 10 places in 293 ms of which 4 ms to minimize.
[2024-06-01 20:41:59] [INFO ] Deduced a trap composed of 29 places in 297 ms of which 3 ms to minimize.
[2024-06-01 20:41:59] [INFO ] Deduced a trap composed of 35 places in 272 ms of which 6 ms to minimize.
[2024-06-01 20:41:59] [INFO ] Deduced a trap composed of 64 places in 394 ms of which 5 ms to minimize.
[2024-06-01 20:42:00] [INFO ] Deduced a trap composed of 23 places in 415 ms of which 5 ms to minimize.
[2024-06-01 20:42:00] [INFO ] Deduced a trap composed of 53 places in 409 ms of which 5 ms to minimize.
SMT process timed out in 6047ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 1108/1108 transitions.
Applied a total of 0 rules in 25 ms. Remains 402 /402 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 402/402 places, 1108/1108 transitions.
RANDOM walk for 40000 steps (8 resets) in 707 ms. (56 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 525808 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 2
Probabilistic random walk after 525808 steps, saw 71164 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
[2024-06-01 20:42:04] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
[2024-06-01 20:42:04] [INFO ] Invariant cache hit.
[2024-06-01 20:42:04] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 102/105 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 102/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 50/155 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 50/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/156 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 386/542 variables, 156/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/542 variables, 72/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/542 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 186/728 variables, 42/433 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/728 variables, 42/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/728 variables, 6/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/728 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 288/1016 variables, 48/529 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1016 variables, 48/577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1016 variables, 258/835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1016 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 152/1168 variables, 4/839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1168 variables, 152/991 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1168 variables, 0/991 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 4/1172 variables, 4/995 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1172 variables, 4/999 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1172 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 128/1300 variables, 156/1155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1300 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/1300 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1300/1300 variables, and 1155 constraints, problems are : Problem set: 0 solved, 2 unsolved in 992 ms.
Refiners :[Domain max(s): 402/402 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 402/402 constraints, ReadFeed: 330/330 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, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 102/105 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 102/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 50/155 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 50/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/156 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 386/542 variables, 156/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/542 variables, 72/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/542 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 186/728 variables, 42/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/728 variables, 42/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/728 variables, 6/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:42:05] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 3 ms to minimize.
[2024-06-01 20:42:06] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/728 variables, 2/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/728 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 288/1016 variables, 48/533 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1016 variables, 48/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1016 variables, 258/839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1016 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 152/1168 variables, 4/843 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1168 variables, 152/995 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:42:07] [INFO ] Deduced a trap composed of 10 places in 515 ms of which 7 ms to minimize.
[2024-06-01 20:42:07] [INFO ] Deduced a trap composed of 43 places in 529 ms of which 7 ms to minimize.
[2024-06-01 20:42:08] [INFO ] Deduced a trap composed of 11 places in 500 ms of which 6 ms to minimize.
[2024-06-01 20:42:08] [INFO ] Deduced a trap composed of 15 places in 406 ms of which 6 ms to minimize.
[2024-06-01 20:42:09] [INFO ] Deduced a trap composed of 72 places in 465 ms of which 6 ms to minimize.
[2024-06-01 20:42:09] [INFO ] Deduced a trap composed of 38 places in 282 ms of which 4 ms to minimize.
[2024-06-01 20:42:09] [INFO ] Deduced a trap composed of 14 places in 461 ms of which 5 ms to minimize.
[2024-06-01 20:42:10] [INFO ] Deduced a trap composed of 54 places in 460 ms of which 5 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1168 variables, 8/1003 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1168 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 4/1172 variables, 4/1007 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1172 variables, 4/1011 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1172 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 128/1300 variables, 156/1167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1300 variables, 0/1167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 0/1300 variables, 0/1167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1300/1300 variables, and 1167 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5702 ms.
Refiners :[Domain max(s): 402/402 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 402/402 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 6713ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 154 ms.
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 1108/1108 transitions.
Applied a total of 0 rules in 30 ms. Remains 402 /402 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 402/402 places, 1108/1108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 1108/1108 transitions.
Applied a total of 0 rules in 25 ms. Remains 402 /402 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
[2024-06-01 20:42:11] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
[2024-06-01 20:42:11] [INFO ] Invariant cache hit.
[2024-06-01 20:42:12] [INFO ] Implicit Places using invariants in 864 ms returned []
[2024-06-01 20:42:12] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
[2024-06-01 20:42:12] [INFO ] Invariant cache hit.
[2024-06-01 20:42:12] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:42:15] [INFO ] Implicit Places using invariants and state equation in 3119 ms returned []
Implicit Place search using SMT with State Equation took 3985 ms to find 0 implicit places.
[2024-06-01 20:42:15] [INFO ] Redundant transitions in 38 ms returned []
Running 1101 sub problems to find dead transitions.
[2024-06-01 20:42:15] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
[2024-06-01 20:42:15] [INFO ] Invariant cache hit.
[2024-06-01 20:42:15] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 401/401 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 18/419 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 20:42:31] [INFO ] Deduced a trap composed of 19 places in 480 ms of which 5 ms to minimize.
[2024-06-01 20:42:31] [INFO ] Deduced a trap composed of 10 places in 451 ms of which 6 ms to minimize.
[2024-06-01 20:42:32] [INFO ] Deduced a trap composed of 10 places in 479 ms of which 10 ms to minimize.
[2024-06-01 20:42:32] [INFO ] Deduced a trap composed of 34 places in 423 ms of which 5 ms to minimize.
[2024-06-01 20:42:33] [INFO ] Deduced a trap composed of 52 places in 395 ms of which 5 ms to minimize.
[2024-06-01 20:42:33] [INFO ] Deduced a trap composed of 42 places in 421 ms of which 6 ms to minimize.
[2024-06-01 20:42:33] [INFO ] Deduced a trap composed of 30 places in 424 ms of which 5 ms to minimize.
[2024-06-01 20:42:34] [INFO ] Deduced a trap composed of 16 places in 327 ms of which 5 ms to minimize.
[2024-06-01 20:42:34] [INFO ] Deduced a trap composed of 21 places in 414 ms of which 5 ms to minimize.
[2024-06-01 20:42:35] [INFO ] Deduced a trap composed of 10 places in 415 ms of which 6 ms to minimize.
[2024-06-01 20:42:35] [INFO ] Deduced a trap composed of 49 places in 367 ms of which 5 ms to minimize.
[2024-06-01 20:42:35] [INFO ] Deduced a trap composed of 23 places in 367 ms of which 5 ms to minimize.
[2024-06-01 20:42:36] [INFO ] Deduced a trap composed of 64 places in 294 ms of which 5 ms to minimize.
[2024-06-01 20:42:36] [INFO ] Deduced a trap composed of 22 places in 339 ms of which 4 ms to minimize.
[2024-06-01 20:42:37] [INFO ] Deduced a trap composed of 34 places in 432 ms of which 5 ms to minimize.
[2024-06-01 20:42:37] [INFO ] Deduced a trap composed of 29 places in 359 ms of which 5 ms to minimize.
[2024-06-01 20:42:37] [INFO ] Deduced a trap composed of 18 places in 338 ms of which 5 ms to minimize.
[2024-06-01 20:42:38] [INFO ] Deduced a trap composed of 12 places in 414 ms of which 5 ms to minimize.
[2024-06-01 20:42:38] [INFO ] Deduced a trap composed of 14 places in 292 ms of which 5 ms to minimize.
[2024-06-01 20:42:38] [INFO ] Deduced a trap composed of 54 places in 366 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/439 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 20:42:40] [INFO ] Deduced a trap composed of 12 places in 409 ms of which 6 ms to minimize.
[2024-06-01 20:42:40] [INFO ] Deduced a trap composed of 36 places in 400 ms of which 5 ms to minimize.
[2024-06-01 20:42:40] [INFO ] Deduced a trap composed of 45 places in 447 ms of which 5 ms to minimize.
[2024-06-01 20:42:41] [INFO ] Deduced a trap composed of 20 places in 458 ms of which 6 ms to minimize.
[2024-06-01 20:42:41] [INFO ] Deduced a trap composed of 18 places in 462 ms of which 5 ms to minimize.
[2024-06-01 20:42:42] [INFO ] Deduced a trap composed of 54 places in 381 ms of which 5 ms to minimize.
[2024-06-01 20:42:42] [INFO ] Deduced a trap composed of 40 places in 360 ms of which 5 ms to minimize.
[2024-06-01 20:42:42] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 2 ms to minimize.
[2024-06-01 20:42:43] [INFO ] Deduced a trap composed of 10 places in 425 ms of which 5 ms to minimize.
[2024-06-01 20:42:43] [INFO ] Deduced a trap composed of 34 places in 420 ms of which 5 ms to minimize.
[2024-06-01 20:42:44] [INFO ] Deduced a trap composed of 53 places in 358 ms of which 5 ms to minimize.
[2024-06-01 20:42:44] [INFO ] Deduced a trap composed of 18 places in 381 ms of which 5 ms to minimize.
[2024-06-01 20:42:44] [INFO ] Deduced a trap composed of 58 places in 281 ms of which 4 ms to minimize.
[2024-06-01 20:42:45] [INFO ] Deduced a trap composed of 35 places in 343 ms of which 4 ms to minimize.
[2024-06-01 20:42:45] [INFO ] Deduced a trap composed of 43 places in 298 ms of which 5 ms to minimize.
[2024-06-01 20:42:45] [INFO ] Deduced a trap composed of 46 places in 275 ms of which 3 ms to minimize.
[2024-06-01 20:42:46] [INFO ] Deduced a trap composed of 19 places in 336 ms of which 4 ms to minimize.
SMT process timed out in 30777ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 30798ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34871 ms. Remains : 402/402 places, 1108/1108 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 840 edges and 402 vertex of which 293 / 402 are part of one of the 42 SCC in 1 ms
Free SCC test removed 251 places
Drop transitions (Empty/Sink Transition effects.) removed 502 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 753 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 150 transition count 355
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 2 place count 150 transition count 314
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 1 with 82 rules applied. Total rules applied 84 place count 109 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 86 place count 108 transition count 313
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 17 rules applied. Total rules applied 103 place count 97 transition count 314
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 48 edges and 97 vertex of which 35 / 97 are part of one of the 5 SCC in 0 ms
Free SCC test removed 30 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 105 place count 67 transition count 313
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Graph (trivial) has 157 edges and 63 vertex of which 24 / 63 are part of one of the 6 SCC in 0 ms
Free SCC test removed 18 places
Iterating post reduction 2 with 40 rules applied. Total rules applied 145 place count 45 transition count 278
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Ensure Unique test removed 111 transitions
Reduce isomorphic transitions removed 183 transitions.
Iterating post reduction 3 with 183 rules applied. Total rules applied 328 place count 45 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 332 place count 45 transition count 91
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 333 place count 45 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 334 place count 44 transition count 90
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 336 place count 44 transition count 90
Applied a total of 336 rules in 37 ms. Remains 44 /402 variables (removed 358) and now considering 90/1108 (removed 1018) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 90 rows 44 cols
[2024-06-01 20:42:46] [INFO ] Computed 11 invariants in 15 ms
[2024-06-01 20:42:46] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 20:42:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 20:42:46] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 20:42:46] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 20:42:46] [INFO ] After 157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 266 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p1) p0))), (F p1)]
Knowledge based reduction with 5 factoid took 488 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), true, (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), true, (NOT p0)]
[2024-06-01 20:42:47] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 402 cols
[2024-06-01 20:42:47] [INFO ] Computed 21 invariants in 4 ms
[2024-06-01 20:42:48] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2024-06-01 20:42:48] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 8 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p1) p0))), (F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 5 factoid took 493 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-6-LTLCardinality-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-6-LTLCardinality-09 finished in 57068 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((p0||X(G(p1)))))))'
Support contains 4 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 61 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:42:49] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-06-01 20:42:49] [INFO ] Computed 27 invariants in 10 ms
[2024-06-01 20:42:50] [INFO ] Implicit Places using invariants in 1314 ms returned [1205, 1206, 1301, 1302, 1303, 1304]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1317 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1324/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 59 ms. Remains 1324 /1324 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1439 ms. Remains : 1324/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 261 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-6-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-6-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLCardinality-10 finished in 1727 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||G(p1))) U X(X(p2)))))'
Found a Lengthening insensitive property : Peterson-PT-6-LTLCardinality-01
Stuttering acceptance computed with spot in 387 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 595 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1330 transition count 1778
Reduce places removed 252 places and 0 transitions.
Iterating post reduction 1 with 252 rules applied. Total rules applied 504 place count 1078 transition count 1778
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 504 place count 1078 transition count 1729
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 602 place count 1029 transition count 1729
Applied a total of 602 rules in 147 ms. Remains 1029 /1330 variables (removed 301) and now considering 1729/2030 (removed 301) transitions.
[2024-06-01 20:42:51] [INFO ] Flow matrix only has 1519 transitions (discarded 210 similar events)
// Phase 1: matrix 1519 rows 1029 cols
[2024-06-01 20:42:51] [INFO ] Computed 27 invariants in 7 ms
[2024-06-01 20:42:52] [INFO ] Implicit Places using invariants in 527 ms returned []
[2024-06-01 20:42:52] [INFO ] Flow matrix only has 1519 transitions (discarded 210 similar events)
[2024-06-01 20:42:52] [INFO ] Invariant cache hit.
[2024-06-01 20:42:53] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:42:54] [INFO ] Implicit Places using invariants and state equation in 2763 ms returned []
Implicit Place search using SMT with State Equation took 3292 ms to find 0 implicit places.
Running 1722 sub problems to find dead transitions.
[2024-06-01 20:42:54] [INFO ] Flow matrix only has 1519 transitions (discarded 210 similar events)
[2024-06-01 20:42:54] [INFO ] Invariant cache hit.
[2024-06-01 20:42:54] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.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 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 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1022 variables, 1022/1022 constraints. Problems are: Problem set: 0 solved, 1722 unsolved
SMT process timed out in 30977ms, After SMT, problems are : Problem set: 0 solved, 1722 unsolved
Search for dead transitions found 0 dead transitions in 31000ms
Starting structural reductions in LI_LTL mode, iteration 1 : 1029/1330 places, 1729/2030 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 34443 ms. Remains : 1029/1330 places, 1729/2030 transitions.
Running random walk in product with property : Peterson-PT-6-LTLCardinality-01
Product exploration explored 100000 steps with 26777 reset in 1559 ms.
Product exploration explored 100000 steps with 26809 reset in 1366 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 p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
RANDOM walk for 34353 steps (7 resets) in 844 ms. (40 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR p0 p2))), (F (NOT (OR p1 p0))), (F (NOT p2)), (F (NOT (OR (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 436 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 457 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 384 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 595 out of 1029 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1029/1029 places, 1729/1729 transitions.
Applied a total of 0 rules in 15 ms. Remains 1029 /1029 variables (removed 0) and now considering 1729/1729 (removed 0) transitions.
[2024-06-01 20:43:30] [INFO ] Flow matrix only has 1519 transitions (discarded 210 similar events)
[2024-06-01 20:43:30] [INFO ] Invariant cache hit.
[2024-06-01 20:43:31] [INFO ] Implicit Places using invariants in 770 ms returned []
[2024-06-01 20:43:31] [INFO ] Flow matrix only has 1519 transitions (discarded 210 similar events)
[2024-06-01 20:43:31] [INFO ] Invariant cache hit.
[2024-06-01 20:43:32] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:43:35] [INFO ] Implicit Places using invariants and state equation in 3610 ms returned []
Implicit Place search using SMT with State Equation took 4384 ms to find 0 implicit places.
Running 1722 sub problems to find dead transitions.
[2024-06-01 20:43:35] [INFO ] Flow matrix only has 1519 transitions (discarded 210 similar events)
[2024-06-01 20:43:35] [INFO ] Invariant cache hit.
[2024-06-01 20:43:35] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1022 variables, 1022/1022 constraints. Problems are: Problem set: 0 solved, 1722 unsolved
SMT process timed out in 30842ms, After SMT, problems are : Problem set: 0 solved, 1722 unsolved
Search for dead transitions found 0 dead transitions in 30872ms
Finished structural reductions in LTL mode , in 1 iterations and 35277 ms. Remains : 1029/1029 places, 1729/1729 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 p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 209 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 348 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
RANDOM walk for 33583 steps (7 resets) in 617 ms. (54 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR p0 p2))), (F (NOT (OR p1 p0))), (F (NOT p2)), (F (NOT (OR (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 500 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 382 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 388 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 373 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 26709 reset in 1702 ms.
Product exploration explored 100000 steps with 26723 reset in 1117 ms.
Applying partial POR strategy [false, false, false, true, false, false, true]
Stuttering acceptance computed with spot in 307 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 595 out of 1029 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1029/1029 places, 1729/1729 transitions.
Applied a total of 0 rules in 28 ms. Remains 1029 /1029 variables (removed 0) and now considering 1729/1729 (removed 0) transitions.
[2024-06-01 20:44:11] [INFO ] Redundant transitions in 40 ms returned []
Running 1722 sub problems to find dead transitions.
[2024-06-01 20:44:11] [INFO ] Flow matrix only has 1519 transitions (discarded 210 similar events)
[2024-06-01 20:44:11] [INFO ] Invariant cache hit.
[2024-06-01 20:44:11] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.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 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 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1022 variables, 1022/1022 constraints. Problems are: Problem set: 0 solved, 1722 unsolved
SMT process timed out in 30785ms, After SMT, problems are : Problem set: 0 solved, 1722 unsolved
Search for dead transitions found 0 dead transitions in 30810ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30892 ms. Remains : 1029/1029 places, 1729/1729 transitions.
Support contains 595 out of 1029 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1029/1029 places, 1729/1729 transitions.
Applied a total of 0 rules in 14 ms. Remains 1029 /1029 variables (removed 0) and now considering 1729/1729 (removed 0) transitions.
[2024-06-01 20:44:42] [INFO ] Flow matrix only has 1519 transitions (discarded 210 similar events)
[2024-06-01 20:44:42] [INFO ] Invariant cache hit.
[2024-06-01 20:44:43] [INFO ] Implicit Places using invariants in 774 ms returned []
[2024-06-01 20:44:43] [INFO ] Flow matrix only has 1519 transitions (discarded 210 similar events)
[2024-06-01 20:44:43] [INFO ] Invariant cache hit.
[2024-06-01 20:44:44] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:44:46] [INFO ] Implicit Places using invariants and state equation in 3223 ms returned []
Implicit Place search using SMT with State Equation took 4004 ms to find 0 implicit places.
Running 1722 sub problems to find dead transitions.
[2024-06-01 20:44:46] [INFO ] Flow matrix only has 1519 transitions (discarded 210 similar events)
[2024-06-01 20:44:46] [INFO ] Invariant cache hit.
[2024-06-01 20:44:46] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.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 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 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1022 variables, 1022/1022 constraints. Problems are: Problem set: 0 solved, 1722 unsolved
SMT process timed out in 30714ms, After SMT, problems are : Problem set: 0 solved, 1722 unsolved
Search for dead transitions found 0 dead transitions in 30738ms
Finished structural reductions in LTL mode , in 1 iterations and 34761 ms. Remains : 1029/1029 places, 1729/1729 transitions.
Treatment of property Peterson-PT-6-LTLCardinality-01 finished in 146929 ms.
[2024-06-01 20:45:17] [INFO ] Flatten gal took : 123 ms
[2024-06-01 20:45:17] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 20:45:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1330 places, 2030 transitions and 6272 arcs took 33 ms.
Total runtime 572204 ms.
There are residual formulas that ITS could not solve within timeout
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
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="Peterson-PT-6"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Peterson-PT-6, 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 r512-smll-171654407300283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-6.tgz
mv Peterson-PT-6 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 ;