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.r488-tall-171631132900572.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 DoubleExponent-PT-100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132900572
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.8M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717197527190

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:18:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 23:18:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:18:48] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2024-05-31 23:18:48] [INFO ] Transformed 5304 places.
[2024-05-31 23:18:48] [INFO ] Transformed 4998 transitions.
[2024-05-31 23:18:48] [INFO ] Parsed PT model containing 5304 places and 4998 transitions and 14094 arcs in 332 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Support contains 65 out of 5304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5304/5304 places, 4998/4998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 5300 transition count 4998
Applied a total of 4 rules in 970 ms. Remains 5300 /5304 variables (removed 4) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-31 23:18:51] [INFO ] Invariants computation overflowed in 177 ms
[2024-05-31 23:18:53] [INFO ] Implicit Places using invariants in 2277 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-31 23:18:53] [INFO ] Invariants computation overflowed in 111 ms
[2024-05-31 23:19:38] [INFO ] Performed 3/5300 implicitness test of which 0 returned IMPLICIT in 42 seconds.
[2024-05-31 23:20:08] [INFO ] Performed 130/5300 implicitness test of which 0 returned IMPLICIT in 72 seconds.
[2024-05-31 23:20:39] [INFO ] Performed 324/5300 implicitness test of which 0 returned IMPLICIT in 103 seconds.
[2024-05-31 23:21:11] [INFO ] Performed 537/5300 implicitness test of which 0 returned IMPLICIT in 135 seconds.
[2024-05-31 23:21:11] [INFO ] Timeout of Implicit test with SMT after 135 seconds.
[2024-05-31 23:21:11] [INFO ] Implicit Places using invariants and state equation in 138497 ms returned []
Implicit Place search using SMT with State Equation took 140819 ms to find 0 implicit places.
Running 4997 sub problems to find dead transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-31 23:21:11] [INFO ] Invariants computation overflowed in 114 ms
(s177 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((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.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5299/10298 variables, and 0 constraints, problems are : Problem set: 0 solved, 4997 unsolved in 30116 ms.
Refiners :[State Equation: 0/5300 constraints, PredecessorRefiner: 4997/4997 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4997 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5299/10298 variables, and 0 constraints, problems are : Problem set: 0 solved, 4997 unsolved in 30079 ms.
Refiners :[State Equation: 0/5300 constraints, PredecessorRefiner: 0/4997 constraints, Known Traps: 0/0 constraints]
After SMT, in 63014ms problems are : Problem set: 0 solved, 4997 unsolved
Search for dead transitions found 0 dead transitions in 63093ms
Starting structural reductions in LTL mode, iteration 1 : 5300/5304 places, 4998/4998 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 204960 ms. Remains : 5300/5304 places, 4998/4998 transitions.
Support contains 65 out of 5300 places after structural reductions.
[2024-05-31 23:22:15] [INFO ] Flatten gal took : 290 ms
[2024-05-31 23:22:15] [INFO ] Flatten gal took : 169 ms
[2024-05-31 23:22:16] [INFO ] Input system was already deterministic with 4998 transitions.
Support contains 56 out of 5300 places (down from 65) after GAL structural reductions.
RANDOM walk for 40000 steps (1326 resets) in 1987 ms. (20 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (111 resets) in 139 ms. (28 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (116 resets) in 108 ms. (36 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (119 resets) in 82 ms. (48 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (110 resets) in 144 ms. (27 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (109 resets) in 33 ms. (117 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (109 resets) in 43 ms. (90 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (116 resets) in 62 ms. (63 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (111 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (117 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (111 resets) in 29 ms. (133 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (110 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (109 resets) in 33 ms. (117 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (115 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (111 resets) in 44 ms. (88 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (105 resets) in 31 ms. (125 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (117 resets) in 45 ms. (86 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (115 resets) in 107 ms. (37 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (111 resets) in 29 ms. (133 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (112 resets) in 27 ms. (142 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (121 resets) in 31 ms. (125 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (105 resets) in 38 ms. (102 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (108 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (114 resets) in 27 ms. (142 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (113 resets) in 31 ms. (125 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (110 resets) in 34 ms. (114 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (109 resets) in 34 ms. (114 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (111 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (118 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (110 resets) in 29 ms. (133 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (110 resets) in 36 ms. (108 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (114 resets) in 39 ms. (100 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (118 resets) in 27 ms. (142 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (111 resets) in 31 ms. (125 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (104 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (114 resets) in 107 ms. (37 steps per ms) remains 35/35 properties
Interrupted probabilistic random walk after 53304 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :1 out of 35
Probabilistic random walk after 53304 steps, saw 26660 distinct states, run finished after 3005 ms. (steps per millisecond=17 ) properties seen :1
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-31 23:22:21] [INFO ] Invariants computation overflowed in 84 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 151/205 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 643/848 variables, 255/309 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/848 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 1232/2080 variables, 565/874 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2080 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 1720/3800 variables, 846/1720 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3800 variables, 0/1720 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 1722/5522 variables, 914/2634 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5522/10298 variables, and 2634 constraints, problems are : Problem set: 0 solved, 34 unsolved in 5013 ms.
Refiners :[State Equation: 2634/5300 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 151/205 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 643/848 variables, 255/309 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/848 variables, 34/343 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/848 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 1232/2080 variables, 565/908 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2080 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 1720/3800 variables, 846/1754 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3800 variables, 0/1754 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 1722/5522 variables, 914/2668 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5522/10298 variables, and 2668 constraints, problems are : Problem set: 0 solved, 34 unsolved in 5027 ms.
Refiners :[State Equation: 2634/5300 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
After SMT, in 10182ms problems are : Problem set: 0 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1133 transitions
Trivial Post-agglo rules discarded 1133 transitions
Performed 1133 trivial Post agglomeration. Transition count delta: 1133
Iterating post reduction 0 with 1136 rules applied. Total rules applied 1137 place count 5297 transition count 3863
Reduce places removed 1133 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 1 with 1156 rules applied. Total rules applied 2293 place count 4164 transition count 3840
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 2316 place count 4141 transition count 3840
Performed 204 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 204 Pre rules applied. Total rules applied 2316 place count 4141 transition count 3636
Deduced a syphon composed of 204 places in 173 ms
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 3 with 408 rules applied. Total rules applied 2724 place count 3937 transition count 3636
Performed 885 Post agglomeration using F-continuation condition.Transition count delta: 885
Deduced a syphon composed of 885 places in 90 ms
Reduce places removed 885 places and 0 transitions.
Iterating global reduction 3 with 1770 rules applied. Total rules applied 4494 place count 3052 transition count 2751
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 143 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4696 place count 2951 transition count 2751
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 54 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 4874 place count 2862 transition count 2751
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4876 place count 2862 transition count 2749
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4878 place count 2860 transition count 2749
Free-agglomeration rule (complex) applied 405 times.
Iterating global reduction 4 with 405 rules applied. Total rules applied 5283 place count 2860 transition count 2344
Reduce places removed 405 places and 0 transitions.
Iterating post reduction 4 with 405 rules applied. Total rules applied 5688 place count 2455 transition count 2344
Partial Free-agglomeration rule applied 408 times.
Drop transitions (Partial Free agglomeration) removed 408 transitions
Iterating global reduction 5 with 408 rules applied. Total rules applied 6096 place count 2455 transition count 2344
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6097 place count 2454 transition count 2343
Applied a total of 6097 rules in 2478 ms. Remains 2454 /5300 variables (removed 2846) and now considering 2343/4998 (removed 2655) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2479 ms. Remains : 2454/5300 places, 2343/4998 transitions.
RANDOM walk for 40000 steps (5145 resets) in 587 ms. (68 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (343 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (331 resets) in 32 ms. (121 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (352 resets) in 56 ms. (70 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (347 resets) in 70 ms. (56 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (330 resets) in 32 ms. (121 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (337 resets) in 38 ms. (102 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (327 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (339 resets) in 30 ms. (129 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (336 resets) in 38 ms. (102 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (339 resets) in 27 ms. (142 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (358 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (331 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (342 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (333 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (345 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (354 resets) in 38 ms. (102 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (337 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (353 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (337 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (341 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (347 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (344 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (338 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (346 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (330 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (335 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (332 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (335 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (338 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (324 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (353 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (330 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (324 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (319 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
Interrupted probabilistic random walk after 85703 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 34
Probabilistic random walk after 85703 steps, saw 42863 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
// Phase 1: matrix 2343 rows 2454 cols
[2024-05-31 23:22:37] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-31 23:22:37] [INFO ] State equation strengthened by 389 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 207/261 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 1546/1807 variables, 522/587 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1807 variables, 60/647 constraints. Problems are: Problem set: 0 solved, 34 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1807 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 2462/4269 variables, 1440/2087 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4269/4797 variables, and 2318 constraints, problems are : Problem set: 0 solved, 34 unsolved in 45027 ms.
Refiners :[State Equation: 2016/2454 constraints, ReadFeed: 302/389 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 207/261 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 1546/1807 variables, 522/587 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1807 variables, 60/647 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1807 variables, 30/677 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1807 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4269/4797 variables, and 2117 constraints, problems are : Problem set: 0 solved, 34 unsolved in 45030 ms.
Refiners :[State Equation: 2016/2454 constraints, ReadFeed: 71/389 constraints, PredecessorRefiner: 30/34 constraints, Known Traps: 0/0 constraints]
After SMT, in 90155ms problems are : Problem set: 0 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 2454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2454/2454 places, 2343/2343 transitions.
Applied a total of 0 rules in 127 ms. Remains 2454 /2454 variables (removed 0) and now considering 2343/2343 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 2454/2454 places, 2343/2343 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2454/2454 places, 2343/2343 transitions.
Applied a total of 0 rules in 311 ms. Remains 2454 /2454 variables (removed 0) and now considering 2343/2343 (removed 0) transitions.
// Phase 1: matrix 2343 rows 2454 cols
[2024-05-31 23:24:08] [INFO ] Invariants computation overflowed in 71 ms
[2024-05-31 23:24:12] [INFO ] Implicit Places using invariants in 4619 ms returned []
// Phase 1: matrix 2343 rows 2454 cols
[2024-05-31 23:24:12] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-31 23:24:14] [INFO ] State equation strengthened by 389 read => feed constraints.
[2024-05-31 23:24:54] [INFO ] Performed 5/2454 implicitness test of which 0 returned IMPLICIT in 40 seconds.
[2024-05-31 23:26:52] [INFO ] Performed 7/2454 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2024-05-31 23:26:52] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2024-05-31 23:26:52] [INFO ] Implicit Places using invariants and state equation in 160120 ms returned []
Implicit Place search using SMT with State Equation took 164742 ms to find 0 implicit places.
[2024-05-31 23:26:52] [INFO ] Redundant transitions in 114 ms returned []
Running 2342 sub problems to find dead transitions.
// Phase 1: matrix 2343 rows 2454 cols
[2024-05-31 23:26:53] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-31 23:26:53] [INFO ] State equation strengthened by 389 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)
(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 timeout
1.0)
(s219 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2453/4797 variables, and 0 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 30042 ms.
Refiners :[State Equation: 0/2454 constraints, ReadFeed: 0/389 constraints, PredecessorRefiner: 2342/2342 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2342 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2453/4797 variables, and 0 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 30036 ms.
Refiners :[State Equation: 0/2454 constraints, ReadFeed: 0/389 constraints, PredecessorRefiner: 0/2342 constraints, Known Traps: 0/0 constraints]
After SMT, in 64503ms problems are : Problem set: 0 solved, 2342 unsolved
Search for dead transitions found 0 dead transitions in 64529ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229714 ms. Remains : 2454/2454 places, 2343/2343 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.31 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U p1))'
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 742 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-31 23:27:58] [INFO ] Invariants computation overflowed in 90 ms
[2024-05-31 23:28:00] [INFO ] Implicit Places using invariants in 1959 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-31 23:28:00] [INFO ] Invariants computation overflowed in 82 ms
[2024-05-31 23:28:44] [INFO ] Performed 3/5300 implicitness test of which 0 returned IMPLICIT in 41 seconds.
[2024-05-31 23:29:14] [INFO ] Performed 136/5300 implicitness test of which 0 returned IMPLICIT in 71 seconds.
[2024-05-31 23:29:45] [INFO ] Performed 363/5300 implicitness test of which 0 returned IMPLICIT in 101 seconds.
[2024-05-31 23:30:15] [INFO ] Performed 534/5300 implicitness test of which 0 returned IMPLICIT in 131 seconds.
[2024-05-31 23:30:15] [INFO ] Timeout of Implicit test with SMT after 131 seconds.
[2024-05-31 23:30:15] [INFO ] Implicit Places using invariants and state equation in 134890 ms returned []
Implicit Place search using SMT with State Equation took 136852 ms to find 0 implicit places.
Running 4997 sub problems to find dead transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-31 23:30:15] [INFO ] Invariants computation overflowed in 84 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5299/10298 variables, and 0 constraints, problems are : Problem set: 0 solved, 4997 unsolved in 30069 ms.
Refiners :[State Equation: 0/5300 constraints, PredecessorRefiner: 4997/4997 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4997 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5299/10298 variables, and 0 constraints, problems are : Problem set: 0 solved, 4997 unsolved in 30057 ms.
Refiners :[State Equation: 0/5300 constraints, PredecessorRefiner: 0/4997 constraints, Known Traps: 0/0 constraints]
After SMT, in 62481ms problems are : Problem set: 0 solved, 4997 unsolved
Search for dead transitions found 0 dead transitions in 62534ms
Finished structural reductions in LTL mode , in 1 iterations and 200138 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-00
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 6 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-00 finished in 200772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(!p0)) U p1)))'
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 736 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-31 23:31:19] [INFO ] Invariants computation overflowed in 101 ms
[2024-05-31 23:31:21] [INFO ] Implicit Places using invariants in 1860 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-31 23:31:21] [INFO ] Invariants computation overflowed in 97 ms
[2024-05-31 23:32:05] [INFO ] Performed 3/5300 implicitness test of which 0 returned IMPLICIT in 41 seconds.
[2024-05-31 23:32:36] [INFO ] Performed 135/5300 implicitness test of which 0 returned IMPLICIT in 72 seconds.
[2024-05-31 23:33:07] [INFO ] Performed 361/5300 implicitness test of which 0 returned IMPLICIT in 103 seconds.
[2024-05-31 23:33:37] [INFO ] Performed 488/5300 implicitness test of which 0 returned IMPLICIT in 133 seconds.
[2024-05-31 23:33:37] [INFO ] Timeout of Implicit test with SMT after 133 seconds.
[2024-05-31 23:33:37] [INFO ] Implicit Places using invariants and state equation in 136865 ms returned []
Implicit Place search using SMT with State Equation took 138729 ms to find 0 implicit places.
Running 4997 sub problems to find dead transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-31 23:33:38] [INFO ] Invariants computation overflowed in 91 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5299/10298 variables, and 0 constraints, problems are : Problem set: 0 solved, 4997 unsolved in 30078 ms.
Refiners :[State Equation: 0/5300 constraints, PredecessorRefiner: 4997/4997 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4997 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5299/10298 variables, and 0 constraints, problems are : Problem set: 0 solved, 4997 unsolved in 30066 ms.
Refiners :[State Equation: 0/5300 constraints, PredecessorRefiner: 0/4997 constraints, Known Traps: 0/0 constraints]
After SMT, in 62682ms problems are : Problem set: 0 solved, 4997 unsolved
Search for dead transitions found 0 dead transitions in 62732ms
Finished structural reductions in LTL mode , in 1 iterations and 202209 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), p0]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-01
Product exploration explored 100000 steps with 3309 reset in 378 ms.
Product exploration explored 100000 steps with 3295 reset in 344 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.21 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) p0), (NOT p1), p0, false, false]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (1330 resets) in 508 ms. (78 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1134 resets) in 209 ms. (190 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1140 resets) in 214 ms. (186 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1142 resets) in 274 ms. (145 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1120 resets) in 155 ms. (256 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 54243 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 4
Probabilistic random walk after 54243 steps, saw 27131 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-31 23:34:46] [INFO ] Invariants computation overflowed in 87 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 47/63 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 106/169 variables, 47/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 170/339 variables, 79/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 224/563 variables, 108/256 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 265/828 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/828 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 222/1050 variables, 118/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1050 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 254/1304 variables, 126/636 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1304 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 266/1570 variables, 141/777 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1570 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 251/1821 variables, 123/900 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1821 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 291/2112 variables, 152/1052 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2112 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 255/2367 variables, 132/1184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2367 variables, 0/1184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 238/2605 variables, 129/1313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2605 variables, 0/1313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 208/2813 variables, 107/1420 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2813 variables, 0/1420 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 209/3022 variables, 109/1529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3022 variables, 0/1529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 203/3225 variables, 103/1632 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/3225 variables, 0/1632 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 209/3434 variables, 109/1741 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/3434 variables, 0/1741 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 203/3637 variables, 103/1844 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/3637 variables, 0/1844 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 209/3846 variables, 109/1953 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3846 variables, 0/1953 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 203/4049 variables, 103/2056 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/4049 variables, 0/2056 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 209/4258 variables, 109/2165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/4258 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 203/4461 variables, 103/2268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/4461 variables, 0/2268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 209/4670 variables, 109/2377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/4670 variables, 0/2377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (OVERLAPS) 203/4873 variables, 103/2480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/4873 variables, 0/2480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 5125ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1197 transitions
Trivial Post-agglo rules discarded 1197 transitions
Performed 1197 trivial Post agglomeration. Transition count delta: 1197
Iterating post reduction 0 with 1200 rules applied. Total rules applied 1201 place count 5297 transition count 3799
Reduce places removed 1197 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2400 place count 4100 transition count 3797
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2402 place count 4098 transition count 3797
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2402 place count 4098 transition count 3597
Deduced a syphon composed of 200 places in 177 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2802 place count 3898 transition count 3597
Performed 902 Post agglomeration using F-continuation condition.Transition count delta: 902
Deduced a syphon composed of 902 places in 62 ms
Reduce places removed 902 places and 0 transitions.
Iterating global reduction 3 with 1804 rules applied. Total rules applied 4606 place count 2996 transition count 2695
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 55 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4808 place count 2895 transition count 2695
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 48 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 4998 place count 2800 transition count 2695
Free-agglomeration rule (complex) applied 398 times.
Iterating global reduction 3 with 398 rules applied. Total rules applied 5396 place count 2800 transition count 2297
Reduce places removed 398 places and 0 transitions.
Iterating post reduction 3 with 398 rules applied. Total rules applied 5794 place count 2402 transition count 2297
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 402 times.
Drop transitions (Partial Free agglomeration) removed 402 transitions
Iterating global reduction 4 with 402 rules applied. Total rules applied 6196 place count 2402 transition count 2297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6197 place count 2401 transition count 2296
Applied a total of 6197 rules in 1795 ms. Remains 2401 /5300 variables (removed 2899) and now considering 2296/4998 (removed 2702) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1797 ms. Remains : 2401/5300 places, 2296/4998 transitions.
RANDOM walk for 40000 steps (5110 resets) in 174 ms. (228 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3408 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (3370 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (3423 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (3418 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 102657 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 4
Probabilistic random walk after 102657 steps, saw 51371 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
// Phase 1: matrix 2296 rows 2401 cols
[2024-05-31 23:34:56] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-31 23:34:56] [INFO ] State equation strengthened by 398 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 90/111 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 975/1086 variables, 254/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1086 variables, 20/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1086 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2626/3712 variables, 1328/1642 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3712 variables, 199/1841 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3712 variables, 0/1841 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf0 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4697/4697 variables, and 2627 constraints, problems are : Problem set: 1 solved, 3 unsolved in 40120 ms.
Refiners :[State Equation: 2401/2401 constraints, ReadFeed: 226/398 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 90/111 variables, 29/35 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 5/40 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 3/43 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 975/1086 variables, 254/297 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1086 variables, 20/317 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1086 variables, 0/317 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2626/3712 variables, 1328/1645 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3712/4697 variables, and 1844 constraints, problems are : Problem set: 1 solved, 3 unsolved in 31111 ms.
Refiners :[State Equation: 1615/2401 constraints, ReadFeed: 226/398 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 71320ms problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 2401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2401/2401 places, 2296/2296 transitions.
Applied a total of 0 rules in 199 ms. Remains 2401 /2401 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 2401/2401 places, 2296/2296 transitions.
RANDOM walk for 40000 steps (5086 resets) in 172 ms. (231 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3444 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3404 resets) in 276 ms. (144 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3414 resets) in 219 ms. (181 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 94289 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 3
Probabilistic random walk after 94289 steps, saw 47192 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
// Phase 1: matrix 2296 rows 2401 cols
[2024-05-31 23:36:11] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-31 23:36:11] [INFO ] State equation strengthened by 398 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 90/111 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 975/1086 variables, 254/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1086 variables, 20/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1086 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2626/3712 variables, 1328/1642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3712 variables, 199/1841 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3712 variables, 0/1841 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 985/4697 variables, 786/2627 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4697/4697 variables, and 2799 constraints, problems are : Problem set: 0 solved, 3 unsolved in 75010 ms.
Refiners :[State Equation: 2401/2401 constraints, ReadFeed: 398/398 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 90/111 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 975/1086 variables, 254/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1086 variables, 20/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1086 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2626/3712 variables, 1328/1645 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3712/4697 variables, and 1844 constraints, problems are : Problem set: 0 solved, 3 unsolved in 50259 ms.
Refiners :[State Equation: 1615/2401 constraints, ReadFeed: 226/398 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 125384ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 2401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2401/2401 places, 2296/2296 transitions.
Applied a total of 0 rules in 216 ms. Remains 2401 /2401 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 2401/2401 places, 2296/2296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2401/2401 places, 2296/2296 transitions.
Applied a total of 0 rules in 206 ms. Remains 2401 /2401 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
// Phase 1: matrix 2296 rows 2401 cols
[2024-05-31 23:38:17] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-31 23:38:40] [INFO ] Implicit Places using invariants in 23254 ms returned []
// Phase 1: matrix 2296 rows 2401 cols
[2024-05-31 23:38:40] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-31 23:38:42] [INFO ] State equation strengthened by 398 read => feed constraints.
[2024-05-31 23:39:12] [INFO ] Performed 4/2401 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:39:57] [INFO ] Performed 25/2401 implicitness test of which 2 returned IMPLICIT in 75 seconds.
[2024-05-31 23:41:03] [INFO ] Performed 54/2401 implicitness test of which 4 returned IMPLICIT in 140 seconds.
[2024-05-31 23:41:20] [INFO ] Implicit Places using invariants and state equation in 160095 ms returned [19, 25, 47, 54, 76, 81]
[2024-05-31 23:41:20] [INFO ] Actually due to overlaps returned [25, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 183381 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2399/2401 places, 2296/2296 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2399 transition count 2295
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2398 transition count 2295
Applied a total of 2 rules in 379 ms. Remains 2398 /2399 variables (removed 1) and now considering 2295/2296 (removed 1) transitions.
// Phase 1: matrix 2295 rows 2398 cols
[2024-05-31 23:41:21] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 23:41:43] [INFO ] Implicit Places using invariants in 22812 ms returned []
// Phase 1: matrix 2295 rows 2398 cols
[2024-05-31 23:41:44] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-31 23:41:45] [INFO ] State equation strengthened by 398 read => feed constraints.
[2024-05-31 23:42:29] [INFO ] Performed 4/2398 implicitness test of which 0 returned IMPLICIT in 44 seconds.
[2024-05-31 23:43:04] [INFO ] Performed 28/2398 implicitness test of which 0 returned IMPLICIT in 78 seconds.
[2024-05-31 23:44:24] [INFO ] Implicit Places with SMT raised an exceptionSMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... after 160078 ms
Discarding 1 places :
Implicit Place search using SMT with State Equation took 182897 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2397/2401 places, 2295/2296 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2397 transition count 2295
Applied a total of 1 rules in 383 ms. Remains 2397 /2397 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
// Phase 1: matrix 2295 rows 2397 cols
[2024-05-31 23:44:24] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-31 23:44:47] [INFO ] Implicit Places using invariants in 22890 ms returned []
// Phase 1: matrix 2295 rows 2397 cols
[2024-05-31 23:44:47] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-31 23:44:48] [INFO ] State equation strengthened by 398 read => feed constraints.
[2024-05-31 23:45:25] [INFO ] Performed 4/2397 implicitness test of which 0 returned IMPLICIT in 36 seconds.
[2024-05-31 23:47:27] [INFO ] Performed 6/2397 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2024-05-31 23:47:27] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2024-05-31 23:47:27] [INFO ] Implicit Places using invariants and state equation in 160096 ms returned []
Implicit Place search using SMT with State Equation took 182989 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 2397/2401 places, 2295/2296 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 550235 ms. Remains : 2397/2401 places, 2295/2296 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT p0))), (G (NOT p0)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 89 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 4998 rows 5300 cols
[2024-05-31 23:47:27] [INFO ] Invariants computation overflowed in 99 ms
[2024-05-31 23:47:42] [INFO ] [Real]Absence check using state equation in 7320 ms returned unknown
Could not prove EG (NOT p1)
Support contains 2 out of 5300 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1196 transitions
Trivial Post-agglo rules discarded 1196 transitions
Performed 1196 trivial Post agglomeration. Transition count delta: 1196
Iterating post reduction 0 with 1196 rules applied. Total rules applied 1196 place count 5299 transition count 3801
Reduce places removed 1196 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2394 place count 4103 transition count 3799
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2396 place count 4101 transition count 3799
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2396 place count 4101 transition count 3599
Deduced a syphon composed of 200 places in 164 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2796 place count 3901 transition count 3599
Performed 900 Post agglomeration using F-continuation condition.Transition count delta: 900
Deduced a syphon composed of 900 places in 61 ms
Reduce places removed 900 places and 0 transitions.
Iterating global reduction 3 with 1800 rules applied. Total rules applied 4596 place count 3001 transition count 2699
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 54 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4798 place count 2900 transition count 2699
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 48 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 4988 place count 2805 transition count 2699
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4989 place count 2804 transition count 2698
Applied a total of 4989 rules in 1240 ms. Remains 2804 /5300 variables (removed 2496) and now considering 2698/4998 (removed 2300) transitions.
// Phase 1: matrix 2698 rows 2804 cols
[2024-05-31 23:47:44] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-31 23:47:45] [INFO ] Implicit Places using invariants in 1331 ms returned []
// Phase 1: matrix 2698 rows 2804 cols
[2024-05-31 23:47:45] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-31 23:47:46] [INFO ] State equation strengthened by 197 read => feed constraints.
[2024-05-31 23:48:28] [INFO ] Performed 2/2804 implicitness test of which 0 returned IMPLICIT in 41 seconds.
[2024-05-31 23:48:58] [INFO ] Performed 57/2804 implicitness test of which 0 returned IMPLICIT in 71 seconds.
[2024-05-31 23:49:28] [INFO ] Performed 330/2804 implicitness test of which 0 returned IMPLICIT in 101 seconds.
[2024-05-31 23:49:58] [INFO ] Performed 515/2804 implicitness test of which 0 returned IMPLICIT in 131 seconds.
[2024-05-31 23:49:58] [INFO ] Timeout of Implicit test with SMT after 131 seconds.
[2024-05-31 23:49:58] [INFO ] Implicit Places using invariants and state equation in 133226 ms returned []
Implicit Place search using SMT with State Equation took 134573 ms to find 0 implicit places.
[2024-05-31 23:49:58] [INFO ] Redundant transitions in 137 ms returned []
Running 2697 sub problems to find dead transitions.
// Phase 1: matrix 2698 rows 2804 cols
[2024-05-31 23:49:58] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-31 23:49:58] [INFO ] State equation strengthened by 197 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2803/5502 variables, and 0 constraints, problems are : Problem set: 0 solved, 2697 unsolved in 30043 ms.
Refiners :[State Equation: 0/2804 constraints, ReadFeed: 0/197 constraints, PredecessorRefiner: 2697/2697 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2697 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2803/5502 variables, and 0 constraints, problems are : Problem set: 0 solved, 2697 unsolved in 30043 ms.
Refiners :[State Equation: 0/2804 constraints, ReadFeed: 0/197 constraints, PredecessorRefiner: 0/2697 constraints, Known Traps: 0/0 constraints]
After SMT, in 61176ms problems are : Problem set: 0 solved, 2697 unsolved
Search for dead transitions found 0 dead transitions in 61208ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2804/5300 places, 2698/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 197187 ms. Remains : 2804/5300 places, 2698/4998 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8867 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (5560 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3241 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 102878 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 1
Probabilistic random walk after 102878 steps, saw 51449 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
// Phase 1: matrix 2698 rows 2804 cols
[2024-05-31 23:51:03] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-31 23:51:03] [INFO ] State equation strengthened by 197 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/62 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 95/157 variables, 45/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 99/256 variables, 52/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 97/353 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 108/461 variables, 54/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/461 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/461 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 110/571 variables, 56/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/571 variables, 4/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/571 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 109/680 variables, 56/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/680 variables, 4/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/680 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 97/777 variables, 52/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/777 variables, 3/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/777 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 92/869 variables, 47/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/869 variables, 4/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/869 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 97/966 variables, 46/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/966 variables, 3/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/966 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 105/1071 variables, 54/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1071 variables, 4/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1071 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 109/1180 variables, 55/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1180 variables, 4/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1180 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 110/1290 variables, 56/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1290 variables, 4/688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1290 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 110/1400 variables, 56/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1400 variables, 4/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1400 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 110/1510 variables, 56/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1510 variables, 4/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1510 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 110/1620 variables, 56/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1620 variables, 4/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1620 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 110/1730 variables, 56/924 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1730 variables, 4/928 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1730 variables, 0/928 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 110/1840 variables, 56/984 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1840 variables, 4/988 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1840 variables, 0/988 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 110/1950 variables, 56/1044 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1950 variables, 4/1048 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1950 variables, 0/1048 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 110/2060 variables, 56/1104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2060 variables, 4/1108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2060 variables, 0/1108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 110/2170 variables, 56/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2170 variables, 4/1168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/2170 variables, 0/1168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 110/2280 variables, 56/1224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/2280 variables, 4/1228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/2280 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 110/2390 variables, 56/1284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2390 variables, 4/1288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/2390 variables, 0/1288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 110/2500 variables, 56/1344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/2500 variables, 4/1348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/2500 variables, 0/1348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 108/2608 variables, 56/1404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/2608 variables, 4/1408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/2608 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 88/2696 variables, 50/1458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/2696 variables, 4/1462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/2696 variables, 0/1462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2760/5502 variables, and 1497 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5008 ms.
Refiners :[State Equation: 1400/2804 constraints, ReadFeed: 97/197 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/62 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 95/157 variables, 45/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 99/256 variables, 52/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 97/353 variables, 49/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/353 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 108/461 variables, 54/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/461 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/461 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 110/571 variables, 56/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/571 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/571 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 109/680 variables, 56/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/680 variables, 4/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/680 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 97/777 variables, 52/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/777 variables, 3/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/777 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 92/869 variables, 47/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/869 variables, 4/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/869 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 97/966 variables, 46/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/966 variables, 3/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/966 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 105/1071 variables, 54/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1071 variables, 4/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1071 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1180/5502 variables, and 625 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3557 ms.
Refiners :[State Equation: 587/2804 constraints, ReadFeed: 37/197 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 8648ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 2804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 2698/2698 transitions.
Graph (complete) has 8469 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2802 transition count 2696
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 2802 transition count 2694
Deduced a syphon composed of 2 places in 45 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 2800 transition count 2694
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 44 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 2798 transition count 2692
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 52 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 2797 transition count 2692
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 1 with 397 rules applied. Total rules applied 410 place count 2797 transition count 2295
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 1 with 397 rules applied. Total rules applied 807 place count 2400 transition count 2295
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions (Partial Free agglomeration) removed 400 transitions
Iterating global reduction 2 with 400 rules applied. Total rules applied 1207 place count 2400 transition count 2295
Applied a total of 1207 rules in 969 ms. Remains 2400 /2804 variables (removed 404) and now considering 2295/2698 (removed 403) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 970 ms. Remains : 2400/2804 places, 2295/2698 transitions.
RANDOM walk for 40000 steps (5136 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3380 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 126424 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 1
Probabilistic random walk after 126424 steps, saw 63267 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
// Phase 1: matrix 2295 rows 2400 cols
[2024-05-31 23:51:16] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-31 23:51:16] [INFO ] State equation strengthened by 398 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 54/67 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 870/937 variables, 198/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/937 variables, 9/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/937 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2660/3597 variables, 1312/1545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3597/4695 variables, and 1742 constraints, problems are : Problem set: 0 solved, 1 unsolved in 15271 ms.
Refiners :[State Equation: 1531/2400 constraints, ReadFeed: 211/398 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 54/67 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 870/937 variables, 198/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/937 variables, 9/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/937 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2660/3597 variables, 1312/1546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3597/4695 variables, and 1743 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11565 ms.
Refiners :[State Equation: 1531/2400 constraints, ReadFeed: 211/398 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 26916ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 2400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2400/2400 places, 2295/2295 transitions.
Applied a total of 0 rules in 212 ms. Remains 2400 /2400 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212 ms. Remains : 2400/2400 places, 2295/2295 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2400/2400 places, 2295/2295 transitions.
Applied a total of 0 rules in 196 ms. Remains 2400 /2400 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
// Phase 1: matrix 2295 rows 2400 cols
[2024-05-31 23:51:43] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-31 23:52:06] [INFO ] Implicit Places using invariants in 23052 ms returned []
// Phase 1: matrix 2295 rows 2400 cols
[2024-05-31 23:52:06] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-31 23:52:08] [INFO ] State equation strengthened by 398 read => feed constraints.
[2024-05-31 23:52:50] [INFO ] Performed 4/2400 implicitness test of which 0 returned IMPLICIT in 42 seconds.
[2024-05-31 23:53:38] [INFO ] Performed 6/2400 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-31 23:54:46] [INFO ] Performed 25/2400 implicitness test of which 2 returned IMPLICIT in 158 seconds.
[2024-05-31 23:54:46] [INFO ] Implicit Places using invariants and state equation in 160082 ms returned [19, 25]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 183167 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2398/2400 places, 2295/2295 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2398 transition count 2294
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2397 transition count 2294
Applied a total of 2 rules in 379 ms. Remains 2397 /2398 variables (removed 1) and now considering 2294/2295 (removed 1) transitions.
// Phase 1: matrix 2294 rows 2397 cols
[2024-05-31 23:54:47] [INFO ] Invariants computation overflowed in 54 ms
[2024-05-31 23:55:10] [INFO ] Implicit Places using invariants in 22967 ms returned []
// Phase 1: matrix 2294 rows 2397 cols
[2024-05-31 23:55:10] [INFO ] Invariants computation overflowed in 51 ms
[2024-05-31 23:55:11] [INFO ] State equation strengthened by 398 read => feed constraints.
[2024-05-31 23:55:45] [INFO ] Performed 4/2397 implicitness test of which 0 returned IMPLICIT in 34 seconds.
[2024-05-31 23:56:24] [INFO ] Performed 29/2397 implicitness test of which 0 returned IMPLICIT in 73 seconds.
[2024-05-31 23:57:23] [INFO ] Performed 31/2397 implicitness test of which 0 returned IMPLICIT in 131 seconds.
[2024-05-31 23:57:23] [INFO ] Timeout of Implicit test with SMT after 131 seconds.
[2024-05-31 23:57:23] [INFO ] Implicit Places using invariants and state equation in 133123 ms returned []
Implicit Place search using SMT with State Equation took 156113 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2397/2400 places, 2294/2295 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 339856 ms. Remains : 2397/2400 places, 2294/2295 transitions.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 2698 rows 2804 cols
[2024-05-31 23:57:23] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-31 23:57:38] [INFO ] [Real]Absence check using state equation in 10833 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-01 finished in 1580331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)||X(G((!p1||F(p2))))) U p1))'
Support contains 6 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1191 transitions
Trivial Post-agglo rules discarded 1191 transitions
Performed 1191 trivial Post agglomeration. Transition count delta: 1191
Iterating post reduction 0 with 1191 rules applied. Total rules applied 1191 place count 5299 transition count 3806
Reduce places removed 1191 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 1194 rules applied. Total rules applied 2385 place count 4108 transition count 3803
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 2388 place count 4105 transition count 3803
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 2388 place count 4105 transition count 3602
Deduced a syphon composed of 201 places in 203 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 2790 place count 3904 transition count 3602
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 67 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 3 with 1802 rules applied. Total rules applied 4592 place count 3003 transition count 2701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 67 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4794 place count 2902 transition count 2701
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 63 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 4984 place count 2807 transition count 2701
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 4985 place count 2807 transition count 2701
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4986 place count 2806 transition count 2700
Applied a total of 4986 rules in 1599 ms. Remains 2806 /5300 variables (removed 2494) and now considering 2700/4998 (removed 2298) transitions.
// Phase 1: matrix 2700 rows 2806 cols
[2024-05-31 23:57:40] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-31 23:57:41] [INFO ] Implicit Places using invariants in 1283 ms returned []
// Phase 1: matrix 2700 rows 2806 cols
[2024-05-31 23:57:41] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-31 23:57:42] [INFO ] State equation strengthened by 196 read => feed constraints.
[2024-05-31 23:58:23] [INFO ] Performed 3/2806 implicitness test of which 0 returned IMPLICIT in 40 seconds.
[2024-06-01 00:00:21] [INFO ] Performed 4/2806 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2024-06-01 00:00:21] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2024-06-01 00:00:21] [INFO ] Implicit Places using invariants and state equation in 160114 ms returned []
Implicit Place search using SMT with State Equation took 161399 ms to find 0 implicit places.
[2024-06-01 00:00:21] [INFO ] Redundant transitions in 84 ms returned []
Running 2699 sub problems to find dead transitions.
// Phase 1: matrix 2700 rows 2806 cols
[2024-06-01 00:00:21] [INFO ] Invariants computation overflowed in 47 ms
[2024-06-01 00:00:21] [INFO ] State equation strengthened by 196 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2805/5506 variables, and 0 constraints, problems are : Problem set: 0 solved, 2699 unsolved in 30045 ms.
Refiners :[State Equation: 0/2806 constraints, ReadFeed: 0/196 constraints, PredecessorRefiner: 2699/2699 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2699 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2805/5506 variables, and 0 constraints, problems are : Problem set: 0 solved, 2699 unsolved in 30040 ms.
Refiners :[State Equation: 0/2806 constraints, ReadFeed: 0/196 constraints, PredecessorRefiner: 0/2699 constraints, Known Traps: 0/0 constraints]
After SMT, in 61117ms problems are : Problem set: 0 solved, 2699 unsolved
Search for dead transitions found 0 dead transitions in 61141ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2806/5300 places, 2700/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 224244 ms. Remains : 2806/5300 places, 2700/4998 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-02
Stuttering criterion allowed to conclude after 310 steps with 36 reset in 2 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-02 finished in 224468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((p1 U p2)))))'
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1195 transitions
Trivial Post-agglo rules discarded 1195 transitions
Performed 1195 trivial Post agglomeration. Transition count delta: 1195
Iterating post reduction 0 with 1195 rules applied. Total rules applied 1195 place count 5299 transition count 3802
Reduce places removed 1195 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1196 rules applied. Total rules applied 2391 place count 4104 transition count 3801
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2392 place count 4103 transition count 3801
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2392 place count 4103 transition count 3601
Deduced a syphon composed of 200 places in 204 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2792 place count 3903 transition count 3601
Performed 902 Post agglomeration using F-continuation condition.Transition count delta: 902
Deduced a syphon composed of 902 places in 79 ms
Reduce places removed 902 places and 0 transitions.
Iterating global reduction 3 with 1804 rules applied. Total rules applied 4596 place count 3001 transition count 2699
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 69 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4798 place count 2900 transition count 2699
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 53 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 4990 place count 2804 transition count 2699
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 4991 place count 2804 transition count 2699
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4992 place count 2803 transition count 2698
Applied a total of 4992 rules in 1503 ms. Remains 2803 /5300 variables (removed 2497) and now considering 2698/4998 (removed 2300) transitions.
// Phase 1: matrix 2698 rows 2803 cols
[2024-06-01 00:01:24] [INFO ] Invariants computation overflowed in 51 ms
[2024-06-01 00:01:26] [INFO ] Implicit Places using invariants in 1271 ms returned []
// Phase 1: matrix 2698 rows 2803 cols
[2024-06-01 00:01:26] [INFO ] Invariants computation overflowed in 38 ms
[2024-06-01 00:01:27] [INFO ] State equation strengthened by 197 read => feed constraints.
[2024-06-01 00:02:02] [INFO ] Performed 4/2803 implicitness test of which 0 returned IMPLICIT in 34 seconds.
[2024-06-01 00:02:32] [INFO ] Performed 197/2803 implicitness test of which 0 returned IMPLICIT in 65 seconds.
[2024-06-01 00:04:06] [INFO ] Performed 260/2803 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2024-06-01 00:04:06] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2024-06-01 00:04:06] [INFO ] Implicit Places using invariants and state equation in 160101 ms returned []
Implicit Place search using SMT with State Equation took 161375 ms to find 0 implicit places.
[2024-06-01 00:04:06] [INFO ] Redundant transitions in 94 ms returned []
Running 2697 sub problems to find dead transitions.
// Phase 1: matrix 2698 rows 2803 cols
[2024-06-01 00:04:06] [INFO ] Invariants computation overflowed in 46 ms
[2024-06-01 00:04:06] [INFO ] State equation strengthened by 197 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2802/5501 variables, and 0 constraints, problems are : Problem set: 0 solved, 2697 unsolved in 30045 ms.
Refiners :[State Equation: 0/2803 constraints, ReadFeed: 0/197 constraints, PredecessorRefiner: 2697/2697 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2697 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2802/5501 variables, and 0 constraints, problems are : Problem set: 0 solved, 2697 unsolved in 30047 ms.
Refiners :[State Equation: 0/2803 constraints, ReadFeed: 0/197 constraints, PredecessorRefiner: 0/2697 constraints, Known Traps: 0/0 constraints]
After SMT, in 61062ms problems are : Problem set: 0 solved, 2697 unsolved
Search for dead transitions found 0 dead transitions in 61087ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2803/5300 places, 2698/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 224076 ms. Remains : 2803/5300 places, 2698/4998 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-03
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-03 finished in 224239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&(p1||X(F((p2||G(p3))))))))'
Support contains 7 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1190 transitions
Trivial Post-agglo rules discarded 1190 transitions
Performed 1190 trivial Post agglomeration. Transition count delta: 1190
Iterating post reduction 0 with 1190 rules applied. Total rules applied 1190 place count 5299 transition count 3807
Reduce places removed 1190 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 1194 rules applied. Total rules applied 2384 place count 4109 transition count 3803
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 2388 place count 4105 transition count 3803
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 2388 place count 4105 transition count 3602
Deduced a syphon composed of 201 places in 168 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 2790 place count 3904 transition count 3602
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 62 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 3 with 1802 rules applied. Total rules applied 4592 place count 3003 transition count 2701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 54 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4794 place count 2902 transition count 2701
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 48 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 4988 place count 2805 transition count 2701
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4989 place count 2804 transition count 2700
Applied a total of 4989 rules in 1220 ms. Remains 2804 /5300 variables (removed 2496) and now considering 2700/4998 (removed 2298) transitions.
// Phase 1: matrix 2700 rows 2804 cols
[2024-06-01 00:05:08] [INFO ] Invariants computation overflowed in 55 ms
[2024-06-01 00:05:10] [INFO ] Implicit Places using invariants in 1360 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2024-06-01 00:05:10] [INFO ] Invariants computation overflowed in 59 ms
[2024-06-01 00:05:11] [INFO ] State equation strengthened by 196 read => feed constraints.
[2024-06-01 00:07:42] [INFO ] Performed 1/2804 implicitness test of which 0 returned IMPLICIT in 151 seconds.
[2024-06-01 00:07:42] [INFO ] Timeout of Implicit test with SMT after 151 seconds.
[2024-06-01 00:07:42] [INFO ] Implicit Places using invariants and state equation in 152804 ms returned []
Implicit Place search using SMT with State Equation took 154166 ms to find 0 implicit places.
[2024-06-01 00:07:42] [INFO ] Redundant transitions in 84 ms returned []
Running 2699 sub problems to find dead transitions.
// Phase 1: matrix 2700 rows 2804 cols
[2024-06-01 00:07:43] [INFO ] Invariants computation overflowed in 53 ms
[2024-06-01 00:07:43] [INFO ] State equation strengthened by 196 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2803/5504 variables, and 0 constraints, problems are : Problem set: 0 solved, 2699 unsolved in 30034 ms.
Refiners :[State Equation: 0/2804 constraints, ReadFeed: 0/196 constraints, PredecessorRefiner: 2699/2699 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2699 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2803/5504 variables, and 0 constraints, problems are : Problem set: 0 solved, 2699 unsolved in 30032 ms.
Refiners :[State Equation: 0/2804 constraints, ReadFeed: 0/196 constraints, PredecessorRefiner: 0/2699 constraints, Known Traps: 0/0 constraints]
After SMT, in 61012ms problems are : Problem set: 0 solved, 2699 unsolved
Search for dead transitions found 0 dead transitions in 61037ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2804/5300 places, 2700/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 216531 ms. Remains : 2804/5300 places, 2700/4998 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-04
Product exploration explored 100000 steps with 13858 reset in 297 ms.
Product exploration explored 100000 steps with 13948 reset in 360 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8873 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p2) p3)), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 159 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (5583 resets) in 474 ms. (84 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (3277 resets) in 658 ms. (60 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (3221 resets) in 1466 ms. (27 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (3300 resets) in 1219 ms. (32 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (3268 resets) in 707 ms. (56 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (3244 resets) in 1052 ms. (37 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (3198 resets) in 836 ms. (47 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (3233 resets) in 670 ms. (59 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 126773 steps, run timeout after 6001 ms. (steps per millisecond=21 ) properties seen :0 out of 7
Probabilistic random walk after 126773 steps, saw 63396 distinct states, run finished after 6001 ms. (steps per millisecond=21 ) properties seen :0
// Phase 1: matrix 2700 rows 2804 cols
[2024-06-01 00:08:53] [INFO ] Invariants computation overflowed in 56 ms
[2024-06-01 00:08:53] [INFO ] State equation strengthened by 196 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 117/149 variables, 44/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 258/407 variables, 113/164 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 9/173 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 353/760 variables, 178/351 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/760 variables, 14/365 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/760 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 365/1125 variables, 180/545 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1125 variables, 13/558 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1125 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 406/1531 variables, 204/762 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1531 variables, 15/777 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1531 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 418/1949 variables, 214/991 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1949 variables, 16/1007 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1949 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 364/2313 variables, 195/1202 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2313 variables, 13/1215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2313 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 300/2613 variables, 161/1376 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2613 variables, 11/1387 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2613 variables, 0/1387 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2851/5504 variables, and 1514 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5031 ms.
Refiners :[State Equation: 1423/2804 constraints, ReadFeed: 91/196 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 117/149 variables, 44/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 258/407 variables, 113/171 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 9/180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 353/760 variables, 178/358 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/760 variables, 14/372 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/760 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 365/1125 variables, 180/552 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1125 variables, 13/565 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1125 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 406/1531 variables, 204/769 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1531 variables, 15/784 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1531 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 418/1949 variables, 214/998 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1949 variables, 16/1014 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1949 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 364/2313 variables, 195/1209 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2313 variables, 13/1222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2313 variables, 0/1222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 300/2613 variables, 161/1383 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2613 variables, 11/1394 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2613 variables, 0/1394 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2851/5504 variables, and 1521 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5010 ms.
Refiners :[State Equation: 1423/2804 constraints, ReadFeed: 91/196 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 10126ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 2804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Graph (complete) has 8477 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2802 transition count 2698
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2802 transition count 2697
Deduced a syphon composed of 1 places in 40 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2801 transition count 2697
Free-agglomeration rule (complex) applied 395 times.
Iterating global reduction 1 with 395 rules applied. Total rules applied 400 place count 2801 transition count 2302
Reduce places removed 395 places and 0 transitions.
Iterating post reduction 1 with 395 rules applied. Total rules applied 795 place count 2406 transition count 2302
Partial Free-agglomeration rule applied 399 times.
Drop transitions (Partial Free agglomeration) removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1194 place count 2406 transition count 2302
Applied a total of 1194 rules in 532 ms. Remains 2406 /2804 variables (removed 398) and now considering 2302/2700 (removed 398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 533 ms. Remains : 2406/2804 places, 2302/2700 transitions.
RANDOM walk for 40000 steps (5028 resets) in 2142 ms. (18 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (3370 resets) in 1506 ms. (26 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (3355 resets) in 1694 ms. (23 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (3375 resets) in 850 ms. (47 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (3401 resets) in 1652 ms. (24 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (3414 resets) in 679 ms. (58 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (3372 resets) in 1249 ms. (32 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (3404 resets) in 1295 ms. (30 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 243170 steps, run timeout after 9001 ms. (steps per millisecond=27 ) properties seen :0 out of 7
Probabilistic random walk after 243170 steps, saw 121638 distinct states, run finished after 9001 ms. (steps per millisecond=27 ) properties seen :0
// Phase 1: matrix 2302 rows 2406 cols
[2024-06-01 00:09:16] [INFO ] Invariants computation overflowed in 54 ms
[2024-06-01 00:09:16] [INFO ] State equation strengthened by 397 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 28/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 847/882 variables, 177/185 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/882 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/882 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 2679/3561 variables, 1317/1505 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3561 variables, 211/1716 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/3561 variables, 0/1716 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4708/4708 variables, and 2621 constraints, problems are : Problem set: 0 solved, 7 unsolved in 45042 ms.
Refiners :[State Equation: 2406/2406 constraints, ReadFeed: 215/397 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 28/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 847/882 variables, 177/185 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/882 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/882 variables, 5/193 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/882 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 2679/3561 variables, 1317/1510 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3561 variables, 211/1721 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3561 variables, 2/1723 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3561 variables, 0/1723 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4708/4708 variables, and 2628 constraints, problems are : Problem set: 0 solved, 7 unsolved in 45027 ms.
Refiners :[State Equation: 2406/2406 constraints, ReadFeed: 215/397 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 90150ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 2406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2406/2406 places, 2302/2302 transitions.
Applied a total of 0 rules in 143 ms. Remains 2406 /2406 variables (removed 0) and now considering 2302/2302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 2406/2406 places, 2302/2302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2406/2406 places, 2302/2302 transitions.
Applied a total of 0 rules in 153 ms. Remains 2406 /2406 variables (removed 0) and now considering 2302/2302 (removed 0) transitions.
// Phase 1: matrix 2302 rows 2406 cols
[2024-06-01 00:10:47] [INFO ] Invariants computation overflowed in 52 ms
[2024-06-01 00:10:59] [INFO ] Implicit Places using invariants in 12550 ms returned []
// Phase 1: matrix 2302 rows 2406 cols
[2024-06-01 00:10:59] [INFO ] Invariants computation overflowed in 46 ms
[2024-06-01 00:11:00] [INFO ] State equation strengthened by 397 read => feed constraints.
[2024-06-01 00:11:31] [INFO ] Performed 30/2406 implicitness test of which 2 returned IMPLICIT in 30 seconds.
[2024-06-01 00:12:01] [INFO ] Performed 333/2406 implicitness test of which 26 returned IMPLICIT in 60 seconds.
[2024-06-01 00:13:39] [INFO ] Performed 352/2406 implicitness test of which 27 returned IMPLICIT in 158 seconds.
[2024-06-01 00:13:39] [INFO ] Implicit Places using invariants and state equation in 160088 ms returned [20, 26, 48, 55, 77, 82, 102, 108, 129, 134, 156, 162, 182, 184, 188, 209, 215, 236, 241, 245, 262, 268, 288, 294, 318, 324, 346]
[2024-06-01 00:13:39] [INFO ] Actually due to overlaps returned [245, 184, 346]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 172653 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2403/2406 places, 2302/2302 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2403 transition count 2301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2402 transition count 2301
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 2402 transition count 2301
Applied a total of 3 rules in 433 ms. Remains 2402 /2403 variables (removed 1) and now considering 2301/2302 (removed 1) transitions.
// Phase 1: matrix 2301 rows 2402 cols
[2024-06-01 00:13:40] [INFO ] Invariants computation overflowed in 77 ms
[2024-06-01 00:13:52] [INFO ] Implicit Places using invariants in 12459 ms returned []
// Phase 1: matrix 2301 rows 2402 cols
[2024-06-01 00:13:52] [INFO ] Invariants computation overflowed in 53 ms
[2024-06-01 00:13:54] [INFO ] State equation strengthened by 397 read => feed constraints.
[2024-06-01 00:14:43] [INFO ] Performed 26/2402 implicitness test of which 2 returned IMPLICIT in 49 seconds.
[2024-06-01 00:15:15] [INFO ] Performed 28/2402 implicitness test of which 2 returned IMPLICIT in 81 seconds.
[2024-06-01 00:15:47] [INFO ] Performed 234/2402 implicitness test of which 16 returned IMPLICIT in 113 seconds.
[2024-06-01 00:16:32] [INFO ] Performed 347/2402 implicitness test of which 25 returned IMPLICIT in 158 seconds.
[2024-06-01 00:16:32] [INFO ] Implicit Places using invariants and state equation in 160110 ms returned [20, 26, 48, 55, 77, 82, 102, 108, 129, 134, 156, 162, 182, 187, 208, 214, 235, 240, 259, 265, 285, 291, 315, 321, 347]
[2024-06-01 00:16:32] [INFO ] Actually due to overlaps returned [347, 26, 20]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 172600 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2399/2406 places, 2301/2302 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2399 transition count 2300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2398 transition count 2300
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 2398 transition count 2300
Applied a total of 3 rules in 473 ms. Remains 2398 /2399 variables (removed 1) and now considering 2300/2301 (removed 1) transitions.
// Phase 1: matrix 2300 rows 2398 cols
[2024-06-01 00:16:33] [INFO ] Invariants computation overflowed in 50 ms
[2024-06-01 00:16:45] [INFO ] Implicit Places using invariants in 12591 ms returned []
// Phase 1: matrix 2300 rows 2398 cols
[2024-06-01 00:16:45] [INFO ] Invariants computation overflowed in 44 ms
[2024-06-01 00:16:47] [INFO ] State equation strengthened by 397 read => feed constraints.
[2024-06-01 00:17:17] [INFO ] Performed 6/2398 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 00:17:52] [INFO ] Performed 172/2398 implicitness test of which 10 returned IMPLICIT in 65 seconds.
[2024-06-01 00:18:28] [INFO ] Performed 350/2398 implicitness test of which 22 returned IMPLICIT in 100 seconds.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="DoubleExponent-PT-100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-100.tgz
mv DoubleExponent-PT-100 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;