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.r476-tall-171620505200115.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 CANInsertWithFailure-PT-030, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505200115
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 5.6M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717187547254

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-030
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:32:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:32:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:32:28] [INFO ] Load time of PNML (sax parser for PT used): 265 ms
[2024-05-31 20:32:28] [INFO ] Transformed 2164 places.
[2024-05-31 20:32:28] [INFO ] Transformed 5580 transitions.
[2024-05-31 20:32:28] [INFO ] Parsed PT model containing 2164 places and 5580 transitions and 15000 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 2164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2164/2164 places, 5580/5580 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2163 transition count 5580
Applied a total of 1 rules in 283 ms. Remains 2163 /2164 variables (removed 1) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2024-05-31 20:32:29] [INFO ] Computed 32 invariants in 219 ms
[2024-05-31 20:32:30] [INFO ] Implicit Places using invariants in 1214 ms returned []
[2024-05-31 20:32:30] [INFO ] Invariant cache hit.
[2024-05-31 20:32:31] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 20:32:40] [INFO ] Implicit Places using invariants and state equation in 10218 ms returned []
Implicit Place search using SMT with State Equation took 11461 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-31 20:32:40] [INFO ] Invariant cache hit.
[2024-05-31 20:32:40] [INFO ] State equation strengthened by 1770 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33603ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33669ms
Starting structural reductions in LTL mode, iteration 1 : 2163/2164 places, 5580/5580 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45465 ms. Remains : 2163/2164 places, 5580/5580 transitions.
Support contains 49 out of 2163 places after structural reductions.
[2024-05-31 20:33:14] [INFO ] Flatten gal took : 256 ms
[2024-05-31 20:33:15] [INFO ] Flatten gal took : 155 ms
[2024-05-31 20:33:15] [INFO ] Input system was already deterministic with 5580 transitions.
Support contains 40 out of 2163 places (down from 49) after GAL structural reductions.
RANDOM walk for 40000 steps (54 resets) in 1863 ms. (21 steps per ms) remains 12/28 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 11/11 properties
[2024-05-31 20:33:16] [INFO ] Invariant cache hit.
[2024-05-31 20:33:16] [INFO ] State equation strengthened by 1770 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp26 is UNSAT
At refinement iteration 1 (OVERLAPS) 2093/2106 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2106 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 54/2160 variables, 27/30 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2160 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/2162 variables, 2/32 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2162 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 7 (OVERLAPS) 5580/7742 variables, 2162/2194 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/7742 variables, 1770/3964 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/7742 variables, 0/3964 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 1/7743 variables, 1/3965 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 341.0 38.0))
(s1 (/ 1.0 38.0))
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 (/ 1.0 38.0))
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 (/ 37.0 38.0))
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 (/ 1.0 38.0))
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 (/ 37.0 38.0))
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 (/ 1.0 38.0))
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 (/ 37.0 38.0))
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 (/ 37.0 38.0))
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 (/ 1.0 38.0))
(s143 (/ 1.0 38.0))
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 (/ 37.0 38.0))
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 (/ 1.0 38.0))
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 (/ 37.0 38.0))
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 (/ 1.0 38.0))
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 (/ 37.0 38.0))
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 (/ 1.0 38.0))
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 (/ 37.0 38.0))
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 (/ 1.0 38.0))
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 (/ 37.0 38.0))
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 (/ 1.0 38.0))
(s242 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7743/7743 variables, and 3965 constraints, problems are : Problem set: 2 solved, 9 unsolved in 5044 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2163/2163 constraints, ReadFeed: 1770/1770 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2092/2103 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-31 20:33:21] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 13 ms to minimize.
[2024-05-31 20:33:21] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-31 20:33:22] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-05-31 20:33:22] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2024-05-31 20:33:22] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:33:22] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 2 ms to minimize.
[2024-05-31 20:33:22] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:33:22] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 2 ms to minimize.
[2024-05-31 20:33:22] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 2 ms to minimize.
[2024-05-31 20:33:22] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:33:22] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:33:22] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:33:22] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-31 20:33:23] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:33:23] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-31 20:33:23] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:33:23] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-05-31 20:33:23] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-31 20:33:23] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:33:23] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2103 variables, 20/22 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2103 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 56/2159 variables, 28/50 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2159 variables, 0/50 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 2/2161 variables, 2/52 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-31 20:33:25] [INFO ] Deduced a trap composed of 65 places in 1381 ms of which 13 ms to minimize.
[2024-05-31 20:33:26] [INFO ] Deduced a trap composed of 53 places in 1207 ms of which 12 ms to minimize.
SMT process timed out in 10685ms, After SMT, problems are : Problem set: 2 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 2163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 209 rules applied. Total rules applied 209 place count 2163 transition count 5371
Reduce places removed 209 places and 0 transitions.
Iterating post reduction 1 with 209 rules applied. Total rules applied 418 place count 1954 transition count 5371
Performed 867 Post agglomeration using F-continuation condition.Transition count delta: 867
Deduced a syphon composed of 867 places in 2 ms
Reduce places removed 867 places and 0 transitions.
Iterating global reduction 2 with 1734 rules applied. Total rules applied 2152 place count 1087 transition count 4504
Drop transitions (Redundant composition of simpler transitions.) removed 809 transitions
Redundant transition composition rules discarded 809 transitions
Iterating global reduction 2 with 809 rules applied. Total rules applied 2961 place count 1087 transition count 3695
Partial Free-agglomeration rule applied 951 times.
Drop transitions (Partial Free agglomeration) removed 951 transitions
Iterating global reduction 2 with 951 rules applied. Total rules applied 3912 place count 1087 transition count 3695
Applied a total of 3912 rules in 858 ms. Remains 1087 /2163 variables (removed 1076) and now considering 3695/5580 (removed 1885) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 859 ms. Remains : 1087/2163 places, 3695/5580 transitions.
RANDOM walk for 40000 steps (282 resets) in 930 ms. (42 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (9 resets) in 89 ms. (444 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 49 ms. (800 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 8/8 properties
// Phase 1: matrix 3695 rows 1087 cols
[2024-05-31 20:33:28] [INFO ] Computed 32 invariants in 38 ms
[2024-05-31 20:33:28] [INFO ] State equation strengthened by 3556 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1017/1025 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 20:33:28] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1025 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1025 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 58/1083 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1083 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/1085 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 20:33:29] [INFO ] Deduced a trap composed of 40 places in 617 ms of which 6 ms to minimize.
[2024-05-31 20:33:30] [INFO ] Deduced a trap composed of 35 places in 573 ms of which 7 ms to minimize.
[2024-05-31 20:33:31] [INFO ] Deduced a trap composed of 63 places in 580 ms of which 7 ms to minimize.
[2024-05-31 20:33:31] [INFO ] Deduced a trap composed of 35 places in 571 ms of which 6 ms to minimize.
[2024-05-31 20:33:32] [INFO ] Deduced a trap composed of 41 places in 543 ms of which 6 ms to minimize.
[2024-05-31 20:33:32] [INFO ] Deduced a trap composed of 41 places in 547 ms of which 6 ms to minimize.
[2024-05-31 20:33:33] [INFO ] Deduced a trap composed of 36 places in 508 ms of which 5 ms to minimize.
[2024-05-31 20:33:33] [INFO ] Deduced a trap composed of 36 places in 510 ms of which 5 ms to minimize.
[2024-05-31 20:33:34] [INFO ] Deduced a trap composed of 38 places in 455 ms of which 5 ms to minimize.
[2024-05-31 20:33:34] [INFO ] Deduced a trap composed of 60 places in 510 ms of which 6 ms to minimize.
[2024-05-31 20:33:35] [INFO ] Deduced a trap composed of 39 places in 477 ms of which 6 ms to minimize.
[2024-05-31 20:33:35] [INFO ] Deduced a trap composed of 36 places in 449 ms of which 8 ms to minimize.
[2024-05-31 20:33:36] [INFO ] Deduced a trap composed of 34 places in 442 ms of which 5 ms to minimize.
[2024-05-31 20:33:36] [INFO ] Deduced a trap composed of 38 places in 436 ms of which 5 ms to minimize.
[2024-05-31 20:33:37] [INFO ] Deduced a trap composed of 36 places in 415 ms of which 4 ms to minimize.
[2024-05-31 20:33:37] [INFO ] Deduced a trap composed of 39 places in 374 ms of which 4 ms to minimize.
[2024-05-31 20:33:38] [INFO ] Deduced a trap composed of 37 places in 374 ms of which 4 ms to minimize.
[2024-05-31 20:33:38] [INFO ] Deduced a trap composed of 43 places in 354 ms of which 5 ms to minimize.
[2024-05-31 20:33:38] [INFO ] Deduced a trap composed of 37 places in 366 ms of which 4 ms to minimize.
[2024-05-31 20:33:39] [INFO ] Deduced a trap composed of 39 places in 390 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1085 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 20:33:39] [INFO ] Deduced a trap composed of 35 places in 337 ms of which 4 ms to minimize.
[2024-05-31 20:33:39] [INFO ] Deduced a trap composed of 41 places in 326 ms of which 5 ms to minimize.
[2024-05-31 20:33:40] [INFO ] Deduced a trap composed of 37 places in 324 ms of which 4 ms to minimize.
[2024-05-31 20:33:40] [INFO ] Deduced a trap composed of 39 places in 304 ms of which 4 ms to minimize.
[2024-05-31 20:33:40] [INFO ] Deduced a trap composed of 36 places in 310 ms of which 4 ms to minimize.
[2024-05-31 20:33:41] [INFO ] Deduced a trap composed of 38 places in 305 ms of which 4 ms to minimize.
[2024-05-31 20:33:41] [INFO ] Deduced a trap composed of 35 places in 278 ms of which 3 ms to minimize.
[2024-05-31 20:33:41] [INFO ] Deduced a trap composed of 35 places in 262 ms of which 4 ms to minimize.
[2024-05-31 20:33:42] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 3 ms to minimize.
[2024-05-31 20:33:42] [INFO ] Deduced a trap composed of 35 places in 235 ms of which 3 ms to minimize.
[2024-05-31 20:33:42] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 3 ms to minimize.
[2024-05-31 20:33:42] [INFO ] Deduced a trap composed of 35 places in 254 ms of which 3 ms to minimize.
[2024-05-31 20:33:43] [INFO ] Deduced a trap composed of 35 places in 198 ms of which 3 ms to minimize.
[2024-05-31 20:33:43] [INFO ] Deduced a trap composed of 36 places in 179 ms of which 2 ms to minimize.
[2024-05-31 20:33:43] [INFO ] Deduced a trap composed of 36 places in 179 ms of which 2 ms to minimize.
[2024-05-31 20:33:43] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 2 ms to minimize.
[2024-05-31 20:33:43] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 3 ms to minimize.
[2024-05-31 20:33:44] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 2 ms to minimize.
[2024-05-31 20:33:44] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2024-05-31 20:33:44] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1085 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 20:33:44] [INFO ] Deduced a trap composed of 36 places in 184 ms of which 3 ms to minimize.
[2024-05-31 20:33:44] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 3 ms to minimize.
[2024-05-31 20:33:44] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 2 ms to minimize.
[2024-05-31 20:33:44] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 2 ms to minimize.
[2024-05-31 20:33:45] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 3 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1085 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1085 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 3695/4780 variables, 1085/1163 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4780 variables, 3556/4719 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4780 variables, 0/4719 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 2/4782 variables, 2/4721 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4782 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/4782 variables, 0/4721 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4782/4782 variables, and 4721 constraints, problems are : Problem set: 0 solved, 8 unsolved in 20996 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1087/1087 constraints, ReadFeed: 3556/3556 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1017/1025 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1025 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1025 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 58/1083 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1083 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/1085 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1085 variables, 45/78 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 20:33:50] [INFO ] Deduced a trap composed of 38 places in 632 ms of which 6 ms to minimize.
[2024-05-31 20:33:51] [INFO ] Deduced a trap composed of 37 places in 620 ms of which 6 ms to minimize.
[2024-05-31 20:33:51] [INFO ] Deduced a trap composed of 47 places in 610 ms of which 6 ms to minimize.
[2024-05-31 20:33:52] [INFO ] Deduced a trap composed of 39 places in 602 ms of which 6 ms to minimize.
[2024-05-31 20:33:53] [INFO ] Deduced a trap composed of 42 places in 586 ms of which 6 ms to minimize.
[2024-05-31 20:33:53] [INFO ] Deduced a trap composed of 35 places in 542 ms of which 6 ms to minimize.
[2024-05-31 20:33:54] [INFO ] Deduced a trap composed of 36 places in 513 ms of which 5 ms to minimize.
[2024-05-31 20:33:54] [INFO ] Deduced a trap composed of 41 places in 509 ms of which 5 ms to minimize.
[2024-05-31 20:33:55] [INFO ] Deduced a trap composed of 39 places in 477 ms of which 5 ms to minimize.
[2024-05-31 20:33:55] [INFO ] Deduced a trap composed of 37 places in 495 ms of which 6 ms to minimize.
[2024-05-31 20:33:56] [INFO ] Deduced a trap composed of 39 places in 457 ms of which 5 ms to minimize.
[2024-05-31 20:33:56] [INFO ] Deduced a trap composed of 40 places in 432 ms of which 5 ms to minimize.
[2024-05-31 20:33:57] [INFO ] Deduced a trap composed of 37 places in 397 ms of which 5 ms to minimize.
[2024-05-31 20:33:57] [INFO ] Deduced a trap composed of 56 places in 397 ms of which 5 ms to minimize.
[2024-05-31 20:33:57] [INFO ] Deduced a trap composed of 55 places in 417 ms of which 5 ms to minimize.
[2024-05-31 20:33:58] [INFO ] Deduced a trap composed of 48 places in 433 ms of which 5 ms to minimize.
[2024-05-31 20:33:58] [INFO ] Deduced a trap composed of 47 places in 433 ms of which 5 ms to minimize.
[2024-05-31 20:33:59] [INFO ] Deduced a trap composed of 48 places in 412 ms of which 5 ms to minimize.
[2024-05-31 20:33:59] [INFO ] Deduced a trap composed of 48 places in 378 ms of which 4 ms to minimize.
[2024-05-31 20:34:00] [INFO ] Deduced a trap composed of 44 places in 421 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1085 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 20:34:00] [INFO ] Deduced a trap composed of 46 places in 402 ms of which 4 ms to minimize.
[2024-05-31 20:34:00] [INFO ] Deduced a trap composed of 44 places in 418 ms of which 4 ms to minimize.
[2024-05-31 20:34:01] [INFO ] Deduced a trap composed of 44 places in 415 ms of which 5 ms to minimize.
[2024-05-31 20:34:01] [INFO ] Deduced a trap composed of 41 places in 406 ms of which 5 ms to minimize.
[2024-05-31 20:34:02] [INFO ] Deduced a trap composed of 45 places in 401 ms of which 4 ms to minimize.
[2024-05-31 20:34:02] [INFO ] Deduced a trap composed of 45 places in 382 ms of which 4 ms to minimize.
[2024-05-31 20:34:03] [INFO ] Deduced a trap composed of 40 places in 402 ms of which 4 ms to minimize.
[2024-05-31 20:34:03] [INFO ] Deduced a trap composed of 44 places in 382 ms of which 5 ms to minimize.
[2024-05-31 20:34:03] [INFO ] Deduced a trap composed of 41 places in 394 ms of which 5 ms to minimize.
[2024-05-31 20:34:04] [INFO ] Deduced a trap composed of 37 places in 356 ms of which 4 ms to minimize.
[2024-05-31 20:34:04] [INFO ] Deduced a trap composed of 39 places in 369 ms of which 5 ms to minimize.
[2024-05-31 20:34:04] [INFO ] Deduced a trap composed of 45 places in 370 ms of which 5 ms to minimize.
[2024-05-31 20:34:05] [INFO ] Deduced a trap composed of 45 places in 384 ms of which 5 ms to minimize.
[2024-05-31 20:34:05] [INFO ] Deduced a trap composed of 46 places in 381 ms of which 5 ms to minimize.
[2024-05-31 20:34:06] [INFO ] Deduced a trap composed of 45 places in 392 ms of which 4 ms to minimize.
[2024-05-31 20:34:06] [INFO ] Deduced a trap composed of 51 places in 347 ms of which 5 ms to minimize.
[2024-05-31 20:34:06] [INFO ] Deduced a trap composed of 36 places in 351 ms of which 5 ms to minimize.
[2024-05-31 20:34:07] [INFO ] Deduced a trap composed of 37 places in 374 ms of which 5 ms to minimize.
[2024-05-31 20:34:07] [INFO ] Deduced a trap composed of 41 places in 374 ms of which 5 ms to minimize.
[2024-05-31 20:34:08] [INFO ] Deduced a trap composed of 38 places in 318 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1085 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 20:34:08] [INFO ] Deduced a trap composed of 38 places in 331 ms of which 4 ms to minimize.
[2024-05-31 20:34:08] [INFO ] Deduced a trap composed of 45 places in 340 ms of which 4 ms to minimize.
[2024-05-31 20:34:09] [INFO ] Deduced a trap composed of 40 places in 329 ms of which 4 ms to minimize.
[2024-05-31 20:34:09] [INFO ] Deduced a trap composed of 38 places in 317 ms of which 4 ms to minimize.
[2024-05-31 20:34:09] [INFO ] Deduced a trap composed of 38 places in 316 ms of which 4 ms to minimize.
[2024-05-31 20:34:10] [INFO ] Deduced a trap composed of 37 places in 313 ms of which 4 ms to minimize.
[2024-05-31 20:34:10] [INFO ] Deduced a trap composed of 35 places in 303 ms of which 4 ms to minimize.
[2024-05-31 20:34:10] [INFO ] Deduced a trap composed of 38 places in 278 ms of which 4 ms to minimize.
[2024-05-31 20:34:11] [INFO ] Deduced a trap composed of 43 places in 290 ms of which 4 ms to minimize.
[2024-05-31 20:34:11] [INFO ] Deduced a trap composed of 39 places in 280 ms of which 3 ms to minimize.
[2024-05-31 20:34:11] [INFO ] Deduced a trap composed of 36 places in 265 ms of which 4 ms to minimize.
[2024-05-31 20:34:11] [INFO ] Deduced a trap composed of 38 places in 266 ms of which 4 ms to minimize.
[2024-05-31 20:34:12] [INFO ] Deduced a trap composed of 38 places in 240 ms of which 3 ms to minimize.
[2024-05-31 20:34:12] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 3 ms to minimize.
[2024-05-31 20:34:12] [INFO ] Deduced a trap composed of 36 places in 268 ms of which 3 ms to minimize.
[2024-05-31 20:34:12] [INFO ] Deduced a trap composed of 39 places in 246 ms of which 3 ms to minimize.
[2024-05-31 20:34:13] [INFO ] Deduced a trap composed of 35 places in 288 ms of which 4 ms to minimize.
[2024-05-31 20:34:13] [INFO ] Deduced a trap composed of 39 places in 269 ms of which 4 ms to minimize.
[2024-05-31 20:34:13] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 4 ms to minimize.
[2024-05-31 20:34:14] [INFO ] Deduced a trap composed of 39 places in 250 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1085 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 20:34:14] [INFO ] Deduced a trap composed of 38 places in 282 ms of which 4 ms to minimize.
[2024-05-31 20:34:14] [INFO ] Deduced a trap composed of 39 places in 264 ms of which 4 ms to minimize.
[2024-05-31 20:34:15] [INFO ] Deduced a trap composed of 37 places in 266 ms of which 4 ms to minimize.
[2024-05-31 20:34:15] [INFO ] Deduced a trap composed of 37 places in 264 ms of which 4 ms to minimize.
[2024-05-31 20:34:15] [INFO ] Deduced a trap composed of 37 places in 243 ms of which 3 ms to minimize.
[2024-05-31 20:34:15] [INFO ] Deduced a trap composed of 47 places in 228 ms of which 4 ms to minimize.
[2024-05-31 20:34:16] [INFO ] Deduced a trap composed of 45 places in 232 ms of which 3 ms to minimize.
[2024-05-31 20:34:16] [INFO ] Deduced a trap composed of 42 places in 233 ms of which 4 ms to minimize.
[2024-05-31 20:34:16] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 3 ms to minimize.
[2024-05-31 20:34:16] [INFO ] Deduced a trap composed of 50 places in 196 ms of which 3 ms to minimize.
[2024-05-31 20:34:16] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 3 ms to minimize.
[2024-05-31 20:34:17] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 4 ms to minimize.
[2024-05-31 20:34:17] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 3 ms to minimize.
[2024-05-31 20:34:17] [INFO ] Deduced a trap composed of 53 places in 298 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1085 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1085 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 3695/4780 variables, 1085/1237 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4780 variables, 3556/4793 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4780 variables, 8/4801 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4780/4782 variables, and 4801 constraints, problems are : Problem set: 0 solved, 8 unsolved in 45028 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1085/1087 constraints, ReadFeed: 3556/3556 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 120/120 constraints]
After SMT, in 66124ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 1087 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1087/1087 places, 3695/3695 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1085 transition count 3693
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 1085 transition count 3693
Applied a total of 5 rules in 186 ms. Remains 1085 /1087 variables (removed 2) and now considering 3693/3695 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 1085/1087 places, 3693/3695 transitions.
RANDOM walk for 40000 steps (283 resets) in 740 ms. (53 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 48 ms. (816 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 161488 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 8
Probabilistic random walk after 161488 steps, saw 30869 distinct states, run finished after 3010 ms. (steps per millisecond=53 ) properties seen :0
// Phase 1: matrix 3693 rows 1085 cols
[2024-05-31 20:34:38] [INFO ] Computed 32 invariants in 41 ms
[2024-05-31 20:34:38] [INFO ] State equation strengthened by 3590 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1015/1023 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 20:34:38] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 0 ms to minimize.
[2024-05-31 20:34:38] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
[2024-05-31 20:34:38] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-31 20:34:38] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:34:38] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:34:38] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-31 20:34:38] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:34:38] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 0 ms to minimize.
[2024-05-31 20:34:38] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 0 ms to minimize.
[2024-05-31 20:34:38] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-05-31 20:34:38] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:34:38] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-31 20:34:39] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-05-31 20:34:39] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:34:39] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:34:39] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 0 ms to minimize.
[2024-05-31 20:34:39] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 0 ms to minimize.
[2024-05-31 20:34:39] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 0 ms to minimize.
[2024-05-31 20:34:39] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 0 ms to minimize.
[2024-05-31 20:34:39] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 20:34:39] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 0 ms to minimize.
[2024-05-31 20:34:39] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 0 ms to minimize.
[2024-05-31 20:34:39] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-05-31 20:34:39] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 0 ms to minimize.
[2024-05-31 20:34:39] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
[2024-05-31 20:34:39] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-31 20:34:39] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:34:39] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 0 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1023 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 58/1081 variables, 29/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1081 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 2/1083 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1083 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 3693/4776 variables, 1083/1143 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4776 variables, 3590/4733 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4776 variables, 0/4733 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 2/4778 variables, 2/4735 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4778 variables, 0/4735 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/4778 variables, 0/4735 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4778/4778 variables, and 4735 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5953 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1085/1085 constraints, ReadFeed: 3590/3590 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1015/1023 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 28/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1023 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 58/1081 variables, 29/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1081 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/1083 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 20:34:45] [INFO ] Deduced a trap composed of 37 places in 621 ms of which 7 ms to minimize.
[2024-05-31 20:34:45] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1083 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1083 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 3693/4776 variables, 1083/1145 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4776 variables, 3590/4735 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4776 variables, 8/4743 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4776 variables, 0/4743 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 2/4778 variables, 2/4745 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4778 variables, 0/4745 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/4778 variables, 0/4745 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4778/4778 variables, and 4745 constraints, problems are : Problem set: 0 solved, 8 unsolved in 57578 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1085/1085 constraints, ReadFeed: 3590/3590 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 30/30 constraints]
After SMT, in 63630ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 1656 ms.
Support contains 8 out of 1085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3693/3693 transitions.
Applied a total of 0 rules in 65 ms. Remains 1085 /1085 variables (removed 0) and now considering 3693/3693 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1085/1085 places, 3693/3693 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3693/3693 transitions.
Applied a total of 0 rules in 68 ms. Remains 1085 /1085 variables (removed 0) and now considering 3693/3693 (removed 0) transitions.
[2024-05-31 20:35:43] [INFO ] Invariant cache hit.
[2024-05-31 20:35:44] [INFO ] Implicit Places using invariants in 920 ms returned []
[2024-05-31 20:35:44] [INFO ] Invariant cache hit.
[2024-05-31 20:35:45] [INFO ] State equation strengthened by 3590 read => feed constraints.
[2024-05-31 20:36:03] [INFO ] Implicit Places using invariants and state equation in 19116 ms returned []
Implicit Place search using SMT with State Equation took 20038 ms to find 0 implicit places.
[2024-05-31 20:36:03] [INFO ] Redundant transitions in 232 ms returned []
Running 3663 sub problems to find dead transitions.
[2024-05-31 20:36:03] [INFO ] Invariant cache hit.
[2024-05-31 20:36:03] [INFO ] State equation strengthened by 3590 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1084 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3663 unsolved
SMT process timed out in 32314ms, After SMT, problems are : Problem set: 0 solved, 3663 unsolved
Search for dead transitions found 0 dead transitions in 32348ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52708 ms. Remains : 1085/1085 places, 3693/3693 transitions.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
Computed a total of 122 stabilizing places and 210 stable transitions
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 57 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2024-05-31 20:36:36] [INFO ] Computed 32 invariants in 116 ms
[2024-05-31 20:36:37] [INFO ] Implicit Places using invariants in 955 ms returned []
[2024-05-31 20:36:37] [INFO ] Invariant cache hit.
[2024-05-31 20:36:38] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 20:36:53] [INFO ] Implicit Places using invariants and state equation in 15708 ms returned []
Implicit Place search using SMT with State Equation took 16666 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-31 20:36:53] [INFO ] Invariant cache hit.
[2024-05-31 20:36:53] [INFO ] State equation strengthened by 1770 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33152ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33197ms
Finished structural reductions in LTL mode , in 1 iterations and 49934 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-01
Stuttering criterion allowed to conclude after 535 steps with 0 reset in 19 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-01 finished in 50218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((F(p1)&&(p0||X(G(p2))))))))'
Support contains 5 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 60 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-31 20:37:26] [INFO ] Invariant cache hit.
[2024-05-31 20:37:27] [INFO ] Implicit Places using invariants in 837 ms returned []
[2024-05-31 20:37:27] [INFO ] Invariant cache hit.
[2024-05-31 20:37:28] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 20:37:43] [INFO ] Implicit Places using invariants and state equation in 15842 ms returned []
Implicit Place search using SMT with State Equation took 16682 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-31 20:37:43] [INFO ] Invariant cache hit.
[2024-05-31 20:37:43] [INFO ] State equation strengthened by 1770 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/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33117ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33212ms
Finished structural reductions in LTL mode , in 1 iterations and 49966 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), true]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 2075 steps with 2 reset in 14 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-03 finished in 50255 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 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 209 rules applied. Total rules applied 209 place count 2163 transition count 5371
Reduce places removed 209 places and 0 transitions.
Iterating post reduction 1 with 209 rules applied. Total rules applied 418 place count 1954 transition count 5371
Performed 869 Post agglomeration using F-continuation condition.Transition count delta: 869
Deduced a syphon composed of 869 places in 1 ms
Reduce places removed 869 places and 0 transitions.
Iterating global reduction 2 with 1738 rules applied. Total rules applied 2156 place count 1085 transition count 4502
Drop transitions (Redundant composition of simpler transitions.) removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 2 with 811 rules applied. Total rules applied 2967 place count 1085 transition count 3691
Applied a total of 2967 rules in 382 ms. Remains 1085 /2163 variables (removed 1078) and now considering 3691/5580 (removed 1889) transitions.
// Phase 1: matrix 3691 rows 1085 cols
[2024-05-31 20:38:17] [INFO ] Computed 32 invariants in 48 ms
[2024-05-31 20:38:17] [INFO ] Implicit Places using invariants in 564 ms returned []
[2024-05-31 20:38:17] [INFO ] Invariant cache hit.
[2024-05-31 20:38:18] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2024-05-31 20:38:24] [INFO ] Implicit Places using invariants and state equation in 6417 ms returned []
Implicit Place search using SMT with State Equation took 6984 ms to find 0 implicit places.
[2024-05-31 20:38:24] [INFO ] Redundant transitions in 215 ms returned []
Running 3661 sub problems to find dead transitions.
[2024-05-31 20:38:24] [INFO ] Invariant cache hit.
[2024-05-31 20:38:24] [INFO ] State equation strengthened by 2666 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1084 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3661 unsolved
SMT process timed out in 31768ms, After SMT, problems are : Problem set: 0 solved, 3661 unsolved
Search for dead transitions found 0 dead transitions in 31798ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1085/2163 places, 3691/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39395 ms. Remains : 1085/2163 places, 3691/5580 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-04
Product exploration explored 100000 steps with 654 reset in 719 ms.
Product exploration explored 100000 steps with 646 reset in 734 ms.
Computed a total of 90 stabilizing places and 149 stable transitions
Computed a total of 90 stabilizing places and 149 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 37254 steps (235 resets) in 392 ms. (94 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 1085 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 65 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2024-05-31 20:38:58] [INFO ] Invariant cache hit.
[2024-05-31 20:38:58] [INFO ] Implicit Places using invariants in 518 ms returned []
[2024-05-31 20:38:58] [INFO ] Invariant cache hit.
[2024-05-31 20:38:59] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2024-05-31 20:39:05] [INFO ] Implicit Places using invariants and state equation in 6401 ms returned []
Implicit Place search using SMT with State Equation took 6921 ms to find 0 implicit places.
[2024-05-31 20:39:05] [INFO ] Redundant transitions in 97 ms returned []
Running 3661 sub problems to find dead transitions.
[2024-05-31 20:39:05] [INFO ] Invariant cache hit.
[2024-05-31 20:39:05] [INFO ] State equation strengthened by 2666 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s3 1.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1084 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3661 unsolved
SMT process timed out in 31736ms, After SMT, problems are : Problem set: 0 solved, 3661 unsolved
Search for dead transitions found 0 dead transitions in 31766ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38862 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Computed a total of 90 stabilizing places and 149 stable transitions
Computed a total of 90 stabilizing places and 149 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (260 resets) in 407 ms. (98 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 180832 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 1
Probabilistic random walk after 180832 steps, saw 34583 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
[2024-05-31 20:39:40] [INFO ] Invariant cache hit.
[2024-05-31 20:39:40] [INFO ] State equation strengthened by 2666 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1022/1025 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1025 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 56/1081 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1081 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/1083 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1083 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3691/4774 variables, 1083/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4774 variables, 2666/3781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4774 variables, 0/3781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/4776 variables, 2/3783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4776 variables, 0/3783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/4776 variables, 0/3783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4776/4776 variables, and 3783 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1327 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1085/1085 constraints, ReadFeed: 2666/2666 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1022/1025 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:39:42] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:39:42] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:39:42] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 0 ms to minimize.
[2024-05-31 20:39:42] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-31 20:39:42] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:39:42] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 0 ms to minimize.
[2024-05-31 20:39:42] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-31 20:39:42] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:39:42] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 0 ms to minimize.
[2024-05-31 20:39:42] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-31 20:39:42] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:39:42] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 0 ms to minimize.
[2024-05-31 20:39:42] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 0 ms to minimize.
[2024-05-31 20:39:42] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:39:42] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:39:42] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 0 ms to minimize.
[2024-05-31 20:39:42] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:39:43] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
[2024-05-31 20:39:43] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 0 ms to minimize.
[2024-05-31 20:39:43] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1025 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:39:43] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:39:43] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1025 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 56/1081 variables, 28/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1081 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1083 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:39:43] [INFO ] Deduced a trap composed of 40 places in 606 ms of which 7 ms to minimize.
[2024-05-31 20:39:44] [INFO ] Deduced a trap composed of 38 places in 555 ms of which 6 ms to minimize.
[2024-05-31 20:39:45] [INFO ] Deduced a trap composed of 47 places in 585 ms of which 6 ms to minimize.
[2024-05-31 20:39:45] [INFO ] Deduced a trap composed of 39 places in 503 ms of which 5 ms to minimize.
[2024-05-31 20:39:46] [INFO ] Deduced a trap composed of 37 places in 536 ms of which 5 ms to minimize.
[2024-05-31 20:39:46] [INFO ] Deduced a trap composed of 40 places in 472 ms of which 6 ms to minimize.
[2024-05-31 20:39:47] [INFO ] Deduced a trap composed of 36 places in 492 ms of which 5 ms to minimize.
SMT process timed out in 6517ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1085 transition count 3690
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1084 transition count 3690
Partial Free-agglomeration rule applied 930 times.
Drop transitions (Partial Free agglomeration) removed 930 transitions
Iterating global reduction 1 with 930 rules applied. Total rules applied 932 place count 1084 transition count 3690
Applied a total of 932 rules in 192 ms. Remains 1084 /1085 variables (removed 1) and now considering 3690/3691 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 1084/1085 places, 3690/3691 transitions.
RANDOM walk for 40000 steps (285 resets) in 391 ms. (102 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 187380 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 1
Probabilistic random walk after 187380 steps, saw 35873 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
// Phase 1: matrix 3690 rows 1084 cols
[2024-05-31 20:39:50] [INFO ] Computed 32 invariants in 38 ms
[2024-05-31 20:39:50] [INFO ] State equation strengthened by 3565 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1021/1024 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 56/1080 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1080 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/1082 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1082 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3690/4772 variables, 1082/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4772 variables, 3565/4679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4772 variables, 0/4679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/4774 variables, 2/4681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4774 variables, 0/4681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/4774 variables, 0/4681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4774/4774 variables, and 4681 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1166 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1084/1084 constraints, ReadFeed: 3565/3565 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1021/1024 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:39:51] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 56/1080 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1080 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1082 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:39:52] [INFO ] Deduced a trap composed of 37 places in 600 ms of which 6 ms to minimize.
[2024-05-31 20:39:53] [INFO ] Deduced a trap composed of 42 places in 586 ms of which 6 ms to minimize.
[2024-05-31 20:39:53] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:39:53] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1082 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1082 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3690/4772 variables, 1082/1119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4772 variables, 3565/4684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4772 variables, 1/4685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4772 variables, 0/4685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/4774 variables, 2/4687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4774 variables, 0/4687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4774 variables, 0/4687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4774/4774 variables, and 4687 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3158 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1084/1084 constraints, ReadFeed: 3565/3565 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 4420ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 653 reset in 648 ms.
Product exploration explored 100000 steps with 642 reset in 671 ms.
Support contains 3 out of 1085 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 56 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
// Phase 1: matrix 3691 rows 1085 cols
[2024-05-31 20:39:56] [INFO ] Computed 32 invariants in 45 ms
[2024-05-31 20:39:57] [INFO ] Implicit Places using invariants in 567 ms returned []
[2024-05-31 20:39:57] [INFO ] Invariant cache hit.
[2024-05-31 20:39:58] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2024-05-31 20:40:03] [INFO ] Implicit Places using invariants and state equation in 6549 ms returned []
Implicit Place search using SMT with State Equation took 7119 ms to find 0 implicit places.
[2024-05-31 20:40:03] [INFO ] Redundant transitions in 99 ms returned []
Running 3661 sub problems to find dead transitions.
[2024-05-31 20:40:03] [INFO ] Invariant cache hit.
[2024-05-31 20:40:03] [INFO ] State equation strengthened by 2666 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1084 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3661 unsolved
SMT process timed out in 31734ms, After SMT, problems are : Problem set: 0 solved, 3661 unsolved
Search for dead transitions found 0 dead transitions in 31768ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39058 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-04 finished in 139080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1953 transition count 5370
Performed 870 Post agglomeration using F-continuation condition.Transition count delta: 870
Deduced a syphon composed of 870 places in 1 ms
Reduce places removed 870 places and 0 transitions.
Iterating global reduction 2 with 1740 rules applied. Total rules applied 2160 place count 1083 transition count 4500
Drop transitions (Redundant composition of simpler transitions.) removed 812 transitions
Redundant transition composition rules discarded 812 transitions
Iterating global reduction 2 with 812 rules applied. Total rules applied 2972 place count 1083 transition count 3688
Applied a total of 2972 rules in 284 ms. Remains 1083 /2163 variables (removed 1080) and now considering 3688/5580 (removed 1892) transitions.
// Phase 1: matrix 3688 rows 1083 cols
[2024-05-31 20:40:36] [INFO ] Computed 32 invariants in 37 ms
[2024-05-31 20:40:36] [INFO ] Implicit Places using invariants in 549 ms returned []
[2024-05-31 20:40:36] [INFO ] Invariant cache hit.
[2024-05-31 20:40:37] [INFO ] State equation strengthened by 2668 read => feed constraints.
[2024-05-31 20:40:43] [INFO ] Implicit Places using invariants and state equation in 6226 ms returned []
Implicit Place search using SMT with State Equation took 6777 ms to find 0 implicit places.
[2024-05-31 20:40:43] [INFO ] Redundant transitions in 105 ms returned []
Running 3658 sub problems to find dead transitions.
[2024-05-31 20:40:43] [INFO ] Invariant cache hit.
[2024-05-31 20:40:43] [INFO ] State equation strengthened by 2668 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 1.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 1.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 1.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 1.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 1.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 1.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 1.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 1.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 1.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3658 unsolved
SMT process timed out in 31913ms, After SMT, problems are : Problem set: 0 solved, 3658 unsolved
Search for dead transitions found 0 dead transitions in 31942ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1083/2163 places, 3688/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39120 ms. Remains : 1083/2163 places, 3688/5580 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-05
Product exploration explored 100000 steps with 653 reset in 673 ms.
Product exploration explored 100000 steps with 656 reset in 715 ms.
Computed a total of 93 stabilizing places and 150 stable transitions
Computed a total of 93 stabilizing places and 150 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 13982 steps (88 resets) in 103 ms. (134 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 1 out of 1083 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1083/1083 places, 3688/3688 transitions.
Applied a total of 0 rules in 56 ms. Remains 1083 /1083 variables (removed 0) and now considering 3688/3688 (removed 0) transitions.
[2024-05-31 20:41:16] [INFO ] Invariant cache hit.
[2024-05-31 20:41:17] [INFO ] Implicit Places using invariants in 525 ms returned []
[2024-05-31 20:41:17] [INFO ] Invariant cache hit.
[2024-05-31 20:41:18] [INFO ] State equation strengthened by 2668 read => feed constraints.
[2024-05-31 20:41:23] [INFO ] Implicit Places using invariants and state equation in 6396 ms returned []
Implicit Place search using SMT with State Equation took 6922 ms to find 0 implicit places.
[2024-05-31 20:41:24] [INFO ] Redundant transitions in 99 ms returned []
Running 3658 sub problems to find dead transitions.
[2024-05-31 20:41:24] [INFO ] Invariant cache hit.
[2024-05-31 20:41:24] [INFO ] State equation strengthened by 2668 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3658 unsolved
SMT process timed out in 31895ms, After SMT, problems are : Problem set: 0 solved, 3658 unsolved
Search for dead transitions found 0 dead transitions in 31926ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39026 ms. Remains : 1083/1083 places, 3688/3688 transitions.
Computed a total of 93 stabilizing places and 150 stable transitions
Computed a total of 93 stabilizing places and 150 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
RANDOM walk for 8475 steps (54 resets) in 82 ms. (102 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 652 reset in 658 ms.
Stack based approach found an accepted trace after 32708 steps with 214 reset with depth 108 and stack size 108 in 219 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-05 finished in 81221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1&&G(p0)))))'
Support contains 2 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 59 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2024-05-31 20:41:57] [INFO ] Computed 32 invariants in 108 ms
[2024-05-31 20:41:58] [INFO ] Implicit Places using invariants in 969 ms returned []
[2024-05-31 20:41:58] [INFO ] Invariant cache hit.
[2024-05-31 20:41:59] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 20:42:13] [INFO ] Implicit Places using invariants and state equation in 15320 ms returned []
Implicit Place search using SMT with State Equation took 16291 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-31 20:42:13] [INFO ] Invariant cache hit.
[2024-05-31 20:42:13] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33047ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33092ms
Finished structural reductions in LTL mode , in 1 iterations and 49453 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-06 finished in 49579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(p1&&F(p0)))))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1953 transition count 5370
Performed 869 Post agglomeration using F-continuation condition.Transition count delta: 869
Deduced a syphon composed of 869 places in 1 ms
Reduce places removed 869 places and 0 transitions.
Iterating global reduction 2 with 1738 rules applied. Total rules applied 2158 place count 1084 transition count 4501
Drop transitions (Redundant composition of simpler transitions.) removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 2 with 811 rules applied. Total rules applied 2969 place count 1084 transition count 3690
Applied a total of 2969 rules in 293 ms. Remains 1084 /2163 variables (removed 1079) and now considering 3690/5580 (removed 1890) transitions.
// Phase 1: matrix 3690 rows 1084 cols
[2024-05-31 20:42:47] [INFO ] Computed 32 invariants in 45 ms
[2024-05-31 20:42:47] [INFO ] Implicit Places using invariants in 560 ms returned []
[2024-05-31 20:42:47] [INFO ] Invariant cache hit.
[2024-05-31 20:42:48] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2024-05-31 20:42:54] [INFO ] Implicit Places using invariants and state equation in 6358 ms returned []
Implicit Place search using SMT with State Equation took 6918 ms to find 0 implicit places.
[2024-05-31 20:42:54] [INFO ] Redundant transitions in 104 ms returned []
Running 3660 sub problems to find dead transitions.
[2024-05-31 20:42:54] [INFO ] Invariant cache hit.
[2024-05-31 20:42:54] [INFO ] State equation strengthened by 2667 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 timeout
1.0)
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1083 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3660 unsolved
SMT process timed out in 31758ms, After SMT, problems are : Problem set: 0 solved, 3660 unsolved
Search for dead transitions found 0 dead transitions in 31787ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1084/2163 places, 3690/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39119 ms. Remains : 1084/2163 places, 3690/5580 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-07
Stuttering criterion allowed to conclude after 151 steps with 0 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-07 finished in 39211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 59 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2024-05-31 20:43:26] [INFO ] Computed 32 invariants in 112 ms
[2024-05-31 20:43:27] [INFO ] Implicit Places using invariants in 967 ms returned []
[2024-05-31 20:43:27] [INFO ] Invariant cache hit.
[2024-05-31 20:43:28] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 20:43:42] [INFO ] Implicit Places using invariants and state equation in 15811 ms returned []
Implicit Place search using SMT with State Equation took 16780 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-31 20:43:42] [INFO ] Invariant cache hit.
[2024-05-31 20:43:42] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 32994ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33039ms
Finished structural reductions in LTL mode , in 1 iterations and 49888 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 394 steps with 0 reset in 6 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-08 finished in 50017 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)||G(p1))))))'
Support contains 2 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 54 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-31 20:44:16] [INFO ] Invariant cache hit.
[2024-05-31 20:44:16] [INFO ] Implicit Places using invariants in 854 ms returned []
[2024-05-31 20:44:16] [INFO ] Invariant cache hit.
[2024-05-31 20:44:18] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 20:44:32] [INFO ] Implicit Places using invariants and state equation in 15457 ms returned []
Implicit Place search using SMT with State Equation took 16312 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-31 20:44:32] [INFO ] Invariant cache hit.
[2024-05-31 20:44:32] [INFO ] State equation strengthened by 1770 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/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33008ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33053ms
Finished structural reductions in LTL mode , in 1 iterations and 49429 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-09
Product exploration explored 100000 steps with 140 reset in 528 ms.
Product exploration explored 100000 steps with 137 reset in 572 ms.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 33822 steps (46 resets) in 384 ms. (87 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 1 factoid took 175 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 61 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-31 20:45:08] [INFO ] Invariant cache hit.
[2024-05-31 20:45:08] [INFO ] Implicit Places using invariants in 871 ms returned []
[2024-05-31 20:45:08] [INFO ] Invariant cache hit.
[2024-05-31 20:45:10] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 20:45:24] [INFO ] Implicit Places using invariants and state equation in 16073 ms returned []
Implicit Place search using SMT with State Equation took 16944 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-31 20:45:25] [INFO ] Invariant cache hit.
[2024-05-31 20:45:25] [INFO ] State equation strengthened by 1770 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)timeout

