fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r512-smll-171654407400340
Last Updated
July 7, 2024

About the Execution of LTSMin+red for PhaseVariation-PT-D10CS100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2645.771 1667139.00 1938290.00 3960.30 TFTFTFFFFTFTTFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r512-smll-171654407400340.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 PhaseVariation-PT-D10CS100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407400340
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.8K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 11 21:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 21:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 11 21:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.9M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717288051941

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhaseVariation-PT-D10CS100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 00:27:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 00:27:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 00:27:35] [INFO ] Load time of PNML (sax parser for PT used): 783 ms
[2024-06-02 00:27:35] [INFO ] Transformed 302 places.
[2024-06-02 00:27:35] [INFO ] Transformed 3137 transitions.
[2024-06-02 00:27:35] [INFO ] Parsed PT model containing 302 places and 3137 transitions and 21755 arcs in 1076 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA PhaseVariation-PT-D10CS100-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 3137/3137 transitions.
Applied a total of 0 rules in 87 ms. Remains 302 /302 variables (removed 0) and now considering 3137/3137 (removed 0) transitions.
Running 3119 sub problems to find dead transitions.
[2024-06-02 00:27:36] [INFO ] Flow matrix only has 201 transitions (discarded 2936 similar events)
// Phase 1: matrix 201 rows 302 cols
[2024-06-02 00:27:36] [INFO ] Computed 101 invariants in 39 ms
[2024-06-02 00:27:36] [INFO ] State equation strengthened by 183 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 3119 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 301/503 variables, and 100 constraints, problems are : Problem set: 0 solved, 3119 unsolved in 20243 ms.
Refiners :[Positive P Invariants (semi-flows): 100/101 constraints, State Equation: 0/302 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 3119/3119 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 3119 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 1)
(s16 0)
(s17 1)
(s18 0)
(s19 1)
(s20 0)
(s21 1)
(s22 0)
(s23 1)
(s24 0)
(s25 1)
(s26 0)
(s27 1)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 1)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 1)
(s66 0)
(s67 1)
(s68 0)
(s69 1)
(s70 0)
(s71 1)
(s72 0)
(s73 1)
(s74 0)
(s75 1)
(s76 0)
(s77 1)
(s78 0)
(s79 1)
(s80 0)
(s81 1)
(s82 0)
(s83 1)
(s84 0)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 1)
(s96 0)
(s97 1)
(s98 0)
(s99 1)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 1)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 1)
(s116 0)
(s117 1)
(s118 0)
(s119 1)
(s120 0)
(s121 1)
(s122 0)
(s123 1)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 1)
(s130 0)
(s131 1)
(s132 0)
(s133 1)
(s134 0)
(s135 1)
(s136 0)
(s137 1)
(s138 0)
(s139 1)
(s140 0)
(s141 1)
(s142 0)
(s143 1)
(s144 0)
(s145 1)
(s146 0)
(s147 1)
(s148 0)
(s149 1)
(s150 0)
(s151 1)
(s152 0)
(s153 1)
(s154 0)
(s155 1)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 1)
(s166 0)
(s167 1)
(s168 0)
(s169 1)
(s170 0)
(s171 1)
(s172 0)
(s173 1)
(s174 0)
(s175 1)
(s176 1)
(s177 0)
(s178 1)
(s179 0)
(s180 1)
(s181 0)
(s182 0)
(s183 1)
(s184 0)
(s185 1)
(s186 0)
(s187 1)
(s188 0)
(s189 1)
(s190 0)
(s191 1)
(s192 0)
(s193 1)
(s194 0)
(s195 1)
(s196 1)
(s197 0)
(s198 0)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 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)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/503 variables, and 100 constraints, problems are : Problem set: 0 solved, 3119 unsolved in 20107 ms.
Refiners :[Positive P Invariants (semi-flows): 100/101 constraints, State Equation: 0/302 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/3119 constraints, Known Traps: 0/0 constraints]
After SMT, in 42697ms problems are : Problem set: 0 solved, 3119 unsolved
Search for dead transitions found 0 dead transitions in 42873ms
[2024-06-02 00:28:19] [INFO ] Flow matrix only has 201 transitions (discarded 2936 similar events)
[2024-06-02 00:28:19] [INFO ] Invariant cache hit.
[2024-06-02 00:28:19] [INFO ] Implicit Places using invariants in 778 ms returned []
[2024-06-02 00:28:19] [INFO ] Flow matrix only has 201 transitions (discarded 2936 similar events)
[2024-06-02 00:28:19] [INFO ] Invariant cache hit.
[2024-06-02 00:28:20] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-06-02 00:28:20] [INFO ] Implicit Places using invariants and state equation in 1048 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1851 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/302 places, 3137/3137 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 306 transitions
Redundant transition composition rules discarded 306 transitions
Iterating global reduction 0 with 306 rules applied. Total rules applied 306 place count 301 transition count 2831
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 308 place count 300 transition count 2830
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 314 place count 294 transition count 2782
Iterating global reduction 1 with 6 rules applied. Total rules applied 320 place count 294 transition count 2782
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 326 place count 294 transition count 2776
Applied a total of 326 rules in 160 ms. Remains 294 /301 variables (removed 7) and now considering 2776/3137 (removed 361) transitions.
[2024-06-02 00:28:21] [INFO ] Flow matrix only has 194 transitions (discarded 2582 similar events)
// Phase 1: matrix 194 rows 294 cols
[2024-06-02 00:28:21] [INFO ] Computed 100 invariants in 16 ms
[2024-06-02 00:28:21] [INFO ] Implicit Places using invariants in 662 ms returned []
[2024-06-02 00:28:21] [INFO ] Flow matrix only has 194 transitions (discarded 2582 similar events)
[2024-06-02 00:28:21] [INFO ] Invariant cache hit.
[2024-06-02 00:28:22] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-06-02 00:28:22] [INFO ] Implicit Places using invariants and state equation in 1006 ms returned []
Implicit Place search using SMT with State Equation took 1674 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 294/302 places, 2776/3137 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46746 ms. Remains : 294/302 places, 2776/3137 transitions.
Support contains 61 out of 294 places after structural reductions.
[2024-06-02 00:28:23] [INFO ] Flatten gal took : 491 ms
[2024-06-02 00:28:23] [INFO ] Flatten gal took : 228 ms
[2024-06-02 00:28:24] [INFO ] Input system was already deterministic with 2776 transitions.
Support contains 57 out of 294 places (down from 61) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 31 to 30
RANDOM walk for 15825 steps (61 resets) in 1204 ms. (13 steps per ms) remains 0/30 properties
Computed a total of 294 stabilizing places and 2776 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 294 transition count 2776
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(((!p0&&X(F(!p0))&&G(!p1))||G(!p0))))||(F(!p2)&&X(F(((!p0&&X(F(!p0))&&G(!p1))||G(!p0)))))))'
Support contains 7 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 2776/2776 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 293 transition count 2770
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 293 transition count 2770
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 293 transition count 2769
Applied a total of 3 rules in 65 ms. Remains 293 /294 variables (removed 1) and now considering 2769/2776 (removed 7) transitions.
Running 2759 sub problems to find dead transitions.
[2024-06-02 00:28:25] [INFO ] Flow matrix only has 193 transitions (discarded 2576 similar events)
// Phase 1: matrix 193 rows 293 cols
[2024-06-02 00:28:25] [INFO ] Computed 100 invariants in 6 ms
[2024-06-02 00:28:25] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2759 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 284/486 variables, and 91 constraints, problems are : Problem set: 0 solved, 2759 unsolved in 20079 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/293 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2759/2759 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2759 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2759 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 284/486 variables, and 91 constraints, problems are : Problem set: 0 solved, 2759 unsolved in 20075 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/293 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2759 constraints, Known Traps: 0/0 constraints]
After SMT, in 42178ms problems are : Problem set: 0 solved, 2759 unsolved
Search for dead transitions found 0 dead transitions in 42287ms
[2024-06-02 00:29:07] [INFO ] Flow matrix only has 193 transitions (discarded 2576 similar events)
[2024-06-02 00:29:07] [INFO ] Invariant cache hit.
[2024-06-02 00:29:08] [INFO ] Implicit Places using invariants in 807 ms returned []
[2024-06-02 00:29:08] [INFO ] Flow matrix only has 193 transitions (discarded 2576 similar events)
[2024-06-02 00:29:08] [INFO ] Invariant cache hit.
[2024-06-02 00:29:08] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-06-02 00:29:09] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned []
Implicit Place search using SMT with State Equation took 1912 ms to find 0 implicit places.
Running 2759 sub problems to find dead transitions.
[2024-06-02 00:29:09] [INFO ] Flow matrix only has 193 transitions (discarded 2576 similar events)
[2024-06-02 00:29:09] [INFO ] Invariant cache hit.
[2024-06-02 00:29:09] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2759 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 284/486 variables, and 91 constraints, problems are : Problem set: 0 solved, 2759 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/293 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2759/2759 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2759 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2759 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 284/486 variables, and 91 constraints, problems are : Problem set: 0 solved, 2759 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/293 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2759 constraints, Known Traps: 0/0 constraints]
After SMT, in 61602ms problems are : Problem set: 0 solved, 2759 unsolved
Search for dead transitions found 0 dead transitions in 61654ms
Starting structural reductions in LTL mode, iteration 1 : 293/294 places, 2769/2776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105946 ms. Remains : 293/294 places, 2769/2776 transitions.
Stuttering acceptance computed with spot in 879 ms :[p0, p0, p0, (AND p0 p2), (AND p0 p2), (AND p0 p1), (AND p0 p1), (AND p0 p1 p2), p0, (AND p0 p1)]
Running random walk in product with property : PhaseVariation-PT-D10CS100-LTLFireability-00
Product exploration explored 100000 steps with 1691 reset in 2499 ms.
Product exploration explored 100000 steps with 1647 reset in 2086 ms.
Computed a total of 293 stabilizing places and 2769 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 293 transition count 2769
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (OR p0 p1))), (X (NOT (OR (AND p2 p0) (AND p2 p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (OR (AND p2 p0) (AND p2 p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 37 ms. Reduced automaton from 10 states, 30 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhaseVariation-PT-D10CS100-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhaseVariation-PT-D10CS100-LTLFireability-00 finished in 112081 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) U G(p1)))'
Support contains 5 out of 294 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 294/294 places, 2776/2776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 292 transition count 2760
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 292 transition count 2760
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 292 transition count 2758
Applied a total of 6 rules in 1242 ms. Remains 292 /294 variables (removed 2) and now considering 2758/2776 (removed 18) transitions.
Running 2749 sub problems to find dead transitions.
[2024-06-02 00:30:18] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
// Phase 1: matrix 192 rows 292 cols
[2024-06-02 00:30:18] [INFO ] Computed 100 invariants in 6 ms
[2024-06-02 00:30:18] [INFO ] State equation strengthened by 183 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 20074 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2749/2749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 0)
(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 0)
(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 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 20079 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2749 constraints, Known Traps: 0/0 constraints]
After SMT, in 41228ms problems are : Problem set: 0 solved, 2749 unsolved
Search for dead transitions found 0 dead transitions in 41259ms
[2024-06-02 00:30:59] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:30:59] [INFO ] Invariant cache hit.
[2024-06-02 00:31:00] [INFO ] Implicit Places using invariants in 843 ms returned []
[2024-06-02 00:31:00] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:31:00] [INFO ] Invariant cache hit.
[2024-06-02 00:31:01] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-06-02 00:31:01] [INFO ] Implicit Places using invariants and state equation in 1107 ms returned []
Implicit Place search using SMT with State Equation took 1955 ms to find 0 implicit places.
[2024-06-02 00:31:02] [INFO ] Redundant transitions in 325 ms returned []
Running 2749 sub problems to find dead transitions.
[2024-06-02 00:31:02] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:31:02] [INFO ] Invariant cache hit.
[2024-06-02 00:31:02] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2749/2749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2749 constraints, Known Traps: 0/0 constraints]
After SMT, in 61506ms problems are : Problem set: 0 solved, 2749 unsolved
Search for dead transitions found 0 dead transitions in 61556ms
Starting structural reductions in SI_LTL mode, iteration 1 : 292/294 places, 2758/2776 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106371 ms. Remains : 292/294 places, 2758/2776 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : PhaseVariation-PT-D10CS100-LTLFireability-01
Stuttering criterion allowed to conclude after 150 steps with 0 reset in 6 ms.
FORMULA PhaseVariation-PT-D10CS100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D10CS100-LTLFireability-01 finished in 106535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 294 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 294/294 places, 2776/2776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 292 transition count 2760
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 292 transition count 2760
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 292 transition count 2758
Applied a total of 6 rules in 1114 ms. Remains 292 /294 variables (removed 2) and now considering 2758/2776 (removed 18) transitions.
Running 2749 sub problems to find dead transitions.
[2024-06-02 00:32:05] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:32:05] [INFO ] Invariant cache hit.
[2024-06-02 00:32:05] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 20078 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2749/2749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 0)
(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 0)
(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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 20075 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2749 constraints, Known Traps: 0/0 constraints]
After SMT, in 41480ms problems are : Problem set: 0 solved, 2749 unsolved
Search for dead transitions found 0 dead transitions in 41510ms
[2024-06-02 00:32:46] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:32:46] [INFO ] Invariant cache hit.
[2024-06-02 00:32:47] [INFO ] Implicit Places using invariants in 782 ms returned []
[2024-06-02 00:32:47] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:32:47] [INFO ] Invariant cache hit.
[2024-06-02 00:32:47] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-06-02 00:32:48] [INFO ] Implicit Places using invariants and state equation in 1189 ms returned []
Implicit Place search using SMT with State Equation took 1974 ms to find 0 implicit places.
[2024-06-02 00:32:48] [INFO ] Redundant transitions in 381 ms returned []
Running 2749 sub problems to find dead transitions.
[2024-06-02 00:32:48] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:32:48] [INFO ] Invariant cache hit.
[2024-06-02 00:32:48] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2749/2749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2749 constraints, Known Traps: 0/0 constraints]
After SMT, in 61407ms problems are : Problem set: 0 solved, 2749 unsolved
Search for dead transitions found 0 dead transitions in 61455ms
Starting structural reductions in SI_LTL mode, iteration 1 : 292/294 places, 2758/2776 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106456 ms. Remains : 292/294 places, 2758/2776 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhaseVariation-PT-D10CS100-LTLFireability-02
Product exploration explored 100000 steps with 749 reset in 2313 ms.
Product exploration explored 100000 steps with 768 reset in 2087 ms.
Computed a total of 292 stabilizing places and 2758 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 292 transition count 2758
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhaseVariation-PT-D10CS100-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhaseVariation-PT-D10CS100-LTLFireability-02 finished in 111457 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(p1)&&p0)||(G(p2)&&X(p3)))))'
Support contains 9 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 2776/2776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 292 transition count 2760
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 292 transition count 2760
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 292 transition count 2758
Applied a total of 6 rules in 32 ms. Remains 292 /294 variables (removed 2) and now considering 2758/2776 (removed 18) transitions.
Running 2749 sub problems to find dead transitions.
[2024-06-02 00:33:55] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:33:55] [INFO ] Invariant cache hit.
[2024-06-02 00:33:55] [INFO ] State equation strengthened by 183 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 20080 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2749/2749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 20082 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2749 constraints, Known Traps: 0/0 constraints]
After SMT, in 41551ms problems are : Problem set: 0 solved, 2749 unsolved
Search for dead transitions found 0 dead transitions in 41592ms
[2024-06-02 00:34:36] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:34:36] [INFO ] Invariant cache hit.
[2024-06-02 00:34:37] [INFO ] Implicit Places using invariants in 892 ms returned []
[2024-06-02 00:34:37] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:34:37] [INFO ] Invariant cache hit.
[2024-06-02 00:34:38] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-06-02 00:34:39] [INFO ] Implicit Places using invariants and state equation in 1156 ms returned []
Implicit Place search using SMT with State Equation took 2056 ms to find 0 implicit places.
Running 2749 sub problems to find dead transitions.
[2024-06-02 00:34:39] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:34:39] [INFO ] Invariant cache hit.
[2024-06-02 00:34:39] [INFO ] State equation strengthened by 183 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 0.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 0.0)
(s169 1.0)
(s170 1.0)
(s171 0.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2749/2749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 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 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2749 constraints, Known Traps: 0/0 constraints]
After SMT, in 61999ms problems are : Problem set: 0 solved, 2749 unsolved
Search for dead transitions found 0 dead transitions in 62049ms
Starting structural reductions in LTL mode, iteration 1 : 292/294 places, 2758/2776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105757 ms. Remains : 292/294 places, 2758/2776 transitions.
Stuttering acceptance computed with spot in 503 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (NOT p3) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1)]
Running random walk in product with property : PhaseVariation-PT-D10CS100-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PhaseVariation-PT-D10CS100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D10CS100-LTLFireability-03 finished in 106295 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(((!p2 U (p3||G(!p2)))||p1)))))'
Support contains 7 out of 294 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 294/294 places, 2776/2776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 292 transition count 2760
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 292 transition count 2760
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 292 transition count 2758
Applied a total of 6 rules in 852 ms. Remains 292 /294 variables (removed 2) and now considering 2758/2776 (removed 18) transitions.
Running 2749 sub problems to find dead transitions.
[2024-06-02 00:35:42] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:35:42] [INFO ] Invariant cache hit.
[2024-06-02 00:35:42] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 20075 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2749/2749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2749 constraints, Known Traps: 0/0 constraints]
After SMT, in 41241ms problems are : Problem set: 0 solved, 2749 unsolved
Search for dead transitions found 0 dead transitions in 41271ms
[2024-06-02 00:36:23] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:36:23] [INFO ] Invariant cache hit.
[2024-06-02 00:36:24] [INFO ] Implicit Places using invariants in 579 ms returned []
[2024-06-02 00:36:24] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:36:24] [INFO ] Invariant cache hit.
[2024-06-02 00:36:24] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-06-02 00:36:25] [INFO ] Implicit Places using invariants and state equation in 1062 ms returned []
Implicit Place search using SMT with State Equation took 1649 ms to find 0 implicit places.
[2024-06-02 00:36:25] [INFO ] Redundant transitions in 156 ms returned []
Running 2749 sub problems to find dead transitions.
[2024-06-02 00:36:25] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:36:25] [INFO ] Invariant cache hit.
[2024-06-02 00:36:25] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2749/2749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2749 constraints, Known Traps: 0/0 constraints]
After SMT, in 61387ms problems are : Problem set: 0 solved, 2749 unsolved
Search for dead transitions found 0 dead transitions in 61435ms
Starting structural reductions in SI_LTL mode, iteration 1 : 292/294 places, 2758/2776 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105384 ms. Remains : 292/294 places, 2758/2776 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3))]
Running random walk in product with property : PhaseVariation-PT-D10CS100-LTLFireability-04
Product exploration explored 100000 steps with 646 reset in 2302 ms.
Product exploration explored 100000 steps with 649 reset in 2029 ms.
Computed a total of 292 stabilizing places and 2758 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 292 transition count 2758
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p3) p2)))), (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p2))))), (X (OR p1 p3 (NOT p2))), (X (NOT (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p1) (NOT p3) p2)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (OR (AND p0 p1) (AND p0 p3) (AND p0 (NOT p2)))), (X p0), (X p1), (X (X (NOT (AND p0 p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (OR p1 p3 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p1) (NOT p3) p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (F (G p0)), (F (G p1)), (F (G p3)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 (NOT p3) (NOT p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p3) p2))))), (X (X (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p2)))))), (X (X (AND p0 p1 (NOT p3) p2))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (OR (AND p0 p1) (AND p0 p3) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 p1) (AND p0 p3) (AND p0 (NOT p2)))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p1 (NOT p3) p2))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 25 factoid took 230 ms. Reduced automaton from 4 states, 14 edges and 4 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhaseVariation-PT-D10CS100-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhaseVariation-PT-D10CS100-LTLFireability-04 finished in 110643 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&&G(p1))))'
Support contains 7 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 2776/2776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 292 transition count 2760
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 292 transition count 2760
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 292 transition count 2758
Applied a total of 6 rules in 38 ms. Remains 292 /294 variables (removed 2) and now considering 2758/2776 (removed 18) transitions.
Running 2749 sub problems to find dead transitions.
[2024-06-02 00:37:32] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:37:32] [INFO ] Invariant cache hit.
[2024-06-02 00:37:32] [INFO ] State equation strengthened by 183 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 0.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 0.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 0.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)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 20079 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2749/2749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 20067 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2749 constraints, Known Traps: 0/0 constraints]
After SMT, in 41643ms problems are : Problem set: 0 solved, 2749 unsolved
Search for dead transitions found 0 dead transitions in 41696ms
[2024-06-02 00:38:13] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:38:14] [INFO ] Invariant cache hit.
[2024-06-02 00:38:14] [INFO ] Implicit Places using invariants in 616 ms returned []
[2024-06-02 00:38:14] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:38:14] [INFO ] Invariant cache hit.
[2024-06-02 00:38:14] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-06-02 00:38:15] [INFO ] Implicit Places using invariants and state equation in 955 ms returned []
Implicit Place search using SMT with State Equation took 1573 ms to find 0 implicit places.
Running 2749 sub problems to find dead transitions.
[2024-06-02 00:38:15] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:38:15] [INFO ] Invariant cache hit.
[2024-06-02 00:38:15] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2749/2749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 0)
(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 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2749 constraints, Known Traps: 0/0 constraints]
After SMT, in 61483ms problems are : Problem set: 0 solved, 2749 unsolved
Search for dead transitions found 0 dead transitions in 61532ms
Starting structural reductions in LTL mode, iteration 1 : 292/294 places, 2758/2776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104859 ms. Remains : 292/294 places, 2758/2776 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PhaseVariation-PT-D10CS100-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PhaseVariation-PT-D10CS100-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D10CS100-LTLFireability-05 finished in 105086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 2776/2776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 292 transition count 2760
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 292 transition count 2760
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 292 transition count 2758
Applied a total of 6 rules in 37 ms. Remains 292 /294 variables (removed 2) and now considering 2758/2776 (removed 18) transitions.
Running 2749 sub problems to find dead transitions.
[2024-06-02 00:39:17] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:39:17] [INFO ] Invariant cache hit.
[2024-06-02 00:39:17] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 20069 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2749/2749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 20060 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2749 constraints, Known Traps: 0/0 constraints]
After SMT, in 41534ms problems are : Problem set: 0 solved, 2749 unsolved
Search for dead transitions found 0 dead transitions in 41583ms
[2024-06-02 00:39:58] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:39:58] [INFO ] Invariant cache hit.
[2024-06-02 00:39:59] [INFO ] Implicit Places using invariants in 814 ms returned []
[2024-06-02 00:39:59] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:39:59] [INFO ] Invariant cache hit.
[2024-06-02 00:40:00] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-06-02 00:40:00] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 1874 ms to find 0 implicit places.
Running 2749 sub problems to find dead transitions.
[2024-06-02 00:40:00] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:40:00] [INFO ] Invariant cache hit.
[2024-06-02 00:40:00] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2749/2749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2749 constraints, Known Traps: 0/0 constraints]
After SMT, in 61594ms problems are : Problem set: 0 solved, 2749 unsolved
Search for dead transitions found 0 dead transitions in 61639ms
Starting structural reductions in LTL mode, iteration 1 : 292/294 places, 2758/2776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105153 ms. Remains : 292/294 places, 2758/2776 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhaseVariation-PT-D10CS100-LTLFireability-06
Stuttering criterion allowed to conclude after 492 steps with 4 reset in 17 ms.
FORMULA PhaseVariation-PT-D10CS100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D10CS100-LTLFireability-06 finished in 105311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(p0))) U p1))'
Support contains 5 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 2776/2776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 292 transition count 2760
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 292 transition count 2760
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 292 transition count 2758
Applied a total of 6 rules in 40 ms. Remains 292 /294 variables (removed 2) and now considering 2758/2776 (removed 18) transitions.
Running 2749 sub problems to find dead transitions.
[2024-06-02 00:41:02] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:41:02] [INFO ] Invariant cache hit.
[2024-06-02 00:41:02] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 20072 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2749/2749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2749 constraints, Known Traps: 0/0 constraints]
After SMT, in 41339ms problems are : Problem set: 0 solved, 2749 unsolved
Search for dead transitions found 0 dead transitions in 41390ms
[2024-06-02 00:41:44] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:41:44] [INFO ] Invariant cache hit.
[2024-06-02 00:41:44] [INFO ] Implicit Places using invariants in 652 ms returned []
[2024-06-02 00:41:44] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:41:44] [INFO ] Invariant cache hit.
[2024-06-02 00:41:45] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-06-02 00:41:45] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 1562 ms to find 0 implicit places.
Running 2749 sub problems to find dead transitions.
[2024-06-02 00:41:45] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:41:45] [INFO ] Invariant cache hit.
[2024-06-02 00:41:45] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2749/2749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2749 constraints, Known Traps: 0/0 constraints]
After SMT, in 61456ms problems are : Problem set: 0 solved, 2749 unsolved
Search for dead transitions found 0 dead transitions in 61505ms
Starting structural reductions in LTL mode, iteration 1 : 292/294 places, 2758/2776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104517 ms. Remains : 292/294 places, 2758/2776 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : PhaseVariation-PT-D10CS100-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PhaseVariation-PT-D10CS100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D10CS100-LTLFireability-07 finished in 104737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X(p1))))'
Support contains 5 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 2776/2776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 292 transition count 2760
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 292 transition count 2760
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 292 transition count 2758
Applied a total of 6 rules in 33 ms. Remains 292 /294 variables (removed 2) and now considering 2758/2776 (removed 18) transitions.
Running 2749 sub problems to find dead transitions.
[2024-06-02 00:42:47] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:42:47] [INFO ] Invariant cache hit.
[2024-06-02 00:42:47] [INFO ] State equation strengthened by 183 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 0.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 0.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.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 0.0)
(s195 0.0)
(s196 1.0)
(s197 1.0)
(s198 0.0)
(s199 1.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 20072 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2749/2749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 20067 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2749 constraints, Known Traps: 0/0 constraints]
After SMT, in 41507ms problems are : Problem set: 0 solved, 2749 unsolved
Search for dead transitions found 0 dead transitions in 41571ms
[2024-06-02 00:43:29] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:43:29] [INFO ] Invariant cache hit.
[2024-06-02 00:43:29] [INFO ] Implicit Places using invariants in 812 ms returned []
[2024-06-02 00:43:29] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:43:29] [INFO ] Invariant cache hit.
[2024-06-02 00:43:30] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-06-02 00:43:30] [INFO ] Implicit Places using invariants and state equation in 988 ms returned []
Implicit Place search using SMT with State Equation took 1808 ms to find 0 implicit places.
Running 2749 sub problems to find dead transitions.
[2024-06-02 00:43:30] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:43:30] [INFO ] Invariant cache hit.
[2024-06-02 00:43:30] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2749/2749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2749 constraints, Known Traps: 0/0 constraints]
After SMT, in 61582ms problems are : Problem set: 0 solved, 2749 unsolved
Search for dead transitions found 0 dead transitions in 61627ms
Starting structural reductions in LTL mode, iteration 1 : 292/294 places, 2758/2776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105058 ms. Remains : 292/294 places, 2758/2776 transitions.
Stuttering acceptance computed with spot in 304 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : PhaseVariation-PT-D10CS100-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PhaseVariation-PT-D10CS100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D10CS100-LTLFireability-08 finished in 105395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 2776/2776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 292 transition count 2760
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 292 transition count 2760
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 292 transition count 2758
Applied a total of 6 rules in 35 ms. Remains 292 /294 variables (removed 2) and now considering 2758/2776 (removed 18) transitions.
Running 2749 sub problems to find dead transitions.
[2024-06-02 00:44:32] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:44:32] [INFO ] Invariant cache hit.
[2024-06-02 00:44:32] [INFO ] State equation strengthened by 183 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 0.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 0.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.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 0.0)
(s195 0.0)
(s196 1.0)
(s197 1.0)
(s198 0.0)
(s199 1.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 20068 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2749/2749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 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 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 20073 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2749 constraints, Known Traps: 0/0 constraints]
After SMT, in 41672ms problems are : Problem set: 0 solved, 2749 unsolved
Search for dead transitions found 0 dead transitions in 41722ms
[2024-06-02 00:45:14] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:45:14] [INFO ] Invariant cache hit.
[2024-06-02 00:45:15] [INFO ] Implicit Places using invariants in 838 ms returned []
[2024-06-02 00:45:15] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:45:15] [INFO ] Invariant cache hit.
[2024-06-02 00:45:15] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-06-02 00:45:16] [INFO ] Implicit Places using invariants and state equation in 1057 ms returned []
Implicit Place search using SMT with State Equation took 1898 ms to find 0 implicit places.
Running 2749 sub problems to find dead transitions.
[2024-06-02 00:45:16] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:45:16] [INFO ] Invariant cache hit.
[2024-06-02 00:45:16] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2749/2749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2749 constraints, Known Traps: 0/0 constraints]
After SMT, in 61541ms problems are : Problem set: 0 solved, 2749 unsolved
Search for dead transitions found 0 dead transitions in 61593ms
Starting structural reductions in LTL mode, iteration 1 : 292/294 places, 2758/2776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105268 ms. Remains : 292/294 places, 2758/2776 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhaseVariation-PT-D10CS100-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 783 ms.
Product exploration explored 100000 steps with 50000 reset in 638 ms.
Computed a total of 292 stabilizing places and 2758 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 292 transition count 2758
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhaseVariation-PT-D10CS100-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhaseVariation-PT-D10CS100-LTLFireability-09 finished in 107319 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&&G((F(p0)||p1)))))'
Support contains 3 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 2776/2776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 292 transition count 2760
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 292 transition count 2760
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 292 transition count 2758
Applied a total of 6 rules in 22 ms. Remains 292 /294 variables (removed 2) and now considering 2758/2776 (removed 18) transitions.
Running 2749 sub problems to find dead transitions.
[2024-06-02 00:46:20] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:46:20] [INFO ] Invariant cache hit.
[2024-06-02 00:46:20] [INFO ] State equation strengthened by 183 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 20068 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2749/2749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 20066 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2749 constraints, Known Traps: 0/0 constraints]
After SMT, in 41337ms problems are : Problem set: 0 solved, 2749 unsolved
Search for dead transitions found 0 dead transitions in 41370ms
[2024-06-02 00:47:01] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:47:01] [INFO ] Invariant cache hit.
[2024-06-02 00:47:02] [INFO ] Implicit Places using invariants in 835 ms returned []
[2024-06-02 00:47:02] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:47:02] [INFO ] Invariant cache hit.
[2024-06-02 00:47:02] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-06-02 00:47:03] [INFO ] Implicit Places using invariants and state equation in 1142 ms returned []
Implicit Place search using SMT with State Equation took 1981 ms to find 0 implicit places.
Running 2749 sub problems to find dead transitions.
[2024-06-02 00:47:03] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:47:03] [INFO ] Invariant cache hit.
[2024-06-02 00:47:03] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2749/2749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2749 constraints, Known Traps: 0/0 constraints]
After SMT, in 61551ms problems are : Problem set: 0 solved, 2749 unsolved
Search for dead transitions found 0 dead transitions in 61598ms
Starting structural reductions in LTL mode, iteration 1 : 292/294 places, 2758/2776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104982 ms. Remains : 292/294 places, 2758/2776 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), true, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhaseVariation-PT-D10CS100-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PhaseVariation-PT-D10CS100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D10CS100-LTLFireability-10 finished in 105254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 5 out of 294 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 294/294 places, 2776/2776 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 293 transition count 2766
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 293 transition count 2766
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 293 transition count 2765
Applied a total of 3 rules in 932 ms. Remains 293 /294 variables (removed 1) and now considering 2765/2776 (removed 11) transitions.
Running 2755 sub problems to find dead transitions.
[2024-06-02 00:48:06] [INFO ] Flow matrix only has 193 transitions (discarded 2572 similar events)
// Phase 1: matrix 193 rows 293 cols
[2024-06-02 00:48:06] [INFO ] Computed 100 invariants in 2 ms
[2024-06-02 00:48:06] [INFO ] State equation strengthened by 183 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 0.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 0.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2755 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 284/486 variables, and 91 constraints, problems are : Problem set: 0 solved, 2755 unsolved in 20076 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/293 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2755/2755 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2755 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2755 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 0)
(s20 1)
(s21 1)
(s22 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 284/486 variables, and 91 constraints, problems are : Problem set: 0 solved, 2755 unsolved in 20070 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/293 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2755 constraints, Known Traps: 0/0 constraints]
After SMT, in 41445ms problems are : Problem set: 0 solved, 2755 unsolved
Search for dead transitions found 0 dead transitions in 41475ms
[2024-06-02 00:48:47] [INFO ] Flow matrix only has 193 transitions (discarded 2572 similar events)
[2024-06-02 00:48:47] [INFO ] Invariant cache hit.
[2024-06-02 00:48:48] [INFO ] Implicit Places using invariants in 837 ms returned []
[2024-06-02 00:48:48] [INFO ] Flow matrix only has 193 transitions (discarded 2572 similar events)
[2024-06-02 00:48:48] [INFO ] Invariant cache hit.
[2024-06-02 00:48:48] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-06-02 00:48:49] [INFO ] Implicit Places using invariants and state equation in 1177 ms returned []
Implicit Place search using SMT with State Equation took 2023 ms to find 0 implicit places.
[2024-06-02 00:48:49] [INFO ] Redundant transitions in 154 ms returned []
Running 2755 sub problems to find dead transitions.
[2024-06-02 00:48:50] [INFO ] Flow matrix only has 193 transitions (discarded 2572 similar events)
[2024-06-02 00:48:50] [INFO ] Invariant cache hit.
[2024-06-02 00:48:50] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2755 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 284/486 variables, and 91 constraints, problems are : Problem set: 0 solved, 2755 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/293 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2755/2755 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2755 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2755 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 284/486 variables, and 91 constraints, problems are : Problem set: 0 solved, 2755 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/293 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2755 constraints, Known Traps: 0/0 constraints]
After SMT, in 61588ms problems are : Problem set: 0 solved, 2755 unsolved
Search for dead transitions found 0 dead transitions in 61635ms
Starting structural reductions in SI_LTL mode, iteration 1 : 293/294 places, 2765/2776 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106239 ms. Remains : 293/294 places, 2765/2776 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhaseVariation-PT-D10CS100-LTLFireability-12
Product exploration explored 100000 steps with 641 reset in 2402 ms.
Product exploration explored 100000 steps with 632 reset in 2114 ms.
Computed a total of 293 stabilizing places and 2765 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 293 transition count 2765
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 22 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhaseVariation-PT-D10CS100-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhaseVariation-PT-D10CS100-LTLFireability-12 finished in 111361 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(F(p0)) U p1))))'
Support contains 5 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 2776/2776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 292 transition count 2760
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 292 transition count 2760
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 292 transition count 2758
Applied a total of 6 rules in 34 ms. Remains 292 /294 variables (removed 2) and now considering 2758/2776 (removed 18) transitions.
Running 2749 sub problems to find dead transitions.
[2024-06-02 00:49:56] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
// Phase 1: matrix 192 rows 292 cols
[2024-06-02 00:49:56] [INFO ] Computed 100 invariants in 6 ms
[2024-06-02 00:49:56] [INFO ] State equation strengthened by 183 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 20066 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2749/2749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 20072 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2749 constraints, Known Traps: 0/0 constraints]
After SMT, in 41654ms problems are : Problem set: 0 solved, 2749 unsolved
Search for dead transitions found 0 dead transitions in 41700ms
[2024-06-02 00:50:38] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:50:38] [INFO ] Invariant cache hit.
[2024-06-02 00:50:39] [INFO ] Implicit Places using invariants in 801 ms returned []
[2024-06-02 00:50:39] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:50:39] [INFO ] Invariant cache hit.
[2024-06-02 00:50:39] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-06-02 00:50:40] [INFO ] Implicit Places using invariants and state equation in 1140 ms returned []
Implicit Place search using SMT with State Equation took 1955 ms to find 0 implicit places.
Running 2749 sub problems to find dead transitions.
[2024-06-02 00:50:40] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:50:40] [INFO ] Invariant cache hit.
[2024-06-02 00:50:40] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2749/2749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
(s162 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 0)
(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 0)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 0)
(s115 1)
(s116 1)
(s117 1)
(s118 0)
(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 1timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2749 constraints, Known Traps: 0/0 constraints]
After SMT, in 61584ms problems are : Problem set: 0 solved, 2749 unsolved
Search for dead transitions found 0 dead transitions in 61636ms
Starting structural reductions in LTL mode, iteration 1 : 292/294 places, 2758/2776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105335 ms. Remains : 292/294 places, 2758/2776 transitions.
Stuttering acceptance computed with spot in 297 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : PhaseVariation-PT-D10CS100-LTLFireability-13
Stuttering criterion allowed to conclude after 258 steps with 1 reset in 10 ms.
FORMULA PhaseVariation-PT-D10CS100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D10CS100-LTLFireability-13 finished in 105673 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 294 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 294/294 places, 2776/2776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 292 transition count 2760
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 292 transition count 2760
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 292 transition count 2758
Applied a total of 6 rules in 1002 ms. Remains 292 /294 variables (removed 2) and now considering 2758/2776 (removed 18) transitions.
Running 2749 sub problems to find dead transitions.
[2024-06-02 00:51:43] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:51:43] [INFO ] Invariant cache hit.
[2024-06-02 00:51:43] [INFO ] State equation strengthened by 183 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 0.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 0.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.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 0.0)
(s195 0.0)
(s196 1.0)
(s197 1.0)
(s198 0.0)
(s199 1.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 20072 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2749/2749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 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 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 20069 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2749 constraints, Known Traps: 0/0 constraints]
After SMT, in 41317ms problems are : Problem set: 0 solved, 2749 unsolved
Search for dead transitions found 0 dead transitions in 41363ms
[2024-06-02 00:52:24] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:52:24] [INFO ] Invariant cache hit.
[2024-06-02 00:52:25] [INFO ] Implicit Places using invariants in 844 ms returned []
[2024-06-02 00:52:25] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:52:25] [INFO ] Invariant cache hit.
[2024-06-02 00:52:25] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-06-02 00:52:26] [INFO ] Implicit Places using invariants and state equation in 1131 ms returned []
Implicit Place search using SMT with State Equation took 1984 ms to find 0 implicit places.
[2024-06-02 00:52:26] [INFO ] Redundant transitions in 158 ms returned []
Running 2749 sub problems to find dead transitions.
[2024-06-02 00:52:26] [INFO ] Flow matrix only has 192 transitions (discarded 2566 similar events)
[2024-06-02 00:52:26] [INFO ] Invariant cache hit.
[2024-06-02 00:52:26] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2749/2749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/484 variables, and 91 constraints, problems are : Problem set: 0 solved, 2749 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/292 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2749 constraints, Known Traps: 0/0 constraints]
After SMT, in 61498ms problems are : Problem set: 0 solved, 2749 unsolved
Search for dead transitions found 0 dead transitions in 61543ms
Starting structural reductions in SI_LTL mode, iteration 1 : 292/294 places, 2758/2776 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106067 ms. Remains : 292/294 places, 2758/2776 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhaseVariation-PT-D10CS100-LTLFireability-14
Product exploration explored 100000 steps with 738 reset in 2320 ms.
Product exploration explored 100000 steps with 717 reset in 2012 ms.
Computed a total of 292 stabilizing places and 2758 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 292 transition count 2758
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhaseVariation-PT-D10CS100-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhaseVariation-PT-D10CS100-LTLFireability-14 finished in 110973 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(X(F(G(((F(X(p0)) U p1)||p0))))))'
Support contains 5 out of 294 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 294/294 places, 2776/2776 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 293 transition count 2770
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 293 transition count 2770
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 293 transition count 2769
Applied a total of 3 rules in 917 ms. Remains 293 /294 variables (removed 1) and now considering 2769/2776 (removed 7) transitions.
Running 2759 sub problems to find dead transitions.
[2024-06-02 00:53:34] [INFO ] Flow matrix only has 193 transitions (discarded 2576 similar events)
// Phase 1: matrix 193 rows 293 cols
[2024-06-02 00:53:34] [INFO ] Computed 100 invariants in 3 ms
[2024-06-02 00:53:34] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2759 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 284/486 variables, and 91 constraints, problems are : Problem set: 0 solved, 2759 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/293 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2759/2759 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2759 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2759 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 284/486 variables, and 91 constraints, problems are : Problem set: 0 solved, 2759 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/293 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2759 constraints, Known Traps: 0/0 constraints]
After SMT, in 41187ms problems are : Problem set: 0 solved, 2759 unsolved
Search for dead transitions found 0 dead transitions in 41216ms
[2024-06-02 00:54:15] [INFO ] Flow matrix only has 193 transitions (discarded 2576 similar events)
[2024-06-02 00:54:15] [INFO ] Invariant cache hit.
[2024-06-02 00:54:16] [INFO ] Implicit Places using invariants in 664 ms returned []
[2024-06-02 00:54:16] [INFO ] Flow matrix only has 193 transitions (discarded 2576 similar events)
[2024-06-02 00:54:16] [INFO ] Invariant cache hit.
[2024-06-02 00:54:16] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-06-02 00:54:17] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1520 ms to find 0 implicit places.
[2024-06-02 00:54:17] [INFO ] Redundant transitions in 99 ms returned []
Running 2759 sub problems to find dead transitions.
[2024-06-02 00:54:17] [INFO ] Flow matrix only has 193 transitions (discarded 2576 similar events)
[2024-06-02 00:54:17] [INFO ] Invariant cache hit.
[2024-06-02 00:54:17] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2759 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 284/486 variables, and 91 constraints, problems are : Problem set: 0 solved, 2759 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/293 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2759/2759 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2759 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 2759 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 284/486 variables, and 91 constraints, problems are : Problem set: 0 solved, 2759 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 91/100 constraints, State Equation: 0/293 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2759 constraints, Known Traps: 0/0 constraints]
After SMT, in 61330ms problems are : Problem set: 0 solved, 2759 unsolved
Search for dead transitions found 0 dead transitions in 61369ms
Starting structural reductions in SI_LTL mode, iteration 1 : 293/294 places, 2769/2776 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105139 ms. Remains : 293/294 places, 2769/2776 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhaseVariation-PT-D10CS100-LTLFireability-15
Stuttering criterion allowed to conclude after 142 steps with 0 reset in 5 ms.
FORMULA PhaseVariation-PT-D10CS100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D10CS100-LTLFireability-15 finished in 105319 ms.
All properties solved by simple procedures.
Total runtime 1664097 ms.
ITS solved all properties within timeout

BK_STOP 1717289719080

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="PhaseVariation-PT-D10CS100"
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 PhaseVariation-PT-D10CS100, 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 r512-smll-171654407400340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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