Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.8M
-rw-r--r-- 1 mcc users 264K Apr 12 03:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Apr 12 03:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 183K Apr 12 03:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 831K Apr 12 03:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 72K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 218K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 156K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 517K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 378K Apr 12 04:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Apr 12 04:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 617K Apr 12 04:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.8M Apr 12 04:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 58K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717278938230

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-7
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:55:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 21:55:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:55:40] [INFO ] Load time of PNML (sax parser for PT used): 483 ms
[2024-06-01 21:55:40] [INFO ] Transformed 1992 places.
[2024-06-01 21:55:40] [INFO ] Transformed 3096 transitions.
[2024-06-01 21:55:40] [INFO ] Found NUPN structural information;
[2024-06-01 21:55:41] [INFO ] Parsed PT model containing 1992 places and 3096 transitions and 9584 arcs in 737 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 54 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Peterson-PT-7-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 637 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 231 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 21:55:41] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2024-06-01 21:55:42] [INFO ] Computed 31 invariants in 67 ms
[2024-06-01 21:55:43] [INFO ] Implicit Places using invariants in 2034 ms returned []
[2024-06-01 21:55:43] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 21:55:43] [INFO ] Invariant cache hit.
[2024-06-01 21:55:46] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 21:56:01] [INFO ] Implicit Places using invariants and state equation in 17640 ms returned []
Implicit Place search using SMT with State Equation took 19742 ms to find 0 implicit places.
Running 3088 sub problems to find dead transitions.
[2024-06-01 21:56:01] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 21:56:01] [INFO ] Invariant cache hit.
[2024-06-01 21:56:01] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1984 variables, 1984/1984 constraints. Problems are: Problem set: 0 solved, 3088 unsolved
SMT process timed out in 32512ms, After SMT, problems are : Problem set: 0 solved, 3088 unsolved
Search for dead transitions found 0 dead transitions in 32593ms
Finished structural reductions in LTL mode , in 1 iterations and 52627 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Support contains 637 out of 1992 places after structural reductions.
[2024-06-01 21:56:35] [INFO ] Flatten gal took : 401 ms
[2024-06-01 21:56:35] [INFO ] Flatten gal took : 199 ms
[2024-06-01 21:56:35] [INFO ] Input system was already deterministic with 3096 transitions.
RANDOM walk for 40000 steps (8 resets) in 1755 ms. (22 steps per ms) remains 4/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 4/4 properties
[2024-06-01 21:56:36] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 21:56:36] [INFO ] Invariant cache hit.
[2024-06-01 21:56:36] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 954/960 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/960 variables, 954/964 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/960 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/964 variables, 4/968 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/964 variables, 4/972 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/964 variables, 0/972 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4/968 variables, 4/976 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/968 variables, 4/980 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 21:56:38] [INFO ] Deduced a trap composed of 221 places in 656 ms of which 99 ms to minimize.
[2024-06-01 21:56:39] [INFO ] Deduced a trap composed of 137 places in 436 ms of which 6 ms to minimize.
[2024-06-01 21:56:39] [INFO ] Deduced a trap composed of 166 places in 362 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/968 variables, 3/983 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/968 variables, 0/983 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1380/2348 variables, 968/1951 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2348 variables, 126/2077 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2348 variables, 0/2077 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 252/2600 variables, 56/2133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2600 variables, 56/2189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2600 variables, 7/2196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2600 variables, 7/2203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2600/4752 variables, and 2203 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5014 ms.
Refiners :[Domain max(s): 1024/1992 constraints, Positive P Invariants (semi-flows): 15/23 constraints, Generalized P Invariants (flows): 4/8 constraints, State Equation: 1024/1992 constraints, ReadFeed: 133/497 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 954/960 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/960 variables, 954/964 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/960 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/964 variables, 4/968 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/964 variables, 4/972 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/964 variables, 0/972 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4/968 variables, 4/976 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/968 variables, 4/980 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/968 variables, 3/983 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 21:56:43] [INFO ] Deduced a trap composed of 109 places in 267 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/968 variables, 1/984 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/968 variables, 0/984 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1380/2348 variables, 968/1952 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2348 variables, 126/2078 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2348 variables, 0/2078 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 252/2600 variables, 56/2134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2600 variables, 56/2190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2600 variables, 7/2197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2600 variables, 7/2204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 21:56:46] [INFO ] Deduced a trap composed of 21 places in 1160 ms of which 11 ms to minimize.
[2024-06-01 21:56:47] [INFO ] Deduced a trap composed of 13 places in 1112 ms of which 14 ms to minimize.
SMT process timed out in 10600ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 892 transitions
Trivial Post-agglo rules discarded 892 transitions
Performed 892 trivial Post agglomeration. Transition count delta: 892
Iterating post reduction 0 with 892 rules applied. Total rules applied 892 place count 1992 transition count 2204
Reduce places removed 892 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 894 rules applied. Total rules applied 1786 place count 1100 transition count 2202
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1788 place count 1098 transition count 2202
Performed 445 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 445 Pre rules applied. Total rules applied 1788 place count 1098 transition count 1757
Deduced a syphon composed of 445 places in 2 ms
Reduce places removed 445 places and 0 transitions.
Iterating global reduction 3 with 890 rules applied. Total rules applied 2678 place count 653 transition count 1757
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 3 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2788 place count 598 transition count 1702
Applied a total of 2788 rules in 717 ms. Remains 598 /1992 variables (removed 1394) and now considering 1702/3096 (removed 1394) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 718 ms. Remains : 598/1992 places, 1702/3096 transitions.
RANDOM walk for 40000 steps (8 resets) in 998 ms. (40 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 321750 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 4
Probabilistic random walk after 321750 steps, saw 54134 distinct states, run finished after 3006 ms. (steps per millisecond=107 ) properties seen :0
[2024-06-01 21:56:51] [INFO ] Flow matrix only has 1366 transitions (discarded 336 similar events)
// Phase 1: matrix 1366 rows 598 cols
[2024-06-01 21:56:51] [INFO ] Computed 31 invariants in 20 ms
[2024-06-01 21:56:51] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 260/266 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 260/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/270 variables, 4/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 4/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4/274 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 21:56:52] [INFO ] Deduced a trap composed of 75 places in 160 ms of which 3 ms to minimize.
[2024-06-01 21:56:52] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 2 ms to minimize.
[2024-06-01 21:56:52] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 3/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 686/960 variables, 274/563 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/960 variables, 126/689 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/960 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 252/1212 variables, 56/745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1212 variables, 56/801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1212 variables, 7/808 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1212 variables, 7/815 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1212 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 364/1576 variables, 56/871 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1576 variables, 56/927 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1576 variables, 364/1291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1576 variables, 0/1291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 204/1780 variables, 4/1295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1780 variables, 204/1499 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1780 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 4/1784 variables, 4/1503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1784 variables, 4/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1784 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 4/1788 variables, 4/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1788 variables, 4/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1788 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 176/1964 variables, 212/1727 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1964 variables, 0/1727 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 0/1964 variables, 0/1727 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1964/1964 variables, and 1727 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3642 ms.
Refiners :[Domain max(s): 598/598 constraints, Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 598/598 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 260/266 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 260/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/270 variables, 4/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 4/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4/274 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 3/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 686/960 variables, 274/563 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/960 variables, 126/689 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/960 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 252/1212 variables, 56/745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1212 variables, 56/801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1212 variables, 7/808 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1212 variables, 7/815 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 21:56:56] [INFO ] Deduced a trap composed of 13 places in 383 ms of which 6 ms to minimize.
[2024-06-01 21:56:57] [INFO ] Deduced a trap composed of 22 places in 427 ms of which 5 ms to minimize.
[2024-06-01 21:56:57] [INFO ] Deduced a trap composed of 22 places in 448 ms of which 5 ms to minimize.
[2024-06-01 21:56:58] [INFO ] Deduced a trap composed of 45 places in 424 ms of which 7 ms to minimize.
[2024-06-01 21:56:58] [INFO ] Deduced a trap composed of 12 places in 430 ms of which 5 ms to minimize.
[2024-06-01 21:56:59] [INFO ] Deduced a trap composed of 68 places in 413 ms of which 5 ms to minimize.
[2024-06-01 21:56:59] [INFO ] Deduced a trap composed of 13 places in 380 ms of which 5 ms to minimize.
[2024-06-01 21:56:59] [INFO ] Deduced a trap composed of 21 places in 445 ms of which 5 ms to minimize.
[2024-06-01 21:57:00] [INFO ] Deduced a trap composed of 31 places in 340 ms of which 5 ms to minimize.
[2024-06-01 21:57:00] [INFO ] Deduced a trap composed of 30 places in 383 ms of which 5 ms to minimize.
[2024-06-01 21:57:01] [INFO ] Deduced a trap composed of 11 places in 311 ms of which 5 ms to minimize.
[2024-06-01 21:57:01] [INFO ] Deduced a trap composed of 20 places in 346 ms of which 5 ms to minimize.
[2024-06-01 21:57:01] [INFO ] Deduced a trap composed of 56 places in 237 ms of which 4 ms to minimize.
[2024-06-01 21:57:01] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 3 ms to minimize.
[2024-06-01 21:57:02] [INFO ] Deduced a trap composed of 25 places in 343 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1212 variables, 15/830 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1212 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 364/1576 variables, 56/886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1576 variables, 56/942 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1576 variables, 364/1306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1576 variables, 0/1306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 204/1780 variables, 4/1310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1780 variables, 204/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1780 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 4/1784 variables, 4/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1784 variables, 4/1522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1784 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 4/1788 variables, 4/1526 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1788 variables, 4/1530 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1788 variables, 4/1534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 21:57:05] [INFO ] Deduced a trap composed of 43 places in 498 ms of which 5 ms to minimize.
[2024-06-01 21:57:05] [INFO ] Deduced a trap composed of 41 places in 549 ms of which 7 ms to minimize.
[2024-06-01 21:57:06] [INFO ] Deduced a trap composed of 81 places in 537 ms of which 7 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/1788 variables, 3/1537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 21:57:07] [INFO ] Deduced a trap composed of 38 places in 587 ms of which 4 ms to minimize.
[2024-06-01 21:57:08] [INFO ] Deduced a trap composed of 29 places in 433 ms of which 8 ms to minimize.
[2024-06-01 21:57:08] [INFO ] Deduced a trap composed of 52 places in 638 ms of which 7 ms to minimize.
[2024-06-01 21:57:09] [INFO ] Deduced a trap composed of 38 places in 561 ms of which 7 ms to minimize.
[2024-06-01 21:57:10] [INFO ] Deduced a trap composed of 65 places in 611 ms of which 8 ms to minimize.
[2024-06-01 21:57:10] [INFO ] Deduced a trap composed of 31 places in 673 ms of which 7 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/1788 variables, 6/1543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1788 variables, 0/1543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 176/1964 variables, 212/1755 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 21:57:12] [INFO ] Deduced a trap composed of 22 places in 711 ms of which 9 ms to minimize.
[2024-06-01 21:57:13] [INFO ] Deduced a trap composed of 14 places in 625 ms of which 8 ms to minimize.
[2024-06-01 21:57:14] [INFO ] Deduced a trap composed of 22 places in 662 ms of which 7 ms to minimize.
[2024-06-01 21:57:14] [INFO ] Deduced a trap composed of 30 places in 698 ms of which 8 ms to minimize.
[2024-06-01 21:57:15] [INFO ] Deduced a trap composed of 47 places in 293 ms of which 5 ms to minimize.
[2024-06-01 21:57:16] [INFO ] Deduced a trap composed of 11 places in 610 ms of which 7 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/1964 variables, 6/1761 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 21:57:17] [INFO ] Deduced a trap composed of 38 places in 258 ms of which 5 ms to minimize.
[2024-06-01 21:57:17] [INFO ] Deduced a trap composed of 41 places in 376 ms of which 5 ms to minimize.
[2024-06-01 21:57:18] [INFO ] Deduced a trap composed of 50 places in 364 ms of which 5 ms to minimize.
[2024-06-01 21:57:18] [INFO ] Deduced a trap composed of 43 places in 647 ms of which 7 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/1964 variables, 4/1765 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 21:57:19] [INFO ] Deduced a trap composed of 12 places in 587 ms of which 8 ms to minimize.
[2024-06-01 21:57:20] [INFO ] Deduced a trap composed of 50 places in 346 ms of which 4 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/1964 variables, 2/1767 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1964 variables, 0/1767 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 0/1964 variables, 0/1767 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1964/1964 variables, and 1767 constraints, problems are : Problem set: 0 solved, 4 unsolved in 26509 ms.
Refiners :[Domain max(s): 598/598 constraints, Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 598/598 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 39/39 constraints]
After SMT, in 30209ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 1 properties in 1408 ms.
Support contains 4 out of 598 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 598/598 places, 1702/1702 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 598 transition count 1700
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 596 transition count 1700
Applied a total of 4 rules in 57 ms. Remains 596 /598 variables (removed 2) and now considering 1700/1702 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 596/598 places, 1700/1702 transitions.
RANDOM walk for 40000 steps (8 resets) in 423 ms. (94 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 292698 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 3
Probabilistic random walk after 292698 steps, saw 52230 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
[2024-06-01 21:57:26] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 596 cols
[2024-06-01 21:57:26] [INFO ] Computed 31 invariants in 9 ms
[2024-06-01 21:57:26] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 195/199 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 195/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/202 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3/205 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 3/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:57:27] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 514/719 variables, 205/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/719 variables, 84/504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/719 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 301/1020 variables, 56/560 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1020 variables, 56/616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1020 variables, 7/623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1020 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 455/1475 variables, 70/693 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1475 variables, 70/763 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1475 variables, 413/1176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1475 variables, 0/1176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 255/1730 variables, 5/1181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1730 variables, 255/1436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1730 variables, 0/1436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 5/1735 variables, 5/1441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1735 variables, 5/1446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1735 variables, 0/1446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 5/1740 variables, 5/1451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1740 variables, 5/1456 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1740 variables, 0/1456 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 220/1960 variables, 265/1721 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1960 variables, 0/1721 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 0/1960 variables, 0/1721 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1960/1960 variables, and 1721 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2485 ms.
Refiners :[Domain max(s): 596/596 constraints, Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 596/596 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 195/199 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 195/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/202 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3/205 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 3/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 514/719 variables, 205/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/719 variables, 84/504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/719 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 301/1020 variables, 56/560 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1020 variables, 56/616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1020 variables, 7/623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:57:30] [INFO ] Deduced a trap composed of 22 places in 315 ms of which 4 ms to minimize.
[2024-06-01 21:57:30] [INFO ] Deduced a trap composed of 31 places in 286 ms of which 4 ms to minimize.
[2024-06-01 21:57:30] [INFO ] Deduced a trap composed of 31 places in 292 ms of which 4 ms to minimize.
[2024-06-01 21:57:31] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 4 ms to minimize.
[2024-06-01 21:57:31] [INFO ] Deduced a trap composed of 55 places in 239 ms of which 5 ms to minimize.
[2024-06-01 21:57:31] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1020 variables, 6/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1020 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 455/1475 variables, 70/699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1475 variables, 70/769 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1475 variables, 413/1182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:57:32] [INFO ] Deduced a trap composed of 13 places in 369 ms of which 4 ms to minimize.
[2024-06-01 21:57:32] [INFO ] Deduced a trap composed of 75 places in 249 ms of which 4 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1475 variables, 2/1184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1475 variables, 0/1184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 255/1730 variables, 5/1189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1730 variables, 255/1444 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:57:34] [INFO ] Deduced a trap composed of 22 places in 819 ms of which 9 ms to minimize.
[2024-06-01 21:57:34] [INFO ] Deduced a trap composed of 11 places in 813 ms of which 8 ms to minimize.
[2024-06-01 21:57:35] [INFO ] Deduced a trap composed of 12 places in 702 ms of which 13 ms to minimize.
[2024-06-01 21:57:36] [INFO ] Deduced a trap composed of 12 places in 807 ms of which 9 ms to minimize.
[2024-06-01 21:57:37] [INFO ] Deduced a trap composed of 30 places in 698 ms of which 8 ms to minimize.
[2024-06-01 21:57:38] [INFO ] Deduced a trap composed of 22 places in 701 ms of which 8 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1730 variables, 6/1450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1730 variables, 0/1450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 5/1735 variables, 5/1455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1735 variables, 5/1460 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1735 variables, 0/1460 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 5/1740 variables, 5/1465 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1740 variables, 5/1470 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1740 variables, 3/1473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:57:39] [INFO ] Deduced a trap composed of 50 places in 669 ms of which 8 ms to minimize.
[2024-06-01 21:57:40] [INFO ] Deduced a trap composed of 56 places in 635 ms of which 7 ms to minimize.
[2024-06-01 21:57:41] [INFO ] Deduced a trap composed of 88 places in 612 ms of which 7 ms to minimize.
[2024-06-01 21:57:41] [INFO ] Deduced a trap composed of 42 places in 549 ms of which 8 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/1740 variables, 4/1477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:57:42] [INFO ] Deduced a trap composed of 80 places in 717 ms of which 8 ms to minimize.
[2024-06-01 21:57:43] [INFO ] Deduced a trap composed of 61 places in 632 ms of which 8 ms to minimize.
[2024-06-01 21:57:44] [INFO ] Deduced a trap composed of 81 places in 666 ms of which 8 ms to minimize.
[2024-06-01 21:57:44] [INFO ] Deduced a trap composed of 24 places in 689 ms of which 8 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/1740 variables, 4/1481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:57:45] [INFO ] Deduced a trap composed of 52 places in 566 ms of which 7 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/1740 variables, 1/1482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1740 variables, 0/1482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (OVERLAPS) 220/1960 variables, 265/1747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:57:47] [INFO ] Deduced a trap composed of 39 places in 768 ms of which 8 ms to minimize.
[2024-06-01 21:57:48] [INFO ] Deduced a trap composed of 14 places in 726 ms of which 8 ms to minimize.
[2024-06-01 21:57:49] [INFO ] Deduced a trap composed of 14 places in 758 ms of which 8 ms to minimize.
[2024-06-01 21:57:49] [INFO ] Deduced a trap composed of 46 places in 734 ms of which 7 ms to minimize.
[2024-06-01 21:57:50] [INFO ] Deduced a trap composed of 21 places in 711 ms of which 7 ms to minimize.
[2024-06-01 21:57:51] [INFO ] Deduced a trap composed of 45 places in 729 ms of which 8 ms to minimize.
[2024-06-01 21:57:52] [INFO ] Deduced a trap composed of 88 places in 772 ms of which 8 ms to minimize.
[2024-06-01 21:57:53] [INFO ] Deduced a trap composed of 21 places in 725 ms of which 7 ms to minimize.
[2024-06-01 21:57:54] [INFO ] Deduced a trap composed of 12 places in 719 ms of which 8 ms to minimize.
[2024-06-01 21:57:54] [INFO ] Deduced a trap composed of 30 places in 692 ms of which 7 ms to minimize.
[2024-06-01 21:57:55] [INFO ] Deduced a trap composed of 31 places in 684 ms of which 7 ms to minimize.
[2024-06-01 21:57:56] [INFO ] Deduced a trap composed of 50 places in 660 ms of which 7 ms to minimize.
[2024-06-01 21:57:57] [INFO ] Deduced a trap composed of 93 places in 636 ms of which 8 ms to minimize.
[2024-06-01 21:57:58] [INFO ] Deduced a trap composed of 32 places in 671 ms of which 7 ms to minimize.
[2024-06-01 21:57:58] [INFO ] Deduced a trap composed of 23 places in 677 ms of which 8 ms to minimize.
[2024-06-01 21:57:59] [INFO ] Deduced a trap composed of 22 places in 600 ms of which 7 ms to minimize.
[2024-06-01 21:58:00] [INFO ] Deduced a trap composed of 14 places in 632 ms of which 7 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/1960 variables, 17/1764 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:58:01] [INFO ] Deduced a trap composed of 47 places in 730 ms of which 8 ms to minimize.
[2024-06-01 21:58:02] [INFO ] Deduced a trap composed of 41 places in 686 ms of which 8 ms to minimize.
[2024-06-01 21:58:02] [INFO ] Deduced a trap composed of 32 places in 664 ms of which 8 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/1960 variables, 3/1767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1960 variables, 0/1767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 0/1960 variables, 0/1767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1960/1960 variables, and 1767 constraints, problems are : Problem set: 0 solved, 3 unsolved in 34951 ms.
Refiners :[Domain max(s): 596/596 constraints, Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 596/596 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 44/44 constraints]
After SMT, in 37476ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 615 ms.
Support contains 4 out of 596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 1700/1700 transitions.
Applied a total of 0 rules in 67 ms. Remains 596 /596 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 596/596 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 1700/1700 transitions.
Applied a total of 0 rules in 59 ms. Remains 596 /596 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2024-06-01 21:58:04] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2024-06-01 21:58:04] [INFO ] Invariant cache hit.
[2024-06-01 21:58:05] [INFO ] Implicit Places using invariants in 1123 ms returned [580, 581, 582, 583, 584, 593, 594, 595]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1132 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 588/596 places, 1700/1700 transitions.
Applied a total of 0 rules in 44 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1235 ms. Remains : 588/596 places, 1700/1700 transitions.
RANDOM walk for 40000 steps (8 resets) in 263 ms. (151 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 399528 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 3
Probabilistic random walk after 399528 steps, saw 60978 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
[2024-06-01 21:58:09] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 588 cols
[2024-06-01 21:58:09] [INFO ] Computed 23 invariants in 6 ms
[2024-06-01 21:58:09] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 195/199 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 195/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:58:09] [INFO ] Deduced a trap composed of 67 places in 129 ms of which 3 ms to minimize.
[2024-06-01 21:58:09] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 3/202 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 514/716 variables, 202/412 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/716 variables, 84/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/716 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 301/1017 variables, 56/552 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1017 variables, 56/608 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1017 variables, 7/615 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1017 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 455/1472 variables, 70/685 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1472 variables, 70/755 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1472 variables, 413/1168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1472 variables, 0/1168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 255/1727 variables, 5/1173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1727 variables, 255/1428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1727 variables, 0/1428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 5/1732 variables, 5/1433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1732 variables, 5/1438 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1732 variables, 0/1438 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 220/1952 variables, 260/1698 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1952 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 0/1952 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1952/1952 variables, and 1698 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2035 ms.
Refiners :[Domain max(s): 588/588 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 588/588 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 195/199 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 195/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 3/202 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 514/716 variables, 202/412 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/716 variables, 84/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/716 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 301/1017 variables, 56/552 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1017 variables, 56/608 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1017 variables, 7/615 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:58:12] [INFO ] Deduced a trap composed of 13 places in 290 ms of which 4 ms to minimize.
[2024-06-01 21:58:12] [INFO ] Deduced a trap composed of 31 places in 275 ms of which 4 ms to minimize.
[2024-06-01 21:58:12] [INFO ] Deduced a trap composed of 22 places in 253 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1017 variables, 3/618 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1017 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 455/1472 variables, 70/688 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1472 variables, 70/758 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1472 variables, 413/1171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:58:13] [INFO ] Deduced a trap composed of 13 places in 359 ms of which 4 ms to minimize.
[2024-06-01 21:58:13] [INFO ] Deduced a trap composed of 14 places in 254 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1472 variables, 2/1173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1472 variables, 0/1173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 255/1727 variables, 5/1178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1727 variables, 255/1433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1727 variables, 2/1435 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:58:15] [INFO ] Deduced a trap composed of 52 places in 654 ms of which 8 ms to minimize.
[2024-06-01 21:58:15] [INFO ] Deduced a trap composed of 29 places in 691 ms of which 8 ms to minimize.
[2024-06-01 21:58:16] [INFO ] Deduced a trap composed of 22 places in 750 ms of which 8 ms to minimize.
[2024-06-01 21:58:17] [INFO ] Deduced a trap composed of 21 places in 697 ms of which 8 ms to minimize.
[2024-06-01 21:58:17] [INFO ] Deduced a trap composed of 32 places in 429 ms of which 4 ms to minimize.
[2024-06-01 21:58:18] [INFO ] Deduced a trap composed of 34 places in 698 ms of which 7 ms to minimize.
[2024-06-01 21:58:19] [INFO ] Deduced a trap composed of 81 places in 623 ms of which 5 ms to minimize.
[2024-06-01 21:58:19] [INFO ] Deduced a trap composed of 51 places in 423 ms of which 4 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1727 variables, 8/1443 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1727 variables, 0/1443 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 5/1732 variables, 5/1448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1732 variables, 5/1453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1732 variables, 1/1454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1732 variables, 0/1454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 220/1952 variables, 260/1714 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 21:58:20] [INFO ] Deduced a trap composed of 12 places in 506 ms of which 5 ms to minimize.
[2024-06-01 21:58:21] [INFO ] Deduced a trap composed of 12 places in 557 ms of which 6 ms to minimize.
[2024-06-01 21:58:22] [INFO ] Deduced a trap composed of 21 places in 585 ms of which 5 ms to minimize.
[2024-06-01 21:58:22] [INFO ] Deduced a trap composed of 22 places in 453 ms of which 6 ms to minimize.
[2024-06-01 21:58:23] [INFO ] Deduced a trap composed of 31 places in 540 ms of which 6 ms to minimize.
[2024-06-01 21:58:23] [INFO ] Deduced a trap composed of 31 places in 622 ms of which 8 ms to minimize.
[2024-06-01 21:58:24] [INFO ] Deduced a trap composed of 50 places in 657 ms of which 8 ms to minimize.
[2024-06-01 21:58:25] [INFO ] Deduced a trap composed of 68 places in 612 ms of which 8 ms to minimize.
[2024-06-01 21:58:26] [INFO ] Deduced a trap composed of 30 places in 626 ms of which 8 ms to minimize.
[2024-06-01 21:58:26] [INFO ] Deduced a trap composed of 30 places in 718 ms of which 8 ms to minimize.
[2024-06-01 21:58:27] [INFO ] Deduced a trap composed of 31 places in 591 ms of which 7 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/1952 variables, 11/1725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1952 variables, 0/1725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 0/1952 variables, 0/1725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1952/1952 variables, and 1725 constraints, problems are : Problem set: 0 solved, 3 unsolved in 17653 ms.
Refiners :[Domain max(s): 588/588 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 588/588 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 26/26 constraints]
After SMT, in 19737ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 366 ms.
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 54 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 588/588 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 47 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2024-06-01 21:58:29] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2024-06-01 21:58:29] [INFO ] Invariant cache hit.
[2024-06-01 21:58:30] [INFO ] Implicit Places using invariants in 1104 ms returned []
[2024-06-01 21:58:30] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2024-06-01 21:58:30] [INFO ] Invariant cache hit.
[2024-06-01 21:58:31] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 21:58:36] [INFO ] Implicit Places using invariants and state equation in 5695 ms returned []
Implicit Place search using SMT with State Equation took 6802 ms to find 0 implicit places.
[2024-06-01 21:58:36] [INFO ] Redundant transitions in 248 ms returned []
Running 1692 sub problems to find dead transitions.
[2024-06-01 21:58:36] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2024-06-01 21:58:36] [INFO ] Invariant cache hit.
[2024-06-01 21:58:36] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 588/588 constraints. Problems are: Problem set: 0 solved, 1692 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/588 variables, 23/611 constraints. Problems are: Problem set: 0 solved, 1692 unsolved
[2024-06-01 21:59:07] [INFO ] Deduced a trap composed of 60 places in 852 ms of which 10 ms to minimize.
SMT process timed out in 31330ms, After SMT, problems are : Problem set: 0 solved, 1692 unsolved
Search for dead transitions found 0 dead transitions in 31352ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38469 ms. Remains : 588/588 places, 1700/1700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 8 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 127 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 21:59:08] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2024-06-01 21:59:08] [INFO ] Computed 31 invariants in 28 ms
[2024-06-01 21:59:10] [INFO ] Implicit Places using invariants in 1753 ms returned []
[2024-06-01 21:59:10] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 21:59:10] [INFO ] Invariant cache hit.
[2024-06-01 21:59:12] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 21:59:29] [INFO ] Implicit Places using invariants and state equation in 19127 ms returned []
Implicit Place search using SMT with State Equation took 20881 ms to find 0 implicit places.
Running 3088 sub problems to find dead transitions.
[2024-06-01 21:59:29] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 21:59:29] [INFO ] Invariant cache hit.
[2024-06-01 21:59:29] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1984 variables, 1984/1984 constraints. Problems are: Problem set: 0 solved, 3088 unsolved
SMT process timed out in 31958ms, After SMT, problems are : Problem set: 0 solved, 3088 unsolved
Search for dead transitions found 0 dead transitions in 31991ms
Finished structural reductions in LTL mode , in 1 iterations and 53006 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 474 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-7-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 4 ms.
FORMULA Peterson-PT-7-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLCardinality-00 finished in 53614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 456 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 74 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 22:00:01] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:00:01] [INFO ] Invariant cache hit.
[2024-06-01 22:00:03] [INFO ] Implicit Places using invariants in 1901 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1908 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 67 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2050 ms. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-7-LTLCardinality-01
Product exploration explored 100000 steps with 25000 reset in 1421 ms.
Product exploration explored 100000 steps with 25000 reset in 992 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 260 steps (0 resets) in 48 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 456 out of 1984 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Applied a total of 0 rules in 67 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 22:00:07] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1984 cols
[2024-06-01 22:00:07] [INFO ] Computed 23 invariants in 16 ms
[2024-06-01 22:00:09] [INFO ] Implicit Places using invariants in 1750 ms returned []
[2024-06-01 22:00:09] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:00:09] [INFO ] Invariant cache hit.
[2024-06-01 22:00:11] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 22:00:33] [INFO ] Implicit Places using invariants and state equation in 24333 ms returned []
Implicit Place search using SMT with State Equation took 26085 ms to find 0 implicit places.
Running 3088 sub problems to find dead transitions.
[2024-06-01 22:00:33] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:00:33] [INFO ] Invariant cache hit.
[2024-06-01 22:00:33] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1984 variables, 1984/1984 constraints. Problems are: Problem set: 0 solved, 3088 unsolved
SMT process timed out in 31678ms, After SMT, problems are : Problem set: 0 solved, 3088 unsolved
Search for dead transitions found 0 dead transitions in 31709ms
Finished structural reductions in LTL mode , in 1 iterations and 57870 ms. Remains : 1984/1984 places, 3096/3096 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 350 steps (0 resets) in 15 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 138 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 1185 ms.
Product exploration explored 100000 steps with 25000 reset in 1016 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 456 out of 1984 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Performed 441 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 441 rules applied. Total rules applied 441 place count 1984 transition count 3096
Performed 350 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 350 Pre rules applied. Total rules applied 441 place count 1984 transition count 3439
Deduced a syphon composed of 791 places in 3 ms
Iterating global reduction 1 with 350 rules applied. Total rules applied 791 place count 1984 transition count 3439
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 888 places in 4 ms
Iterating global reduction 1 with 97 rules applied. Total rules applied 888 place count 1984 transition count 3439
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 937 place count 1935 transition count 3390
Deduced a syphon composed of 839 places in 3 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 986 place count 1935 transition count 3390
Deduced a syphon composed of 839 places in 3 ms
Applied a total of 986 rules in 953 ms. Remains 1935 /1984 variables (removed 49) and now considering 3390/3096 (removed -294) transitions.
[2024-06-01 22:01:10] [INFO ] Redundant transitions in 155 ms returned []
Running 3382 sub problems to find dead transitions.
[2024-06-01 22:01:10] [INFO ] Flow matrix only has 3054 transitions (discarded 336 similar events)
// Phase 1: matrix 3054 rows 1935 cols
[2024-06-01 22:01:10] [INFO ] Computed 23 invariants in 23 ms
[2024-06-01 22:01:10] [INFO ] State equation strengthened by 840 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 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)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1935 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1935/4989 variables, and 23 constraints, problems are : Problem set: 0 solved, 3382 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/1935 constraints, ReadFeed: 0/840 constraints, PredecessorRefiner: 3382/3382 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1935 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3382 unsolved
[2024-06-01 22:01:47] [INFO ] Deduced a trap composed of 29 places in 1511 ms of which 18 ms to minimize.
[2024-06-01 22:01:49] [INFO ] Deduced a trap composed of 19 places in 1841 ms of which 23 ms to minimize.
[2024-06-01 22:01:51] [INFO ] Deduced a trap composed of 29 places in 1398 ms of which 13 ms to minimize.
[2024-06-01 22:01:52] [INFO ] Deduced a trap composed of 73 places in 1354 ms of which 13 ms to minimize.
[2024-06-01 22:01:53] [INFO ] Deduced a trap composed of 51 places in 1367 ms of which 12 ms to minimize.
[2024-06-01 22:01:55] [INFO ] Deduced a trap composed of 47 places in 1722 ms of which 18 ms to minimize.
[2024-06-01 22:01:56] [INFO ] Deduced a trap composed of 53 places in 1207 ms of which 11 ms to minimize.
[2024-06-01 22:01:59] [INFO ] Deduced a trap composed of 113 places in 2421 ms of which 24 ms to minimize.
[2024-06-01 22:02:01] [INFO ] Deduced a trap composed of 85 places in 2261 ms of which 24 ms to minimize.
[2024-06-01 22:02:03] [INFO ] Deduced a trap composed of 55 places in 1732 ms of which 15 ms to minimize.
[2024-06-01 22:02:05] [INFO ] Deduced a trap composed of 93 places in 1948 ms of which 15 ms to minimize.
[2024-06-01 22:02:07] [INFO ] Deduced a trap composed of 37 places in 1759 ms of which 14 ms to minimize.
[2024-06-01 22:02:09] [INFO ] Deduced a trap composed of 29 places in 2017 ms of which 14 ms to minimize.
[2024-06-01 22:02:10] [INFO ] Deduced a trap composed of 47 places in 1365 ms of which 21 ms to minimize.
[2024-06-01 22:02:12] [INFO ] Deduced a trap composed of 33 places in 1675 ms of which 11 ms to minimize.
SMT process timed out in 62302ms, After SMT, problems are : Problem set: 0 solved, 3382 unsolved
Search for dead transitions found 0 dead transitions in 62336ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1935/1984 places, 3390/3096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63466 ms. Remains : 1935/1984 places, 3390/3096 transitions.
Support contains 456 out of 1984 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Applied a total of 0 rules in 43 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 22:02:12] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1984 cols
[2024-06-01 22:02:12] [INFO ] Computed 23 invariants in 9 ms
[2024-06-01 22:02:14] [INFO ] Implicit Places using invariants in 1517 ms returned []
[2024-06-01 22:02:14] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:02:14] [INFO ] Invariant cache hit.
[2024-06-01 22:02:16] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 22:02:36] [INFO ] Implicit Places using invariants and state equation in 22308 ms returned []
Implicit Place search using SMT with State Equation took 23832 ms to find 0 implicit places.
Running 3088 sub problems to find dead transitions.
[2024-06-01 22:02:36] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:02:36] [INFO ] Invariant cache hit.
[2024-06-01 22:02:36] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1984 variables, 1984/1984 constraints. Problems are: Problem set: 0 solved, 3088 unsolved
SMT process timed out in 31583ms, After SMT, problems are : Problem set: 0 solved, 3088 unsolved
Search for dead transitions found 0 dead transitions in 31613ms
Finished structural reductions in LTL mode , in 1 iterations and 55499 ms. Remains : 1984/1984 places, 3096/3096 transitions.
Treatment of property Peterson-PT-7-LTLCardinality-01 finished in 186584 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 504 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 392 place count 1992 transition count 2704
Reduce places removed 392 places and 0 transitions.
Performed 392 Post agglomeration using F-continuation condition.Transition count delta: 392
Iterating post reduction 1 with 784 rules applied. Total rules applied 1176 place count 1600 transition count 2312
Reduce places removed 392 places and 0 transitions.
Iterating post reduction 2 with 392 rules applied. Total rules applied 1568 place count 1208 transition count 2312
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 1568 place count 1208 transition count 2256
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 1680 place count 1152 transition count 2256
Applied a total of 1680 rules in 201 ms. Remains 1152 /1992 variables (removed 840) and now considering 2256/3096 (removed 840) transitions.
[2024-06-01 22:03:08] [INFO ] Flow matrix only has 1920 transitions (discarded 336 similar events)
// Phase 1: matrix 1920 rows 1152 cols
[2024-06-01 22:03:08] [INFO ] Computed 31 invariants in 11 ms
[2024-06-01 22:03:10] [INFO ] Implicit Places using invariants in 1433 ms returned [1136, 1137, 1138, 1139, 1140, 1149, 1150, 1151]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1435 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1144/1992 places, 2256/3096 transitions.
Applied a total of 0 rules in 41 ms. Remains 1144 /1144 variables (removed 0) and now considering 2256/2256 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1677 ms. Remains : 1144/1992 places, 2256/3096 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-7-LTLCardinality-02
Product exploration explored 100000 steps with 1137 reset in 1315 ms.
Stack based approach found an accepted trace after 89 steps with 1 reset with depth 23 and stack size 23 in 2 ms.
FORMULA Peterson-PT-7-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLCardinality-02 finished in 3097 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))||(!p1 U X(G(p2)))))'
Support contains 176 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 108 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 22:03:11] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2024-06-01 22:03:11] [INFO ] Computed 31 invariants in 18 ms
[2024-06-01 22:03:13] [INFO ] Implicit Places using invariants in 1732 ms returned []
[2024-06-01 22:03:13] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:03:13] [INFO ] Invariant cache hit.
[2024-06-01 22:03:15] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 22:03:29] [INFO ] Implicit Places using invariants and state equation in 16497 ms returned []
Implicit Place search using SMT with State Equation took 18229 ms to find 0 implicit places.
Running 3088 sub problems to find dead transitions.
[2024-06-01 22:03:29] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:03:29] [INFO ] Invariant cache hit.
[2024-06-01 22:03:29] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1984 variables, 1984/1984 constraints. Problems are: Problem set: 0 solved, 3088 unsolved
SMT process timed out in 31498ms, After SMT, problems are : Problem set: 0 solved, 3088 unsolved
Search for dead transitions found 0 dead transitions in 31527ms
Finished structural reductions in LTL mode , in 1 iterations and 49876 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 354 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-7-LTLCardinality-03
Product exploration explored 100000 steps with 4144 reset in 918 ms.
Stack based approach found an accepted trace after 90311 steps with 3779 reset with depth 25 and stack size 25 in 1187 ms.
FORMULA Peterson-PT-7-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLCardinality-03 finished in 52372 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))||F(p1)))'
Support contains 112 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 132 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 22:04:03] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:04:03] [INFO ] Invariant cache hit.
[2024-06-01 22:04:05] [INFO ] Implicit Places using invariants in 1896 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1900 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 125 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2157 ms. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-7-LTLCardinality-05
Product exploration explored 100000 steps with 4501 reset in 1071 ms.
Stack based approach found an accepted trace after 6973 steps with 312 reset with depth 19 and stack size 19 in 61 ms.
FORMULA Peterson-PT-7-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLCardinality-05 finished in 3481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 895 transitions
Trivial Post-agglo rules discarded 895 transitions
Performed 895 trivial Post agglomeration. Transition count delta: 895
Iterating post reduction 0 with 895 rules applied. Total rules applied 895 place count 1992 transition count 2201
Reduce places removed 895 places and 0 transitions.
Iterating post reduction 1 with 895 rules applied. Total rules applied 1790 place count 1097 transition count 2201
Performed 447 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 447 Pre rules applied. Total rules applied 1790 place count 1097 transition count 1754
Deduced a syphon composed of 447 places in 1 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 2 with 894 rules applied. Total rules applied 2684 place count 650 transition count 1754
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2796 place count 594 transition count 1698
Applied a total of 2796 rules in 224 ms. Remains 594 /1992 variables (removed 1398) and now considering 1698/3096 (removed 1398) transitions.
[2024-06-01 22:04:07] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
// Phase 1: matrix 1362 rows 594 cols
[2024-06-01 22:04:07] [INFO ] Computed 31 invariants in 13 ms
[2024-06-01 22:04:08] [INFO ] Implicit Places using invariants in 960 ms returned [578, 579, 580, 581, 582, 591, 592, 593]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 963 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 586/1992 places, 1698/3096 transitions.
Applied a total of 0 rules in 45 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1232 ms. Remains : 586/1992 places, 1698/3096 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-7-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 444 ms.
Stack based approach found an accepted trace after 47 steps with 0 reset with depth 48 and stack size 48 in 0 ms.
FORMULA Peterson-PT-7-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLCardinality-08 finished in 1787 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(F(p1)&&F(p2))))'
Support contains 5 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 125 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 22:04:09] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2024-06-01 22:04:09] [INFO ] Computed 31 invariants in 11 ms
[2024-06-01 22:04:10] [INFO ] Implicit Places using invariants in 1621 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1624 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 77 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1827 ms. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Peterson-PT-7-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 959 ms.
Product exploration explored 100000 steps with 50000 reset in 859 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 22 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-7-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-7-LTLCardinality-10 finished in 3840 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 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 79 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 22:04:13] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:04:13] [INFO ] Invariant cache hit.
[2024-06-01 22:04:14] [INFO ] Implicit Places using invariants in 1834 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1841 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 109 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2029 ms. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-7-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 59 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-7-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLCardinality-11 finished in 2174 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 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 893 transitions
Trivial Post-agglo rules discarded 893 transitions
Performed 893 trivial Post agglomeration. Transition count delta: 893
Iterating post reduction 0 with 893 rules applied. Total rules applied 893 place count 1992 transition count 2203
Reduce places removed 893 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 894 rules applied. Total rules applied 1787 place count 1099 transition count 2202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1788 place count 1098 transition count 2202
Performed 447 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 447 Pre rules applied. Total rules applied 1788 place count 1098 transition count 1755
Deduced a syphon composed of 447 places in 2 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 3 with 894 rules applied. Total rules applied 2682 place count 651 transition count 1755
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 2794 place count 595 transition count 1699
Applied a total of 2794 rules in 228 ms. Remains 595 /1992 variables (removed 1397) and now considering 1699/3096 (removed 1397) transitions.
[2024-06-01 22:04:15] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 595 cols
[2024-06-01 22:04:15] [INFO ] Computed 31 invariants in 5 ms
[2024-06-01 22:04:16] [INFO ] Implicit Places using invariants in 1279 ms returned [579, 580, 581, 582, 583, 592, 593, 594]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1282 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 587/1992 places, 1699/3096 transitions.
Applied a total of 0 rules in 43 ms. Remains 587 /587 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1553 ms. Remains : 587/1992 places, 1699/3096 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-7-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 456 ms.
Product exploration explored 100000 steps with 0 reset in 566 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 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 43 ms :[(NOT p0)]
RANDOM walk for 35781 steps (7 resets) in 280 ms. (127 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 138 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 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Support contains 2 out of 587 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 587/587 places, 1699/1699 transitions.
Applied a total of 0 rules in 37 ms. Remains 587 /587 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2024-06-01 22:04:18] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 587 cols
[2024-06-01 22:04:18] [INFO ] Computed 23 invariants in 5 ms
[2024-06-01 22:04:19] [INFO ] Implicit Places using invariants in 1047 ms returned []
[2024-06-01 22:04:19] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2024-06-01 22:04:19] [INFO ] Invariant cache hit.
[2024-06-01 22:04:20] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 22:04:24] [INFO ] Implicit Places using invariants and state equation in 5087 ms returned []
Implicit Place search using SMT with State Equation took 6138 ms to find 0 implicit places.
[2024-06-01 22:04:24] [INFO ] Redundant transitions in 135 ms returned []
Running 1691 sub problems to find dead transitions.
[2024-06-01 22:04:24] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2024-06-01 22:04:24] [INFO ] Invariant cache hit.
[2024-06-01 22:04:24] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/587 variables, 587/587 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
SMT process timed out in 30774ms, After SMT, problems are : Problem set: 0 solved, 1691 unsolved
Search for dead transitions found 0 dead transitions in 30790ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37108 ms. Remains : 587/587 places, 1699/1699 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 155 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 55 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 333 ms. (119 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 461169 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 1
Probabilistic random walk after 461169 steps, saw 63730 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :0
[2024-06-01 22:04:58] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2024-06-01 22:04:58] [INFO ] Invariant cache hit.
[2024-06-01 22:04:58] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 66/68 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/69 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 173/242 variables, 69/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 14/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/641 variables, 56/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/641 variables, 56/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/641 variables, 7/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/641 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1278 variables, 98/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1278 variables, 98/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1278 variables, 483/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1278 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1635 variables, 7/959 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1635 variables, 357/1316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1635 variables, 0/1316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1642 variables, 7/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1642 variables, 7/1330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1642 variables, 0/1330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1950 variables, 364/1694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1950 variables, 0/1694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1950 variables, 0/1694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1950/1950 variables, and 1694 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1139 ms.
Refiners :[Domain max(s): 587/587 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 587/587 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 66/68 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/69 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 173/242 variables, 69/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 14/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/641 variables, 56/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/641 variables, 56/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/641 variables, 7/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/641 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1278 variables, 98/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1278 variables, 98/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1278 variables, 483/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1278 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1635 variables, 7/959 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1635 variables, 357/1316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1635 variables, 1/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:05:01] [INFO ] Deduced a trap composed of 12 places in 716 ms of which 8 ms to minimize.
[2024-06-01 22:05:02] [INFO ] Deduced a trap composed of 44 places in 739 ms of which 6 ms to minimize.
[2024-06-01 22:05:02] [INFO ] Deduced a trap composed of 13 places in 683 ms of which 8 ms to minimize.
[2024-06-01 22:05:03] [INFO ] Deduced a trap composed of 20 places in 790 ms of which 8 ms to minimize.
[2024-06-01 22:05:04] [INFO ] Deduced a trap composed of 64 places in 815 ms of which 8 ms to minimize.
[2024-06-01 22:05:05] [INFO ] Deduced a trap composed of 21 places in 769 ms of which 9 ms to minimize.
SMT process timed out in 6661ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 587 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 587/587 places, 1699/1699 transitions.
Applied a total of 0 rules in 42 ms. Remains 587 /587 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 587/587 places, 1699/1699 transitions.
RANDOM walk for 22860 steps (4 resets) in 118 ms. (192 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 142 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 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 550 ms.
Stack based approach found an accepted trace after 7200 steps with 0 reset with depth 7201 and stack size 5464 in 47 ms.
FORMULA Peterson-PT-7-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLCardinality-12 finished in 51372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&(p1||G(p2))))))'
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 77 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 22:05:06] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2024-06-01 22:05:06] [INFO ] Computed 31 invariants in 14 ms
[2024-06-01 22:05:08] [INFO ] Implicit Places using invariants in 1996 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 2000 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 123 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2202 ms. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Peterson-PT-7-LTLCardinality-13
Product exploration explored 100000 steps with 74 reset in 493 ms.
Stack based approach found an accepted trace after 574 steps with 1 reset with depth 249 and stack size 249 in 3 ms.
FORMULA Peterson-PT-7-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLCardinality-13 finished in 3019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(!p1)||p0)) U G(p1))))'
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 82 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 22:05:09] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:05:09] [INFO ] Invariant cache hit.
[2024-06-01 22:05:11] [INFO ] Implicit Places using invariants in 1608 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1611 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 81 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1776 ms. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p1), (NOT p1), (AND p1 (NOT p0)), false, true, (AND p1 p0), (NOT p1)]
Running random walk in product with property : Peterson-PT-7-LTLCardinality-15
Product exploration explored 100000 steps with 24890 reset in 802 ms.
Product exploration explored 100000 steps with 25080 reset in 695 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 122 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), (NOT p1), (AND p1 (NOT p0)), false, true, (AND p1 p0), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 210 ms. (189 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 1/1 properties
[2024-06-01 22:05:13] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1984 cols
[2024-06-01 22:05:13] [INFO ] Computed 23 invariants in 14 ms
[2024-06-01 22:05:13] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 476/480 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 476/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/482 variables, 2/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 690/1172 variables, 482/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1172 variables, 28/996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1172 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 350/1522 variables, 56/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1522 variables, 56/1108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1522 variables, 7/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1522 variables, 7/1122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1522 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 546/2068 variables, 84/1206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2068 variables, 84/1290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2068 variables, 462/1752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2068 variables, 0/1752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1356/3424 variables, 6/1758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3424 variables, 1356/3114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3424 variables, 0/3114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/3430 variables, 6/3120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3430 variables, 6/3126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3430 variables, 0/3126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1314/4744 variables, 1362/4488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/4744 variables, 0/4488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/4744 variables, 0/4488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4744/4744 variables, and 4488 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2869 ms.
Refiners :[Domain max(s): 1984/1984 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 1984/1984 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 476/480 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 476/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/482 variables, 2/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 690/1172 variables, 482/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1172 variables, 28/996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1172 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 350/1522 variables, 56/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1522 variables, 56/1108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1522 variables, 7/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1522 variables, 7/1122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1522 variables, 1/1123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:05:18] [INFO ] Deduced a trap composed of 16 places in 556 ms of which 8 ms to minimize.
[2024-06-01 22:05:18] [INFO ] Deduced a trap composed of 13 places in 603 ms of which 8 ms to minimize.
[2024-06-01 22:05:19] [INFO ] Deduced a trap composed of 47 places in 606 ms of which 8 ms to minimize.
[2024-06-01 22:05:19] [INFO ] Deduced a trap composed of 33 places in 563 ms of which 8 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1522 variables, 4/1127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1522 variables, 0/1127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 546/2068 variables, 84/1211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2068 variables, 84/1295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2068 variables, 462/1757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2068 variables, 0/1757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1356/3424 variables, 6/1763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3424 variables, 1356/3119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:05:23] [INFO ] Deduced a trap composed of 13 places in 2076 ms of which 26 ms to minimize.
SMT process timed out in 9676ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 894 transitions
Trivial Post-agglo rules discarded 894 transitions
Performed 894 trivial Post agglomeration. Transition count delta: 894
Iterating post reduction 0 with 894 rules applied. Total rules applied 894 place count 1984 transition count 2202
Reduce places removed 894 places and 0 transitions.
Iterating post reduction 1 with 894 rules applied. Total rules applied 1788 place count 1090 transition count 2202
Performed 445 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 445 Pre rules applied. Total rules applied 1788 place count 1090 transition count 1757
Deduced a syphon composed of 445 places in 1 ms
Reduce places removed 445 places and 0 transitions.
Iterating global reduction 2 with 890 rules applied. Total rules applied 2678 place count 645 transition count 1757
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2790 place count 589 transition count 1701
Applied a total of 2790 rules in 209 ms. Remains 589 /1984 variables (removed 1395) and now considering 1701/3096 (removed 1395) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 589/1984 places, 1701/3096 transitions.
RANDOM walk for 40000 steps (8 resets) in 288 ms. (138 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 484776 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 1
Probabilistic random walk after 484776 steps, saw 65965 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
[2024-06-01 22:05:26] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
// Phase 1: matrix 1365 rows 589 cols
[2024-06-01 22:05:26] [INFO ] Computed 23 invariants in 3 ms
[2024-06-01 22:05:26] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 131/135 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 131/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/137 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 345/482 variables, 137/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 28/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 350/832 variables, 56/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/832 variables, 56/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/832 variables, 7/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/832 variables, 7/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/832 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 546/1378 variables, 84/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1378 variables, 84/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1378 variables, 462/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1378 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 306/1684 variables, 6/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1684 variables, 306/1374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1684 variables, 0/1374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/1690 variables, 6/1380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1690 variables, 6/1386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1690 variables, 0/1386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 264/1954 variables, 312/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1954 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1954 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1954/1954 variables, and 1698 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1198 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 589/589 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 131/135 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 131/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/137 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 345/482 variables, 137/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 28/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 350/832 variables, 56/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/832 variables, 56/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/832 variables, 7/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/832 variables, 7/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/832 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:05:28] [INFO ] Deduced a trap composed of 20 places in 229 ms of which 5 ms to minimize.
[2024-06-01 22:05:28] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 3 ms to minimize.
[2024-06-01 22:05:29] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 4 ms to minimize.
[2024-06-01 22:05:29] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/832 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/832 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 546/1378 variables, 84/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1378 variables, 84/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1378 variables, 462/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1378 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 306/1684 variables, 6/1073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1684 variables, 306/1379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:05:30] [INFO ] Deduced a trap composed of 33 places in 710 ms of which 8 ms to minimize.
[2024-06-01 22:05:31] [INFO ] Deduced a trap composed of 28 places in 667 ms of which 7 ms to minimize.
[2024-06-01 22:05:31] [INFO ] Deduced a trap composed of 39 places in 649 ms of which 7 ms to minimize.
[2024-06-01 22:05:32] [INFO ] Deduced a trap composed of 34 places in 549 ms of which 7 ms to minimize.
[2024-06-01 22:05:33] [INFO ] Deduced a trap composed of 43 places in 603 ms of which 7 ms to minimize.
[2024-06-01 22:05:33] [INFO ] Deduced a trap composed of 49 places in 546 ms of which 7 ms to minimize.
[2024-06-01 22:05:34] [INFO ] Deduced a trap composed of 60 places in 484 ms of which 6 ms to minimize.
[2024-06-01 22:05:34] [INFO ] Deduced a trap composed of 57 places in 479 ms of which 6 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1684 variables, 8/1387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1684 variables, 0/1387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 6/1690 variables, 6/1393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1690 variables, 6/1399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1690 variables, 0/1399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 264/1954 variables, 312/1711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:05:36] [INFO ] Deduced a trap composed of 21 places in 730 ms of which 8 ms to minimize.
[2024-06-01 22:05:36] [INFO ] Deduced a trap composed of 31 places in 750 ms of which 8 ms to minimize.
[2024-06-01 22:05:37] [INFO ] Deduced a trap composed of 12 places in 690 ms of which 7 ms to minimize.
[2024-06-01 22:05:38] [INFO ] Deduced a trap composed of 38 places in 680 ms of which 8 ms to minimize.
[2024-06-01 22:05:38] [INFO ] Deduced a trap composed of 12 places in 437 ms of which 5 ms to minimize.
[2024-06-01 22:05:39] [INFO ] Deduced a trap composed of 12 places in 588 ms of which 8 ms to minimize.
[2024-06-01 22:05:40] [INFO ] Deduced a trap composed of 29 places in 625 ms of which 7 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1954 variables, 7/1718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1954 variables, 0/1718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/1954 variables, 0/1718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1954/1954 variables, and 1718 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12682 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 589/589 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints]
After SMT, in 13911ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 4 out of 589 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 589/589 places, 1701/1701 transitions.
Applied a total of 0 rules in 24 ms. Remains 589 /589 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 589/589 places, 1701/1701 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 589/589 places, 1701/1701 transitions.
Applied a total of 0 rules in 23 ms. Remains 589 /589 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
[2024-06-01 22:05:40] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2024-06-01 22:05:40] [INFO ] Invariant cache hit.
[2024-06-01 22:05:41] [INFO ] Implicit Places using invariants in 1030 ms returned []
[2024-06-01 22:05:41] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2024-06-01 22:05:41] [INFO ] Invariant cache hit.
[2024-06-01 22:05:42] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 22:05:47] [INFO ] Implicit Places using invariants and state equation in 5538 ms returned []
Implicit Place search using SMT with State Equation took 6572 ms to find 0 implicit places.
[2024-06-01 22:05:47] [INFO ] Redundant transitions in 66 ms returned []
Running 1693 sub problems to find dead transitions.
[2024-06-01 22:05:47] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2024-06-01 22:05:47] [INFO ] Invariant cache hit.
[2024-06-01 22:05:47] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/589 variables, 589/589 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/589 variables, 23/612 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
[2024-06-01 22:06:16] [INFO ] Deduced a trap composed of 11 places in 865 ms of which 9 ms to minimize.
[2024-06-01 22:06:16] [INFO ] Deduced a trap composed of 11 places in 787 ms of which 9 ms to minimize.
[2024-06-01 22:06:17] [INFO ] Deduced a trap composed of 29 places in 795 ms of which 9 ms to minimize.
[2024-06-01 22:06:18] [INFO ] Deduced a trap composed of 40 places in 749 ms of which 8 ms to minimize.
SMT process timed out in 31130ms, After SMT, problems are : Problem set: 0 solved, 1693 unsolved
Search for dead transitions found 0 dead transitions in 31159ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37835 ms. Remains : 589/589 places, 1701/1701 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1287 edges and 589 vertex of which 447 / 589 are part of one of the 56 SCC in 12 ms
Free SCC test removed 391 places
Drop transitions (Empty/Sink Transition effects.) removed 782 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1173 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 198 transition count 473
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 143 transition count 473
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 113 place count 142 transition count 472
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 139 place count 125 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 62 edges and 125 vertex of which 48 / 125 are part of one of the 6 SCC in 5 ms
Free SCC test removed 42 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 141 place count 83 transition count 470
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (trivial) has 308 edges and 77 vertex of which 42 / 77 are part of one of the 7 SCC in 0 ms
Free SCC test removed 35 places
Iterating post reduction 1 with 55 rules applied. Total rules applied 196 place count 42 transition count 422
Drop transitions (Empty/Sink Transition effects.) removed 210 transitions
Ensure Unique test removed 145 transitions
Reduce isomorphic transitions removed 355 transitions.
Iterating post reduction 2 with 355 rules applied. Total rules applied 551 place count 42 transition count 67
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 558 place count 42 transition count 68
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 580 place count 35 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 595 place count 35 transition count 38
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 599 place count 35 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 600 place count 35 transition count 37
Applied a total of 600 rules in 90 ms. Remains 35 /589 variables (removed 554) and now considering 37/1701 (removed 1664) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 37 rows 35 cols
[2024-06-01 22:06:18] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 22:06:18] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 22:06:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-06-01 22:06:18] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 22:06:18] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 22:06:18] [INFO ] After 106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 264 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND p1 p0))), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 375 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 331 ms :[(NOT p1), (NOT p1), (AND p1 (NOT p0)), false, true, (AND p1 p0), (NOT p1)]
Stuttering acceptance computed with spot in 333 ms :[(NOT p1), (NOT p1), (AND p1 (NOT p0)), false, true, (AND p1 p0), (NOT p1)]
Support contains 4 out of 1984 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Applied a total of 0 rules in 458 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 22:06:20] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1984 cols
[2024-06-01 22:06:20] [INFO ] Computed 23 invariants in 16 ms
[2024-06-01 22:06:22] [INFO ] Implicit Places using invariants in 1906 ms returned []
[2024-06-01 22:06:22] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:06:22] [INFO ] Invariant cache hit.
[2024-06-01 22:06:24] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 22:06:47] [INFO ] Implicit Places using invariants and state equation in 25107 ms returned []
Implicit Place search using SMT with State Equation took 27015 ms to find 0 implicit places.
Running 3088 sub problems to find dead transitions.
[2024-06-01 22:06:47] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:06:47] [INFO ] Invariant cache hit.
[2024-06-01 22:06:47] [INFO ] State equation strengthened by 497 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/1984 variables, 1984/1984 constraints. Problems are: Problem set: 0 solved, 3088 unsolved
SMT process timed out in 31658ms, After SMT, problems are : Problem set: 0 solved, 3088 unsolved
Search for dead transitions found 0 dead transitions in 31692ms
Finished structural reductions in LTL mode , in 1 iterations and 59172 ms. Remains : 1984/1984 places, 3096/3096 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 159 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 341 ms :[(NOT p1), (NOT p1), (AND p1 (NOT p0)), false, true, (AND p1 p0), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 279 ms. (142 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
[2024-06-01 22:07:19] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:07:19] [INFO ] Invariant cache hit.
[2024-06-01 22:07:19] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 476/480 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 476/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/482 variables, 2/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 690/1172 variables, 482/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1172 variables, 28/996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1172 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 350/1522 variables, 56/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1522 variables, 56/1108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1522 variables, 7/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1522 variables, 7/1122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1522 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 546/2068 variables, 84/1206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2068 variables, 84/1290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2068 variables, 462/1752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2068 variables, 0/1752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1356/3424 variables, 6/1758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3424 variables, 1356/3114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3424 variables, 0/3114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/3430 variables, 6/3120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3430 variables, 6/3126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3430 variables, 0/3126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1314/4744 variables, 1362/4488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/4744 variables, 0/4488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/4744 variables, 0/4488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4744/4744 variables, and 4488 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2965 ms.
Refiners :[Domain max(s): 1984/1984 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 1984/1984 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 476/480 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 476/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/482 variables, 2/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 690/1172 variables, 482/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1172 variables, 28/996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1172 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 350/1522 variables, 56/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1522 variables, 56/1108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1522 variables, 7/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1522 variables, 7/1122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1522 variables, 1/1123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:07:23] [INFO ] Deduced a trap composed of 16 places in 573 ms of which 8 ms to minimize.
[2024-06-01 22:07:24] [INFO ] Deduced a trap composed of 13 places in 548 ms of which 8 ms to minimize.
[2024-06-01 22:07:25] [INFO ] Deduced a trap composed of 47 places in 560 ms of which 8 ms to minimize.
[2024-06-01 22:07:25] [INFO ] Deduced a trap composed of 33 places in 562 ms of which 8 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1522 variables, 4/1127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1522 variables, 0/1127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 546/2068 variables, 84/1211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2068 variables, 84/1295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2068 variables, 462/1757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2068 variables, 0/1757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1356/3424 variables, 6/1763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3424 variables, 1356/3119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:07:28] [INFO ] Deduced a trap composed of 54 places in 1973 ms of which 26 ms to minimize.
SMT process timed out in 9305ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 894 transitions
Trivial Post-agglo rules discarded 894 transitions
Performed 894 trivial Post agglomeration. Transition count delta: 894
Iterating post reduction 0 with 894 rules applied. Total rules applied 894 place count 1984 transition count 2202
Reduce places removed 894 places and 0 transitions.
Iterating post reduction 1 with 894 rules applied. Total rules applied 1788 place count 1090 transition count 2202
Performed 445 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 445 Pre rules applied. Total rules applied 1788 place count 1090 transition count 1757
Deduced a syphon composed of 445 places in 2 ms
Reduce places removed 445 places and 0 transitions.
Iterating global reduction 2 with 890 rules applied. Total rules applied 2678 place count 645 transition count 1757
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2790 place count 589 transition count 1701
Applied a total of 2790 rules in 275 ms. Remains 589 /1984 variables (removed 1395) and now considering 1701/3096 (removed 1395) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 589/1984 places, 1701/3096 transitions.
RANDOM walk for 40000 steps (8 resets) in 229 ms. (173 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 506016 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 1
Probabilistic random walk after 506016 steps, saw 75240 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
[2024-06-01 22:07:32] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
// Phase 1: matrix 1365 rows 589 cols
[2024-06-01 22:07:32] [INFO ] Computed 23 invariants in 5 ms
[2024-06-01 22:07:32] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 131/135 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 131/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/137 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 345/482 variables, 137/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 28/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 350/832 variables, 56/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/832 variables, 56/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/832 variables, 7/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/832 variables, 7/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/832 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 546/1378 variables, 84/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1378 variables, 84/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1378 variables, 462/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1378 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 306/1684 variables, 6/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1684 variables, 306/1374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1684 variables, 0/1374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/1690 variables, 6/1380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1690 variables, 6/1386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1690 variables, 0/1386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 264/1954 variables, 312/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1954 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1954 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1954/1954 variables, and 1698 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1147 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 589/589 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 131/135 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 131/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/137 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 345/482 variables, 137/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 28/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 350/832 variables, 56/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/832 variables, 56/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/832 variables, 7/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/832 variables, 7/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/832 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:07:34] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 4 ms to minimize.
[2024-06-01 22:07:34] [INFO ] Deduced a trap composed of 11 places in 235 ms of which 3 ms to minimize.
[2024-06-01 22:07:34] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 3 ms to minimize.
[2024-06-01 22:07:34] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/832 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/832 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 546/1378 variables, 84/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1378 variables, 84/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1378 variables, 462/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1378 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 306/1684 variables, 6/1073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1684 variables, 306/1379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:07:36] [INFO ] Deduced a trap composed of 33 places in 708 ms of which 8 ms to minimize.
[2024-06-01 22:07:36] [INFO ] Deduced a trap composed of 28 places in 513 ms of which 7 ms to minimize.
[2024-06-01 22:07:37] [INFO ] Deduced a trap composed of 39 places in 647 ms of which 7 ms to minimize.
[2024-06-01 22:07:38] [INFO ] Deduced a trap composed of 34 places in 593 ms of which 7 ms to minimize.
[2024-06-01 22:07:38] [INFO ] Deduced a trap composed of 43 places in 621 ms of which 7 ms to minimize.
[2024-06-01 22:07:39] [INFO ] Deduced a trap composed of 49 places in 556 ms of which 6 ms to minimize.
[2024-06-01 22:07:39] [INFO ] Deduced a trap composed of 60 places in 468 ms of which 6 ms to minimize.
[2024-06-01 22:07:40] [INFO ] Deduced a trap composed of 57 places in 444 ms of which 6 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1684 variables, 8/1387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1684 variables, 0/1387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 6/1690 variables, 6/1393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1690 variables, 6/1399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1690 variables, 0/1399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 264/1954 variables, 312/1711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:07:41] [INFO ] Deduced a trap composed of 21 places in 564 ms of which 6 ms to minimize.
[2024-06-01 22:07:42] [INFO ] Deduced a trap composed of 31 places in 529 ms of which 5 ms to minimize.
[2024-06-01 22:07:42] [INFO ] Deduced a trap composed of 12 places in 428 ms of which 4 ms to minimize.
[2024-06-01 22:07:43] [INFO ] Deduced a trap composed of 38 places in 560 ms of which 7 ms to minimize.
[2024-06-01 22:07:43] [INFO ] Deduced a trap composed of 12 places in 447 ms of which 7 ms to minimize.
[2024-06-01 22:07:44] [INFO ] Deduced a trap composed of 12 places in 454 ms of which 7 ms to minimize.
[2024-06-01 22:07:44] [INFO ] Deduced a trap composed of 29 places in 543 ms of which 7 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1954 variables, 7/1718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1954 variables, 0/1718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/1954 variables, 0/1718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1954/1954 variables, and 1718 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11607 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 589/589 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints]
After SMT, in 12774ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 4 out of 589 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 589/589 places, 1701/1701 transitions.
Applied a total of 0 rules in 50 ms. Remains 589 /589 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 589/589 places, 1701/1701 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 589/589 places, 1701/1701 transitions.
Applied a total of 0 rules in 51 ms. Remains 589 /589 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
[2024-06-01 22:07:45] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2024-06-01 22:07:45] [INFO ] Invariant cache hit.
[2024-06-01 22:07:46] [INFO ] Implicit Places using invariants in 1023 ms returned []
[2024-06-01 22:07:46] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2024-06-01 22:07:46] [INFO ] Invariant cache hit.
[2024-06-01 22:07:47] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 22:07:52] [INFO ] Implicit Places using invariants and state equation in 6105 ms returned []
Implicit Place search using SMT with State Equation took 7130 ms to find 0 implicit places.
[2024-06-01 22:07:52] [INFO ] Redundant transitions in 63 ms returned []
Running 1693 sub problems to find dead transitions.
[2024-06-01 22:07:52] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2024-06-01 22:07:52] [INFO ] Invariant cache hit.
[2024-06-01 22:07:52] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/589 variables, 589/589 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
SMT process timed out in 30700ms, After SMT, problems are : Problem set: 0 solved, 1693 unsolved
Search for dead transitions found 0 dead transitions in 30718ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37975 ms. Remains : 589/589 places, 1701/1701 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1287 edges and 589 vertex of which 447 / 589 are part of one of the 56 SCC in 0 ms
Free SCC test removed 391 places
Drop transitions (Empty/Sink Transition effects.) removed 782 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1173 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 198 transition count 473
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 143 transition count 473
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 113 place count 142 transition count 472
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 139 place count 125 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 62 edges and 125 vertex of which 48 / 125 are part of one of the 6 SCC in 0 ms
Free SCC test removed 42 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 141 place count 83 transition count 470
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (trivial) has 308 edges and 77 vertex of which 42 / 77 are part of one of the 7 SCC in 0 ms
Free SCC test removed 35 places
Iterating post reduction 1 with 55 rules applied. Total rules applied 196 place count 42 transition count 422
Drop transitions (Empty/Sink Transition effects.) removed 210 transitions
Ensure Unique test removed 145 transitions
Reduce isomorphic transitions removed 355 transitions.
Iterating post reduction 2 with 355 rules applied. Total rules applied 551 place count 42 transition count 67
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 558 place count 42 transition count 68
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 580 place count 35 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 595 place count 35 transition count 38
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 599 place count 35 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 600 place count 35 transition count 37
Applied a total of 600 rules in 30 ms. Remains 35 /589 variables (removed 554) and now considering 37/1701 (removed 1664) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 37 rows 35 cols
[2024-06-01 22:08:23] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 22:08:23] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 22:08:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-01 22:08:23] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 22:08:23] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 22:08:23] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 166 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND p1 p0))), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 365 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(NOT p1), (NOT p1), (AND p1 (NOT p0)), false, true, (AND p1 p0), (NOT p1)]
Stuttering acceptance computed with spot in 407 ms :[(NOT p1), (NOT p1), (AND p1 (NOT p0)), false, true, (AND p1 p0), (NOT p1)]
Stuttering acceptance computed with spot in 286 ms :[(NOT p1), (NOT p1), (AND p1 (NOT p0)), false, true, (AND p1 p0), (NOT p1)]
Product exploration explored 100000 steps with 25032 reset in 670 ms.
Product exploration explored 100000 steps with 25030 reset in 821 ms.
Applying partial POR strategy [false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 324 ms :[(NOT p1), (NOT p1), (AND p1 (NOT p0)), false, true, (AND p1 p0), (NOT p1)]
Support contains 4 out of 1984 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Performed 503 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 503 rules applied. Total rules applied 503 place count 1984 transition count 3096
Performed 398 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 398 Pre rules applied. Total rules applied 503 place count 1984 transition count 3389
Deduced a syphon composed of 901 places in 3 ms
Iterating global reduction 1 with 398 rules applied. Total rules applied 901 place count 1984 transition count 3389
Discarding 203 places :
Symmetric choice reduction at 1 with 203 rule applications. Total rules 1104 place count 1781 transition count 3186
Deduced a syphon composed of 698 places in 3 ms
Iterating global reduction 1 with 203 rules applied. Total rules applied 1307 place count 1781 transition count 3186
Performed 494 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1192 places in 3 ms
Iterating global reduction 1 with 494 rules applied. Total rules applied 1801 place count 1781 transition count 3186
Discarding 445 places :
Symmetric choice reduction at 1 with 445 rule applications. Total rules 2246 place count 1336 transition count 2741
Deduced a syphon composed of 747 places in 3 ms
Iterating global reduction 1 with 445 rules applied. Total rules applied 2691 place count 1336 transition count 2741
Deduced a syphon composed of 747 places in 2 ms
Applied a total of 2691 rules in 764 ms. Remains 1336 /1984 variables (removed 648) and now considering 2741/3096 (removed 355) transitions.
[2024-06-01 22:08:27] [INFO ] Redundant transitions in 117 ms returned []
Running 2733 sub problems to find dead transitions.
[2024-06-01 22:08:27] [INFO ] Flow matrix only has 2405 transitions (discarded 336 similar events)
// Phase 1: matrix 2405 rows 1336 cols
[2024-06-01 22:08:27] [INFO ] Computed 23 invariants in 7 ms
[2024-06-01 22:08:27] [INFO ] State equation strengthened by 790 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2733 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1336/3741 variables, and 23 constraints, problems are : Problem set: 0 solved, 2733 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/1336 constraints, ReadFeed: 0/790 constraints, PredecessorRefiner: 2733/2733 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2733 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1336 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2733 unsolved
[2024-06-01 22:09:03] [INFO ] Deduced a trap composed of 27 places in 1470 ms of which 15 ms to minimize.
[2024-06-01 22:09:05] [INFO ] Deduced a trap composed of 17 places in 1656 ms of which 16 ms to minimize.
[2024-06-01 22:09:06] [INFO ] Deduced a trap composed of 14 places in 1541 ms of which 17 ms to minimize.
[2024-06-01 22:09:08] [INFO ] Deduced a trap composed of 24 places in 1325 ms of which 10 ms to minimize.
[2024-06-01 22:09:09] [INFO ] Deduced a trap composed of 21 places in 1039 ms of which 10 ms to minimize.
[2024-06-01 22:09:10] [INFO ] Deduced a trap composed of 41 places in 1592 ms of which 17 ms to minimize.
[2024-06-01 22:09:12] [INFO ] Deduced a trap composed of 49 places in 1770 ms of which 16 ms to minimize.
[2024-06-01 22:09:14] [INFO ] Deduced a trap composed of 68 places in 1550 ms of which 16 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 22:09:16] [INFO ] Deduced a trap composed of 34 places in 1618 ms of which 15 ms to minimize.
[2024-06-01 22:09:17] [INFO ] Deduced a trap composed of 26 places in 1622 ms of which 17 ms to minimize.
[2024-06-01 22:09:19] [INFO ] Deduced a trap composed of 41 places in 1535 ms of which 14 ms to minimize.
[2024-06-01 22:09:20] [INFO ] Deduced a trap composed of 32 places in 1456 ms of which 18 ms to minimize.
[2024-06-01 22:09:22] [INFO ] Deduced a trap composed of 31 places in 1812 ms of which 16 ms to minimize.
[2024-06-01 22:09:24] [INFO ] Deduced a trap composed of 48 places in 1395 ms of which 9 ms to minimize.
[2024-06-01 22:09:25] [INFO ] Deduced a trap composed of 31 places in 1301 ms of which 14 ms to minimize.
[2024-06-01 22:09:27] [INFO ] Deduced a trap composed of 101 places in 1789 ms of which 18 ms to minimize.
[2024-06-01 22:09:29] [INFO ] Deduced a trap composed of 49 places in 1930 ms of which 18 ms to minimize.
SMT process timed out in 61568ms, After SMT, problems are : Problem set: 0 solved, 2733 unsolved
Search for dead transitions found 0 dead transitions in 61596ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1336/1984 places, 2741/3096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62500 ms. Remains : 1336/1984 places, 2741/3096 transitions.
Support contains 4 out of 1984 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1984/1984 places, 3096/3096 transitions.
Applied a total of 0 rules in 123 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 22:09:29] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1984 cols
[2024-06-01 22:09:29] [INFO ] Computed 23 invariants in 14 ms
[2024-06-01 22:09:31] [INFO ] Implicit Places using invariants in 1980 ms returned []
[2024-06-01 22:09:31] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:09:31] [INFO ] Invariant cache hit.
[2024-06-01 22:09:33] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 22:09:54] [INFO ] Implicit Places using invariants and state equation in 23155 ms returned []
Implicit Place search using SMT with State Equation took 25139 ms to find 0 implicit places.
Running 3088 sub problems to find dead transitions.
[2024-06-01 22:09:54] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 22:09:54] [INFO ] Invariant cache hit.
[2024-06-01 22:09:54] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1984 variables, 1984/1984 constraints. Problems are: Problem set: 0 solved, 3088 unsolved
SMT process timed out in 31720ms, After SMT, problems are : Problem set: 0 solved, 3088 unsolved
Search for dead transitions found 0 dead transitions in 31770ms
Finished structural reductions in LTL mode , in 1 iterations and 57043 ms. Remains : 1984/1984 places, 3096/3096 transitions.
Treatment of property Peterson-PT-7-LTLCardinality-15 finished in 316863 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : Peterson-PT-7-LTLCardinality-01
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 456 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 392 place count 1992 transition count 2704
Reduce places removed 392 places and 0 transitions.
Performed 392 Post agglomeration using F-continuation condition.Transition count delta: 392
Iterating post reduction 1 with 784 rules applied. Total rules applied 1176 place count 1600 transition count 2312
Reduce places removed 392 places and 0 transitions.
Iterating post reduction 2 with 392 rules applied. Total rules applied 1568 place count 1208 transition count 2312
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 1568 place count 1208 transition count 2208
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 1776 place count 1104 transition count 2208
Applied a total of 1776 rules in 213 ms. Remains 1104 /1992 variables (removed 888) and now considering 2208/3096 (removed 888) transitions.
[2024-06-01 22:10:26] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1104 cols
[2024-06-01 22:10:27] [INFO ] Computed 31 invariants in 8 ms
[2024-06-01 22:10:28] [INFO ] Implicit Places using invariants in 1067 ms returned [1088, 1089, 1090, 1091, 1092, 1101, 1102, 1103]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1070 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1096/1992 places, 2208/3096 transitions.
Applied a total of 0 rules in 36 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1320 ms. Remains : 1096/1992 places, 2208/3096 transitions.
Running random walk in product with property : Peterson-PT-7-LTLCardinality-01
Product exploration explored 100000 steps with 25000 reset in 1012 ms.
Product exploration explored 100000 steps with 25000 reset in 757 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 147 steps (0 resets) in 8 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 99 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 456 out of 1096 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 20 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2024-06-01 22:10:30] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2024-06-01 22:10:30] [INFO ] Computed 23 invariants in 7 ms
[2024-06-01 22:10:31] [INFO ] Implicit Places using invariants in 1362 ms returned []
[2024-06-01 22:10:31] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-06-01 22:10:31] [INFO ] Invariant cache hit.
[2024-06-01 22:10:33] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 22:10:39] [INFO ] Implicit Places using invariants and state equation in 7889 ms returned []
Implicit Place search using SMT with State Equation took 9259 ms to find 0 implicit places.
Running 2200 sub problems to find dead transitions.
[2024-06-01 22:10:39] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-06-01 22:10:39] [INFO ] Invariant cache hit.
[2024-06-01 22:10:39] [INFO ] State equation strengthened by 497 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/1096 variables, 1096/1096 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
SMT process timed out in 31201ms, After SMT, problems are : Problem set: 0 solved, 2200 unsolved
Search for dead transitions found 0 dead transitions in 31232ms
Finished structural reductions in LTL mode , in 1 iterations and 40517 ms. Remains : 1096/1096 places, 2208/2208 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 175 steps (0 resets) in 8 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 128 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 1015 ms.
Product exploration explored 100000 steps with 25000 reset in 719 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 456 out of 1096 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 47 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2024-06-01 22:11:14] [INFO ] Redundant transitions in 94 ms returned []
Running 2200 sub problems to find dead transitions.
[2024-06-01 22:11:14] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-06-01 22:11:14] [INFO ] Invariant cache hit.
[2024-06-01 22:11:14] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1096 variables, 1096/1096 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
SMT process timed out in 31129ms, After SMT, problems are : Problem set: 0 solved, 2200 unsolved
Search for dead transitions found 0 dead transitions in 31165ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31322 ms. Remains : 1096/1096 places, 2208/2208 transitions.
Support contains 456 out of 1096 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 13 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2024-06-01 22:11:45] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-06-01 22:11:45] [INFO ] Invariant cache hit.
[2024-06-01 22:11:46] [INFO ] Implicit Places using invariants in 1072 ms returned []
[2024-06-01 22:11:46] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-06-01 22:11:46] [INFO ] Invariant cache hit.
[2024-06-01 22:11:47] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 22:11:53] [INFO ] Implicit Places using invariants and state equation in 7288 ms returned []
Implicit Place search using SMT with State Equation took 8363 ms to find 0 implicit places.
Running 2200 sub problems to find dead transitions.
[2024-06-01 22:11:53] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2024-06-01 22:11:53] [INFO ] Invariant cache hit.
[2024-06-01 22:11:53] [INFO ] State equation strengthened by 497 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/1096 variables, 1096/1096 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
SMT process timed out in 30924ms, After SMT, problems are : Problem set: 0 solved, 2200 unsolved
Search for dead transitions found 0 dead transitions in 30949ms
Finished structural reductions in LTL mode , in 1 iterations and 39329 ms. Remains : 1096/1096 places, 2208/2208 transitions.
Treatment of property Peterson-PT-7-LTLCardinality-01 finished in 118534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(!p1)||p0)) U G(p1))))'
Found a Lengthening insensitive property : Peterson-PT-7-LTLCardinality-15
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (NOT p1), (AND p1 (NOT p0)), false, true, (AND p1 p0), (NOT p1)]
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 894 transitions
Trivial Post-agglo rules discarded 894 transitions
Performed 894 trivial Post agglomeration. Transition count delta: 894
Iterating post reduction 0 with 894 rules applied. Total rules applied 894 place count 1992 transition count 2202
Reduce places removed 894 places and 0 transitions.
Iterating post reduction 1 with 894 rules applied. Total rules applied 1788 place count 1098 transition count 2202
Performed 445 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 445 Pre rules applied. Total rules applied 1788 place count 1098 transition count 1757
Deduced a syphon composed of 445 places in 1 ms
Reduce places removed 445 places and 0 transitions.
Iterating global reduction 2 with 890 rules applied. Total rules applied 2678 place count 653 transition count 1757
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2790 place count 597 transition count 1701
Applied a total of 2790 rules in 156 ms. Remains 597 /1992 variables (removed 1395) and now considering 1701/3096 (removed 1395) transitions.
[2024-06-01 22:12:25] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
// Phase 1: matrix 1365 rows 597 cols
[2024-06-01 22:12:25] [INFO ] Computed 31 invariants in 3 ms
[2024-06-01 22:12:26] [INFO ] Implicit Places using invariants in 905 ms returned [581, 582, 583, 584, 585, 594, 595, 596]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 911 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 589/1992 places, 1701/3096 transitions.
Applied a total of 0 rules in 18 ms. Remains 589 /589 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1087 ms. Remains : 589/1992 places, 1701/3096 transitions.
Running random walk in product with property : Peterson-PT-7-LTLCardinality-15
Product exploration explored 100000 steps with 24953 reset in 440 ms.
Product exploration explored 100000 steps with 24957 reset in 407 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 99 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (NOT p1), (AND p1 (NOT p0)), false, true, (AND p1 p0), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 134 ms. (296 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
[2024-06-01 22:12:27] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
// Phase 1: matrix 1365 rows 589 cols
[2024-06-01 22:12:27] [INFO ] Computed 23 invariants in 3 ms
[2024-06-01 22:12:27] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 131/135 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 131/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/137 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 345/482 variables, 137/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 28/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 350/832 variables, 56/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/832 variables, 56/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/832 variables, 7/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/832 variables, 7/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/832 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 546/1378 variables, 84/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1378 variables, 84/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1378 variables, 462/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1378 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 306/1684 variables, 6/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1684 variables, 306/1374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1684 variables, 0/1374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/1690 variables, 6/1380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1690 variables, 6/1386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1690 variables, 0/1386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 264/1954 variables, 312/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1954 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1954 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1954/1954 variables, and 1698 constraints, problems are : Problem set: 0 solved, 1 unsolved in 847 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 589/589 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 131/135 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 131/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/137 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 345/482 variables, 137/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 28/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 350/832 variables, 56/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/832 variables, 56/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/832 variables, 7/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/832 variables, 7/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/832 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:12:28] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 2 ms to minimize.
[2024-06-01 22:12:29] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 3 ms to minimize.
[2024-06-01 22:12:29] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 2 ms to minimize.
[2024-06-01 22:12:29] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/832 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/832 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 546/1378 variables, 84/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1378 variables, 84/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1378 variables, 462/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1378 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 306/1684 variables, 6/1073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1684 variables, 306/1379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:12:30] [INFO ] Deduced a trap composed of 33 places in 417 ms of which 5 ms to minimize.
[2024-06-01 22:12:30] [INFO ] Deduced a trap composed of 28 places in 419 ms of which 5 ms to minimize.
[2024-06-01 22:12:31] [INFO ] Deduced a trap composed of 39 places in 409 ms of which 5 ms to minimize.
[2024-06-01 22:12:31] [INFO ] Deduced a trap composed of 34 places in 303 ms of which 4 ms to minimize.
[2024-06-01 22:12:31] [INFO ] Deduced a trap composed of 43 places in 353 ms of which 4 ms to minimize.
[2024-06-01 22:12:32] [INFO ] Deduced a trap composed of 49 places in 309 ms of which 4 ms to minimize.
[2024-06-01 22:12:32] [INFO ] Deduced a trap composed of 60 places in 271 ms of which 3 ms to minimize.
[2024-06-01 22:12:32] [INFO ] Deduced a trap composed of 57 places in 266 ms of which 3 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1684 variables, 8/1387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1684 variables, 0/1387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 6/1690 variables, 6/1393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1690 variables, 6/1399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1690 variables, 0/1399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 264/1954 variables, 312/1711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:12:33] [INFO ] Deduced a trap composed of 11 places in 400 ms of which 5 ms to minimize.
[2024-06-01 22:12:33] [INFO ] Deduced a trap composed of 20 places in 387 ms of which 5 ms to minimize.
SMT process timed out in 6146ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 589 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 589/589 places, 1701/1701 transitions.
Applied a total of 0 rules in 24 ms. Remains 589 /589 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 589/589 places, 1701/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 520533 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 1
Probabilistic random walk after 520533 steps, saw 76658 distinct states, run finished after 3008 ms. (steps per millisecond=173 ) properties seen :0
[2024-06-01 22:12:36] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2024-06-01 22:12:36] [INFO ] Invariant cache hit.
[2024-06-01 22:12:36] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 131/135 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 131/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/137 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 345/482 variables, 137/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 28/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 350/832 variables, 56/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/832 variables, 56/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/832 variables, 7/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/832 variables, 7/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/832 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 546/1378 variables, 84/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1378 variables, 84/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1378 variables, 462/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1378 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 306/1684 variables, 6/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1684 variables, 306/1374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1684 variables, 0/1374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/1690 variables, 6/1380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1690 variables, 6/1386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1690 variables, 0/1386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 264/1954 variables, 312/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1954 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1954 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1954/1954 variables, and 1698 constraints, problems are : Problem set: 0 solved, 1 unsolved in 804 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 589/589 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 131/135 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 131/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/137 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 345/482 variables, 137/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 28/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 350/832 variables, 56/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/832 variables, 56/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/832 variables, 7/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/832 variables, 7/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/832 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:12:38] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 2 ms to minimize.
[2024-06-01 22:12:38] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 2 ms to minimize.
[2024-06-01 22:12:38] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 3 ms to minimize.
[2024-06-01 22:12:38] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/832 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/832 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 546/1378 variables, 84/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1378 variables, 84/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1378 variables, 462/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1378 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 306/1684 variables, 6/1073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1684 variables, 306/1379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:12:39] [INFO ] Deduced a trap composed of 31 places in 373 ms of which 5 ms to minimize.
[2024-06-01 22:12:39] [INFO ] Deduced a trap composed of 49 places in 304 ms of which 4 ms to minimize.
[2024-06-01 22:12:40] [INFO ] Deduced a trap composed of 48 places in 310 ms of which 4 ms to minimize.
[2024-06-01 22:12:40] [INFO ] Deduced a trap composed of 62 places in 252 ms of which 3 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1684 variables, 4/1383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1684 variables, 0/1383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 6/1690 variables, 6/1389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1690 variables, 6/1395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1690 variables, 0/1395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 264/1954 variables, 312/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:12:41] [INFO ] Deduced a trap composed of 11 places in 415 ms of which 5 ms to minimize.
[2024-06-01 22:12:41] [INFO ] Deduced a trap composed of 12 places in 427 ms of which 5 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1954 variables, 2/1709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1954 variables, 0/1709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/1954 variables, 0/1709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1954/1954 variables, and 1709 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4024 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 589/589 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 4851ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 4 out of 589 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 589/589 places, 1701/1701 transitions.
Applied a total of 0 rules in 24 ms. Remains 589 /589 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 589/589 places, 1701/1701 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 589/589 places, 1701/1701 transitions.
Applied a total of 0 rules in 23 ms. Remains 589 /589 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
[2024-06-01 22:12:41] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2024-06-01 22:12:41] [INFO ] Invariant cache hit.
[2024-06-01 22:12:42] [INFO ] Implicit Places using invariants in 839 ms returned []
[2024-06-01 22:12:42] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2024-06-01 22:12:42] [INFO ] Invariant cache hit.
[2024-06-01 22:12:43] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 22:12:46] [INFO ] Implicit Places using invariants and state equation in 3928 ms returned []
Implicit Place search using SMT with State Equation took 4773 ms to find 0 implicit places.
[2024-06-01 22:12:46] [INFO ] Redundant transitions in 38 ms returned []
Running 1693 sub problems to find dead transitions.
[2024-06-01 22:12:46] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2024-06-01 22:12:46] [INFO ] Invariant cache hit.
[2024-06-01 22:12:46] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/589 variables, 589/589 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/589 variables, 23/612 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
[2024-06-01 22:13:08] [INFO ] Deduced a trap composed of 11 places in 532 ms of which 6 ms to minimize.
[2024-06-01 22:13:09] [INFO ] Deduced a trap composed of 11 places in 522 ms of which 5 ms to minimize.
[2024-06-01 22:13:09] [INFO ] Deduced a trap composed of 29 places in 492 ms of which 5 ms to minimize.
[2024-06-01 22:13:10] [INFO ] Deduced a trap composed of 40 places in 468 ms of which 6 ms to minimize.
[2024-06-01 22:13:10] [INFO ] Deduced a trap composed of 24 places in 480 ms of which 5 ms to minimize.
[2024-06-01 22:13:11] [INFO ] Deduced a trap composed of 55 places in 395 ms of which 5 ms to minimize.
[2024-06-01 22:13:11] [INFO ] Deduced a trap composed of 20 places in 440 ms of which 5 ms to minimize.
[2024-06-01 22:13:12] [INFO ] Deduced a trap composed of 59 places in 448 ms of which 5 ms to minimize.
[2024-06-01 22:13:12] [INFO ] Deduced a trap composed of 68 places in 313 ms of which 4 ms to minimize.
[2024-06-01 22:13:12] [INFO ] Deduced a trap composed of 80 places in 321 ms of which 4 ms to minimize.
[2024-06-01 22:13:13] [INFO ] Deduced a trap composed of 64 places in 310 ms of which 4 ms to minimize.
[2024-06-01 22:13:13] [INFO ] Deduced a trap composed of 40 places in 332 ms of which 4 ms to minimize.
[2024-06-01 22:13:13] [INFO ] Deduced a trap composed of 55 places in 413 ms of which 4 ms to minimize.
[2024-06-01 22:13:14] [INFO ] Deduced a trap composed of 11 places in 412 ms of which 5 ms to minimize.
[2024-06-01 22:13:14] [INFO ] Deduced a trap composed of 14 places in 446 ms of which 5 ms to minimize.
[2024-06-01 22:13:15] [INFO ] Deduced a trap composed of 16 places in 459 ms of which 5 ms to minimize.
[2024-06-01 22:13:15] [INFO ] Deduced a trap composed of 52 places in 440 ms of which 5 ms to minimize.
[2024-06-01 22:13:16] [INFO ] Deduced a trap composed of 45 places in 434 ms of which 5 ms to minimize.
[2024-06-01 22:13:16] [INFO ] Deduced a trap composed of 14 places in 446 ms of which 7 ms to minimize.
[2024-06-01 22:13:17] [INFO ] Deduced a trap composed of 38 places in 408 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 20/632 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 589/1954 variables, and 632 constraints, problems are : Problem set: 0 solved, 1693 unsolved in 30031 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/589 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1693/1693 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1693 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/589 variables, 589/589 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/589 variables, 23/612 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 20/632 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
[2024-06-01 22:13:20] [INFO ] Deduced a trap composed of 14 places in 506 ms of which 6 ms to minimize.
[2024-06-01 22:13:21] [INFO ] Deduced a trap composed of 13 places in 508 ms of which 6 ms to minimize.
[2024-06-01 22:13:21] [INFO ] Deduced a trap composed of 29 places in 496 ms of which 6 ms to minimize.
[2024-06-01 22:13:22] [INFO ] Deduced a trap composed of 20 places in 493 ms of which 5 ms to minimize.
[2024-06-01 22:13:22] [INFO ] Deduced a trap composed of 51 places in 520 ms of which 5 ms to minimize.
[2024-06-01 22:13:23] [INFO ] Deduced a trap composed of 29 places in 478 ms of which 5 ms to minimize.
[2024-06-01 22:13:23] [INFO ] Deduced a trap composed of 21 places in 509 ms of which 5 ms to minimize.
[2024-06-01 22:13:24] [INFO ] Deduced a trap composed of 29 places in 516 ms of which 6 ms to minimize.
[2024-06-01 22:13:24] [INFO ] Deduced a trap composed of 22 places in 512 ms of which 6 ms to minimize.
[2024-06-01 22:13:25] [INFO ] Deduced a trap composed of 38 places in 509 ms of which 6 ms to minimize.
[2024-06-01 22:13:25] [INFO ] Deduced a trap composed of 31 places in 500 ms of which 5 ms to minimize.
[2024-06-01 22:13:26] [INFO ] Deduced a trap composed of 32 places in 459 ms of which 5 ms to minimize.
[2024-06-01 22:13:26] [INFO ] Deduced a trap composed of 20 places in 442 ms of which 5 ms to minimize.
[2024-06-01 22:13:27] [INFO ] Deduced a trap composed of 23 places in 410 ms of which 5 ms to minimize.
[2024-06-01 22:13:27] [INFO ] Deduced a trap composed of 55 places in 362 ms of which 4 ms to minimize.
[2024-06-01 22:13:28] [INFO ] Deduced a trap composed of 66 places in 476 ms of which 5 ms to minimize.
[2024-06-01 22:13:28] [INFO ] Deduced a trap composed of 40 places in 477 ms of which 5 ms to minimize.
[2024-06-01 22:13:29] [INFO ] Deduced a trap composed of 54 places in 463 ms of which 6 ms to minimize.
[2024-06-01 22:13:29] [INFO ] Deduced a trap composed of 25 places in 409 ms of which 5 ms to minimize.
[2024-06-01 22:13:29] [INFO ] Deduced a trap composed of 82 places in 307 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/589 variables, 20/652 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
[2024-06-01 22:13:31] [INFO ] Deduced a trap composed of 23 places in 447 ms of which 5 ms to minimize.
[2024-06-01 22:13:31] [INFO ] Deduced a trap composed of 23 places in 516 ms of which 5 ms to minimize.
[2024-06-01 22:13:32] [INFO ] Deduced a trap composed of 37 places in 506 ms of which 6 ms to minimize.
[2024-06-01 22:13:32] [INFO ] Deduced a trap composed of 36 places in 494 ms of which 5 ms to minimize.
[2024-06-01 22:13:33] [INFO ] Deduced a trap composed of 25 places in 386 ms of which 5 ms to minimize.
[2024-06-01 22:13:33] [INFO ] Deduced a trap composed of 58 places in 512 ms of which 5 ms to minimize.
[2024-06-01 22:13:34] [INFO ] Deduced a trap composed of 31 places in 419 ms of which 5 ms to minimize.
[2024-06-01 22:13:34] [INFO ] Deduced a trap composed of 61 places in 472 ms of which 5 ms to minimize.
[2024-06-01 22:13:35] [INFO ] Deduced a trap composed of 21 places in 457 ms of which 6 ms to minimize.
[2024-06-01 22:13:35] [INFO ] Deduced a trap composed of 20 places in 520 ms of which 6 ms to minimize.
[2024-06-01 22:13:36] [INFO ] Deduced a trap composed of 33 places in 523 ms of which 5 ms to minimize.
[2024-06-01 22:13:36] [INFO ] Deduced a trap composed of 55 places in 491 ms of which 6 ms to minimize.
[2024-06-01 22:13:37] [INFO ] Deduced a trap composed of 24 places in 482 ms of which 5 ms to minimize.
[2024-06-01 22:13:37] [INFO ] Deduced a trap composed of 20 places in 484 ms of which 5 ms to minimize.
[2024-06-01 22:13:38] [INFO ] Deduced a trap composed of 32 places in 457 ms of which 5 ms to minimize.
[2024-06-01 22:13:38] [INFO ] Deduced a trap composed of 39 places in 477 ms of which 5 ms to minimize.
[2024-06-01 22:13:39] [INFO ] Deduced a trap composed of 29 places in 446 ms of which 5 ms to minimize.
[2024-06-01 22:13:39] [INFO ] Deduced a trap composed of 57 places in 424 ms of which 5 ms to minimize.
[2024-06-01 22:13:39] [INFO ] Deduced a trap composed of 40 places in 461 ms of which 5 ms to minimize.
[2024-06-01 22:13:40] [INFO ] Deduced a trap composed of 11 places in 458 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/589 variables, 20/672 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
[2024-06-01 22:13:42] [INFO ] Deduced a trap composed of 86 places in 486 ms of which 5 ms to minimize.
[2024-06-01 22:13:42] [INFO ] Deduced a trap composed of 20 places in 437 ms of which 5 ms to minimize.
[2024-06-01 22:13:43] [INFO ] Deduced a trap composed of 69 places in 446 ms of which 5 ms to minimize.
[2024-06-01 22:13:43] [INFO ] Deduced a trap composed of 59 places in 453 ms of which 5 ms to minimize.
[2024-06-01 22:13:44] [INFO ] Deduced a trap composed of 53 places in 451 ms of which 5 ms to minimize.
[2024-06-01 22:13:44] [INFO ] Deduced a trap composed of 50 places in 435 ms of which 4 ms to minimize.
[2024-06-01 22:13:45] [INFO ] Deduced a trap composed of 20 places in 394 ms of which 5 ms to minimize.
[2024-06-01 22:13:45] [INFO ] Deduced a trap composed of 25 places in 416 ms of which 5 ms to minimize.
[2024-06-01 22:13:46] [INFO ] Deduced a trap composed of 19 places in 486 ms of which 5 ms to minimize.
[2024-06-01 22:13:46] [INFO ] Deduced a trap composed of 40 places in 402 ms of which 5 ms to minimize.
[2024-06-01 22:13:46] [INFO ] Deduced a trap composed of 62 places in 416 ms of which 5 ms to minimize.
[2024-06-01 22:13:47] [INFO ] Deduced a trap composed of 70 places in 418 ms of which 4 ms to minimize.
[2024-06-01 22:13:47] [INFO ] Deduced a trap composed of 31 places in 410 ms of which 5 ms to minimize.
SMT process timed out in 60992ms, After SMT, problems are : Problem set: 0 solved, 1693 unsolved
Search for dead transitions found 0 dead transitions in 61008ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65858 ms. Remains : 589/589 places, 1701/1701 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1287 edges and 589 vertex of which 447 / 589 are part of one of the 56 SCC in 0 ms
Free SCC test removed 391 places
Drop transitions (Empty/Sink Transition effects.) removed 782 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1173 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 198 transition count 473
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 143 transition count 473
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 113 place count 142 transition count 472
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 139 place count 125 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 62 edges and 125 vertex of which 48 / 125 are part of one of the 6 SCC in 0 ms
Free SCC test removed 42 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 141 place count 83 transition count 470
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (trivial) has 308 edges and 77 vertex of which 42 / 77 are part of one of the 7 SCC in 0 ms
Free SCC test removed 35 places
Iterating post reduction 1 with 55 rules applied. Total rules applied 196 place count 42 transition count 422
Drop transitions (Empty/Sink Transition effects.) removed 210 transitions
Ensure Unique test removed 145 transitions
Reduce isomorphic transitions removed 355 transitions.
Iterating post reduction 2 with 355 rules applied. Total rules applied 551 place count 42 transition count 67
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 558 place count 42 transition count 68
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 580 place count 35 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 595 place count 35 transition count 38
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 599 place count 35 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 600 place count 35 transition count 37
Applied a total of 600 rules in 26 ms. Remains 35 /589 variables (removed 554) and now considering 37/1701 (removed 1664) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 37 rows 35 cols
[2024-06-01 22:13:47] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 22:13:47] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 22:13:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-01 22:13:47] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 22:13:47] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 22:13:47] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 122 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND p1 p0))), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 241 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (NOT p1), (AND p1 (NOT p0)), false, true, (AND p1 p0), (NOT p1)]
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p1), (AND p1 (NOT p0)), false, true, (AND p1 p0), (NOT p1)]
Support contains 4 out of 589 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 589/589 places, 1701/1701 transitions.
Applied a total of 0 rules in 11 ms. Remains 589 /589 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
[2024-06-01 22:13:48] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
// Phase 1: matrix 1365 rows 589 cols
[2024-06-01 22:13:48] [INFO ] Computed 23 invariants in 2 ms
[2024-06-01 22:13:49] [INFO ] Implicit Places using invariants in 820 ms returned []
[2024-06-01 22:13:49] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2024-06-01 22:13:49] [INFO ] Invariant cache hit.
[2024-06-01 22:13:49] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 22:13:53] [INFO ] Implicit Places using invariants and state equation in 3934 ms returned []
Implicit Place search using SMT with State Equation took 4769 ms to find 0 implicit places.
Running 1693 sub problems to find dead transitions.
[2024-06-01 22:13:53] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2024-06-01 22:13:53] [INFO ] Invariant cache hit.
[2024-06-01 22:13:53] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/589 variables, 589/589 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/589 variables, 23/612 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
[2024-06-01 22:14:14] [INFO ] Deduced a trap composed of 11 places in 469 ms of which 6 ms to minimize.
[2024-06-01 22:14:15] [INFO ] Deduced a trap composed of 11 places in 477 ms of which 5 ms to minimize.
[2024-06-01 22:14:15] [INFO ] Deduced a trap composed of 29 places in 497 ms of which 6 ms to minimize.
[2024-06-01 22:14:16] [INFO ] Deduced a trap composed of 40 places in 467 ms of which 5 ms to minimize.
[2024-06-01 22:14:16] [INFO ] Deduced a trap composed of 24 places in 509 ms of which 6 ms to minimize.
[2024-06-01 22:14:17] [INFO ] Deduced a trap composed of 55 places in 449 ms of which 5 ms to minimize.
[2024-06-01 22:14:17] [INFO ] Deduced a trap composed of 20 places in 447 ms of which 5 ms to minimize.
[2024-06-01 22:14:18] [INFO ] Deduced a trap composed of 59 places in 373 ms of which 4 ms to minimize.
[2024-06-01 22:14:18] [INFO ] Deduced a trap composed of 68 places in 311 ms of which 4 ms to minimize.
[2024-06-01 22:14:18] [INFO ] Deduced a trap composed of 80 places in 352 ms of which 4 ms to minimize.
[2024-06-01 22:14:19] [INFO ] Deduced a trap composed of 64 places in 362 ms of which 5 ms to minimize.
[2024-06-01 22:14:19] [INFO ] Deduced a trap composed of 40 places in 331 ms of which 4 ms to minimize.
[2024-06-01 22:14:19] [INFO ] Deduced a trap composed of 55 places in 406 ms of which 4 ms to minimize.
[2024-06-01 22:14:20] [INFO ] Deduced a trap composed of 11 places in 412 ms of which 5 ms to minimize.
[2024-06-01 22:14:20] [INFO ] Deduced a trap composed of 14 places in 452 ms of which 5 ms to minimize.
[2024-06-01 22:14:21] [INFO ] Deduced a trap composed of 16 places in 438 ms of which 5 ms to minimize.
[2024-06-01 22:14:21] [INFO ] Deduced a trap composed of 52 places in 445 ms of which 4 ms to minimize.
[2024-06-01 22:14:22] [INFO ] Deduced a trap composed of 45 places in 448 ms of which 5 ms to minimize.
[2024-06-01 22:14:22] [INFO ] Deduced a trap composed of 14 places in 403 ms of which 5 ms to minimize.
[2024-06-01 22:14:23] [INFO ] Deduced a trap composed of 38 places in 444 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 20/632 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
[2024-06-01 22:14:24] [INFO ] Deduced a trap composed of 11 places in 470 ms of which 5 ms to minimize.
SMT process timed out in 31087ms, After SMT, problems are : Problem set: 0 solved, 1693 unsolved
Search for dead transitions found 0 dead transitions in 31104ms
Finished structural reductions in LTL mode , in 1 iterations and 35887 ms. Remains : 589/589 places, 1701/1701 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 105 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (NOT p1), (AND p1 (NOT p0)), false, true, (AND p1 p0), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 228 ms. (174 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
[2024-06-01 22:14:24] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2024-06-01 22:14:24] [INFO ] Invariant cache hit.
[2024-06-01 22:14:24] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 131/135 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 131/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/137 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 345/482 variables, 137/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 28/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 350/832 variables, 56/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/832 variables, 56/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/832 variables, 7/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/832 variables, 7/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/832 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 546/1378 variables, 84/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1378 variables, 84/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1378 variables, 462/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1378 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 306/1684 variables, 6/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1684 variables, 306/1374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1684 variables, 0/1374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/1690 variables, 6/1380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1690 variables, 6/1386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1690 variables, 0/1386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 264/1954 variables, 312/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1954 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1954 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1954/1954 variables, and 1698 constraints, problems are : Problem set: 0 solved, 1 unsolved in 799 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 589/589 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 131/135 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 131/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/137 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 345/482 variables, 137/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 28/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 350/832 variables, 56/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/832 variables, 56/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/832 variables, 7/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/832 variables, 7/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/832 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:14:26] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 2 ms to minimize.
[2024-06-01 22:14:26] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 3 ms to minimize.
[2024-06-01 22:14:26] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 2 ms to minimize.
[2024-06-01 22:14:26] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/832 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/832 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 546/1378 variables, 84/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1378 variables, 84/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1378 variables, 462/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1378 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 306/1684 variables, 6/1073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1684 variables, 306/1379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:14:27] [INFO ] Deduced a trap composed of 31 places in 347 ms of which 4 ms to minimize.
[2024-06-01 22:14:27] [INFO ] Deduced a trap composed of 49 places in 318 ms of which 4 ms to minimize.
[2024-06-01 22:14:27] [INFO ] Deduced a trap composed of 48 places in 310 ms of which 4 ms to minimize.
[2024-06-01 22:14:28] [INFO ] Deduced a trap composed of 62 places in 288 ms of which 4 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1684 variables, 4/1383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1684 variables, 0/1383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 6/1690 variables, 6/1389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1690 variables, 6/1395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1690 variables, 0/1395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 264/1954 variables, 312/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:14:29] [INFO ] Deduced a trap composed of 11 places in 385 ms of which 4 ms to minimize.
[2024-06-01 22:14:29] [INFO ] Deduced a trap composed of 12 places in 387 ms of which 5 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1954 variables, 2/1709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1954 variables, 0/1709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/1954 variables, 0/1709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1954/1954 variables, and 1709 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4029 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 589/589 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 4850ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 4 out of 589 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 589/589 places, 1701/1701 transitions.
Applied a total of 0 rules in 24 ms. Remains 589 /589 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 589/589 places, 1701/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 519507 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 1
Probabilistic random walk after 519507 steps, saw 76528 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
[2024-06-01 22:14:32] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2024-06-01 22:14:32] [INFO ] Invariant cache hit.
[2024-06-01 22:14:32] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 131/135 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 131/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/137 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 345/482 variables, 137/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 28/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 350/832 variables, 56/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/832 variables, 56/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/832 variables, 7/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/832 variables, 7/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/832 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 546/1378 variables, 84/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1378 variables, 84/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1378 variables, 462/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1378 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 306/1684 variables, 6/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1684 variables, 306/1374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1684 variables, 0/1374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/1690 variables, 6/1380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1690 variables, 6/1386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1690 variables, 0/1386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 264/1954 variables, 312/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1954 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1954 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1954/1954 variables, and 1698 constraints, problems are : Problem set: 0 solved, 1 unsolved in 845 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 589/589 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 131/135 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 131/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/137 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 345/482 variables, 137/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 28/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 350/832 variables, 56/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/832 variables, 56/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/832 variables, 7/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/832 variables, 7/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/832 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:14:34] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 3 ms to minimize.
[2024-06-01 22:14:34] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 2 ms to minimize.
[2024-06-01 22:14:34] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 2 ms to minimize.
[2024-06-01 22:14:34] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/832 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/832 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 546/1378 variables, 84/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1378 variables, 84/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1378 variables, 462/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1378 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 306/1684 variables, 6/1073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1684 variables, 306/1379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:14:35] [INFO ] Deduced a trap composed of 31 places in 387 ms of which 4 ms to minimize.
[2024-06-01 22:14:35] [INFO ] Deduced a trap composed of 49 places in 284 ms of which 4 ms to minimize.
[2024-06-01 22:14:35] [INFO ] Deduced a trap composed of 48 places in 307 ms of which 4 ms to minimize.
[2024-06-01 22:14:36] [INFO ] Deduced a trap composed of 62 places in 293 ms of which 4 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1684 variables, 4/1383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1684 variables, 0/1383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 6/1690 variables, 6/1389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1690 variables, 6/1395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1690 variables, 0/1395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 264/1954 variables, 312/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:14:37] [INFO ] Deduced a trap composed of 11 places in 425 ms of which 5 ms to minimize.
[2024-06-01 22:14:37] [INFO ] Deduced a trap composed of 12 places in 430 ms of which 5 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1954 variables, 2/1709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1954 variables, 0/1709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/1954 variables, 0/1709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1954/1954 variables, and 1709 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4007 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 589/589 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 4881ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 4 out of 589 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 589/589 places, 1701/1701 transitions.
Applied a total of 0 rules in 24 ms. Remains 589 /589 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 589/589 places, 1701/1701 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 589/589 places, 1701/1701 transitions.
Applied a total of 0 rules in 24 ms. Remains 589 /589 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
[2024-06-01 22:14:37] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2024-06-01 22:14:37] [INFO ] Invariant cache hit.
[2024-06-01 22:14:38] [INFO ] Implicit Places using invariants in 892 ms returned []
[2024-06-01 22:14:38] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2024-06-01 22:14:38] [INFO ] Invariant cache hit.
[2024-06-01 22:14:39] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 22:14:42] [INFO ] Implicit Places using invariants and state equation in 3959 ms returned []
Implicit Place search using SMT with State Equation took 4861 ms to find 0 implicit places.
[2024-06-01 22:14:42] [INFO ] Redundant transitions in 38 ms returned []
Running 1693 sub problems to find dead transitions.
[2024-06-01 22:14:42] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2024-06-01 22:14:42] [INFO ] Invariant cache hit.
[2024-06-01 22:14:42] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/589 variables, 589/589 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/589 variables, 23/612 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
[2024-06-01 22:15:04] [INFO ] Deduced a trap composed of 11 places in 530 ms of which 6 ms to minimize.
[2024-06-01 22:15:05] [INFO ] Deduced a trap composed of 11 places in 526 ms of which 5 ms to minimize.
[2024-06-01 22:15:05] [INFO ] Deduced a trap composed of 29 places in 441 ms of which 5 ms to minimize.
[2024-06-01 22:15:06] [INFO ] Deduced a trap composed of 40 places in 496 ms of which 6 ms to minimize.
[2024-06-01 22:15:06] [INFO ] Deduced a trap composed of 24 places in 477 ms of which 5 ms to minimize.
[2024-06-01 22:15:07] [INFO ] Deduced a trap composed of 55 places in 454 ms of which 5 ms to minimize.
[2024-06-01 22:15:07] [INFO ] Deduced a trap composed of 20 places in 428 ms of which 5 ms to minimize.
[2024-06-01 22:15:08] [INFO ] Deduced a trap composed of 59 places in 371 ms of which 4 ms to minimize.
[2024-06-01 22:15:08] [INFO ] Deduced a trap composed of 68 places in 314 ms of which 4 ms to minimize.
[2024-06-01 22:15:08] [INFO ] Deduced a trap composed of 80 places in 371 ms of which 4 ms to minimize.
[2024-06-01 22:15:09] [INFO ] Deduced a trap composed of 64 places in 347 ms of which 4 ms to minimize.
[2024-06-01 22:15:09] [INFO ] Deduced a trap composed of 40 places in 327 ms of which 4 ms to minimize.
[2024-06-01 22:15:09] [INFO ] Deduced a trap composed of 55 places in 395 ms of which 4 ms to minimize.
[2024-06-01 22:15:10] [INFO ] Deduced a trap composed of 11 places in 476 ms of which 5 ms to minimize.
[2024-06-01 22:15:10] [INFO ] Deduced a trap composed of 14 places in 454 ms of which 6 ms to minimize.
[2024-06-01 22:15:11] [INFO ] Deduced a trap composed of 16 places in 436 ms of which 5 ms to minimize.
[2024-06-01 22:15:11] [INFO ] Deduced a trap composed of 52 places in 356 ms of which 5 ms to minimize.
[2024-06-01 22:15:12] [INFO ] Deduced a trap composed of 45 places in 477 ms of which 5 ms to minimize.
[2024-06-01 22:15:12] [INFO ] Deduced a trap composed of 14 places in 429 ms of which 5 ms to minimize.
[2024-06-01 22:15:13] [INFO ] Deduced a trap composed of 38 places in 461 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 20/632 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 589/1954 variables, and 632 constraints, problems are : Problem set: 0 solved, 1693 unsolved in 30030 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/589 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1693/1693 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1693 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/589 variables, 589/589 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/589 variables, 23/612 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 20/632 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
[2024-06-01 22:15:16] [INFO ] Deduced a trap composed of 14 places in 522 ms of which 6 ms to minimize.
[2024-06-01 22:15:17] [INFO ] Deduced a trap composed of 13 places in 531 ms of which 6 ms to minimize.
[2024-06-01 22:15:17] [INFO ] Deduced a trap composed of 29 places in 504 ms of which 6 ms to minimize.
[2024-06-01 22:15:18] [INFO ] Deduced a trap composed of 20 places in 501 ms of which 6 ms to minimize.
[2024-06-01 22:15:18] [INFO ] Deduced a trap composed of 51 places in 503 ms of which 5 ms to minimize.
[2024-06-01 22:15:19] [INFO ] Deduced a trap composed of 29 places in 491 ms of which 5 ms to minimize.
[2024-06-01 22:15:19] [INFO ] Deduced a trap composed of 21 places in 399 ms of which 6 ms to minimize.
[2024-06-01 22:15:20] [INFO ] Deduced a trap composed of 29 places in 509 ms of which 10 ms to minimize.
[2024-06-01 22:15:20] [INFO ] Deduced a trap composed of 22 places in 498 ms of which 5 ms to minimize.
[2024-06-01 22:15:21] [INFO ] Deduced a trap composed of 38 places in 504 ms of which 5 ms to minimize.
[2024-06-01 22:15:21] [INFO ] Deduced a trap composed of 31 places in 474 ms of which 6 ms to minimize.
[2024-06-01 22:15:22] [INFO ] Deduced a trap composed of 32 places in 465 ms of which 7 ms to minimize.
[2024-06-01 22:15:22] [INFO ] Deduced a trap composed of 20 places in 444 ms of which 5 ms to minimize.
[2024-06-01 22:15:23] [INFO ] Deduced a trap composed of 23 places in 481 ms of which 5 ms to minimize.
[2024-06-01 22:15:23] [INFO ] Deduced a trap composed of 55 places in 438 ms of which 5 ms to minimize.
[2024-06-01 22:15:24] [INFO ] Deduced a trap composed of 66 places in 461 ms of which 5 ms to minimize.
[2024-06-01 22:15:24] [INFO ] Deduced a trap composed of 40 places in 380 ms of which 5 ms to minimize.
[2024-06-01 22:15:25] [INFO ] Deduced a trap composed of 54 places in 492 ms of which 5 ms to minimize.
[2024-06-01 22:15:25] [INFO ] Deduced a trap composed of 25 places in 412 ms of which 5 ms to minimize.
[2024-06-01 22:15:25] [INFO ] Deduced a trap composed of 82 places in 302 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/589 variables, 20/652 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
[2024-06-01 22:15:27] [INFO ] Deduced a trap composed of 23 places in 490 ms of which 6 ms to minimize.
[2024-06-01 22:15:27] [INFO ] Deduced a trap composed of 23 places in 501 ms of which 5 ms to minimize.
[2024-06-01 22:15:28] [INFO ] Deduced a trap composed of 37 places in 489 ms of which 5 ms to minimize.
[2024-06-01 22:15:28] [INFO ] Deduced a trap composed of 36 places in 506 ms of which 6 ms to minimize.
[2024-06-01 22:15:29] [INFO ] Deduced a trap composed of 25 places in 505 ms of which 6 ms to minimize.
[2024-06-01 22:15:29] [INFO ] Deduced a trap composed of 58 places in 518 ms of which 6 ms to minimize.
[2024-06-01 22:15:30] [INFO ] Deduced a trap composed of 31 places in 526 ms of which 6 ms to minimize.
[2024-06-01 22:15:31] [INFO ] Deduced a trap composed of 61 places in 508 ms of which 5 ms to minimize.
[2024-06-01 22:15:31] [INFO ] Deduced a trap composed of 21 places in 510 ms of which 5 ms to minimize.
[2024-06-01 22:15:32] [INFO ] Deduced a trap composed of 20 places in 505 ms of which 6 ms to minimize.
[2024-06-01 22:15:32] [INFO ] Deduced a trap composed of 33 places in 502 ms of which 5 ms to minimize.
[2024-06-01 22:15:33] [INFO ] Deduced a trap composed of 55 places in 505 ms of which 5 ms to minimize.
[2024-06-01 22:15:33] [INFO ] Deduced a trap composed of 24 places in 507 ms of which 5 ms to minimize.
[2024-06-01 22:15:34] [INFO ] Deduced a trap composed of 20 places in 495 ms of which 6 ms to minimize.
[2024-06-01 22:15:34] [INFO ] Deduced a trap composed of 32 places in 462 ms of which 5 ms to minimize.
[2024-06-01 22:15:35] [INFO ] Deduced a trap composed of 39 places in 452 ms of which 5 ms to minimize.
[2024-06-01 22:15:35] [INFO ] Deduced a trap composed of 29 places in 470 ms of which 5 ms to minimize.
[2024-06-01 22:15:36] [INFO ] Deduced a trap composed of 57 places in 457 ms of which 5 ms to minimize.
[2024-06-01 22:15:36] [INFO ] Deduced a trap composed of 40 places in 464 ms of which 5 ms to minimize.
[2024-06-01 22:15:36] [INFO ] Deduced a trap composed of 11 places in 467 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/589 variables, 20/672 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
[2024-06-01 22:15:38] [INFO ] Deduced a trap composed of 86 places in 459 ms of which 5 ms to minimize.
[2024-06-01 22:15:39] [INFO ] Deduced a trap composed of 20 places in 424 ms of which 4 ms to minimize.
[2024-06-01 22:15:39] [INFO ] Deduced a trap composed of 69 places in 432 ms of which 5 ms to minimize.
[2024-06-01 22:15:40] [INFO ] Deduced a trap composed of 59 places in 393 ms of which 5 ms to minimize.
[2024-06-01 22:15:40] [INFO ] Deduced a trap composed of 53 places in 435 ms of which 5 ms to minimize.
[2024-06-01 22:15:41] [INFO ] Deduced a trap composed of 50 places in 415 ms of which 5 ms to minimize.
[2024-06-01 22:15:41] [INFO ] Deduced a trap composed of 20 places in 407 ms of which 5 ms to minimize.
[2024-06-01 22:15:41] [INFO ] Deduced a trap composed of 25 places in 430 ms of which 4 ms to minimize.
[2024-06-01 22:15:42] [INFO ] Deduced a trap composed of 19 places in 501 ms of which 5 ms to minimize.
[2024-06-01 22:15:42] [INFO ] Deduced a trap composed of 40 places in 377 ms of which 4 ms to minimize.
[2024-06-01 22:15:43] [INFO ] Deduced a trap composed of 62 places in 312 ms of which 5 ms to minimize.
[2024-06-01 22:15:43] [INFO ] Deduced a trap composed of 70 places in 421 ms of which 5 ms to minimize.
SMT process timed out in 60885ms, After SMT, problems are : Problem set: 0 solved, 1693 unsolved
Search for dead transitions found 0 dead transitions in 60903ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65836 ms. Remains : 589/589 places, 1701/1701 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1287 edges and 589 vertex of which 447 / 589 are part of one of the 56 SCC in 1 ms
Free SCC test removed 391 places
Drop transitions (Empty/Sink Transition effects.) removed 782 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1173 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 198 transition count 473
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 143 transition count 473
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 113 place count 142 transition count 472
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 139 place count 125 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 62 edges and 125 vertex of which 48 / 125 are part of one of the 6 SCC in 0 ms
Free SCC test removed 42 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 141 place count 83 transition count 470
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (trivial) has 308 edges and 77 vertex of which 42 / 77 are part of one of the 7 SCC in 0 ms
Free SCC test removed 35 places
Iterating post reduction 1 with 55 rules applied. Total rules applied 196 place count 42 transition count 422
Drop transitions (Empty/Sink Transition effects.) removed 210 transitions
Ensure Unique test removed 145 transitions
Reduce isomorphic transitions removed 355 transitions.
Iterating post reduction 2 with 355 rules applied. Total rules applied 551 place count 42 transition count 67
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 558 place count 42 transition count 68
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 580 place count 35 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 595 place count 35 transition count 38
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 599 place count 35 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 600 place count 35 transition count 37
Applied a total of 600 rules in 25 ms. Remains 35 /589 variables (removed 554) and now considering 37/1701 (removed 1664) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 37 rows 35 cols
[2024-06-01 22:15:43] [INFO ] Computed 9 invariants in 0 ms
[2024-06-01 22:15:43] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 22:15:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-01 22:15:43] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 22:15:43] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 22:15:43] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 123 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND p1 p0))), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 234 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p1), (AND p1 (NOT p0)), false, true, (AND p1 p0), (NOT p1)]
Stuttering acceptance computed with spot in 289 ms :[(NOT p1), (NOT p1), (AND p1 (NOT p0)), false, true, (AND p1 p0), (NOT p1)]
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (NOT p1), (AND p1 (NOT p0)), false, true, (AND p1 p0), (NOT p1)]
Product exploration explored 100000 steps with 24940 reset in 392 ms.
Product exploration explored 100000 steps with 24990 reset in 406 ms.
Applying partial POR strategy [false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p1), (AND p1 (NOT p0)), false, true, (AND p1 p0), (NOT p1)]
Support contains 4 out of 589 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 589/589 places, 1701/1701 transitions.
Applied a total of 0 rules in 23 ms. Remains 589 /589 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
[2024-06-01 22:15:45] [INFO ] Redundant transitions in 36 ms returned []
Running 1693 sub problems to find dead transitions.
[2024-06-01 22:15:45] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
// Phase 1: matrix 1365 rows 589 cols
[2024-06-01 22:15:45] [INFO ] Computed 23 invariants in 3 ms
[2024-06-01 22:15:45] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/589 variables, 589/589 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/589 variables, 23/612 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
[2024-06-01 22:16:08] [INFO ] Deduced a trap composed of 11 places in 482 ms of which 6 ms to minimize.
[2024-06-01 22:16:08] [INFO ] Deduced a trap composed of 11 places in 468 ms of which 6 ms to minimize.
[2024-06-01 22:16:09] [INFO ] Deduced a trap composed of 29 places in 507 ms of which 5 ms to minimize.
[2024-06-01 22:16:09] [INFO ] Deduced a trap composed of 40 places in 484 ms of which 5 ms to minimize.
[2024-06-01 22:16:10] [INFO ] Deduced a trap composed of 24 places in 486 ms of which 5 ms to minimize.
[2024-06-01 22:16:10] [INFO ] Deduced a trap composed of 55 places in 410 ms of which 5 ms to minimize.
[2024-06-01 22:16:11] [INFO ] Deduced a trap composed of 20 places in 508 ms of which 5 ms to minimize.
[2024-06-01 22:16:11] [INFO ] Deduced a trap composed of 59 places in 375 ms of which 4 ms to minimize.
[2024-06-01 22:16:11] [INFO ] Deduced a trap composed of 68 places in 343 ms of which 4 ms to minimize.
[2024-06-01 22:16:12] [INFO ] Deduced a trap composed of 80 places in 362 ms of which 5 ms to minimize.
[2024-06-01 22:16:12] [INFO ] Deduced a trap composed of 64 places in 369 ms of which 5 ms to minimize.
[2024-06-01 22:16:13] [INFO ] Deduced a trap composed of 40 places in 329 ms of which 6 ms to minimize.
[2024-06-01 22:16:13] [INFO ] Deduced a trap composed of 55 places in 396 ms of which 5 ms to minimize.
[2024-06-01 22:16:13] [INFO ] Deduced a trap composed of 11 places in 440 ms of which 5 ms to minimize.
[2024-06-01 22:16:14] [INFO ] Deduced a trap composed of 14 places in 442 ms of which 5 ms to minimize.
[2024-06-01 22:16:14] [INFO ] Deduced a trap composed of 16 places in 422 ms of which 5 ms to minimize.
[2024-06-01 22:16:15] [INFO ] Deduced a trap composed of 52 places in 391 ms of which 4 ms to minimize.
[2024-06-01 22:16:15] [INFO ] Deduced a trap composed of 45 places in 461 ms of which 5 ms to minimize.
[2024-06-01 22:16:16] [INFO ] Deduced a trap composed of 14 places in 451 ms of which 5 ms to minimize.
[2024-06-01 22:16:16] [INFO ] Deduced a trap composed of 38 places in 451 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 20/632 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 589/1954 variables, and 632 constraints, problems are : Problem set: 0 solved, 1693 unsolved in 30028 ms.
Refiners :[Domain max(s): 589/589 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/589 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1693/1693 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1693 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/589 variables, 589/589 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/589 variables, 23/612 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 20/632 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
[2024-06-01 22:16:20] [INFO ] Deduced a trap composed of 14 places in 473 ms of which 5 ms to minimize.
[2024-06-01 22:16:20] [INFO ] Deduced a trap composed of 13 places in 534 ms of which 21 ms to minimize.
[2024-06-01 22:16:21] [INFO ] Deduced a trap composed of 29 places in 485 ms of which 6 ms to minimize.
[2024-06-01 22:16:21] [INFO ] Deduced a trap composed of 20 places in 486 ms of which 5 ms to minimize.
[2024-06-01 22:16:22] [INFO ] Deduced a trap composed of 51 places in 488 ms of which 5 ms to minimize.
[2024-06-01 22:16:22] [INFO ] Deduced a trap composed of 29 places in 499 ms of which 5 ms to minimize.
[2024-06-01 22:16:23] [INFO ] Deduced a trap composed of 21 places in 501 ms of which 5 ms to minimize.
[2024-06-01 22:16:23] [INFO ] Deduced a trap composed of 29 places in 497 ms of which 6 ms to minimize.
[2024-06-01 22:16:24] [INFO ] Deduced a trap composed of 22 places in 485 ms of which 5 ms to minimize.
[2024-06-01 22:16:24] [INFO ] Deduced a trap composed of 38 places in 446 ms of which 5 ms to minimize.
[2024-06-01 22:16:25] [INFO ] Deduced a trap composed of 31 places in 458 ms of which 5 ms to minimize.
[2024-06-01 22:16:25] [INFO ] Deduced a trap composed of 32 places in 472 ms of which 6 ms to minimize.
[2024-06-01 22:16:26] [INFO ] Deduced a trap composed of 20 places in 440 ms of which 4 ms to minimize.
[2024-06-01 22:16:26] [INFO ] Deduced a trap composed of 23 places in 455 ms of which 5 ms to minimize.
[2024-06-01 22:16:27] [INFO ] Deduced a trap composed of 55 places in 422 ms of which 5 ms to minimize.
[2024-06-01 22:16:27] [INFO ] Deduced a trap composed of 66 places in 423 ms of which 5 ms to minimize.
[2024-06-01 22:16:28] [INFO ] Deduced a trap composed of 40 places in 483 ms of which 5 ms to minimize.
[2024-06-01 22:16:28] [INFO ] Deduced a trap composed of 54 places in 387 ms of which 5 ms to minimize.
[2024-06-01 22:16:28] [INFO ] Deduced a trap composed of 25 places in 415 ms of which 5 ms to minimize.
[2024-06-01 22:16:29] [INFO ] Deduced a trap composed of 82 places in 289 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/589 variables, 20/652 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
[2024-06-01 22:16:30] [INFO ] Deduced a trap composed of 23 places in 481 ms of which 5 ms to minimize.
[2024-06-01 22:16:31] [INFO ] Deduced a trap composed of 23 places in 501 ms of which 5 ms to minimize.
[2024-06-01 22:16:31] [INFO ] Deduced a trap composed of 37 places in 475 ms of which 5 ms to minimize.
[2024-06-01 22:16:32] [INFO ] Deduced a trap composed of 36 places in 498 ms of which 5 ms to minimize.
[2024-06-01 22:16:32] [INFO ] Deduced a trap composed of 25 places in 442 ms of which 5 ms to minimize.
[2024-06-01 22:16:33] [INFO ] Deduced a trap composed of 58 places in 503 ms of which 5 ms to minimize.
[2024-06-01 22:16:33] [INFO ] Deduced a trap composed of 31 places in 461 ms of which 5 ms to minimize.
[2024-06-01 22:16:34] [INFO ] Deduced a trap composed of 61 places in 516 ms of which 5 ms to minimize.
[2024-06-01 22:16:34] [INFO ] Deduced a trap composed of 21 places in 476 ms of which 6 ms to minimize.
[2024-06-01 22:16:35] [INFO ] Deduced a trap composed of 20 places in 496 ms of which 5 ms to minimize.
[2024-06-01 22:16:35] [INFO ] Deduced a trap composed of 33 places in 522 ms of which 5 ms to minimize.
[2024-06-01 22:16:36] [INFO ] Deduced a trap composed of 55 places in 525 ms of which 6 ms to minimize.
[2024-06-01 22:16:36] [INFO ] Deduced a trap composed of 24 places in 401 ms of which 5 ms to minimize.
[2024-06-01 22:16:37] [INFO ] Deduced a trap composed of 20 places in 495 ms of which 5 ms to minimize.
[2024-06-01 22:16:37] [INFO ] Deduced a trap composed of 32 places in 478 ms of which 5 ms to minimize.
[2024-06-01 22:16:38] [INFO ] Deduced a trap composed of 39 places in 496 ms of which 6 ms to minimize.
[2024-06-01 22:16:38] [INFO ] Deduced a trap composed of 29 places in 473 ms of which 5 ms to minimize.
[2024-06-01 22:16:39] [INFO ] Deduced a trap composed of 57 places in 473 ms of which 5 ms to minimize.
[2024-06-01 22:16:39] [INFO ] Deduced a trap composed of 40 places in 468 ms of which 5 ms to minimize.
[2024-06-01 22:16:40] [INFO ] Deduced a trap composed of 11 places in 461 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/589 variables, 20/672 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
[2024-06-01 22:16:41] [INFO ] Deduced a trap composed of 47 places in 471 ms of which 5 ms to minimize.
[2024-06-01 22:16:42] [INFO ] Deduced a trap composed of 49 places in 468 ms of which 5 ms to minimize.
[2024-06-01 22:16:42] [INFO ] Deduced a trap composed of 27 places in 345 ms of which 5 ms to minimize.
[2024-06-01 22:16:43] [INFO ] Deduced a trap composed of 38 places in 412 ms of which 5 ms to minimize.
[2024-06-01 22:16:43] [INFO ] Deduced a trap composed of 60 places in 364 ms of which 4 ms to minimize.
[2024-06-01 22:16:43] [INFO ] Deduced a trap composed of 75 places in 373 ms of which 4 ms to minimize.
[2024-06-01 22:16:44] [INFO ] Deduced a trap composed of 54 places in 330 ms of which 4 ms to minimize.
[2024-06-01 22:16:44] [INFO ] Deduced a trap composed of 57 places in 344 ms of which 4 ms to minimize.
[2024-06-01 22:16:44] [INFO ] Deduced a trap composed of 61 places in 256 ms of which 4 ms to minimize.
[2024-06-01 22:16:45] [INFO ] Deduced a trap composed of 73 places in 270 ms of which 4 ms to minimize.
[2024-06-01 22:16:45] [INFO ] Deduced a trap composed of 34 places in 321 ms of which 4 ms to minimize.
[2024-06-01 22:16:45] [INFO ] Deduced a trap composed of 41 places in 293 ms of which 4 ms to minimize.
[2024-06-01 22:16:45] [INFO ] Deduced a trap composed of 44 places in 243 ms of which 3 ms to minimize.
[2024-06-01 22:16:46] [INFO ] Deduced a trap composed of 49 places in 298 ms of which 4 ms to minimize.
[2024-06-01 22:16:46] [INFO ] Deduced a trap composed of 55 places in 305 ms of which 3 ms to minimize.
[2024-06-01 22:16:46] [INFO ] Deduced a trap composed of 38 places in 247 ms of which 4 ms to minimize.
SMT process timed out in 60913ms, After SMT, problems are : Problem set: 0 solved, 1693 unsolved
Search for dead transitions found 0 dead transitions in 60931ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60999 ms. Remains : 589/589 places, 1701/1701 transitions.
Support contains 4 out of 589 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 589/589 places, 1701/1701 transitions.
Applied a total of 0 rules in 11 ms. Remains 589 /589 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
[2024-06-01 22:16:46] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2024-06-01 22:16:46] [INFO ] Invariant cache hit.
[2024-06-01 22:16:47] [INFO ] Implicit Places using invariants in 864 ms returned []
[2024-06-01 22:16:47] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2024-06-01 22:16:47] [INFO ] Invariant cache hit.
[2024-06-01 22:16:48] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 22:16:52] [INFO ] Implicit Places using invariants and state equation in 4335 ms returned []
Implicit Place search using SMT with State Equation took 5213 ms to find 0 implicit places.
Running 1693 sub problems to find dead transitions.
[2024-06-01 22:16:52] [INFO ] Flow matrix only has 1365 transitions (discarded 336 similar events)
[2024-06-01 22:16:52] [INFO ] Invariant cache hit.
[2024-06-01 22:16:52] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/589 variables, 589/589 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/589 variables, 23/612 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
[2024-06-01 22:17:14] [INFO ] Deduced a trap composed of 11 places in 628 ms of which 6 ms to minimize.
[2024-06-01 22:17:15] [INFO ] Deduced a trap composed of 11 places in 533 ms of which 5 ms to minimize.
[2024-06-01 22:17:15] [INFO ] Deduced a trap composed of 29 places in 518 ms of which 5 ms to minimize.
[2024-06-01 22:17:16] [INFO ] Deduced a trap composed of 40 places in 486 ms of which 5 ms to minimize.
[2024-06-01 22:17:16] [INFO ] Deduced a trap composed of 24 places in 459 ms of which 6 ms to minimize.
[2024-06-01 22:17:17] [INFO ] Deduced a trap composed of 55 places in 449 ms of which 5 ms to minimize.
[2024-06-01 22:17:17] [INFO ] Deduced a trap composed of 20 places in 459 ms of which 5 ms to minimize.
[2024-06-01 22:17:18] [INFO ] Deduced a trap composed of 59 places in 367 ms of which 4 ms to minimize.
[2024-06-01 22:17:18] [INFO ] Deduced a trap composed of 68 places in 311 ms of which 4 ms to minimize.
[2024-06-01 22:17:18] [INFO ] Deduced a trap composed of 80 places in 367 ms of which 4 ms to minimize.
[2024-06-01 22:17:19] [INFO ] Deduced a trap composed of 64 places in 390 ms of which 5 ms to minimize.
[2024-06-01 22:17:19] [INFO ] Deduced a trap composed of 40 places in 337 ms of which 4 ms to minimize.
[2024-06-01 22:17:20] [INFO ] Deduced a trap composed of 55 places in 426 ms of which 4 ms to minimize.
[2024-06-01 22:17:20] [INFO ] Deduced a trap composed of 11 places in 455 ms of which 5 ms to minimize.
[2024-06-01 22:17:21] [INFO ] Deduced a trap composed of 14 places in 456 ms of which 5 ms to minimize.
[2024-06-01 22:17:21] [INFO ] Deduced a trap composed of 16 places in 459 ms of which 5 ms to minimize.
[2024-06-01 22:17:21] [INFO ] Deduced a trap composed of 52 places in 450 ms of which 5 ms to minimize.
[2024-06-01 22:17:22] [INFO ] Deduced a trap composed of 45 places in 459 ms of which 5 ms to minimize.
[2024-06-01 22:17:22] [INFO ] Deduced a trap composed of 14 places in 456 ms of which 5 ms to minimize.
SMT process timed out in 30782ms, After SMT, problems are : Problem set: 0 solved, 1693 unsolved
Search for dead transitions found 0 dead transitions in 30799ms
Finished structural reductions in LTL mode , in 1 iterations and 36027 ms. Remains : 589/589 places, 1701/1701 transitions.
Treatment of property Peterson-PT-7-LTLCardinality-15 finished in 298065 ms.
[2024-06-01 22:17:23] [INFO ] Flatten gal took : 118 ms
[2024-06-01 22:17:23] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 22:17:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1992 places, 3096 transitions and 9584 arcs took 26 ms.
Total runtime 1303004 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : Peterson-PT-7-LTLCardinality-01
FORMULA Peterson-PT-7-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717282029918

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
ltl formula name Peterson-PT-7-LTLCardinality-01
ltl formula formula --ltl=/tmp/3668/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1992 places, 3096 transitions and 9584 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.360 real 0.080 user 0.160 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3668/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3668/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3668/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3668/ltl_0_
ltl formula name Peterson-PT-7-LTLCardinality-15
ltl formula formula --ltl=/tmp/3668/ltl_1_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1992 places, 3096 transitions and 9584 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.370 real 0.130 user 0.110 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3668/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3668/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3668/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3668/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 1993 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1993, there are 3186 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~76!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5
pnml2lts-mc( 0/ 4): unique states count: 321
pnml2lts-mc( 0/ 4): unique transitions count: 2576
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1
pnml2lts-mc( 0/ 4): - claim found count: 25
pnml2lts-mc( 0/ 4): - claim success count: 326
pnml2lts-mc( 0/ 4): - cum. max stack depth: 321
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 326 states 2620 transitions, fanout: 8.037
pnml2lts-mc( 0/ 4): Total exploration time 0.110 sec (0.110 sec minimum, 0.110 sec on average)
pnml2lts-mc( 0/ 4): States per second: 2964, Transitions per second: 23818
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 36.0 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3153 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Peterson-PT-7, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r512-smll-171654407300291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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