(s127 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33017ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33061ms
Finished structural reductions in LTL mode , in 1 iterations and 50083 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (54 resets) in 901 ms. (44 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
[2024-05-31 20:45:58] [INFO ] Invariant cache hit.
[2024-05-31 20:45:58] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2099/2101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:45:59] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2024-05-31 20:45:59] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/2159 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2159 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2161 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:46:00] [INFO ] Deduced a trap composed of 61 places in 1374 ms of which 15 ms to minimize.
[2024-05-31 20:46:02] [INFO ] Deduced a trap composed of 53 places in 1259 ms of which 12 ms to minimize.
[2024-05-31 20:46:03] [INFO ] Deduced a trap composed of 65 places in 1173 ms of which 11 ms to minimize.
[2024-05-31 20:46:04] [INFO ] Deduced a trap composed of 71 places in 1124 ms of which 11 ms to minimize.
SMT process timed out in 5708ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 2163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1953 transition count 5370
Performed 869 Post agglomeration using F-continuation condition.Transition count delta: 869
Deduced a syphon composed of 869 places in 1 ms
Reduce places removed 869 places and 0 transitions.
Iterating global reduction 2 with 1738 rules applied. Total rules applied 2158 place count 1084 transition count 4501
Drop transitions (Redundant composition of simpler transitions.) removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 2 with 811 rules applied. Total rules applied 2969 place count 1084 transition count 3690
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2970 place count 1084 transition count 3689
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2971 place count 1083 transition count 3689
Partial Free-agglomeration rule applied 930 times.
Drop transitions (Partial Free agglomeration) removed 930 transitions
Iterating global reduction 3 with 930 rules applied. Total rules applied 3901 place count 1083 transition count 3689
Applied a total of 3901 rules in 489 ms. Remains 1083 /2163 variables (removed 1080) and now considering 3689/5580 (removed 1891) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 489 ms. Remains : 1083/2163 places, 3689/5580 transitions.
RANDOM walk for 40000 steps (284 resets) in 452 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 198984 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 198984 steps, saw 35475 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
// Phase 1: matrix 3689 rows 1083 cols
[2024-05-31 20:46:08] [INFO ] Computed 32 invariants in 41 ms
[2024-05-31 20:46:08] [INFO ] State equation strengthened by 3596 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:46:08] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 58/1079 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1081 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:46:09] [INFO ] Deduced a trap composed of 35 places in 617 ms of which 6 ms to minimize.
[2024-05-31 20:46:09] [INFO ] Deduced a trap composed of 40 places in 548 ms of which 6 ms to minimize.
[2024-05-31 20:46:10] [INFO ] Deduced a trap composed of 36 places in 561 ms of which 6 ms to minimize.
[2024-05-31 20:46:10] [INFO ] Deduced a trap composed of 41 places in 509 ms of which 6 ms to minimize.
[2024-05-31 20:46:11] [INFO ] Deduced a trap composed of 41 places in 562 ms of which 6 ms to minimize.
[2024-05-31 20:46:11] [INFO ] Deduced a trap composed of 36 places in 573 ms of which 6 ms to minimize.
[2024-05-31 20:46:12] [INFO ] Deduced a trap composed of 39 places in 529 ms of which 5 ms to minimize.
[2024-05-31 20:46:12] [INFO ] Deduced a trap composed of 40 places in 510 ms of which 5 ms to minimize.
[2024-05-31 20:46:13] [INFO ] Deduced a trap composed of 38 places in 484 ms of which 6 ms to minimize.
[2024-05-31 20:46:13] [INFO ] Deduced a trap composed of 36 places in 476 ms of which 5 ms to minimize.
[2024-05-31 20:46:14] [INFO ] Deduced a trap composed of 48 places in 459 ms of which 5 ms to minimize.
[2024-05-31 20:46:14] [INFO ] Deduced a trap composed of 38 places in 461 ms of which 6 ms to minimize.
[2024-05-31 20:46:15] [INFO ] Deduced a trap composed of 48 places in 450 ms of which 5 ms to minimize.
[2024-05-31 20:46:15] [INFO ] Deduced a trap composed of 35 places in 413 ms of which 4 ms to minimize.
[2024-05-31 20:46:16] [INFO ] Deduced a trap composed of 37 places in 433 ms of which 5 ms to minimize.
[2024-05-31 20:46:16] [INFO ] Deduced a trap composed of 37 places in 408 ms of which 5 ms to minimize.
[2024-05-31 20:46:17] [INFO ] Deduced a trap composed of 53 places in 378 ms of which 4 ms to minimize.
[2024-05-31 20:46:17] [INFO ] Deduced a trap composed of 39 places in 342 ms of which 4 ms to minimize.
[2024-05-31 20:46:17] [INFO ] Deduced a trap composed of 37 places in 325 ms of which 5 ms to minimize.
[2024-05-31 20:46:18] [INFO ] Deduced a trap composed of 42 places in 297 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:46:18] [INFO ] Deduced a trap composed of 34 places in 297 ms of which 4 ms to minimize.
[2024-05-31 20:46:18] [INFO ] Deduced a trap composed of 36 places in 308 ms of which 5 ms to minimize.
[2024-05-31 20:46:19] [INFO ] Deduced a trap composed of 36 places in 302 ms of which 4 ms to minimize.
[2024-05-31 20:46:19] [INFO ] Deduced a trap composed of 39 places in 301 ms of which 4 ms to minimize.
[2024-05-31 20:46:19] [INFO ] Deduced a trap composed of 38 places in 303 ms of which 4 ms to minimize.
[2024-05-31 20:46:20] [INFO ] Deduced a trap composed of 42 places in 288 ms of which 4 ms to minimize.
[2024-05-31 20:46:20] [INFO ] Deduced a trap composed of 40 places in 286 ms of which 4 ms to minimize.
[2024-05-31 20:46:20] [INFO ] Deduced a trap composed of 36 places in 282 ms of which 4 ms to minimize.
[2024-05-31 20:46:20] [INFO ] Deduced a trap composed of 52 places in 282 ms of which 4 ms to minimize.
[2024-05-31 20:46:21] [INFO ] Deduced a trap composed of 43 places in 276 ms of which 4 ms to minimize.
[2024-05-31 20:46:21] [INFO ] Deduced a trap composed of 43 places in 294 ms of which 4 ms to minimize.
[2024-05-31 20:46:21] [INFO ] Deduced a trap composed of 36 places in 278 ms of which 4 ms to minimize.
[2024-05-31 20:46:22] [INFO ] Deduced a trap composed of 35 places in 267 ms of which 4 ms to minimize.
[2024-05-31 20:46:22] [INFO ] Deduced a trap composed of 38 places in 241 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 14/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3689/4770 variables, 1081/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4770 variables, 3596/4744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4770 variables, 0/4744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/4772 variables, 2/4746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4772 variables, 0/4746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4772 variables, 0/4746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4772/4772 variables, and 4746 constraints, problems are : Problem set: 0 solved, 1 unsolved in 15461 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3596/3596 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1021 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:46:23] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1021 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/1079 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/1081 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 34/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:46:24] [INFO ] Deduced a trap composed of 45 places in 615 ms of which 6 ms to minimize.
[2024-05-31 20:46:25] [INFO ] Deduced a trap composed of 39 places in 610 ms of which 6 ms to minimize.
[2024-05-31 20:46:25] [INFO ] Deduced a trap composed of 38 places in 615 ms of which 6 ms to minimize.
[2024-05-31 20:46:26] [INFO ] Deduced a trap composed of 46 places in 625 ms of which 7 ms to minimize.
[2024-05-31 20:46:27] [INFO ] Deduced a trap composed of 46 places in 619 ms of which 6 ms to minimize.
[2024-05-31 20:46:27] [INFO ] Deduced a trap composed of 47 places in 618 ms of which 7 ms to minimize.
[2024-05-31 20:46:28] [INFO ] Deduced a trap composed of 43 places in 628 ms of which 8 ms to minimize.
[2024-05-31 20:46:28] [INFO ] Deduced a trap composed of 46 places in 616 ms of which 6 ms to minimize.
[2024-05-31 20:46:29] [INFO ] Deduced a trap composed of 41 places in 624 ms of which 7 ms to minimize.
[2024-05-31 20:46:30] [INFO ] Deduced a trap composed of 40 places in 600 ms of which 6 ms to minimize.
[2024-05-31 20:46:30] [INFO ] Deduced a trap composed of 50 places in 611 ms of which 6 ms to minimize.
[2024-05-31 20:46:31] [INFO ] Deduced a trap composed of 44 places in 601 ms of which 6 ms to minimize.
[2024-05-31 20:46:32] [INFO ] Deduced a trap composed of 38 places in 600 ms of which 7 ms to minimize.
[2024-05-31 20:46:32] [INFO ] Deduced a trap composed of 35 places in 556 ms of which 6 ms to minimize.
[2024-05-31 20:46:33] [INFO ] Deduced a trap composed of 36 places in 516 ms of which 5 ms to minimize.
[2024-05-31 20:46:33] [INFO ] Deduced a trap composed of 44 places in 512 ms of which 5 ms to minimize.
[2024-05-31 20:46:34] [INFO ] Deduced a trap composed of 40 places in 507 ms of which 5 ms to minimize.
[2024-05-31 20:46:34] [INFO ] Deduced a trap composed of 39 places in 477 ms of which 5 ms to minimize.
[2024-05-31 20:46:35] [INFO ] Deduced a trap composed of 45 places in 452 ms of which 5 ms to minimize.
[2024-05-31 20:46:35] [INFO ] Deduced a trap composed of 47 places in 454 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:46:36] [INFO ] Deduced a trap composed of 46 places in 462 ms of which 5 ms to minimize.
[2024-05-31 20:46:36] [INFO ] Deduced a trap composed of 44 places in 433 ms of which 4 ms to minimize.
[2024-05-31 20:46:37] [INFO ] Deduced a trap composed of 44 places in 426 ms of which 5 ms to minimize.
[2024-05-31 20:46:37] [INFO ] Deduced a trap composed of 44 places in 418 ms of which 5 ms to minimize.
[2024-05-31 20:46:37] [INFO ] Deduced a trap composed of 43 places in 421 ms of which 5 ms to minimize.
[2024-05-31 20:46:38] [INFO ] Deduced a trap composed of 38 places in 398 ms of which 5 ms to minimize.
[2024-05-31 20:46:38] [INFO ] Deduced a trap composed of 38 places in 421 ms of which 5 ms to minimize.
[2024-05-31 20:46:39] [INFO ] Deduced a trap composed of 41 places in 422 ms of which 5 ms to minimize.
[2024-05-31 20:46:39] [INFO ] Deduced a trap composed of 41 places in 433 ms of which 5 ms to minimize.
[2024-05-31 20:46:40] [INFO ] Deduced a trap composed of 40 places in 418 ms of which 5 ms to minimize.
[2024-05-31 20:46:40] [INFO ] Deduced a trap composed of 42 places in 430 ms of which 5 ms to minimize.
[2024-05-31 20:46:41] [INFO ] Deduced a trap composed of 41 places in 427 ms of which 5 ms to minimize.
[2024-05-31 20:46:41] [INFO ] Deduced a trap composed of 49 places in 427 ms of which 5 ms to minimize.
[2024-05-31 20:46:41] [INFO ] Deduced a trap composed of 47 places in 370 ms of which 5 ms to minimize.
[2024-05-31 20:46:42] [INFO ] Deduced a trap composed of 44 places in 405 ms of which 5 ms to minimize.
[2024-05-31 20:46:42] [INFO ] Deduced a trap composed of 52 places in 418 ms of which 5 ms to minimize.
[2024-05-31 20:46:43] [INFO ] Deduced a trap composed of 49 places in 425 ms of which 5 ms to minimize.
[2024-05-31 20:46:43] [INFO ] Deduced a trap composed of 49 places in 391 ms of which 5 ms to minimize.
[2024-05-31 20:46:44] [INFO ] Deduced a trap composed of 45 places in 416 ms of which 5 ms to minimize.
[2024-05-31 20:46:44] [INFO ] Deduced a trap composed of 35 places in 383 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:46:44] [INFO ] Deduced a trap composed of 36 places in 327 ms of which 5 ms to minimize.
[2024-05-31 20:46:45] [INFO ] Deduced a trap composed of 35 places in 354 ms of which 5 ms to minimize.
[2024-05-31 20:46:45] [INFO ] Deduced a trap composed of 35 places in 323 ms of which 4 ms to minimize.
[2024-05-31 20:46:45] [INFO ] Deduced a trap composed of 46 places in 305 ms of which 4 ms to minimize.
[2024-05-31 20:46:46] [INFO ] Deduced a trap composed of 47 places in 293 ms of which 5 ms to minimize.
[2024-05-31 20:46:46] [INFO ] Deduced a trap composed of 35 places in 281 ms of which 4 ms to minimize.
[2024-05-31 20:46:46] [INFO ] Deduced a trap composed of 35 places in 258 ms of which 4 ms to minimize.
[2024-05-31 20:46:46] [INFO ] Deduced a trap composed of 47 places in 238 ms of which 4 ms to minimize.
[2024-05-31 20:46:47] [INFO ] Deduced a trap composed of 35 places in 241 ms of which 4 ms to minimize.
[2024-05-31 20:46:47] [INFO ] Deduced a trap composed of 39 places in 221 ms of which 3 ms to minimize.
[2024-05-31 20:46:47] [INFO ] Deduced a trap composed of 39 places in 220 ms of which 3 ms to minimize.
[2024-05-31 20:46:47] [INFO ] Deduced a trap composed of 39 places in 219 ms of which 3 ms to minimize.
[2024-05-31 20:46:48] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 3 ms to minimize.
[2024-05-31 20:46:48] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 3 ms to minimize.
[2024-05-31 20:46:48] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 2 ms to minimize.
[2024-05-31 20:46:48] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 3 ms to minimize.
[2024-05-31 20:46:49] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 3 ms to minimize.
[2024-05-31 20:46:49] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 2 ms to minimize.
[2024-05-31 20:46:49] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 2 ms to minimize.
[2024-05-31 20:46:49] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1081 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:46:49] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 3 ms to minimize.
[2024-05-31 20:46:49] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 2 ms to minimize.
[2024-05-31 20:46:50] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 2 ms to minimize.
[2024-05-31 20:46:50] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 3 ms to minimize.
[2024-05-31 20:46:50] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 2 ms to minimize.
[2024-05-31 20:46:50] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 2 ms to minimize.
[2024-05-31 20:46:50] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 3 ms to minimize.
[2024-05-31 20:46:50] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2024-05-31 20:46:50] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 2 ms to minimize.
[2024-05-31 20:46:51] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 2 ms to minimize.
[2024-05-31 20:46:51] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-05-31 20:46:51] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 1 ms to minimize.
[2024-05-31 20:46:51] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-05-31 20:46:51] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2024-05-31 20:46:51] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:46:51] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
[2024-05-31 20:46:51] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 1 ms to minimize.
[2024-05-31 20:46:51] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 2 ms to minimize.
[2024-05-31 20:46:51] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 1 ms to minimize.
[2024-05-31 20:46:52] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1081 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1081 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3689/4770 variables, 1081/1229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4770 variables, 3596/4825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4770 variables, 1/4826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4770 variables, 0/4826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/4772 variables, 2/4828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4772 variables, 0/4828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/4772 variables, 0/4828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4772/4772 variables, and 4828 constraints, problems are : Problem set: 0 solved, 1 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1083/1083 constraints, ReadFeed: 3596/3596 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 116/116 constraints]
After SMT, in 45593ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3689/3689 transitions.
Applied a total of 0 rules in 67 ms. Remains 1083 /1083 variables (removed 0) and now considering 3689/3689 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1083/1083 places, 3689/3689 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 3689/3689 transitions.
Applied a total of 0 rules in 59 ms. Remains 1083 /1083 variables (removed 0) and now considering 3689/3689 (removed 0) transitions.
[2024-05-31 20:46:53] [INFO ] Invariant cache hit.
[2024-05-31 20:46:54] [INFO ] Implicit Places using invariants in 877 ms returned []
[2024-05-31 20:46:54] [INFO ] Invariant cache hit.
[2024-05-31 20:46:55] [INFO ] State equation strengthened by 3596 read => feed constraints.
[2024-05-31 20:47:13] [INFO ] Implicit Places using invariants and state equation in 18684 ms returned []
Implicit Place search using SMT with State Equation took 19563 ms to find 0 implicit places.
[2024-05-31 20:47:13] [INFO ] Redundant transitions in 102 ms returned []
Running 3659 sub problems to find dead transitions.
[2024-05-31 20:47:13] [INFO ] Invariant cache hit.
[2024-05-31 20:47:13] [INFO ] State equation strengthened by 3596 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/1082 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3659 unsolved
SMT process timed out in 32168ms, After SMT, problems are : Problem set: 0 solved, 3659 unsolved
Search for dead transitions found 0 dead transitions in 32198ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51936 ms. Remains : 1083/1083 places, 3689/3689 transitions.
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 1 factoid took 208 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 242 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 225 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Entered a terminal (fully accepting) state of product in 44940 steps with 62 reset in 224 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-09 finished in 210823 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))&&(G((p1 U p2))||X(X(X(G(p0)))))))'
Support contains 5 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 60 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2024-05-31 20:47:47] [INFO ] Computed 32 invariants in 115 ms
[2024-05-31 20:47:47] [INFO ] Implicit Places using invariants in 975 ms returned []
[2024-05-31 20:47:47] [INFO ] Invariant cache hit.
[2024-05-31 20:47:49] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 20:48:02] [INFO ] Implicit Places using invariants and state equation in 14953 ms returned []
Implicit Place search using SMT with State Equation took 15930 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-31 20:48:02] [INFO ] Invariant cache hit.
[2024-05-31 20:48:02] [INFO ] State equation strengthened by 1770 read => feed constraints.
(s1738 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 1.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 1.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 1.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 1.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 1.0)
(s595 0.0)
(s596 0.0)
(s597 1.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 1.0)
(s602 0.0)
(s603 0.0)
(s604 1.0)
(s605 1.0)
(s606 0.0)
(s607 0.0)
(s608 1.0)
(s609 0.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 0.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 1.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 1.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 1.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 1.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 1.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 1.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 1.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 0.0)
(s1361 0.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 0.0)
(s1416 0.0)
(s1417 0.0)
(s1418 0.0)
(s1419 0.0)
(s1420 0.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 0.0)
(s1426 0.0)
(s1427 0.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 0.0)
(s1432 0.0)
(s1433 0.0)
(s1434 0.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 0.0)
(s1441 0.0)
(s1442 0.0)
(s1443 0.0)
(s1444 0.0)
(s1445 0.0)
(s1446 0.0)
(s1447 0.0)
(s1448 0.0)
(s1449 0.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 0.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 0.0)
(s1461 0.0)
(s1462 0.0)
(s1463 0.0)
(s1464 0.0)
(s1465 0.0)
(s1466 0.0)
(s1467 0.0)
(s1468 0.0)
(s1469 0.0)
(s1470 0.0)
(s1471 0.0)
(s1472 0.0)
(s1473 0.0)
(s1474 0.0)
(s1475 0.0)
(s1476 0.0)
(s1477 0.0)
(s1478 0.0)
(s1479 0.0)
(s1480 0.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0)
(s1484 0.0)
(s1485 0.0)
(s1486 0.0)
(s1487 0.0)
(s1488 0.0)
(s1489 0.0)
(s1490 0.0)
(s1491 0.0)
(s1492 0.0)
(s1493 0.0)
(s1494 0.0)
(s1495 0.0)
(s1496 0.0)
(s1497 0.0)
(s1498 0.0)
(s1499 0.0)
(s1500 0.0)
(s1501 0.0)
(s1502 0.0)
(s1503 0.0)
(s1504 0.0)
(s1505 0.0)
(s1506 0.0)
(s1507 0.0)
(s1508 0.0)
(s1509 0.0)
(s1510 0.0)
(s1511 0.0)
(s1512 0.0)
(s1513 0.0)
(s1514 0.0)
(s1515 0.0)
(s1516 0.0)
(s1517 0.0)
(s1518 0.0)
(s1519 0.0)
(s1520 0.0)
(s1521 0.0)
(s1522 0.0)
(s1523 0.0)
(s1524 0.0)
(s1525 0.0)
(s1526 0.0)
(s1527 0.0)
(s1528 0.0)
(s1529 0.0)
(s1530 0.0)
(s1531 0.0)
(s1532 0.0)
(s1533 0.0)
(s1534 0.0)
(s1535 0.0)
(s1536 0.0)
(s1537 0.0)
(s1538 0.0)
(s1539 0.0)
(s1540 0.0)
(s1541 0.0)
(s1542 0.0)
(s1543 0.0)
(s1544 0.0)
(s1545 0.0)
(s1546 0.0)
(s1547 0.0)
(s1548 0.0)
(s1549 0.0)
(s1550 0.0)
(s1551 0.0)
(s1552 0.0)
(s1553 0.0)
(s1554 0.0)
(s1555 0.0)
(s1556 0.0)
(s1557 0.0)
(s1558 0.0)
(s1559 0.0)
(s1560 0.0)
(s1561 0.0)
(s1562 0.0)
(s1563 0.0)
(s1564 0.0)
(s1565 0.0)
(s1566 0.0)
(s1567 0.0)
(s1568 0.0)
(s1569 0.0)
(s1570 0.0)
(s1571 0.0)
(s1572 0.0)
(s1573 0.0)
(s1574 0.0)
(s1575 0.0)
(s1576 0.0)
(s1577 0.0)
(s1578 0.0)
(s1579 0.0)
(s1580 0.0)
(s1581 0.0)
(s1582 0.0)
(s1583 0.0)
(s1584 0.0)
(s1585 0.0)
(s1586 0.0)
(s1587 0.0)
(s1588 0.0)
(s1589 0.0)
(s1590 0.0)
(s1591 0.0)
(s1592 0.0)
(s1593 0.0)
(s1594 0.0)
(s1595 0.0)
(s1596 0.0)
(s1597 0.0)
(s1598 0.0)
(s1599 0.0)
(s1600 0.0)
(s1601 0.0)
(s1602 0.0)
(s1603 0.0)
(s1604 0.0)
(s1605 0.0)
(s1606 0.0)
(s1607 0.0)
(s1608 0.0)
(s1609 0.0)
(s1610 0.0)
(s1611 0.0)
(s1612 0.0)
(s1613 0.0)
(s1614 0.0)
(s1615 0.0)
(s1616 0.0)
(s1617 0.0)
(s1618 0.0)
(s1619 0.0)
(s1620 0.0)
(s1621 0.0)
(s1622 0.0)
(s1623 0.0)
(s1624 0.0)
(s1625 0.0)
(s1626 0.0)
(s1627 0.0)
(s1628 0.0)
(s1629 0.0)
(s1630 0.0)
(s1631 0.0)
(s1632 0.0)
(s1633 0.0)
(s1634 0.0)
(s1635 0.0)
(s1636 0.0)
(s1637 0.0)
(s1638 0.0)
(s1639 0.0)
(s1640 0.0)
(s1641 0.0)
(s1642 0.0)
(s1643 0.0)
(s1644 0.0)
(s1645 0.0)
(s1646 0.0)
(s1647 0.0)
(s1648 0.0)
(s1649 0.0)
(s1650 0.0)
(s1651 0.0)
(s1652 0.0)
(s1653 0.0)
(s1654 0.0)
(s1655 0.0)
(s1656 0.0)
(s1657 0.0)
(s1658 0.0)
(s1659 0.0)
(s1660 0.0)
(s1661 0.0)
(s1662 0.0)
(s1663 0.0)
(s1664 0.0)
(s1665 0.0)
(s1666 0.0)
(s1667 0.0)
(s1668 0.0)
(s1669 0.0)
(s1670 0.0)
(s1671 0.0)
(s1672 0.0)
(s1673 0.0)
(s1674 0.0)
(s1675 0.0)
(s1676 0.0)
(s1677 0.0)
(s1678 0.0)
(s1679 0.0)
(s1680 0.0)
(s1681 0.0)
(s1682 0.0)
(s1683 0.0)
(s1684 0.0)
(s1685 0.0)
(s1686 0.0)
(s1687 0.0)
(s1688 0.0)
(s1689 0.0)
(s1690 0.0)
(s1691 0.0)
(s1692 0.0)
(s1693 0.0)
(s1694 0.0)
(s1695 0.0)
(s1696 0.0)
(s1697 0.0)
(s1698 0.0)
(s1699 0.0)
(s1700 0.0)
(s1701 0.0)
(s1702 0.0)
(s1703 0.0)
(s1704 0.0)
(s1705 0.0)
(s1706 0.0)
(s1707 0.0)
(s1708 0.0)
(s1709 0.0)
(s1710 0.0)
(s1711 0.0)
(s1712 0.0)
(s1713 0.0)
(s1714 0.0)
(s1715 0.0)
(s1716 0.0)
(s1717 0.0)
(s1718 0.0)
(s1719 0.0)
(s1720 0.0)
(s1721 0.0)
(s1722 0.0)
(s1723 0.0)
(s1724 0.0)
(s1725 0.0)
(s1726 0.0)
(s1727 0.0)
(s1728 0.0)
(s1729 0.0)
(s1730 0.0)
(s1731 0.0)
(s1732 0.0)
(s1733 0.0)
(s1734 0.0)
(s1735 0.0)
(s1736 0.0)
(s1737 0.0)
(s1738 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33041ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33084ms
Finished structural reductions in LTL mode , in 1 iterations and 49087 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 524 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-10
Stuttering criterion allowed to conclude after 31189 steps with 42 reset in 174 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-10 finished in 49822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1))))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1953 transition count 5370
Performed 869 Post agglomeration using F-continuation condition.Transition count delta: 869
Deduced a syphon composed of 869 places in 1 ms
Reduce places removed 869 places and 0 transitions.
Iterating global reduction 2 with 1738 rules applied. Total rules applied 2158 place count 1084 transition count 4501
Drop transitions (Redundant composition of simpler transitions.) removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 2 with 811 rules applied. Total rules applied 2969 place count 1084 transition count 3690
Applied a total of 2969 rules in 303 ms. Remains 1084 /2163 variables (removed 1079) and now considering 3690/5580 (removed 1890) transitions.
// Phase 1: matrix 3690 rows 1084 cols
[2024-05-31 20:48:37] [INFO ] Computed 32 invariants in 45 ms
[2024-05-31 20:48:37] [INFO ] Implicit Places using invariants in 575 ms returned []
[2024-05-31 20:48:37] [INFO ] Invariant cache hit.
[2024-05-31 20:48:38] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2024-05-31 20:48:43] [INFO ] Implicit Places using invariants and state equation in 6021 ms returned []
Implicit Place search using SMT with State Equation took 6597 ms to find 0 implicit places.
[2024-05-31 20:48:43] [INFO ] Redundant transitions in 105 ms returned []
Running 3660 sub problems to find dead transitions.
[2024-05-31 20:48:43] [INFO ] Invariant cache hit.
[2024-05-31 20:48:43] [INFO ] State equation strengthened by 2667 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/1083 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3660 unsolved
SMT process timed out in 31781ms, After SMT, problems are : Problem set: 0 solved, 3660 unsolved
Search for dead transitions found 0 dead transitions in 31808ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1084/2163 places, 3690/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38827 ms. Remains : 1084/2163 places, 3690/5580 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 79 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-11 finished in 38936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 60 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2024-05-31 20:49:15] [INFO ] Computed 32 invariants in 110 ms
[2024-05-31 20:49:16] [INFO ] Implicit Places using invariants in 1011 ms returned []
[2024-05-31 20:49:16] [INFO ] Invariant cache hit.
[2024-05-31 20:49:18] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 20:49:32] [INFO ] Implicit Places using invariants and state equation in 16073 ms returned []
Implicit Place search using SMT with State Equation took 17086 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-31 20:49:32] [INFO ] Invariant cache hit.
[2024-05-31 20:49:32] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33033ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33075ms
Finished structural reductions in LTL mode , in 1 iterations and 50227 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-12 finished in 50333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(!p0)))'
Support contains 1 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1953 transition count 5370
Performed 869 Post agglomeration using F-continuation condition.Transition count delta: 869
Deduced a syphon composed of 869 places in 1 ms
Reduce places removed 869 places and 0 transitions.
Iterating global reduction 2 with 1738 rules applied. Total rules applied 2158 place count 1084 transition count 4501
Drop transitions (Redundant composition of simpler transitions.) removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 2 with 811 rules applied. Total rules applied 2969 place count 1084 transition count 3690
Applied a total of 2969 rules in 306 ms. Remains 1084 /2163 variables (removed 1079) and now considering 3690/5580 (removed 1890) transitions.
// Phase 1: matrix 3690 rows 1084 cols
[2024-05-31 20:50:06] [INFO ] Computed 32 invariants in 45 ms
[2024-05-31 20:50:06] [INFO ] Implicit Places using invariants in 580 ms returned []
[2024-05-31 20:50:06] [INFO ] Invariant cache hit.
[2024-05-31 20:50:07] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2024-05-31 20:50:12] [INFO ] Implicit Places using invariants and state equation in 6132 ms returned []
Implicit Place search using SMT with State Equation took 6715 ms to find 0 implicit places.
[2024-05-31 20:50:13] [INFO ] Redundant transitions in 103 ms returned []
Running 3660 sub problems to find dead transitions.
[2024-05-31 20:50:13] [INFO ] Invariant cache hit.
[2024-05-31 20:50:13] [INFO ] State equation strengthened by 2667 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1083 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3660 unsolved
SMT process timed out in 31732ms, After SMT, problems are : Problem set: 0 solved, 3660 unsolved
Search for dead transitions found 0 dead transitions in 31760ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1084/2163 places, 3690/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38894 ms. Remains : 1084/2163 places, 3690/5580 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, p0, (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-13
Stuttering criterion allowed to conclude after 167 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-13 finished in 39020 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((X(p0) U p1))))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 59 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2024-05-31 20:50:45] [INFO ] Computed 32 invariants in 114 ms
[2024-05-31 20:50:46] [INFO ] Implicit Places using invariants in 1001 ms returned []
[2024-05-31 20:50:46] [INFO ] Invariant cache hit.
[2024-05-31 20:50:47] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 20:51:01] [INFO ] Implicit Places using invariants and state equation in 15414 ms returned []
Implicit Place search using SMT with State Equation took 16415 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-31 20:51:01] [INFO ] Invariant cache hit.
[2024-05-31 20:51:01] [INFO ] State equation strengthened by 1770 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 1.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 1.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 1.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 1.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 1.0)
(s595 0.0)
(s596 0.0)
(s597 1.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 1.0)
(s602 0.0)
(s603 0.0)
(s604 1.0)
(s605 1.0)
(s606 0.0)
(s607 0.0)
(s608 1.0)
(s609 0.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 0.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 1.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33036ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33077ms
Finished structural reductions in LTL mode , in 1 iterations and 49561 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-14
Product exploration explored 100000 steps with 141 reset in 472 ms.
Product exploration explored 100000 steps with 140 reset in 494 ms.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 31580 steps (44 resets) in 183 ms. (171 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 140 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 58 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-31 20:51:36] [INFO ] Invariant cache hit.
[2024-05-31 20:51:37] [INFO ] Implicit Places using invariants in 871 ms returned []
[2024-05-31 20:51:37] [INFO ] Invariant cache hit.
[2024-05-31 20:51:38] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 20:51:52] [INFO ] Implicit Places using invariants and state equation in 15453 ms returned []
Implicit Place search using SMT with State Equation took 16327 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-31 20:51:52] [INFO ] Invariant cache hit.
[2024-05-31 20:51:52] [INFO ] State equation strengthened by 1770 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/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33048ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33089ms
Finished structural reductions in LTL mode , in 1 iterations and 49489 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 39442 steps (52 resets) in 240 ms. (163 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 133 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 136 reset in 468 ms.
Product exploration explored 100000 steps with 142 reset in 487 ms.
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 61 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
[2024-05-31 20:52:27] [INFO ] Invariant cache hit.
[2024-05-31 20:52:28] [INFO ] Implicit Places using invariants in 862 ms returned []
[2024-05-31 20:52:28] [INFO ] Invariant cache hit.
[2024-05-31 20:52:29] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2024-05-31 20:52:43] [INFO ] Implicit Places using invariants and state equation in 14874 ms returned []
Implicit Place search using SMT with State Equation took 15736 ms to find 0 implicit places.
Running 5550 sub problems to find dead transitions.
[2024-05-31 20:52:43] [INFO ] Invariant cache hit.
[2024-05-31 20:52:43] [INFO ] State equation strengthened by 1770 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2162 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5550 unsolved
SMT process timed out in 33037ms, After SMT, problems are : Problem set: 0 solved, 5550 unsolved
Search for dead transitions found 0 dead transitions in 33078ms
Finished structural reductions in LTL mode , in 1 iterations and 48884 ms. Remains : 2163/2163 places, 5580/5580 transitions.
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-14 finished in 151524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 208 rules applied. Total rules applied 208 place count 2163 transition count 5372
Reduce places removed 208 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 209 rules applied. Total rules applied 417 place count 1955 transition count 5371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 418 place count 1954 transition count 5371
Performed 869 Post agglomeration using F-continuation condition.Transition count delta: 869
Deduced a syphon composed of 869 places in 1 ms
Reduce places removed 869 places and 0 transitions.
Iterating global reduction 3 with 1738 rules applied. Total rules applied 2156 place count 1085 transition count 4502
Drop transitions (Redundant composition of simpler transitions.) removed 812 transitions
Redundant transition composition rules discarded 812 transitions
Iterating global reduction 3 with 812 rules applied. Total rules applied 2968 place count 1085 transition count 3690
Applied a total of 2968 rules in 321 ms. Remains 1085 /2163 variables (removed 1078) and now considering 3690/5580 (removed 1890) transitions.
// Phase 1: matrix 3690 rows 1085 cols
[2024-05-31 20:53:16] [INFO ] Computed 32 invariants in 47 ms
[2024-05-31 20:53:17] [INFO ] Implicit Places using invariants in 590 ms returned []
[2024-05-31 20:53:17] [INFO ] Invariant cache hit.
[2024-05-31 20:53:18] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2024-05-31 20:53:23] [INFO ] Implicit Places using invariants and state equation in 6245 ms returned []
Implicit Place search using SMT with State Equation took 6836 ms to find 0 implicit places.
[2024-05-31 20:53:23] [INFO ] Redundant transitions in 101 ms returned []
Running 3660 sub problems to find dead transitions.
[2024-05-31 20:53:23] [INFO ] Invariant cache hit.
[2024-05-31 20:53:23] [INFO ] State equation strengthened by 2667 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/1084 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3660 unsolved
SMT process timed out in 31758ms, After SMT, problems are : Problem set: 0 solved, 3660 unsolved
Search for dead transitions found 0 dead transitions in 31793ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1085/2163 places, 3690/5580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39061 ms. Remains : 1085/2163 places, 3690/5580 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-15
Stuttering criterion allowed to conclude after 173 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-030-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-15 finished in 39131 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)))'
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((X(p0) U p1))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-030-LTLCardinality-14
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1953 transition count 5370
Performed 840 Post agglomeration using F-continuation condition.Transition count delta: 840
Deduced a syphon composed of 840 places in 1 ms
Reduce places removed 840 places and 0 transitions.
Iterating global reduction 2 with 1680 rules applied. Total rules applied 2100 place count 1113 transition count 4530
Drop transitions (Redundant composition of simpler transitions.) removed 783 transitions
Redundant transition composition rules discarded 783 transitions
Iterating global reduction 2 with 783 rules applied. Total rules applied 2883 place count 1113 transition count 3747
Partial Post-agglomeration rule applied 58 times.
Drop transitions (Partial Post agglomeration) removed 58 transitions
Iterating global reduction 2 with 58 rules applied. Total rules applied 2941 place count 1113 transition count 3747
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 2969 place count 1085 transition count 3719
Iterating global reduction 2 with 28 rules applied. Total rules applied 2997 place count 1085 transition count 3719
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 3025 place count 1085 transition count 3691
Applied a total of 3025 rules in 472 ms. Remains 1085 /2163 variables (removed 1078) and now considering 3691/5580 (removed 1889) transitions.
// Phase 1: matrix 3691 rows 1085 cols
[2024-05-31 20:53:56] [INFO ] Computed 32 invariants in 47 ms
[2024-05-31 20:53:56] [INFO ] Implicit Places using invariants in 573 ms returned []
[2024-05-31 20:53:56] [INFO ] Invariant cache hit.
[2024-05-31 20:53:57] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2024-05-31 20:54:02] [INFO ] Implicit Places using invariants and state equation in 5960 ms returned []
Implicit Place search using SMT with State Equation took 6535 ms to find 0 implicit places.
Running 3661 sub problems to find dead transitions.
[2024-05-31 20:54:02] [INFO ] Invariant cache hit.
[2024-05-31 20:54:02] [INFO ] State equation strengthened by 2667 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1084 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3661 unsolved
SMT process timed out in 31744ms, After SMT, problems are : Problem set: 0 solved, 3661 unsolved
Search for dead transitions found 0 dead transitions in 31776ms
Starting structural reductions in LI_LTL mode, iteration 1 : 1085/2163 places, 3691/5580 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 38794 ms. Remains : 1085/2163 places, 3691/5580 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLCardinality-14
Product exploration explored 100000 steps with 648 reset in 633 ms.
Product exploration explored 100000 steps with 647 reset in 667 ms.
Computed a total of 93 stabilizing places and 150 stable transitions
Computed a total of 93 stabilizing places and 150 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 93 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 30579 steps (195 resets) in 224 ms. (135 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 191 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Support contains 3 out of 1085 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 37 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2024-05-31 20:54:36] [INFO ] Invariant cache hit.
[2024-05-31 20:54:37] [INFO ] Implicit Places using invariants in 527 ms returned []
[2024-05-31 20:54:37] [INFO ] Invariant cache hit.
[2024-05-31 20:54:37] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2024-05-31 20:54:43] [INFO ] Implicit Places using invariants and state equation in 6166 ms returned []
Implicit Place search using SMT with State Equation took 6695 ms to find 0 implicit places.
Running 3661 sub problems to find dead transitions.
[2024-05-31 20:54:43] [INFO ] Invariant cache hit.
[2024-05-31 20:54:43] [INFO ] State equation strengthened by 2667 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s3 1.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1084 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3661 unsolved
SMT process timed out in 31738ms, After SMT, problems are : Problem set: 0 solved, 3661 unsolved
Search for dead transitions found 0 dead transitions in 31767ms
Finished structural reductions in LTL mode , in 1 iterations and 38507 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Computed a total of 93 stabilizing places and 150 stable transitions
Computed a total of 93 stabilizing places and 150 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 70 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 26035 steps (165 resets) in 193 ms. (134 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 108 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 647 reset in 644 ms.
Product exploration explored 100000 steps with 652 reset in 663 ms.
Support contains 3 out of 1085 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 38 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
[2024-05-31 20:55:17] [INFO ] Invariant cache hit.
[2024-05-31 20:55:17] [INFO ] Implicit Places using invariants in 534 ms returned []
[2024-05-31 20:55:17] [INFO ] Invariant cache hit.
[2024-05-31 20:55:18] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2024-05-31 20:55:24] [INFO ] Implicit Places using invariants and state equation in 6704 ms returned []
Implicit Place search using SMT with State Equation took 7243 ms to find 0 implicit places.
Running 3661 sub problems to find dead transitions.
[2024-05-31 20:55:24] [INFO ] Invariant cache hit.
[2024-05-31 20:55:24] [INFO ] State equation strengthened by 2667 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1084 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3661 unsolved
SMT process timed out in 31718ms, After SMT, problems are : Problem set: 0 solved, 3661 unsolved
Search for dead transitions found 0 dead transitions in 31748ms
Finished structural reductions in LTL mode , in 1 iterations and 39038 ms. Remains : 1085/1085 places, 3691/3691 transitions.
Treatment of property CANInsertWithFailure-PT-030-LTLCardinality-14 finished in 120556 ms.
[2024-05-31 20:55:56] [INFO ] Flatten gal took : 127 ms
[2024-05-31 20:55:56] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-31 20:55:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2163 places, 5580 transitions and 14940 arcs took 25 ms.
Total runtime 1408104 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="CANInsertWithFailure-PT-030"
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 CANInsertWithFailure-PT-030, 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 r476-tall-171620505200115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-030.tgz
mv CANInsertWithFailure-PT-030 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;