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.r109-tall-171624208300328.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 gold2023
Input is DBSingleClientW-PT-d1m08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208300328
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 12 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716325952036

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m08
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 21:12:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 21:12:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:12:33] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-21 21:12:33] [INFO ] Transformed 1440 places.
[2024-05-21 21:12:33] [INFO ] Transformed 672 transitions.
[2024-05-21 21:12:33] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 179 place count 248 transition count 426
Iterating global reduction 1 with 78 rules applied. Total rules applied 257 place count 248 transition count 426
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 275 place count 248 transition count 408
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 331 place count 192 transition count 352
Iterating global reduction 2 with 56 rules applied. Total rules applied 387 place count 192 transition count 352
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 392 place count 192 transition count 347
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 413 place count 171 transition count 316
Iterating global reduction 3 with 21 rules applied. Total rules applied 434 place count 171 transition count 316
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 452 place count 171 transition count 298
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 456 place count 167 transition count 292
Iterating global reduction 4 with 4 rules applied. Total rules applied 460 place count 167 transition count 292
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 466 place count 167 transition count 286
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 468 place count 165 transition count 284
Iterating global reduction 5 with 2 rules applied. Total rules applied 470 place count 165 transition count 284
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 472 place count 163 transition count 282
Iterating global reduction 5 with 2 rules applied. Total rules applied 474 place count 163 transition count 282
Applied a total of 474 rules in 77 ms. Remains 163 /347 variables (removed 184) and now considering 282/672 (removed 390) transitions.
// Phase 1: matrix 282 rows 163 cols
[2024-05-21 21:12:34] [INFO ] Computed 2 invariants in 17 ms
[2024-05-21 21:12:34] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-21 21:12:34] [INFO ] Invariant cache hit.
[2024-05-21 21:12:34] [INFO ] State equation strengthened by 135 read => feed constraints.
[2024-05-21 21:12:34] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
[2024-05-21 21:12:34] [INFO ] Invariant cache hit.
[2024-05-21 21:12:34] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 163/347 places, 282/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 993 ms. Remains : 163/347 places, 282/672 transitions.
Support contains 39 out of 163 places after structural reductions.
[2024-05-21 21:12:34] [INFO ] Flatten gal took : 44 ms
[2024-05-21 21:12:35] [INFO ] Flatten gal took : 18 ms
[2024-05-21 21:12:35] [INFO ] Input system was already deterministic with 282 transitions.
Support contains 37 out of 163 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2268 resets, run finished after 600 ms. (steps per millisecond=16 ) properties (out of 29) seen :8
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 40 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 103 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 97 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2024-05-21 21:12:35] [INFO ] Invariant cache hit.
[2024-05-21 21:12:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 21:12:36] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:12:36] [INFO ] After 818ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:20
[2024-05-21 21:12:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 21:12:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:12:37] [INFO ] After 628ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :20
[2024-05-21 21:12:37] [INFO ] State equation strengthened by 135 read => feed constraints.
[2024-05-21 21:12:38] [INFO ] After 861ms SMT Verify possible using 135 Read/Feed constraints in natural domain returned unsat :1 sat :20
[2024-05-21 21:12:39] [INFO ] After 1788ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :20
Attempting to minimize the solution found.
Minimization took 910 ms.
[2024-05-21 21:12:40] [INFO ] After 3520ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :20
Fused 21 Parikh solutions to 20 different solutions.
Parikh walk visited 2 properties in 229 ms.
Support contains 22 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 153 transition count 253
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 153 transition count 253
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 145 transition count 241
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 145 transition count 241
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 145 transition count 237
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 139 transition count 231
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 139 transition count 231
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 55 place count 139 transition count 228
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 136 transition count 223
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 136 transition count 223
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 67 place count 136 transition count 217
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 135 transition count 216
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 135 transition count 216
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 134 transition count 214
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 134 transition count 214
Applied a total of 71 rules in 41 ms. Remains 134 /163 variables (removed 29) and now considering 214/282 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 134/163 places, 214/282 transitions.
Incomplete random walk after 10000 steps, including 2298 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 61 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Finished probabilistic random walk after 59237 steps, run visited all 17 properties in 206 ms. (steps per millisecond=287 )
Probabilistic random walk after 59237 steps, saw 25972 distinct states, run finished after 207 ms. (steps per millisecond=286 ) properties seen :17
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 6 stabilizing places and 25 stable transitions
Graph (complete) has 607 edges and 163 vertex of which 162 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||(!p0&&F(!p1)))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 139 transition count 207
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 139 transition count 207
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 139 transition count 203
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 71 place count 120 transition count 180
Iterating global reduction 1 with 19 rules applied. Total rules applied 90 place count 120 transition count 180
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 94 place count 120 transition count 176
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 110 place count 104 transition count 152
Iterating global reduction 2 with 16 rules applied. Total rules applied 126 place count 104 transition count 152
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 134 place count 104 transition count 144
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 142 place count 96 transition count 124
Iterating global reduction 3 with 8 rules applied. Total rules applied 150 place count 96 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 151 place count 96 transition count 123
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 157 place count 90 transition count 117
Iterating global reduction 4 with 6 rules applied. Total rules applied 163 place count 90 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 164 place count 90 transition count 116
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 169 place count 85 transition count 110
Iterating global reduction 5 with 5 rules applied. Total rules applied 174 place count 85 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 177 place count 85 transition count 107
Applied a total of 177 rules in 14 ms. Remains 85 /163 variables (removed 78) and now considering 107/282 (removed 175) transitions.
// Phase 1: matrix 107 rows 85 cols
[2024-05-21 21:12:41] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 21:12:41] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 21:12:41] [INFO ] Invariant cache hit.
[2024-05-21 21:12:41] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 21:12:41] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-05-21 21:12:41] [INFO ] Invariant cache hit.
[2024-05-21 21:12:41] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/163 places, 107/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 259 ms. Remains : 85/163 places, 107/282 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 314 ms :[true, p1, p0, p0, (AND p1 p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s1 1) (GEQ s39 1)), p0:(AND (GEQ s1 1) (GEQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 311 ms.
Product exploration explored 100000 steps with 50000 reset in 275 ms.
Computed a total of 6 stabilizing places and 14 stable transitions
Graph (complete) has 287 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 6 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 23 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-00 finished in 1247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U !p1)) U X(G((p0 U p1)))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 139 transition count 209
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 139 transition count 209
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 139 transition count 203
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 71 place count 122 transition count 182
Iterating global reduction 1 with 17 rules applied. Total rules applied 88 place count 122 transition count 182
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 92 place count 122 transition count 178
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 106 place count 108 transition count 158
Iterating global reduction 2 with 14 rules applied. Total rules applied 120 place count 108 transition count 158
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 126 place count 108 transition count 152
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 134 place count 100 transition count 132
Iterating global reduction 3 with 8 rules applied. Total rules applied 142 place count 100 transition count 132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 145 place count 100 transition count 129
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 150 place count 95 transition count 124
Iterating global reduction 4 with 5 rules applied. Total rules applied 155 place count 95 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 156 place count 95 transition count 123
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 160 place count 91 transition count 118
Iterating global reduction 5 with 4 rules applied. Total rules applied 164 place count 91 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 166 place count 91 transition count 116
Applied a total of 166 rules in 13 ms. Remains 91 /163 variables (removed 72) and now considering 116/282 (removed 166) transitions.
// Phase 1: matrix 116 rows 91 cols
[2024-05-21 21:12:42] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:12:42] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 21:12:42] [INFO ] Invariant cache hit.
[2024-05-21 21:12:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-21 21:12:43] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-05-21 21:12:43] [INFO ] Invariant cache hit.
[2024-05-21 21:12:43] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/163 places, 116/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 267 ms. Remains : 91/163 places, 116/282 transitions.
Stuttering acceptance computed with spot in 300 ms :[(NOT p1), false, (NOT p1), true, (NOT p1), p1, p1, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(OR (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}, { cond=(AND p1 p0), acceptance={} source=5 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 7}]], initial=2, aps=[p1:(AND (GEQ s1 1) (GEQ s85 1)), p0:(AND (GEQ s1 1) (GEQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 14 steps with 4 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-01 finished in 589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(G(p1))) U X(G((F(!p1)||X(X(!p0)))))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 137 transition count 201
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 137 transition count 201
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 137 transition count 197
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 75 place count 118 transition count 174
Iterating global reduction 1 with 19 rules applied. Total rules applied 94 place count 118 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 98 place count 118 transition count 170
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 114 place count 102 transition count 146
Iterating global reduction 2 with 16 rules applied. Total rules applied 130 place count 102 transition count 146
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 138 place count 102 transition count 138
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 145 place count 95 transition count 119
Iterating global reduction 3 with 7 rules applied. Total rules applied 152 place count 95 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 153 place count 95 transition count 118
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 158 place count 90 transition count 113
Iterating global reduction 4 with 5 rules applied. Total rules applied 163 place count 90 transition count 113
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 168 place count 85 transition count 107
Iterating global reduction 4 with 5 rules applied. Total rules applied 173 place count 85 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 176 place count 85 transition count 104
Applied a total of 176 rules in 16 ms. Remains 85 /163 variables (removed 78) and now considering 104/282 (removed 178) transitions.
// Phase 1: matrix 104 rows 85 cols
[2024-05-21 21:12:43] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:12:43] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-21 21:12:43] [INFO ] Invariant cache hit.
[2024-05-21 21:12:43] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 21:12:43] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2024-05-21 21:12:43] [INFO ] Invariant cache hit.
[2024-05-21 21:12:43] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/163 places, 104/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 310 ms. Remains : 85/163 places, 104/282 transitions.
Stuttering acceptance computed with spot in 377 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=true, acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={0} source=4 dest: 6}, { cond=p1, acceptance={} source=4 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 8}], [{ cond=(AND p0 p1), acceptance={0} source=6 dest: 6}, { cond=(AND p0 p1), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 p1), acceptance={0} source=7 dest: 4}, { cond=(AND p0 p1), acceptance={} source=7 dest: 9}], [{ cond=p1, acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=9 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 9}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s73 1)), p1:(AND (GEQ s1 1) (GEQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22931 reset in 232 ms.
Product exploration explored 100000 steps with 23011 reset in 162 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 286 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 132 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 375 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Incomplete random walk after 10000 steps, including 2344 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 474 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 21:12:45] [INFO ] Invariant cache hit.
[2024-05-21 21:12:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 21:12:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:12:45] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:12:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 21:12:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:12:45] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 21:12:45] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 21:12:45] [INFO ] After 12ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 21:12:45] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-21 21:12:45] [INFO ] After 117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 104/104 transitions.
Graph (complete) has 264 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 84 transition count 102
Applied a total of 3 rules in 10 ms. Remains 84 /85 variables (removed 1) and now considering 102/104 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 84/85 places, 102/104 transitions.
Incomplete random walk after 10000 steps, including 2333 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4296 steps, run visited all 1 properties in 27 ms. (steps per millisecond=159 )
Probabilistic random walk after 4296 steps, saw 1997 distinct states, run finished after 28 ms. (steps per millisecond=153 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 p1)), (F p0), (F p1)]
Knowledge based reduction with 6 factoid took 203 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 371 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Stuttering acceptance computed with spot in 472 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 104/104 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-05-21 21:12:46] [INFO ] Invariant cache hit.
[2024-05-21 21:12:46] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 21:12:46] [INFO ] Invariant cache hit.
[2024-05-21 21:12:46] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 21:12:46] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-21 21:12:46] [INFO ] Invariant cache hit.
[2024-05-21 21:12:46] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 234 ms. Remains : 85/85 places, 104/104 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 286 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 103 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 382 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Incomplete random walk after 10000 steps, including 2302 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 458 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 21:12:47] [INFO ] Invariant cache hit.
[2024-05-21 21:12:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 21:12:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 21:12:47] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:12:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 21:12:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:12:47] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 21:12:47] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 21:12:47] [INFO ] After 11ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 21:12:47] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-21 21:12:47] [INFO ] After 102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 104/104 transitions.
Graph (complete) has 264 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 84 transition count 102
Applied a total of 3 rules in 5 ms. Remains 84 /85 variables (removed 1) and now considering 102/104 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 84/85 places, 102/104 transitions.
Incomplete random walk after 10000 steps, including 2316 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 476 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4296 steps, run visited all 1 properties in 14 ms. (steps per millisecond=306 )
Probabilistic random walk after 4296 steps, saw 1997 distinct states, run finished after 15 ms. (steps per millisecond=286 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 p1)), (F p0), (F p1)]
Knowledge based reduction with 6 factoid took 197 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 413 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Stuttering acceptance computed with spot in 411 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Stuttering acceptance computed with spot in 385 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Product exploration explored 100000 steps with 22986 reset in 110 ms.
Product exploration explored 100000 steps with 22939 reset in 106 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 423 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 104/104 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-05-21 21:12:49] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:12:49] [INFO ] Invariant cache hit.
[2024-05-21 21:12:49] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 85/85 places, 104/104 transitions.
Built C files in :
/tmp/ltsmin10938857578572285521
[2024-05-21 21:12:49] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10938857578572285521
Running compilation step : cd /tmp/ltsmin10938857578572285521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 289 ms.
Running link step : cd /tmp/ltsmin10938857578572285521;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin10938857578572285521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15576309402665105152.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 104/104 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-05-21 21:13:04] [INFO ] Invariant cache hit.
[2024-05-21 21:13:04] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 21:13:04] [INFO ] Invariant cache hit.
[2024-05-21 21:13:05] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 21:13:05] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-21 21:13:05] [INFO ] Invariant cache hit.
[2024-05-21 21:13:05] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 258 ms. Remains : 85/85 places, 104/104 transitions.
Built C files in :
/tmp/ltsmin12290433465185636964
[2024-05-21 21:13:05] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12290433465185636964
Running compilation step : cd /tmp/ltsmin12290433465185636964;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 185 ms.
Running link step : cd /tmp/ltsmin12290433465185636964;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin12290433465185636964;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6746848196181126989.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 21:13:20] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:13:20] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:13:20] [INFO ] Time to serialize gal into /tmp/LTL12432962521259437672.gal : 3 ms
[2024-05-21 21:13:20] [INFO ] Time to serialize properties into /tmp/LTL13382839029661686693.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12432962521259437672.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5608264914058238306.hoa' '-atoms' '/tmp/LTL13382839029661686693.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13382839029661686693.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5608264914058238306.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t54, t64, t73, t74, t121, t170, t222, t223, t226, t227, t228, t229, t23...407
Computing Next relation with stutter on 1.02145e+07 deadlock states
Detected timeout of ITS tools.
[2024-05-21 21:13:35] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:13:35] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:13:35] [INFO ] Time to serialize gal into /tmp/LTL8657203942737181646.gal : 1 ms
[2024-05-21 21:13:35] [INFO ] Time to serialize properties into /tmp/LTL7574644928855924770.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8657203942737181646.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7574644928855924770.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((("((s1>=1)&&(l954>=1))")U(X(G("((s1>=1)&&(l955>=1))"))))U(X(G((F(!("((s1>=1)&&(l955>=1))")))||(X(X(!("((s1>=1)&&(l954>=1))")))))))...157
Formula 0 simplified : (!"((s1>=1)&&(l954>=1))" R XF!"((s1>=1)&&(l955>=1))") R XF(G"((s1>=1)&&(l955>=1))" & XX"((s1>=1)&&(l954>=1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t54, t64, t73, t74, t121, t170, t222, t223, t226, t227, t228, t229, t23...407
Computing Next relation with stutter on 1.02145e+07 deadlock states
Detected timeout of ITS tools.
[2024-05-21 21:13:50] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:13:50] [INFO ] Applying decomposition
[2024-05-21 21:13:50] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2057075596013048421.txt' '-o' '/tmp/graph2057075596013048421.bin' '-w' '/tmp/graph2057075596013048421.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2057075596013048421.bin' '-l' '-1' '-v' '-w' '/tmp/graph2057075596013048421.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:13:50] [INFO ] Decomposing Gal with order
[2024-05-21 21:13:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:13:50] [INFO ] Removed a total of 81 redundant transitions.
[2024-05-21 21:13:50] [INFO ] Flatten gal took : 34 ms
[2024-05-21 21:13:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 6 ms.
[2024-05-21 21:13:50] [INFO ] Time to serialize gal into /tmp/LTL14502994397124863074.gal : 3 ms
[2024-05-21 21:13:50] [INFO ] Time to serialize properties into /tmp/LTL6366732583398913836.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14502994397124863074.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6366732583398913836.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((("((u1.s1>=1)&&(i3.u10.l954>=1))")U(X(G("((u1.s1>=1)&&(u1.l955>=1))"))))U(X(G((F(!("((u1.s1>=1)&&(u1.l955>=1))")))||(X(X(!("((u1.s...189
Formula 0 simplified : (!"((u1.s1>=1)&&(i3.u10.l954>=1))" R XF!"((u1.s1>=1)&&(u1.l955>=1))") R XF(G"((u1.s1>=1)&&(u1.l955>=1))" & XX"((u1.s1>=1)&&(i3.u10.l...165
Reverse transition relation is NOT exact ! Due to transitions t6, t11, t54, t64, t73, t170, t222, t223, t226, t227, t228, t229, t232, t233, t234, t235, t23...413
Computing Next relation with stutter on 1.02145e+07 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11673379881392568972
[2024-05-21 21:14:05] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11673379881392568972
Running compilation step : cd /tmp/ltsmin11673379881392568972;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 185 ms.
Running link step : cd /tmp/ltsmin11673379881392568972;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11673379881392568972;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true) U X([]((LTLAPp1==true)))) U X([]((<>(!(LTLAPp1==true))||X(X(!(LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-02 finished in 97307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 138 transition count 205
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 138 transition count 205
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 138 transition count 201
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 72 place count 120 transition count 179
Iterating global reduction 1 with 18 rules applied. Total rules applied 90 place count 120 transition count 179
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 94 place count 120 transition count 175
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 109 place count 105 transition count 152
Iterating global reduction 2 with 15 rules applied. Total rules applied 124 place count 105 transition count 152
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 130 place count 105 transition count 146
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 138 place count 97 transition count 126
Iterating global reduction 3 with 8 rules applied. Total rules applied 146 place count 97 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 147 place count 97 transition count 125
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 153 place count 91 transition count 119
Iterating global reduction 4 with 6 rules applied. Total rules applied 159 place count 91 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 160 place count 91 transition count 118
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 165 place count 86 transition count 112
Iterating global reduction 5 with 5 rules applied. Total rules applied 170 place count 86 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 173 place count 86 transition count 109
Applied a total of 173 rules in 30 ms. Remains 86 /163 variables (removed 77) and now considering 109/282 (removed 173) transitions.
// Phase 1: matrix 109 rows 86 cols
[2024-05-21 21:14:20] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:14:20] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-21 21:14:20] [INFO ] Invariant cache hit.
[2024-05-21 21:14:20] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 21:14:20] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2024-05-21 21:14:21] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 21:14:21] [INFO ] Invariant cache hit.
[2024-05-21 21:14:21] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/163 places, 109/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 372 ms. Remains : 86/163 places, 109/282 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22946 reset in 108 ms.
Product exploration explored 100000 steps with 23034 reset in 116 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 292 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2353 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1307 steps, run visited all 1 properties in 5 ms. (steps per millisecond=261 )
Probabilistic random walk after 1307 steps, saw 676 distinct states, run finished after 5 ms. (steps per millisecond=261 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 109/109 transitions.
Applied a total of 0 rules in 6 ms. Remains 86 /86 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-21 21:14:21] [INFO ] Invariant cache hit.
[2024-05-21 21:14:22] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-21 21:14:22] [INFO ] Invariant cache hit.
[2024-05-21 21:14:22] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 21:14:22] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2024-05-21 21:14:22] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 21:14:22] [INFO ] Invariant cache hit.
[2024-05-21 21:14:22] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 471 ms. Remains : 86/86 places, 109/109 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 292 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Finished random walk after 622 steps, including 142 resets, run visited all 1 properties in 4 ms. (steps per millisecond=155 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22999 reset in 105 ms.
Product exploration explored 100000 steps with 23117 reset in 143 ms.
Built C files in :
/tmp/ltsmin16607615040561756934
[2024-05-21 21:14:23] [INFO ] Computing symmetric may disable matrix : 109 transitions.
[2024-05-21 21:14:23] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:14:23] [INFO ] Computing symmetric may enable matrix : 109 transitions.
[2024-05-21 21:14:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:14:23] [INFO ] Computing Do-Not-Accords matrix : 109 transitions.
[2024-05-21 21:14:23] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:14:23] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16607615040561756934
Running compilation step : cd /tmp/ltsmin16607615040561756934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 229 ms.
Running link step : cd /tmp/ltsmin16607615040561756934;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin16607615040561756934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8794177736855479302.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 109/109 transitions.
Applied a total of 0 rules in 13 ms. Remains 86 /86 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-21 21:14:38] [INFO ] Invariant cache hit.
[2024-05-21 21:14:38] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-21 21:14:38] [INFO ] Invariant cache hit.
[2024-05-21 21:14:38] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 21:14:38] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2024-05-21 21:14:38] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 21:14:38] [INFO ] Invariant cache hit.
[2024-05-21 21:14:38] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 339 ms. Remains : 86/86 places, 109/109 transitions.
Built C files in :
/tmp/ltsmin62466547673477310
[2024-05-21 21:14:38] [INFO ] Computing symmetric may disable matrix : 109 transitions.
[2024-05-21 21:14:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:14:38] [INFO ] Computing symmetric may enable matrix : 109 transitions.
[2024-05-21 21:14:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:14:38] [INFO ] Computing Do-Not-Accords matrix : 109 transitions.
[2024-05-21 21:14:38] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:14:38] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin62466547673477310
Running compilation step : cd /tmp/ltsmin62466547673477310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 228 ms.
Running link step : cd /tmp/ltsmin62466547673477310;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin62466547673477310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15336993669264203491.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 21:14:53] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:14:53] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:14:53] [INFO ] Time to serialize gal into /tmp/LTL216543859373203399.gal : 2 ms
[2024-05-21 21:14:53] [INFO ] Time to serialize properties into /tmp/LTL17519482229867755019.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL216543859373203399.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13680129308806673328.hoa' '-atoms' '/tmp/LTL17519482229867755019.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17519482229867755019.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13680129308806673328.hoa
Detected timeout of ITS tools.
[2024-05-21 21:15:08] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:15:08] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:15:08] [INFO ] Time to serialize gal into /tmp/LTL11612210974575222792.gal : 2 ms
[2024-05-21 21:15:08] [INFO ] Time to serialize properties into /tmp/LTL16299564093190443519.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11612210974575222792.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16299564093190443519.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l1307<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l1307<1))"
Detected timeout of ITS tools.
[2024-05-21 21:15:23] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:15:23] [INFO ] Applying decomposition
[2024-05-21 21:15:23] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15188298126565849622.txt' '-o' '/tmp/graph15188298126565849622.bin' '-w' '/tmp/graph15188298126565849622.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15188298126565849622.bin' '-l' '-1' '-v' '-w' '/tmp/graph15188298126565849622.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:15:23] [INFO ] Decomposing Gal with order
[2024-05-21 21:15:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:15:23] [INFO ] Removed a total of 106 redundant transitions.
[2024-05-21 21:15:23] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:15:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 4 ms.
[2024-05-21 21:15:24] [INFO ] Time to serialize gal into /tmp/LTL15253979036234311130.gal : 2 ms
[2024-05-21 21:15:24] [INFO ] Time to serialize properties into /tmp/LTL5396954595900945077.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15253979036234311130.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5396954595900945077.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.u0.s1<1)||(i0.u0.l1307<1))"))))
Formula 0 simplified : FG!"((i0.u0.s1<1)||(i0.u0.l1307<1))"
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t11, t54, t64, t170, t222, t226, t227, t228, t229, t232, t233, t234, t235, t236, t237...442
Computing Next relation with stutter on 1.38027e+07 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11279105105982595852
[2024-05-21 21:15:39] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11279105105982595852
Running compilation step : cd /tmp/ltsmin11279105105982595852;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 216 ms.
Running link step : cd /tmp/ltsmin11279105105982595852;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11279105105982595852;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-03 finished in 93447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(!X(X(p0))))||X(!F(p1))) U p2))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 140 transition count 212
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 140 transition count 212
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 140 transition count 208
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 123 transition count 187
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 123 transition count 187
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 88 place count 123 transition count 183
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 102 place count 109 transition count 162
Iterating global reduction 2 with 14 rules applied. Total rules applied 116 place count 109 transition count 162
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 123 place count 109 transition count 155
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 129 place count 103 transition count 143
Iterating global reduction 3 with 6 rules applied. Total rules applied 135 place count 103 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 137 place count 103 transition count 141
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 142 place count 98 transition count 136
Iterating global reduction 4 with 5 rules applied. Total rules applied 147 place count 98 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 148 place count 98 transition count 135
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 152 place count 94 transition count 130
Iterating global reduction 5 with 4 rules applied. Total rules applied 156 place count 94 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 157 place count 94 transition count 129
Applied a total of 157 rules in 15 ms. Remains 94 /163 variables (removed 69) and now considering 129/282 (removed 153) transitions.
// Phase 1: matrix 129 rows 94 cols
[2024-05-21 21:15:54] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:15:54] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 21:15:54] [INFO ] Invariant cache hit.
[2024-05-21 21:15:54] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 21:15:54] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-05-21 21:15:54] [INFO ] Invariant cache hit.
[2024-05-21 21:15:54] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/163 places, 129/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 427 ms. Remains : 94/163 places, 129/282 transitions.
Stuttering acceptance computed with spot in 374 ms :[(NOT p2), (OR (NOT p2) (AND p0 p1)), p0, (AND p0 p1), p0, p0, true, (AND p0 p1), (AND p1 p0), p1]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p1, acceptance={} source=7 dest: 5}, { cond=(NOT p1), acceptance={} source=7 dest: 8}], [{ cond=(AND p1 p0), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 9}], [{ cond=p1, acceptance={} source=9 dest: 6}, { cond=(NOT p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s87 1)), p1:(AND (GEQ s1 1) (GEQ s92 1)), p0:(AND (GEQ s1 1) (GEQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 40 steps with 8 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-04 finished in 841 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||G(p1))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 138 transition count 205
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 138 transition count 205
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 55 place count 138 transition count 200
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 73 place count 120 transition count 178
Iterating global reduction 1 with 18 rules applied. Total rules applied 91 place count 120 transition count 178
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 95 place count 120 transition count 174
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 110 place count 105 transition count 152
Iterating global reduction 2 with 15 rules applied. Total rules applied 125 place count 105 transition count 152
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 132 place count 105 transition count 145
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 139 place count 98 transition count 127
Iterating global reduction 3 with 7 rules applied. Total rules applied 146 place count 98 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 148 place count 98 transition count 125
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 152 place count 94 transition count 121
Iterating global reduction 4 with 4 rules applied. Total rules applied 156 place count 94 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 157 place count 94 transition count 120
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 160 place count 91 transition count 116
Iterating global reduction 5 with 3 rules applied. Total rules applied 163 place count 91 transition count 116
Applied a total of 163 rules in 15 ms. Remains 91 /163 variables (removed 72) and now considering 116/282 (removed 166) transitions.
// Phase 1: matrix 116 rows 91 cols
[2024-05-21 21:15:55] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:15:55] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 21:15:55] [INFO ] Invariant cache hit.
[2024-05-21 21:15:55] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 21:15:55] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-05-21 21:15:55] [INFO ] Invariant cache hit.
[2024-05-21 21:15:55] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/163 places, 116/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 276 ms. Remains : 91/163 places, 116/282 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s73 1) (LT s1 1) (LT s86 1)), p0:(AND (GEQ s1 1) (GEQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 23063 reset in 142 ms.
Product exploration explored 100000 steps with 23079 reset in 156 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 309 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 2271 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 472 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 468 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 21:15:56] [INFO ] Invariant cache hit.
[2024-05-21 21:15:56] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 21:15:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:15:56] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:15:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 21:15:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 21:15:56] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 21:15:56] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 21:15:56] [INFO ] After 34ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 21:15:56] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-21 21:15:56] [INFO ] After 187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 116/116 transitions.
Graph (complete) has 285 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 90 transition count 114
Applied a total of 3 rules in 6 ms. Remains 90 /91 variables (removed 1) and now considering 114/116 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 90/91 places, 114/116 transitions.
Incomplete random walk after 10000 steps, including 2279 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 450 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Finished probabilistic random walk after 299281 steps, run visited all 2 properties in 521 ms. (steps per millisecond=574 )
Probabilistic random walk after 299281 steps, saw 122854 distinct states, run finished after 521 ms. (steps per millisecond=574 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 205 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Applied a total of 0 rules in 8 ms. Remains 91 /91 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-21 21:15:57] [INFO ] Invariant cache hit.
[2024-05-21 21:15:57] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 21:15:57] [INFO ] Invariant cache hit.
[2024-05-21 21:15:57] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 21:15:57] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2024-05-21 21:15:57] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-21 21:15:57] [INFO ] Invariant cache hit.
[2024-05-21 21:15:57] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 342 ms. Remains : 91/91 places, 116/116 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 309 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 103 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 2295 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 508 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 454 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 21:15:58] [INFO ] Invariant cache hit.
[2024-05-21 21:15:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 21:15:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:15:58] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:15:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 21:15:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-21 21:15:58] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 21:15:58] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 21:15:58] [INFO ] After 32ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 21:15:58] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-21 21:15:58] [INFO ] After 193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 116/116 transitions.
Graph (complete) has 285 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 90 transition count 114
Applied a total of 3 rules in 4 ms. Remains 90 /91 variables (removed 1) and now considering 114/116 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 90/91 places, 114/116 transitions.
Incomplete random walk after 10000 steps, including 2317 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 453 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Finished probabilistic random walk after 299281 steps, run visited all 2 properties in 438 ms. (steps per millisecond=683 )
Probabilistic random walk after 299281 steps, saw 122854 distinct states, run finished after 438 ms. (steps per millisecond=683 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F (AND p0 p1))]
Knowledge based reduction with 9 factoid took 205 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 22967 reset in 127 ms.
Product exploration explored 100000 steps with 23052 reset in 130 ms.
Built C files in :
/tmp/ltsmin16270090092187335985
[2024-05-21 21:16:00] [INFO ] Computing symmetric may disable matrix : 116 transitions.
[2024-05-21 21:16:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:16:00] [INFO ] Computing symmetric may enable matrix : 116 transitions.
[2024-05-21 21:16:00] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:16:00] [INFO ] Computing Do-Not-Accords matrix : 116 transitions.
[2024-05-21 21:16:00] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:16:00] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16270090092187335985
Running compilation step : cd /tmp/ltsmin16270090092187335985;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 246 ms.
Running link step : cd /tmp/ltsmin16270090092187335985;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16270090092187335985;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10804961225102596750.hoa' '--buchi-type=spotba'
LTSmin run took 735 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-05 finished in 6209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((p1&&X((p1 U (X(!p2)||G(p1))))))||p0))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 139 transition count 214
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 139 transition count 214
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 139 transition count 209
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 71 place count 121 transition count 187
Iterating global reduction 1 with 18 rules applied. Total rules applied 89 place count 121 transition count 187
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 94 place count 121 transition count 182
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 109 place count 106 transition count 159
Iterating global reduction 2 with 15 rules applied. Total rules applied 124 place count 106 transition count 159
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 132 place count 106 transition count 151
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 139 place count 99 transition count 133
Iterating global reduction 3 with 7 rules applied. Total rules applied 146 place count 99 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 147 place count 99 transition count 132
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 152 place count 94 transition count 127
Iterating global reduction 4 with 5 rules applied. Total rules applied 157 place count 94 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 158 place count 94 transition count 126
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 162 place count 90 transition count 121
Iterating global reduction 5 with 4 rules applied. Total rules applied 166 place count 90 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 168 place count 90 transition count 119
Applied a total of 168 rules in 12 ms. Remains 90 /163 variables (removed 73) and now considering 119/282 (removed 163) transitions.
// Phase 1: matrix 119 rows 90 cols
[2024-05-21 21:16:01] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:16:01] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 21:16:01] [INFO ] Invariant cache hit.
[2024-05-21 21:16:01] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-21 21:16:01] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-21 21:16:01] [INFO ] Invariant cache hit.
[2024-05-21 21:16:01] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/163 places, 119/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 296 ms. Remains : 90/163 places, 119/282 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (LT s1 1) (LT s74 1)), p0:(OR (LT s1 1) (LT s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 189 ms.
Product exploration explored 100000 steps with 50000 reset in 193 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 308 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-07 finished in 863 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(G(p1)&&F(p2))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 139 transition count 210
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 139 transition count 210
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 139 transition count 205
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 70 place count 122 transition count 184
Iterating global reduction 1 with 17 rules applied. Total rules applied 87 place count 122 transition count 184
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 91 place count 122 transition count 180
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 104 place count 109 transition count 163
Iterating global reduction 2 with 13 rules applied. Total rules applied 117 place count 109 transition count 163
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 124 place count 109 transition count 156
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 130 place count 103 transition count 141
Iterating global reduction 3 with 6 rules applied. Total rules applied 136 place count 103 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 138 place count 103 transition count 139
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 141 place count 100 transition count 136
Iterating global reduction 4 with 3 rules applied. Total rules applied 144 place count 100 transition count 136
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 147 place count 97 transition count 132
Iterating global reduction 4 with 3 rules applied. Total rules applied 150 place count 97 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 151 place count 97 transition count 131
Applied a total of 151 rules in 27 ms. Remains 97 /163 variables (removed 66) and now considering 131/282 (removed 151) transitions.
// Phase 1: matrix 131 rows 97 cols
[2024-05-21 21:16:02] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:16:02] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 21:16:02] [INFO ] Invariant cache hit.
[2024-05-21 21:16:02] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-21 21:16:02] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-05-21 21:16:02] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:16:02] [INFO ] Invariant cache hit.
[2024-05-21 21:16:02] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/163 places, 131/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 320 ms. Remains : 97/163 places, 131/282 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s95 1)), p1:(AND (GEQ s1 1) (GEQ s88 1)), p2:(AND (GEQ s1 1) (GEQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-08 finished in 452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(p0) U X(p1))&&F((p2||G(p3))))))'
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 141 transition count 216
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 141 transition count 216
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 141 transition count 213
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 66 place count 122 transition count 190
Iterating global reduction 1 with 19 rules applied. Total rules applied 85 place count 122 transition count 190
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 90 place count 122 transition count 185
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 105 place count 107 transition count 165
Iterating global reduction 2 with 15 rules applied. Total rules applied 120 place count 107 transition count 165
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 128 place count 107 transition count 157
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 134 place count 101 transition count 144
Iterating global reduction 3 with 6 rules applied. Total rules applied 140 place count 101 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 141 place count 101 transition count 143
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 146 place count 96 transition count 138
Iterating global reduction 4 with 5 rules applied. Total rules applied 151 place count 96 transition count 138
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 156 place count 91 transition count 132
Iterating global reduction 4 with 5 rules applied. Total rules applied 161 place count 91 transition count 132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 164 place count 91 transition count 129
Applied a total of 164 rules in 15 ms. Remains 91 /163 variables (removed 72) and now considering 129/282 (removed 153) transitions.
// Phase 1: matrix 129 rows 91 cols
[2024-05-21 21:16:02] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:16:02] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 21:16:02] [INFO ] Invariant cache hit.
[2024-05-21 21:16:02] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-21 21:16:02] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-21 21:16:02] [INFO ] Invariant cache hit.
[2024-05-21 21:16:02] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/163 places, 129/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 252 ms. Remains : 91/163 places, 129/282 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s29 1) (GEQ s51 1)), p2:(AND (GEQ s1 1) (GEQ s46 1)), p1:(AND (GEQ s1 1) (GEQ s39 1)), p3:(AND (GEQ s1 1) (GEQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-10 finished in 522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 139 transition count 207
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 139 transition count 207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 139 transition count 204
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 69 place count 121 transition count 182
Iterating global reduction 1 with 18 rules applied. Total rules applied 87 place count 121 transition count 182
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 91 place count 121 transition count 178
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 106 place count 106 transition count 156
Iterating global reduction 2 with 15 rules applied. Total rules applied 121 place count 106 transition count 156
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 128 place count 106 transition count 149
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 136 place count 98 transition count 129
Iterating global reduction 3 with 8 rules applied. Total rules applied 144 place count 98 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 146 place count 98 transition count 127
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 151 place count 93 transition count 122
Iterating global reduction 4 with 5 rules applied. Total rules applied 156 place count 93 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 157 place count 93 transition count 121
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 161 place count 89 transition count 116
Iterating global reduction 5 with 4 rules applied. Total rules applied 165 place count 89 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 167 place count 89 transition count 114
Applied a total of 167 rules in 15 ms. Remains 89 /163 variables (removed 74) and now considering 114/282 (removed 168) transitions.
// Phase 1: matrix 114 rows 89 cols
[2024-05-21 21:16:03] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:16:03] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 21:16:03] [INFO ] Invariant cache hit.
[2024-05-21 21:16:03] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-21 21:16:03] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-05-21 21:16:03] [INFO ] Invariant cache hit.
[2024-05-21 21:16:03] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/163 places, 114/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 247 ms. Remains : 89/163 places, 114/282 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s83 1) (AND (GEQ s2 1) (GEQ s87 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22957 reset in 107 ms.
Product exploration explored 100000 steps with 22960 reset in 117 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 304 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 62 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2330 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17490 steps, run visited all 1 properties in 26 ms. (steps per millisecond=672 )
Probabilistic random walk after 17490 steps, saw 8345 distinct states, run finished after 26 ms. (steps per millisecond=672 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-11 finished in 843 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 138 transition count 202
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 138 transition count 202
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 138 transition count 198
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 71 place count 121 transition count 177
Iterating global reduction 1 with 17 rules applied. Total rules applied 88 place count 121 transition count 177
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 92 place count 121 transition count 173
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 107 place count 106 transition count 153
Iterating global reduction 2 with 15 rules applied. Total rules applied 122 place count 106 transition count 153
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 130 place count 106 transition count 145
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 137 place count 99 transition count 126
Iterating global reduction 3 with 7 rules applied. Total rules applied 144 place count 99 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 145 place count 99 transition count 125
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 150 place count 94 transition count 120
Iterating global reduction 4 with 5 rules applied. Total rules applied 155 place count 94 transition count 120
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 160 place count 89 transition count 114
Iterating global reduction 4 with 5 rules applied. Total rules applied 165 place count 89 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 168 place count 89 transition count 111
Applied a total of 168 rules in 11 ms. Remains 89 /163 variables (removed 74) and now considering 111/282 (removed 171) transitions.
// Phase 1: matrix 111 rows 89 cols
[2024-05-21 21:16:03] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:16:03] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 21:16:03] [INFO ] Invariant cache hit.
[2024-05-21 21:16:04] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-21 21:16:04] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-21 21:16:04] [INFO ] Invariant cache hit.
[2024-05-21 21:16:04] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/163 places, 111/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 237 ms. Remains : 89/163 places, 111/282 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-12 finished in 353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 139 transition count 203
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 139 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 139 transition count 200
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 69 place count 121 transition count 178
Iterating global reduction 1 with 18 rules applied. Total rules applied 87 place count 121 transition count 178
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 90 place count 121 transition count 175
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 106 place count 105 transition count 151
Iterating global reduction 2 with 16 rules applied. Total rules applied 122 place count 105 transition count 151
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 130 place count 105 transition count 143
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 137 place count 98 transition count 129
Iterating global reduction 3 with 7 rules applied. Total rules applied 144 place count 98 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 145 place count 98 transition count 128
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 151 place count 92 transition count 122
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 92 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 158 place count 92 transition count 121
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 163 place count 87 transition count 115
Iterating global reduction 5 with 5 rules applied. Total rules applied 168 place count 87 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 171 place count 87 transition count 112
Applied a total of 171 rules in 37 ms. Remains 87 /163 variables (removed 76) and now considering 112/282 (removed 170) transitions.
// Phase 1: matrix 112 rows 87 cols
[2024-05-21 21:16:04] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 21:16:04] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 21:16:04] [INFO ] Invariant cache hit.
[2024-05-21 21:16:04] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-21 21:16:04] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-05-21 21:16:04] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:16:04] [INFO ] Invariant cache hit.
[2024-05-21 21:16:04] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/163 places, 112/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 261 ms. Remains : 87/163 places, 112/282 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s43 1)), p1:(AND (GEQ s7 1) (GEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-13 finished in 394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&F((X((F(p1)&&G(p2)))&&F(!p2))))))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 140 transition count 211
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 140 transition count 211
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 140 transition count 206
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 67 place count 124 transition count 188
Iterating global reduction 1 with 16 rules applied. Total rules applied 83 place count 124 transition count 188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 87 place count 124 transition count 184
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 99 place count 112 transition count 165
Iterating global reduction 2 with 12 rules applied. Total rules applied 111 place count 112 transition count 165
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 118 place count 112 transition count 158
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 124 place count 106 transition count 143
Iterating global reduction 3 with 6 rules applied. Total rules applied 130 place count 106 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 132 place count 106 transition count 141
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 135 place count 103 transition count 138
Iterating global reduction 4 with 3 rules applied. Total rules applied 138 place count 103 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 139 place count 103 transition count 137
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 141 place count 101 transition count 135
Iterating global reduction 5 with 2 rules applied. Total rules applied 143 place count 101 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 145 place count 101 transition count 133
Applied a total of 145 rules in 29 ms. Remains 101 /163 variables (removed 62) and now considering 133/282 (removed 149) transitions.
// Phase 1: matrix 133 rows 101 cols
[2024-05-21 21:16:04] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:16:04] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 21:16:04] [INFO ] Invariant cache hit.
[2024-05-21 21:16:04] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 21:16:04] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-05-21 21:16:04] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 21:16:04] [INFO ] Invariant cache hit.
[2024-05-21 21:16:04] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/163 places, 133/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 347 ms. Remains : 101/163 places, 133/282 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), (OR (NOT p2) (NOT p1)), p2, (NOT p2), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p0 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s96 1)), p2:(OR (LT s17 1) (LT s77 1)), p1:(OR (LT s1 1) (LT s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-14 finished in 558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 137 transition count 201
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 137 transition count 201
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 137 transition count 197
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 75 place count 118 transition count 174
Iterating global reduction 1 with 19 rules applied. Total rules applied 94 place count 118 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 98 place count 118 transition count 170
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 113 place count 103 transition count 148
Iterating global reduction 2 with 15 rules applied. Total rules applied 128 place count 103 transition count 148
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 135 place count 103 transition count 141
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 143 place count 95 transition count 121
Iterating global reduction 3 with 8 rules applied. Total rules applied 151 place count 95 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 152 place count 95 transition count 120
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 157 place count 90 transition count 115
Iterating global reduction 4 with 5 rules applied. Total rules applied 162 place count 90 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 163 place count 90 transition count 114
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 167 place count 86 transition count 109
Iterating global reduction 5 with 4 rules applied. Total rules applied 171 place count 86 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 173 place count 86 transition count 107
Applied a total of 173 rules in 20 ms. Remains 86 /163 variables (removed 77) and now considering 107/282 (removed 175) transitions.
// Phase 1: matrix 107 rows 86 cols
[2024-05-21 21:16:05] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:16:05] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 21:16:05] [INFO ] Invariant cache hit.
[2024-05-21 21:16:05] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-21 21:16:05] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2024-05-21 21:16:05] [INFO ] Invariant cache hit.
[2024-05-21 21:16:05] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 86/163 places, 107/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 273 ms. Remains : 86/163 places, 107/282 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 162 ms.
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 291 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-15 finished in 704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(G(p1))) U X(G((F(!p1)||X(X(!p0)))))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d1m08-LTLFireability-02
Stuttering acceptance computed with spot in 398 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 137 transition count 201
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 137 transition count 201
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 137 transition count 197
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 75 place count 118 transition count 174
Iterating global reduction 1 with 19 rules applied. Total rules applied 94 place count 118 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 98 place count 118 transition count 170
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 114 place count 102 transition count 146
Iterating global reduction 2 with 16 rules applied. Total rules applied 130 place count 102 transition count 146
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 138 place count 102 transition count 138
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 145 place count 95 transition count 119
Iterating global reduction 3 with 7 rules applied. Total rules applied 152 place count 95 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 153 place count 95 transition count 118
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 158 place count 90 transition count 113
Iterating global reduction 4 with 5 rules applied. Total rules applied 163 place count 90 transition count 113
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 168 place count 85 transition count 107
Iterating global reduction 4 with 5 rules applied. Total rules applied 173 place count 85 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 176 place count 85 transition count 104
Applied a total of 176 rules in 19 ms. Remains 85 /163 variables (removed 78) and now considering 104/282 (removed 178) transitions.
// Phase 1: matrix 104 rows 85 cols
[2024-05-21 21:16:06] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:16:06] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-21 21:16:06] [INFO ] Invariant cache hit.
[2024-05-21 21:16:06] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 21:16:06] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2024-05-21 21:16:06] [INFO ] Invariant cache hit.
[2024-05-21 21:16:06] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 85/163 places, 104/282 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 426 ms. Remains : 85/163 places, 104/282 transitions.
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=true, acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={0} source=4 dest: 6}, { cond=p1, acceptance={} source=4 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 8}], [{ cond=(AND p0 p1), acceptance={0} source=6 dest: 6}, { cond=(AND p0 p1), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 p1), acceptance={0} source=7 dest: 4}, { cond=(AND p0 p1), acceptance={} source=7 dest: 9}], [{ cond=p1, acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=9 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 9}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s73 1)), p1:(AND (GEQ s1 1) (GEQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22897 reset in 99 ms.
Product exploration explored 100000 steps with 23056 reset in 106 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 286 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 140 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Incomplete random walk after 10000 steps, including 2335 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 21:16:07] [INFO ] Invariant cache hit.
[2024-05-21 21:16:07] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 21:16:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 21:16:07] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:16:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-21 21:16:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 21:16:07] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 21:16:07] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 21:16:07] [INFO ] After 12ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 21:16:07] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-21 21:16:07] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 104/104 transitions.
Graph (complete) has 264 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 84 transition count 102
Applied a total of 3 rules in 3 ms. Remains 84 /85 variables (removed 1) and now considering 102/104 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 84/85 places, 102/104 transitions.
Incomplete random walk after 10000 steps, including 2267 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4296 steps, run visited all 1 properties in 7 ms. (steps per millisecond=613 )
Probabilistic random walk after 4296 steps, saw 1997 distinct states, run finished after 8 ms. (steps per millisecond=537 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 p1)), (F p0), (F p1)]
Knowledge based reduction with 6 factoid took 179 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 349 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Stuttering acceptance computed with spot in 371 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 104/104 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-05-21 21:16:08] [INFO ] Invariant cache hit.
[2024-05-21 21:16:08] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 21:16:08] [INFO ] Invariant cache hit.
[2024-05-21 21:16:08] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 21:16:08] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-05-21 21:16:08] [INFO ] Invariant cache hit.
[2024-05-21 21:16:09] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 326 ms. Remains : 85/85 places, 104/104 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 286 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 139 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 538 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Incomplete random walk after 10000 steps, including 2270 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 21:16:09] [INFO ] Invariant cache hit.
[2024-05-21 21:16:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 21:16:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:16:09] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:16:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 21:16:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 21:16:09] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 21:16:09] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 21:16:09] [INFO ] After 11ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 21:16:09] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-21 21:16:09] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 104/104 transitions.
Graph (complete) has 264 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 84 transition count 102
Applied a total of 3 rules in 6 ms. Remains 84 /85 variables (removed 1) and now considering 102/104 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 84/85 places, 102/104 transitions.
Incomplete random walk after 10000 steps, including 2306 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4296 steps, run visited all 1 properties in 8 ms. (steps per millisecond=537 )
Probabilistic random walk after 4296 steps, saw 1997 distinct states, run finished after 8 ms. (steps per millisecond=537 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 p1)), (F p0), (F p1)]
Knowledge based reduction with 6 factoid took 214 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Stuttering acceptance computed with spot in 325 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Stuttering acceptance computed with spot in 431 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Product exploration explored 100000 steps with 22951 reset in 118 ms.
Product exploration explored 100000 steps with 22964 reset in 106 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 298 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 104/104 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-05-21 21:16:11] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:16:11] [INFO ] Invariant cache hit.
[2024-05-21 21:16:11] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 130 ms. Remains : 85/85 places, 104/104 transitions.
Built C files in :
/tmp/ltsmin7942480180023750567
[2024-05-21 21:16:12] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7942480180023750567
Running compilation step : cd /tmp/ltsmin7942480180023750567;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 180 ms.
Running link step : cd /tmp/ltsmin7942480180023750567;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin7942480180023750567;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10435122239804567936.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 104/104 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-05-21 21:16:27] [INFO ] Invariant cache hit.
[2024-05-21 21:16:27] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 21:16:27] [INFO ] Invariant cache hit.
[2024-05-21 21:16:27] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 21:16:27] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-21 21:16:27] [INFO ] Invariant cache hit.
[2024-05-21 21:16:27] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 219 ms. Remains : 85/85 places, 104/104 transitions.
Built C files in :
/tmp/ltsmin9958605258731106703
[2024-05-21 21:16:27] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9958605258731106703
Running compilation step : cd /tmp/ltsmin9958605258731106703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 198 ms.
Running link step : cd /tmp/ltsmin9958605258731106703;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9958605258731106703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14143527211187034403.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 21:16:42] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:16:42] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:16:42] [INFO ] Time to serialize gal into /tmp/LTL18122805668189082136.gal : 1 ms
[2024-05-21 21:16:42] [INFO ] Time to serialize properties into /tmp/LTL11153184247708207407.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18122805668189082136.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11669490244472561481.hoa' '-atoms' '/tmp/LTL11153184247708207407.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11153184247708207407.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11669490244472561481.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t54, t64, t73, t74, t121, t170, t222, t223, t226, t227, t228, t229, t23...407
Computing Next relation with stutter on 1.02145e+07 deadlock states
Detected timeout of ITS tools.
[2024-05-21 21:16:57] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:16:57] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:16:57] [INFO ] Time to serialize gal into /tmp/LTL12485456824591512683.gal : 1 ms
[2024-05-21 21:16:57] [INFO ] Time to serialize properties into /tmp/LTL12696815745917913740.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12485456824591512683.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12696815745917913740.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((("((s1>=1)&&(l954>=1))")U(X(G("((s1>=1)&&(l955>=1))"))))U(X(G((F(!("((s1>=1)&&(l955>=1))")))||(X(X(!("((s1>=1)&&(l954>=1))")))))))...157
Formula 0 simplified : (!"((s1>=1)&&(l954>=1))" R XF!"((s1>=1)&&(l955>=1))") R XF(G"((s1>=1)&&(l955>=1))" & XX"((s1>=1)&&(l954>=1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t54, t64, t73, t74, t121, t170, t222, t223, t226, t227, t228, t229, t23...407
Computing Next relation with stutter on 1.02145e+07 deadlock states
Detected timeout of ITS tools.
[2024-05-21 21:17:12] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:17:12] [INFO ] Applying decomposition
[2024-05-21 21:17:12] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15194312440064016962.txt' '-o' '/tmp/graph15194312440064016962.bin' '-w' '/tmp/graph15194312440064016962.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15194312440064016962.bin' '-l' '-1' '-v' '-w' '/tmp/graph15194312440064016962.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:17:12] [INFO ] Decomposing Gal with order
[2024-05-21 21:17:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:17:12] [INFO ] Removed a total of 89 redundant transitions.
[2024-05-21 21:17:12] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:17:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 3 ms.
[2024-05-21 21:17:12] [INFO ] Time to serialize gal into /tmp/LTL17633765751620397836.gal : 2 ms
[2024-05-21 21:17:12] [INFO ] Time to serialize properties into /tmp/LTL15274721076793055213.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17633765751620397836.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15274721076793055213.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((("((u1.s1>=1)&&(i0.u0.l954>=1))")U(X(G("((u1.s1>=1)&&(u16.l955>=1))"))))U(X(G((F(!("((u1.s1>=1)&&(u16.l955>=1))")))||(X(X(!("((u1....189
Formula 0 simplified : (!"((u1.s1>=1)&&(i0.u0.l954>=1))" R XF!"((u1.s1>=1)&&(u16.l955>=1))") R XF(G"((u1.s1>=1)&&(u16.l955>=1))" & XX"((u1.s1>=1)&&(i0.u0.l...165
Reverse transition relation is NOT exact ! Due to transitions t6, t11, t53, t64, t73, t121, t170, t222, t223, t226, t227, t229, t232, t233, t234, t235, t23...386
Computing Next relation with stutter on 1.02145e+07 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8315575965163411233
[2024-05-21 21:17:27] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8315575965163411233
Running compilation step : cd /tmp/ltsmin8315575965163411233;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 204 ms.
Running link step : cd /tmp/ltsmin8315575965163411233;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8315575965163411233;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true) U X([]((LTLAPp1==true)))) U X([]((<>(!(LTLAPp1==true))||X(X(!(LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-02 finished in 96938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-21 21:17:42] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11161838867806512031
[2024-05-21 21:17:42] [INFO ] Computing symmetric may disable matrix : 282 transitions.
[2024-05-21 21:17:42] [INFO ] Applying decomposition
[2024-05-21 21:17:42] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:17:42] [INFO ] Computing symmetric may enable matrix : 282 transitions.
[2024-05-21 21:17:42] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:17:42] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7182695933645208183.txt' '-o' '/tmp/graph7182695933645208183.bin' '-w' '/tmp/graph7182695933645208183.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7182695933645208183.bin' '-l' '-1' '-v' '-w' '/tmp/graph7182695933645208183.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:17:43] [INFO ] Decomposing Gal with order
[2024-05-21 21:17:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:17:43] [INFO ] Computing Do-Not-Accords matrix : 282 transitions.
[2024-05-21 21:17:43] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:17:43] [INFO ] Removed a total of 305 redundant transitions.
[2024-05-21 21:17:43] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11161838867806512031
Running compilation step : cd /tmp/ltsmin11161838867806512031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 21:17:43] [INFO ] Flatten gal took : 28 ms
[2024-05-21 21:17:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 194 labels/synchronizations in 7 ms.
[2024-05-21 21:17:43] [INFO ] Time to serialize gal into /tmp/LTLFireability10290171040527902328.gal : 3 ms
[2024-05-21 21:17:43] [INFO ] Time to serialize properties into /tmp/LTLFireability7227941118947132626.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10290171040527902328.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7227941118947132626.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !(((("((i6.u0.s1>=1)&&(i5.u15.l954>=1))")U(X(G("((i6.u0.s1>=1)&&(i6.u24.l955>=1))"))))U(X(G((F(!("((i6.u0.s1>=1)&&(i6.u24.l955>=1))"))...209
Formula 0 simplified : (!"((i6.u0.s1>=1)&&(i5.u15.l954>=1))" R XF!"((i6.u0.s1>=1)&&(i6.u24.l955>=1))") R XF(G"((i6.u0.s1>=1)&&(i6.u24.l955>=1))" & XX"((i6....185
Compilation finished in 581 ms.
Running link step : cd /tmp/ltsmin11161838867806512031;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11161838867806512031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true) U X([]((LTLAPp1==true)))) U X([]((<>(!(LTLAPp1==true))||X(X(!(LTLAPp0==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: LTL layer: formula: (((LTLAPp0==true) U X([]((LTLAPp1==true)))) U X([]((<>(!(LTLAPp1==true))||X(X(!(LTLAPp0==true)))))))
pins2lts-mc-linux64( 2/ 8), 0.008: "(((LTLAPp0==true) U X([]((LTLAPp1==true)))) U X([]((<>(!(LTLAPp1==true))||X(X(!(LTLAPp0==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.008: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.029: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.029: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.041: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.041: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.041: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.048: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.058: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.058: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.065: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.090: There are 286 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.090: State length is 164, there are 300 groups
pins2lts-mc-linux64( 0/ 8), 0.090: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.090: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.090: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.090: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.123: [Blue] ~36 levels ~960 states ~2864 transitions
pins2lts-mc-linux64( 0/ 8), 0.146: [Blue] ~36 levels ~1920 states ~4648 transitions
pins2lts-mc-linux64( 6/ 8), 0.235: [Blue] ~51 levels ~3840 states ~8768 transitions
pins2lts-mc-linux64( 5/ 8), 0.319: [Blue] ~32 levels ~7680 states ~16896 transitions
pins2lts-mc-linux64( 5/ 8), 0.484: [Blue] ~32 levels ~15360 states ~32248 transitions
pins2lts-mc-linux64( 6/ 8), 0.801: [Blue] ~154 levels ~30720 states ~65848 transitions
pins2lts-mc-linux64( 6/ 8), 1.394: [Blue] ~180 levels ~61440 states ~123856 transitions
pins2lts-mc-linux64( 7/ 8), 2.692: [Blue] ~162 levels ~122880 states ~285184 transitions
pins2lts-mc-linux64( 7/ 8), 5.671: [Blue] ~309 levels ~245760 states ~548760 transitions
pins2lts-mc-linux64( 0/ 8), 11.667: [Blue] ~1030 levels ~491520 states ~1165728 transitions
pins2lts-mc-linux64( 6/ 8), 19.120: [Blue] ~1295 levels ~983040 states ~2546192 transitions
pins2lts-mc-linux64( 3/ 8), 29.653: [Blue] ~475 levels ~1966080 states ~4259840 transitions
pins2lts-mc-linux64( 1/ 8), 42.456: [Blue] ~4311 levels ~3932160 states ~10318080 transitions
pins2lts-mc-linux64( 5/ 8), 65.365: [Blue] ~6806 levels ~7864320 states ~22659408 transitions
pins2lts-mc-linux64( 7/ 8), 109.680: [Blue] ~36122 levels ~15728640 states ~42328912 transitions
pins2lts-mc-linux64( 7/ 8), 179.413: [Blue] ~36122 levels ~31457280 states ~84385768 transitions
pins2lts-mc-linux64( 7/ 8), 326.699: [Blue] ~333578 levels ~62914560 states ~168597352 transitions
pins2lts-mc-linux64( 7/ 8), 649.781: [Blue] ~667300 levels ~125829120 states ~339723136 transitions
pins2lts-mc-linux64( 0/ 8), 684.226: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 684.345:
pins2lts-mc-linux64( 0/ 8), 684.345: Explored 127194183 states 398176386 transitions, fanout: 3.130
pins2lts-mc-linux64( 0/ 8), 684.345: Total exploration time 684.250 sec (684.130 sec minimum, 684.169 sec on average)
pins2lts-mc-linux64( 0/ 8), 684.345: States per second: 185888, Transitions per second: 581916
pins2lts-mc-linux64( 0/ 8), 684.345:
pins2lts-mc-linux64( 0/ 8), 684.345: State space has 134217407 states, 1173493 are accepting
pins2lts-mc-linux64( 0/ 8), 684.345: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 684.345: blue states: 127194183 (94.77%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 684.345: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 684.345: all-red states: 14123340 (10.52%), bogus 1510 (0.00%)
pins2lts-mc-linux64( 0/ 8), 684.345:
pins2lts-mc-linux64( 0/ 8), 684.345: Total memory used for local state coloring: 50.5MB
pins2lts-mc-linux64( 0/ 8), 684.345:
pins2lts-mc-linux64( 0/ 8), 684.345: Queue width: 8B, total height: 3306621, memory: 25.23MB
pins2lts-mc-linux64( 0/ 8), 684.345: Tree memory: 1170.5MB, 9.1 B/state, compr.: 1.4%
pins2lts-mc-linux64( 0/ 8), 684.345: Tree fill ratio (roots/leafs): 99.0%/57.0%
pins2lts-mc-linux64( 0/ 8), 684.345: Stored 285 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 684.345: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 684.345: Est. total memory use: 1195.7MB (~1049.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11161838867806512031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true) U X([]((LTLAPp1==true)))) U X([]((<>(!(LTLAPp1==true))||X(X(!(LTLAPp0==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11161838867806512031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true) U X([]((LTLAPp1==true)))) U X([]((<>(!(LTLAPp1==true))||X(X(!(LTLAPp0==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-21 21:39:28] [INFO ] Flatten gal took : 295 ms
[2024-05-21 21:39:29] [INFO ] Time to serialize gal into /tmp/LTLFireability7737172242991460572.gal : 34 ms
[2024-05-21 21:39:29] [INFO ] Time to serialize properties into /tmp/LTLFireability11771595612512032956.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7737172242991460572.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11771595612512032956.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !(((("((s1>=1)&&(l954>=1))")U(X(G("((s1>=1)&&(l955>=1))"))))U(X(G((F(!("((s1>=1)&&(l955>=1))")))||(X(X(!("((s1>=1)&&(l954>=1))")))))))...157
Formula 0 simplified : (!"((s1>=1)&&(l954>=1))" R XF!"((s1>=1)&&(l955>=1))") R XF(G"((s1>=1)&&(l955>=1))" & XX"((s1>=1)&&(l954>=1))")
Detected timeout of ITS tools.
[2024-05-21 22:01:15] [INFO ] Flatten gal took : 188 ms
[2024-05-21 22:01:16] [INFO ] Input system was already deterministic with 282 transitions.
[2024-05-21 22:01:16] [INFO ] Transformed 163 places.
[2024-05-21 22:01:16] [INFO ] Transformed 282 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 22:01:16] [INFO ] Time to serialize gal into /tmp/LTLFireability9713055989704417785.gal : 9 ms
[2024-05-21 22:01:16] [INFO ] Time to serialize properties into /tmp/LTLFireability5764585025082791951.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9713055989704417785.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5764585025082791951.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((("((s1>=1)&&(l954>=1))")U(X(G("((s1>=1)&&(l955>=1))"))))U(X(G((F(!("((s1>=1)&&(l955>=1))")))||(X(X(!("((s1>=1)&&(l954>=1))")))))))...157
Formula 0 simplified : (!"((s1>=1)&&(l954>=1))" R XF!"((s1>=1)&&(l955>=1))") R XF(G"((s1>=1)&&(l955>=1))" & XX"((s1>=1)&&(l954>=1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10962084 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16033568 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="DBSingleClientW-PT-d1m08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is DBSingleClientW-PT-d1m08, 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 r109-tall-171624208300328"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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