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-171624208400358.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-d2m07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208400358
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 12 12:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 12 12:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 12:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716328589958

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-d2m07
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 21:56:31] [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:56:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:56:31] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2024-05-21 21:56:31] [INFO ] Transformed 4763 places.
[2024-05-21 21:56:31] [INFO ] Transformed 2478 transitions.
[2024-05-21 21:56:31] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 248 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 3580 places in 15 ms
Reduce places removed 3580 places and 0 transitions.
Support contains 41 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 368 places :
Symmetric choice reduction at 1 with 368 rule applications. Total rules 613 place count 769 transition count 1412
Iterating global reduction 1 with 368 rules applied. Total rules applied 981 place count 769 transition count 1412
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 1026 place count 769 transition count 1367
Discarding 293 places :
Symmetric choice reduction at 2 with 293 rule applications. Total rules 1319 place count 476 transition count 1074
Iterating global reduction 2 with 293 rules applied. Total rules applied 1612 place count 476 transition count 1074
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1617 place count 476 transition count 1069
Discarding 211 places :
Symmetric choice reduction at 3 with 211 rule applications. Total rules 1828 place count 265 transition count 773
Iterating global reduction 3 with 211 rules applied. Total rules applied 2039 place count 265 transition count 773
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 3 with 240 rules applied. Total rules applied 2279 place count 265 transition count 533
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 2292 place count 252 transition count 512
Iterating global reduction 4 with 13 rules applied. Total rules applied 2305 place count 252 transition count 512
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 2315 place count 242 transition count 502
Iterating global reduction 4 with 10 rules applied. Total rules applied 2325 place count 242 transition count 502
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 2329 place count 242 transition count 498
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 2336 place count 235 transition count 491
Iterating global reduction 5 with 7 rules applied. Total rules applied 2343 place count 235 transition count 491
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 2354 place count 235 transition count 480
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2355 place count 234 transition count 473
Iterating global reduction 6 with 1 rules applied. Total rules applied 2356 place count 234 transition count 473
Applied a total of 2356 rules in 199 ms. Remains 234 /1183 variables (removed 949) and now considering 473/2478 (removed 2005) transitions.
// Phase 1: matrix 473 rows 234 cols
[2024-05-21 21:56:32] [INFO ] Computed 2 invariants in 25 ms
[2024-05-21 21:56:32] [INFO ] Implicit Places using invariants in 495 ms returned []
[2024-05-21 21:56:32] [INFO ] Invariant cache hit.
[2024-05-21 21:56:32] [INFO ] State equation strengthened by 254 read => feed constraints.
[2024-05-21 21:56:33] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 1315 ms to find 0 implicit places.
[2024-05-21 21:56:33] [INFO ] Invariant cache hit.
[2024-05-21 21:56:33] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 234/1183 places, 473/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1690 ms. Remains : 234/1183 places, 473/2478 transitions.
Support contains 41 out of 234 places after structural reductions.
[2024-05-21 21:56:33] [INFO ] Flatten gal took : 56 ms
[2024-05-21 21:56:33] [INFO ] Flatten gal took : 30 ms
[2024-05-21 21:56:33] [INFO ] Input system was already deterministic with 473 transitions.
Incomplete random walk after 10000 steps, including 2297 resets, run finished after 577 ms. (steps per millisecond=17 ) properties (out of 38) seen :3
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 35) 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 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) 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 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 104 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) 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 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 38 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 35) 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 35) 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 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) 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 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 34 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 109 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 100 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Interrupted probabilistic random walk after 844543 steps, run timeout after 3001 ms. (steps per millisecond=281 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1, 23=1, 24=1, 25=1, 26=1, 27=1, 28=1, 29=1, 30=1, 32=1, 33=1, 34=1}
Probabilistic random walk after 844543 steps, saw 332425 distinct states, run finished after 3002 ms. (steps per millisecond=281 ) properties seen :34
Running SMT prover for 1 properties.
[2024-05-21 21:56:37] [INFO ] Invariant cache hit.
[2024-05-21 21:56:37] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-21 21:56:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:56:37] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 37 stable transitions
Graph (complete) has 940 edges and 234 vertex of which 233 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' '!((F(p0)||G(p1)))'
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 200 transition count 341
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 200 transition count 341
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 78 place count 200 transition count 331
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 103 place count 175 transition count 301
Iterating global reduction 1 with 25 rules applied. Total rules applied 128 place count 175 transition count 301
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 136 place count 175 transition count 293
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 159 place count 152 transition count 256
Iterating global reduction 2 with 23 rules applied. Total rules applied 182 place count 152 transition count 256
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 195 place count 152 transition count 243
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 208 place count 139 transition count 208
Iterating global reduction 3 with 13 rules applied. Total rules applied 221 place count 139 transition count 208
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 225 place count 139 transition count 204
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 232 place count 132 transition count 197
Iterating global reduction 4 with 7 rules applied. Total rules applied 239 place count 132 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 242 place count 132 transition count 194
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 246 place count 128 transition count 189
Iterating global reduction 5 with 4 rules applied. Total rules applied 250 place count 128 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 251 place count 128 transition count 188
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 252 place count 127 transition count 186
Iterating global reduction 6 with 1 rules applied. Total rules applied 253 place count 127 transition count 186
Applied a total of 253 rules in 54 ms. Remains 127 /234 variables (removed 107) and now considering 186/473 (removed 287) transitions.
// Phase 1: matrix 186 rows 127 cols
[2024-05-21 21:56:38] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:56:38] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-21 21:56:38] [INFO ] Invariant cache hit.
[2024-05-21 21:56:38] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 21:56:38] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2024-05-21 21:56:38] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-21 21:56:38] [INFO ] Invariant cache hit.
[2024-05-21 21:56:38] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/234 places, 186/473 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 760 ms. Remains : 127/234 places, 186/473 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 167 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s96 1)), p1:(AND (GEQ s1 1) (GEQ s68 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][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-00 finished in 977 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 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 200 transition count 347
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 200 transition count 347
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 79 place count 200 transition count 336
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 104 place count 175 transition count 302
Iterating global reduction 1 with 25 rules applied. Total rules applied 129 place count 175 transition count 302
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 137 place count 175 transition count 294
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 159 place count 153 transition count 258
Iterating global reduction 2 with 22 rules applied. Total rules applied 181 place count 153 transition count 258
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 194 place count 153 transition count 245
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 207 place count 140 transition count 207
Iterating global reduction 3 with 13 rules applied. Total rules applied 220 place count 140 transition count 207
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 224 place count 140 transition count 203
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 230 place count 134 transition count 197
Iterating global reduction 4 with 6 rules applied. Total rules applied 236 place count 134 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 239 place count 134 transition count 194
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 242 place count 131 transition count 190
Iterating global reduction 5 with 3 rules applied. Total rules applied 245 place count 131 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 246 place count 131 transition count 189
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 247 place count 130 transition count 187
Iterating global reduction 6 with 1 rules applied. Total rules applied 248 place count 130 transition count 187
Applied a total of 248 rules in 47 ms. Remains 130 /234 variables (removed 104) and now considering 187/473 (removed 286) transitions.
// Phase 1: matrix 187 rows 130 cols
[2024-05-21 21:56:39] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:56:39] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-21 21:56:39] [INFO ] Invariant cache hit.
[2024-05-21 21:56:39] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 21:56:39] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
[2024-05-21 21:56:39] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-21 21:56:39] [INFO ] Invariant cache hit.
[2024-05-21 21:56:39] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/234 places, 187/473 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 601 ms. Remains : 130/234 places, 187/473 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-01 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 s124 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 22937 reset in 206 ms.
Product exploration explored 100000 steps with 23040 reset in 189 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 472 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 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 56 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2297 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16977 steps, run visited all 1 properties in 67 ms. (steps per millisecond=253 )
Probabilistic random walk after 16977 steps, saw 7979 distinct states, run finished after 67 ms. (steps per millisecond=253 ) 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 92 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 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 187/187 transitions.
Applied a total of 0 rules in 10 ms. Remains 130 /130 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2024-05-21 21:56:40] [INFO ] Invariant cache hit.
[2024-05-21 21:56:40] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 21:56:40] [INFO ] Invariant cache hit.
[2024-05-21 21:56:40] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 21:56:41] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2024-05-21 21:56:41] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-21 21:56:41] [INFO ] Invariant cache hit.
[2024-05-21 21:56:41] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 403 ms. Remains : 130/130 places, 187/187 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 472 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 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 61 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2256 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 459 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16977 steps, run visited all 1 properties in 28 ms. (steps per millisecond=606 )
Probabilistic random walk after 16977 steps, saw 7979 distinct states, run finished after 28 ms. (steps per millisecond=606 ) 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 99 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 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22854 reset in 141 ms.
Product exploration explored 100000 steps with 23030 reset in 199 ms.
Built C files in :
/tmp/ltsmin15012872917321019523
[2024-05-21 21:56:42] [INFO ] Computing symmetric may disable matrix : 187 transitions.
[2024-05-21 21:56:42] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:56:42] [INFO ] Computing symmetric may enable matrix : 187 transitions.
[2024-05-21 21:56:42] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:56:42] [INFO ] Computing Do-Not-Accords matrix : 187 transitions.
[2024-05-21 21:56:42] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:56:42] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15012872917321019523
Running compilation step : cd /tmp/ltsmin15012872917321019523;'/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 808 ms.
Running link step : cd /tmp/ltsmin15012872917321019523;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 198 ms.
Running LTSmin : cd /tmp/ltsmin15012872917321019523;'/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/stateBased13795406072107935102.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 187/187 transitions.
Applied a total of 0 rules in 10 ms. Remains 130 /130 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2024-05-21 21:56:57] [INFO ] Invariant cache hit.
[2024-05-21 21:56:57] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 21:56:57] [INFO ] Invariant cache hit.
[2024-05-21 21:56:57] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 21:56:57] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2024-05-21 21:56:57] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 21:56:57] [INFO ] Invariant cache hit.
[2024-05-21 21:56:57] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 427 ms. Remains : 130/130 places, 187/187 transitions.
Built C files in :
/tmp/ltsmin14791654413286182869
[2024-05-21 21:56:57] [INFO ] Computing symmetric may disable matrix : 187 transitions.
[2024-05-21 21:56:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:56:57] [INFO ] Computing symmetric may enable matrix : 187 transitions.
[2024-05-21 21:56:57] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:56:57] [INFO ] Computing Do-Not-Accords matrix : 187 transitions.
[2024-05-21 21:56:57] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:56:57] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14791654413286182869
Running compilation step : cd /tmp/ltsmin14791654413286182869;'/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 387 ms.
Running link step : cd /tmp/ltsmin14791654413286182869;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14791654413286182869;'/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/stateBased8726921368545441635.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 21:57:12] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:57:12] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:57:12] [INFO ] Time to serialize gal into /tmp/LTL12146755395802294635.gal : 3 ms
[2024-05-21 21:57:12] [INFO ] Time to serialize properties into /tmp/LTL3990892459935405634.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/LTL12146755395802294635.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14917477373145109505.hoa' '-atoms' '/tmp/LTL3990892459935405634.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/LTL3990892459935405634.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14917477373145109505.hoa
Detected timeout of ITS tools.
[2024-05-21 21:57:27] [INFO ] Flatten gal took : 17 ms
[2024-05-21 21:57:27] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:57:27] [INFO ] Time to serialize gal into /tmp/LTL18317636383327840105.gal : 2 ms
[2024-05-21 21:57:27] [INFO ] Time to serialize properties into /tmp/LTL7323413976754401501.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/LTL18317636383327840105.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7323413976754401501.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...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l4144<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l4144<1))"
Detected timeout of ITS tools.
[2024-05-21 21:57:42] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:57:42] [INFO ] Applying decomposition
[2024-05-21 21:57:42] [INFO ] Flatten gal took : 10 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/graph9487448922579668816.txt' '-o' '/tmp/graph9487448922579668816.bin' '-w' '/tmp/graph9487448922579668816.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9487448922579668816.bin' '-l' '-1' '-v' '-w' '/tmp/graph9487448922579668816.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:57:43] [INFO ] Decomposing Gal with order
[2024-05-21 21:57:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:57:43] [INFO ] Removed a total of 200 redundant transitions.
[2024-05-21 21:57:43] [INFO ] Flatten gal took : 80 ms
[2024-05-21 21:57:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 36 ms.
[2024-05-21 21:57:43] [INFO ] Time to serialize gal into /tmp/LTL4268406471197505430.gal : 21 ms
[2024-05-21 21:57:43] [INFO ] Time to serialize properties into /tmp/LTL15380869894849681529.ltl : 31 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/LTL4268406471197505430.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15380869894849681529.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.l4144<1))"))))
Formula 0 simplified : FG!"((i0.u0.s1<1)||(i0.u0.l4144<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14656540014011453122
[2024-05-21 21:57:58] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14656540014011453122
Running compilation step : cd /tmp/ltsmin14656540014011453122;'/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 275 ms.
Running link step : cd /tmp/ltsmin14656540014011453122;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14656540014011453122;'/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-d2m07-LTLFireability-01 finished in 94268 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||X((X(X(G(p2)))&&p1)))))'
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 202 transition count 349
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 202 transition count 349
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 75 place count 202 transition count 338
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 98 place count 179 transition count 306
Iterating global reduction 1 with 23 rules applied. Total rules applied 121 place count 179 transition count 306
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 128 place count 179 transition count 299
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 148 place count 159 transition count 267
Iterating global reduction 2 with 20 rules applied. Total rules applied 168 place count 159 transition count 267
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 179 place count 159 transition count 256
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 190 place count 148 transition count 230
Iterating global reduction 3 with 11 rules applied. Total rules applied 201 place count 148 transition count 230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 204 place count 148 transition count 227
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 211 place count 141 transition count 220
Iterating global reduction 4 with 7 rules applied. Total rules applied 218 place count 141 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 221 place count 141 transition count 217
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 225 place count 137 transition count 212
Iterating global reduction 5 with 4 rules applied. Total rules applied 229 place count 137 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 230 place count 137 transition count 211
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 231 place count 136 transition count 209
Iterating global reduction 6 with 1 rules applied. Total rules applied 232 place count 136 transition count 209
Applied a total of 232 rules in 27 ms. Remains 136 /234 variables (removed 98) and now considering 209/473 (removed 264) transitions.
// Phase 1: matrix 209 rows 136 cols
[2024-05-21 21:58:13] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:58:13] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 21:58:13] [INFO ] Invariant cache hit.
[2024-05-21 21:58:13] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-21 21:58:13] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2024-05-21 21:58:13] [INFO ] Invariant cache hit.
[2024-05-21 21:58:13] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/234 places, 209/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 458 ms. Remains : 136/234 places, 209/473 transitions.
Stuttering acceptance computed with spot in 320 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=5, aps=[p0:(AND (GEQ s1 1) (GEQ s95 1)), p1:(AND (GEQ s1 1) (GEQ s127 1)), p2:(AND (GEQ s1 1) (GEQ s92 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-02 finished in 802 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 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 200 transition count 341
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 200 transition count 341
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 78 place count 200 transition count 331
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 104 place count 174 transition count 296
Iterating global reduction 1 with 26 rules applied. Total rules applied 130 place count 174 transition count 296
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 138 place count 174 transition count 288
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 161 place count 151 transition count 251
Iterating global reduction 2 with 23 rules applied. Total rules applied 184 place count 151 transition count 251
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 197 place count 151 transition count 238
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 210 place count 138 transition count 203
Iterating global reduction 3 with 13 rules applied. Total rules applied 223 place count 138 transition count 203
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 227 place count 138 transition count 199
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 234 place count 131 transition count 192
Iterating global reduction 4 with 7 rules applied. Total rules applied 241 place count 131 transition count 192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 244 place count 131 transition count 189
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 248 place count 127 transition count 184
Iterating global reduction 5 with 4 rules applied. Total rules applied 252 place count 127 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 253 place count 127 transition count 183
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 254 place count 126 transition count 181
Iterating global reduction 6 with 1 rules applied. Total rules applied 255 place count 126 transition count 181
Applied a total of 255 rules in 16 ms. Remains 126 /234 variables (removed 108) and now considering 181/473 (removed 292) transitions.
// Phase 1: matrix 181 rows 126 cols
[2024-05-21 21:58:14] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:58:14] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 21:58:14] [INFO ] Invariant cache hit.
[2024-05-21 21:58:14] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 21:58:14] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2024-05-21 21:58:14] [INFO ] Invariant cache hit.
[2024-05-21 21:58:14] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/234 places, 181/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 406 ms. Remains : 126/234 places, 181/473 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-03 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 s68 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-d2m07-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-03 finished in 592 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(((p1 U p2)&&p0))))'
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 201 transition count 356
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 201 transition count 356
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 77 place count 201 transition count 345
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 101 place count 177 transition count 312
Iterating global reduction 1 with 24 rules applied. Total rules applied 125 place count 177 transition count 312
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 132 place count 177 transition count 305
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 153 place count 156 transition count 271
Iterating global reduction 2 with 21 rules applied. Total rules applied 174 place count 156 transition count 271
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 188 place count 156 transition count 257
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 200 place count 144 transition count 217
Iterating global reduction 3 with 12 rules applied. Total rules applied 212 place count 144 transition count 217
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 218 place count 144 transition count 211
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 224 place count 138 transition count 205
Iterating global reduction 4 with 6 rules applied. Total rules applied 230 place count 138 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 231 place count 138 transition count 204
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 235 place count 134 transition count 199
Iterating global reduction 5 with 4 rules applied. Total rules applied 239 place count 134 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 240 place count 134 transition count 198
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 241 place count 133 transition count 196
Iterating global reduction 6 with 1 rules applied. Total rules applied 242 place count 133 transition count 196
Applied a total of 242 rules in 21 ms. Remains 133 /234 variables (removed 101) and now considering 196/473 (removed 277) transitions.
// Phase 1: matrix 196 rows 133 cols
[2024-05-21 21:58:14] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:58:14] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 21:58:14] [INFO ] Invariant cache hit.
[2024-05-21 21:58:14] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-21 21:58:15] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-21 21:58:15] [INFO ] Invariant cache hit.
[2024-05-21 21:58:15] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 133/234 places, 196/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 436 ms. Remains : 133/234 places, 196/473 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s126 1)), p1:(AND (GEQ s1 1) (GEQ s113 1)), p0:(AND (GEQ s1 1) (GEQ s113 1) (OR (LT s1 1) (LT s123 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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-d2m07-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-04 finished in 568 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(p0)))'
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 200 transition count 347
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 200 transition count 347
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 79 place count 200 transition count 336
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 104 place count 175 transition count 302
Iterating global reduction 1 with 25 rules applied. Total rules applied 129 place count 175 transition count 302
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 136 place count 175 transition count 295
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 158 place count 153 transition count 259
Iterating global reduction 2 with 22 rules applied. Total rules applied 180 place count 153 transition count 259
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 193 place count 153 transition count 246
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 206 place count 140 transition count 205
Iterating global reduction 3 with 13 rules applied. Total rules applied 219 place count 140 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 222 place count 140 transition count 202
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 229 place count 133 transition count 195
Iterating global reduction 4 with 7 rules applied. Total rules applied 236 place count 133 transition count 195
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 239 place count 133 transition count 192
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 243 place count 129 transition count 187
Iterating global reduction 5 with 4 rules applied. Total rules applied 247 place count 129 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 248 place count 129 transition count 186
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 249 place count 128 transition count 184
Iterating global reduction 6 with 1 rules applied. Total rules applied 250 place count 128 transition count 184
Applied a total of 250 rules in 19 ms. Remains 128 /234 variables (removed 106) and now considering 184/473 (removed 289) transitions.
// Phase 1: matrix 184 rows 128 cols
[2024-05-21 21:58:15] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:58:15] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 21:58:15] [INFO ] Invariant cache hit.
[2024-05-21 21:58:15] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 21:58:15] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2024-05-21 21:58:15] [INFO ] Invariant cache hit.
[2024-05-21 21:58:15] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/234 places, 184/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 410 ms. Remains : 128/234 places, 184/473 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s116 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][false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-05 finished in 547 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(G(p1))&&p0)))'
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 201 transition count 353
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 201 transition count 353
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 80 place count 201 transition count 339
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 105 place count 176 transition count 305
Iterating global reduction 1 with 25 rules applied. Total rules applied 130 place count 176 transition count 305
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 138 place count 176 transition count 297
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 160 place count 154 transition count 261
Iterating global reduction 2 with 22 rules applied. Total rules applied 182 place count 154 transition count 261
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 195 place count 154 transition count 248
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 208 place count 141 transition count 213
Iterating global reduction 3 with 13 rules applied. Total rules applied 221 place count 141 transition count 213
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 225 place count 141 transition count 209
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 232 place count 134 transition count 202
Iterating global reduction 4 with 7 rules applied. Total rules applied 239 place count 134 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 242 place count 134 transition count 199
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 246 place count 130 transition count 194
Iterating global reduction 5 with 4 rules applied. Total rules applied 250 place count 130 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 251 place count 130 transition count 193
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 252 place count 129 transition count 191
Iterating global reduction 6 with 1 rules applied. Total rules applied 253 place count 129 transition count 191
Applied a total of 253 rules in 17 ms. Remains 129 /234 variables (removed 105) and now considering 191/473 (removed 282) transitions.
// Phase 1: matrix 191 rows 129 cols
[2024-05-21 21:58:15] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:58:16] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 21:58:16] [INFO ] Invariant cache hit.
[2024-05-21 21:58:16] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 21:58:16] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2024-05-21 21:58:16] [INFO ] Invariant cache hit.
[2024-05-21 21:58:16] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/234 places, 191/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 426 ms. Remains : 129/234 places, 191/473 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-06 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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s94 1)), p1:(AND (GEQ s1 1) (GEQ s88 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-06 finished in 574 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(p1) U G((p1 U !p2)))||X(p2)||p0)))'
Support contains 6 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 202 transition count 343
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 202 transition count 343
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 74 place count 202 transition count 333
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 97 place count 179 transition count 305
Iterating global reduction 1 with 23 rules applied. Total rules applied 120 place count 179 transition count 305
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 128 place count 179 transition count 297
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 148 place count 159 transition count 267
Iterating global reduction 2 with 20 rules applied. Total rules applied 168 place count 159 transition count 267
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 180 place count 159 transition count 255
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 192 place count 147 transition count 214
Iterating global reduction 3 with 12 rules applied. Total rules applied 204 place count 147 transition count 214
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 208 place count 147 transition count 210
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 213 place count 142 transition count 205
Iterating global reduction 4 with 5 rules applied. Total rules applied 218 place count 142 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 221 place count 142 transition count 202
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 223 place count 140 transition count 200
Iterating global reduction 5 with 2 rules applied. Total rules applied 225 place count 140 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 226 place count 140 transition count 199
Applied a total of 226 rules in 16 ms. Remains 140 /234 variables (removed 94) and now considering 199/473 (removed 274) transitions.
// Phase 1: matrix 199 rows 140 cols
[2024-05-21 21:58:16] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:58:16] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 21:58:16] [INFO ] Invariant cache hit.
[2024-05-21 21:58:16] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 21:58:16] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2024-05-21 21:58:16] [INFO ] Invariant cache hit.
[2024-05-21 21:58:16] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 140/234 places, 199/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 478 ms. Remains : 140/234 places, 199/473 transitions.
Stuttering acceptance computed with spot in 260 ms :[false, false, false, (AND (NOT p1) (NOT p2)), p2, (NOT p1), p2]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(OR (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s51 1) (LT s57 1)), p2:(AND (GEQ s1 1) (GEQ s94 1)), p1:(AND (GEQ s26 1) (GEQ s117 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 270 ms.
Product exploration explored 100000 steps with 50000 reset in 236 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 501 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 15 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-07 finished in 1290 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&&G(!p1)) U (G((!p0&&G(!p1)))||p2)))'
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 202 transition count 351
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 202 transition count 351
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 74 place count 202 transition count 341
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 98 place count 178 transition count 308
Iterating global reduction 1 with 24 rules applied. Total rules applied 122 place count 178 transition count 308
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 130 place count 178 transition count 300
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 151 place count 157 transition count 266
Iterating global reduction 2 with 21 rules applied. Total rules applied 172 place count 157 transition count 266
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 185 place count 157 transition count 253
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 196 place count 146 transition count 227
Iterating global reduction 3 with 11 rules applied. Total rules applied 207 place count 146 transition count 227
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 215 place count 146 transition count 219
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 221 place count 140 transition count 213
Iterating global reduction 4 with 6 rules applied. Total rules applied 227 place count 140 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 229 place count 140 transition count 211
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 233 place count 136 transition count 206
Iterating global reduction 5 with 4 rules applied. Total rules applied 237 place count 136 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 238 place count 136 transition count 205
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 239 place count 135 transition count 203
Iterating global reduction 6 with 1 rules applied. Total rules applied 240 place count 135 transition count 203
Applied a total of 240 rules in 33 ms. Remains 135 /234 variables (removed 99) and now considering 203/473 (removed 270) transitions.
// Phase 1: matrix 203 rows 135 cols
[2024-05-21 21:58:17] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:58:17] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 21:58:17] [INFO ] Invariant cache hit.
[2024-05-21 21:58:17] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-21 21:58:18] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-05-21 21:58:18] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 21:58:18] [INFO ] Invariant cache hit.
[2024-05-21 21:58:18] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/234 places, 203/473 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 481 ms. Remains : 135/234 places, 203/473 transitions.
Stuttering acceptance computed with spot in 467 ms :[(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), true, p1]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s72 1)), p0:(AND (GEQ s1 1) (GEQ s129 1)), p2:(AND (GEQ s1 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 22962 reset in 259 ms.
Product exploration explored 100000 steps with 22917 reset in 184 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 495 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT p1)), true, (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 83 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), true, p1]
Incomplete random walk after 10000 steps, including 2277 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 454 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 450 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Finished probabilistic random walk after 9537 steps, run visited all 3 properties in 48 ms. (steps per millisecond=198 )
Probabilistic random walk after 9537 steps, saw 4539 distinct states, run finished after 48 ms. (steps per millisecond=198 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT p1)), true, (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p1), (F (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 8 factoid took 131 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-08 finished in 2073 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(F(!p0)) U G(p1))))'
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 201 transition count 348
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 201 transition count 348
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 76 place count 201 transition count 338
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 101 place count 176 transition count 304
Iterating global reduction 1 with 25 rules applied. Total rules applied 126 place count 176 transition count 304
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 132 place count 176 transition count 298
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 154 place count 154 transition count 263
Iterating global reduction 2 with 22 rules applied. Total rules applied 176 place count 154 transition count 263
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 189 place count 154 transition count 250
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 201 place count 142 transition count 217
Iterating global reduction 3 with 12 rules applied. Total rules applied 213 place count 142 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 216 place count 142 transition count 214
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 223 place count 135 transition count 207
Iterating global reduction 4 with 7 rules applied. Total rules applied 230 place count 135 transition count 207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 233 place count 135 transition count 204
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 237 place count 131 transition count 199
Iterating global reduction 5 with 4 rules applied. Total rules applied 241 place count 131 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 242 place count 131 transition count 198
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 243 place count 130 transition count 196
Iterating global reduction 6 with 1 rules applied. Total rules applied 244 place count 130 transition count 196
Applied a total of 244 rules in 20 ms. Remains 130 /234 variables (removed 104) and now considering 196/473 (removed 277) transitions.
// Phase 1: matrix 196 rows 130 cols
[2024-05-21 21:58:19] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:58:19] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 21:58:19] [INFO ] Invariant cache hit.
[2024-05-21 21:58:20] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-21 21:58:20] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-05-21 21:58:20] [INFO ] Invariant cache hit.
[2024-05-21 21:58:20] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/234 places, 196/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 418 ms. Remains : 130/234 places, 196/473 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), p0, (AND p0 p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s120 1)), p0:(AND (GEQ s1 1) (GEQ s70 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-09 finished in 582 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(p1)&&X((F(p3)&&p2))&&p0)))'
Support contains 6 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 203 transition count 344
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 203 transition count 344
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 69 place count 203 transition count 337
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 91 place count 181 transition count 310
Iterating global reduction 1 with 22 rules applied. Total rules applied 113 place count 181 transition count 310
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 121 place count 181 transition count 302
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 141 place count 161 transition count 270
Iterating global reduction 2 with 20 rules applied. Total rules applied 161 place count 161 transition count 270
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 171 place count 161 transition count 260
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 182 place count 150 transition count 240
Iterating global reduction 3 with 11 rules applied. Total rules applied 193 place count 150 transition count 240
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 197 place count 150 transition count 236
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 204 place count 143 transition count 229
Iterating global reduction 4 with 7 rules applied. Total rules applied 211 place count 143 transition count 229
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 214 place count 143 transition count 226
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 218 place count 139 transition count 221
Iterating global reduction 5 with 4 rules applied. Total rules applied 222 place count 139 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 223 place count 139 transition count 220
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 224 place count 138 transition count 218
Iterating global reduction 6 with 1 rules applied. Total rules applied 225 place count 138 transition count 218
Applied a total of 225 rules in 18 ms. Remains 138 /234 variables (removed 96) and now considering 218/473 (removed 255) transitions.
// Phase 1: matrix 218 rows 138 cols
[2024-05-21 21:58:20] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:58:20] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 21:58:20] [INFO ] Invariant cache hit.
[2024-05-21 21:58:20] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-21 21:58:20] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2024-05-21 21:58:20] [INFO ] Invariant cache hit.
[2024-05-21 21:58:20] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 138/234 places, 218/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 485 ms. Remains : 138/234 places, 218/473 transitions.
Stuttering acceptance computed with spot in 561 ms :[(NOT p1), (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p3) (NOT p0)), true]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND p1 p2 p3), acceptance={} source=1 dest: 0}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 p3), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(AND (GEQ s1 1) (GEQ s73 1)), p2:(AND (GEQ s49 1) (GEQ s55 1)), p3:(OR (LT s1 1) (LT s96 1)), p0:(AND (GEQ s1 1) (GEQ s92 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-10 finished in 1068 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(X(((!G((p1 U p2)) U !F(p1))||p0)))))'
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 201 transition count 350
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 201 transition count 350
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 77 place count 201 transition count 339
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 101 place count 177 transition count 306
Iterating global reduction 1 with 24 rules applied. Total rules applied 125 place count 177 transition count 306
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 133 place count 177 transition count 298
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 154 place count 156 transition count 264
Iterating global reduction 2 with 21 rules applied. Total rules applied 175 place count 156 transition count 264
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 189 place count 156 transition count 250
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 201 place count 144 transition count 216
Iterating global reduction 3 with 12 rules applied. Total rules applied 213 place count 144 transition count 216
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 221 place count 144 transition count 208
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 227 place count 138 transition count 202
Iterating global reduction 4 with 6 rules applied. Total rules applied 233 place count 138 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 236 place count 138 transition count 199
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 240 place count 134 transition count 194
Iterating global reduction 5 with 4 rules applied. Total rules applied 244 place count 134 transition count 194
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 245 place count 133 transition count 192
Iterating global reduction 5 with 1 rules applied. Total rules applied 246 place count 133 transition count 192
Applied a total of 246 rules in 17 ms. Remains 133 /234 variables (removed 101) and now considering 192/473 (removed 281) transitions.
// Phase 1: matrix 192 rows 133 cols
[2024-05-21 21:58:21] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:58:21] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 21:58:21] [INFO ] Invariant cache hit.
[2024-05-21 21:58:21] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 21:58:21] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-05-21 21:58:21] [INFO ] Invariant cache hit.
[2024-05-21 21:58:21] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 133/234 places, 192/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 416 ms. Remains : 133/234 places, 192/473 transitions.
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s127 1)), p1:(AND (GEQ s1 1) (GEQ s127 1)), p2:(AND (GEQ s1 1) (GEQ s91 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]]
Product exploration explored 100000 steps with 23000 reset in 149 ms.
Product exploration explored 100000 steps with 23062 reset in 157 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 482 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Incomplete random walk after 10000 steps, including 2276 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 420 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:58:23] [INFO ] Invariant cache hit.
[2024-05-21 21:58:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 21:58:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:58:23] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:58:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 21:58:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:58:23] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 21:58:23] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 21:58:23] [INFO ] After 34ms SMT Verify possible using 66 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 21:58:23] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-21 21:58:23] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 192/192 transitions.
Graph (complete) has 451 edges and 133 vertex of which 132 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 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 132 transition count 189
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 131 transition count 186
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 131 transition count 186
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 130 transition count 185
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 130 transition count 185
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 129 transition count 183
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 129 transition count 183
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 128 transition count 182
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 128 transition count 182
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 127 transition count 181
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 127 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 127 transition count 180
Applied a total of 15 rules in 15 ms. Remains 127 /133 variables (removed 6) and now considering 180/192 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 127/133 places, 180/192 transitions.
Incomplete random walk after 10000 steps, including 2279 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 434 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 20722 steps, run visited all 1 properties in 37 ms. (steps per millisecond=560 )
Probabilistic random walk after 20722 steps, saw 10231 distinct states, run finished after 37 ms. (steps per millisecond=560 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT p0)), (F (AND p1 (NOT p2))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 3 factoid took 976 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 133 /133 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-21 21:58:24] [INFO ] Invariant cache hit.
[2024-05-21 21:58:25] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 21:58:25] [INFO ] Invariant cache hit.
[2024-05-21 21:58:25] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 21:58:25] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2024-05-21 21:58:25] [INFO ] Invariant cache hit.
[2024-05-21 21:58:25] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 405 ms. Remains : 133/133 places, 192/192 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 482 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Incomplete random walk after 10000 steps, including 2306 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 438 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 451 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 433 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 477 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Finished probabilistic random walk after 21803 steps, run visited all 5 properties in 149 ms. (steps per millisecond=146 )
Probabilistic random walk after 21803 steps, saw 10751 distinct states, run finished after 149 ms. (steps per millisecond=146 ) properties seen :5
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT p0)), (F (AND p1 (NOT p2))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 3 factoid took 734 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Product exploration explored 100000 steps with 23040 reset in 142 ms.
Product exploration explored 100000 steps with 23079 reset in 180 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 133 /133 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-21 21:58:28] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 21:58:28] [INFO ] Invariant cache hit.
[2024-05-21 21:58:28] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 133/133 places, 192/192 transitions.
Built C files in :
/tmp/ltsmin3842977593973562800
[2024-05-21 21:58:28] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3842977593973562800
Running compilation step : cd /tmp/ltsmin3842977593973562800;'/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 308 ms.
Running link step : cd /tmp/ltsmin3842977593973562800;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3842977593973562800;'/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/stateBased16024889493333867679.hoa' '--buchi-type=spotba'
LTSmin run took 119 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-11 finished in 7257 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)||X((p1||G(F(p2)))))))'
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 202 transition count 363
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 202 transition count 363
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 76 place count 202 transition count 351
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 101 place count 177 transition count 317
Iterating global reduction 1 with 25 rules applied. Total rules applied 126 place count 177 transition count 317
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 136 place count 177 transition count 307
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 158 place count 155 transition count 271
Iterating global reduction 2 with 22 rules applied. Total rules applied 180 place count 155 transition count 271
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 195 place count 155 transition count 256
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 207 place count 143 transition count 223
Iterating global reduction 3 with 12 rules applied. Total rules applied 219 place count 143 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 223 place count 143 transition count 219
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 229 place count 137 transition count 213
Iterating global reduction 4 with 6 rules applied. Total rules applied 235 place count 137 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 238 place count 137 transition count 210
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 241 place count 134 transition count 206
Iterating global reduction 5 with 3 rules applied. Total rules applied 244 place count 134 transition count 206
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 245 place count 133 transition count 204
Iterating global reduction 5 with 1 rules applied. Total rules applied 246 place count 133 transition count 204
Applied a total of 246 rules in 24 ms. Remains 133 /234 variables (removed 101) and now considering 204/473 (removed 269) transitions.
// Phase 1: matrix 204 rows 133 cols
[2024-05-21 21:58:28] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:58:28] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 21:58:28] [INFO ] Invariant cache hit.
[2024-05-21 21:58:28] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 21:58:29] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-05-21 21:58:29] [INFO ] Invariant cache hit.
[2024-05-21 21:58:29] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 133/234 places, 204/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 429 ms. Remains : 133/234 places, 204/473 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s71 1)), p1:(AND (GEQ s1 1) (GEQ s131 1)), p2:(OR (LT s1 1) (LT s98 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][false, false, false, false]]
Product exploration explored 100000 steps with 29814 reset in 171 ms.
Product exploration explored 100000 steps with 29790 reset in 177 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 89 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2277 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 413 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 405 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 442 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 395 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Finished probabilistic random walk after 73712 steps, run visited all 6 properties in 263 ms. (steps per millisecond=280 )
Probabilistic random walk after 73712 steps, saw 32576 distinct states, run finished after 263 ms. (steps per millisecond=280 ) properties seen :6
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p2))), (F p0), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 244 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 4 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-21 21:58:31] [INFO ] Invariant cache hit.
[2024-05-21 21:58:31] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 21:58:31] [INFO ] Invariant cache hit.
[2024-05-21 21:58:31] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 21:58:31] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2024-05-21 21:58:31] [INFO ] Invariant cache hit.
[2024-05-21 21:58:31] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 418 ms. Remains : 133/133 places, 204/204 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 79 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2307 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 457 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 413 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 421 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Finished probabilistic random walk after 73712 steps, run visited all 6 properties in 232 ms. (steps per millisecond=317 )
Probabilistic random walk after 73712 steps, saw 32576 distinct states, run finished after 232 ms. (steps per millisecond=317 ) properties seen :6
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p2))), (F p0), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 256 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 29772 reset in 171 ms.
Product exploration explored 100000 steps with 29809 reset in 171 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 13 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-21 21:58:33] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 21:58:33] [INFO ] Invariant cache hit.
[2024-05-21 21:58:33] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 133/133 places, 204/204 transitions.
Built C files in :
/tmp/ltsmin1200253236580060518
[2024-05-21 21:58:33] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1200253236580060518
Running compilation step : cd /tmp/ltsmin1200253236580060518;'/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 313 ms.
Running link step : cd /tmp/ltsmin1200253236580060518;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin1200253236580060518;'/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/stateBased5111489352169756806.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 5 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-21 21:58:48] [INFO ] Invariant cache hit.
[2024-05-21 21:58:49] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 21:58:49] [INFO ] Invariant cache hit.
[2024-05-21 21:58:49] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 21:58:49] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2024-05-21 21:58:49] [INFO ] Invariant cache hit.
[2024-05-21 21:58:49] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 420 ms. Remains : 133/133 places, 204/204 transitions.
Built C files in :
/tmp/ltsmin6318479192735867788
[2024-05-21 21:58:49] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6318479192735867788
Running compilation step : cd /tmp/ltsmin6318479192735867788;'/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 306 ms.
Running link step : cd /tmp/ltsmin6318479192735867788;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6318479192735867788;'/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/stateBased13836559545614995739.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 21:59:04] [INFO ] Flatten gal took : 18 ms
[2024-05-21 21:59:04] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:59:04] [INFO ] Time to serialize gal into /tmp/LTL11012082860741022510.gal : 2 ms
[2024-05-21 21:59:04] [INFO ] Time to serialize properties into /tmp/LTL14819604903927065248.prop : 2 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/LTL11012082860741022510.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2219976803599692669.hoa' '-atoms' '/tmp/LTL14819604903927065248.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/LTL14819604903927065248.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2219976803599692669.hoa
Detected timeout of ITS tools.
[2024-05-21 21:59:19] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:59:19] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:59:19] [INFO ] Time to serialize gal into /tmp/LTL7602106134749433249.gal : 1 ms
[2024-05-21 21:59:19] [INFO ] Time to serialize properties into /tmp/LTL13005157457878061621.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/LTL7602106134749433249.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13005157457878061621.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...276
Read 1 LTL properties
Checking formula 0 : !((G((F("((s1>=1)&&(l1667>=1))"))||(X(("((s1>=1)&&(l4272>=1))")||(G(F("((s1<1)||(l3092<1))"))))))))
Formula 0 simplified : F(G!"((s1>=1)&&(l1667>=1))" & X(!"((s1>=1)&&(l4272>=1))" & FG!"((s1<1)||(l3092<1))"))
Detected timeout of ITS tools.
[2024-05-21 21:59:34] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:59:34] [INFO ] Applying decomposition
[2024-05-21 21:59:34] [INFO ] Flatten gal took : 8 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/graph5544601546296384462.txt' '-o' '/tmp/graph5544601546296384462.bin' '-w' '/tmp/graph5544601546296384462.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5544601546296384462.bin' '-l' '-1' '-v' '-w' '/tmp/graph5544601546296384462.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:59:34] [INFO ] Decomposing Gal with order
[2024-05-21 21:59:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:59:34] [INFO ] Removed a total of 176 redundant transitions.
[2024-05-21 21:59:34] [INFO ] Flatten gal took : 22 ms
[2024-05-21 21:59:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 157 labels/synchronizations in 6 ms.
[2024-05-21 21:59:34] [INFO ] Time to serialize gal into /tmp/LTL6668342082379147141.gal : 2 ms
[2024-05-21 21:59:34] [INFO ] Time to serialize properties into /tmp/LTL17148027975984041586.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/LTL6668342082379147141.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17148027975984041586.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("((i1.u0.s1>=1)&&(i1.u0.l1667>=1))"))||(X(("((i1.u0.s1>=1)&&(i6.u13.l4272>=1))")||(G(F("((i1.u0.s1<1)||(i1.u0.l3092<1))"))))))...157
Formula 0 simplified : F(G!"((i1.u0.s1>=1)&&(i1.u0.l1667>=1))" & X(!"((i1.u0.s1>=1)&&(i6.u13.l4272>=1))" & FG!"((i1.u0.s1<1)||(i1.u0.l3092<1))"))
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t113, t173, t235, t236, t347, t365, t383, t384, t385, t392, t393, t394, t395, t396, t...863
Computing Next relation with stutter on 1.67049e+07 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18146777170154380672
[2024-05-21 21:59:49] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18146777170154380672
Running compilation step : cd /tmp/ltsmin18146777170154380672;'/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 309 ms.
Running link step : cd /tmp/ltsmin18146777170154380672;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin18146777170154380672;'/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))||X(((LTLAPp1==true)||[](<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-12 finished in 96100 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((p0||G(p1)||X(F(p2))))))'
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 201 transition count 343
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 201 transition count 343
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 76 place count 201 transition count 333
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 101 place count 176 transition count 299
Iterating global reduction 1 with 25 rules applied. Total rules applied 126 place count 176 transition count 299
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 134 place count 176 transition count 291
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 156 place count 154 transition count 255
Iterating global reduction 2 with 22 rules applied. Total rules applied 178 place count 154 transition count 255
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 190 place count 154 transition count 243
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 202 place count 142 transition count 215
Iterating global reduction 3 with 12 rules applied. Total rules applied 214 place count 142 transition count 215
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 218 place count 142 transition count 211
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 224 place count 136 transition count 205
Iterating global reduction 4 with 6 rules applied. Total rules applied 230 place count 136 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 233 place count 136 transition count 202
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 236 place count 133 transition count 198
Iterating global reduction 5 with 3 rules applied. Total rules applied 239 place count 133 transition count 198
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 240 place count 132 transition count 196
Iterating global reduction 5 with 1 rules applied. Total rules applied 241 place count 132 transition count 196
Applied a total of 241 rules in 15 ms. Remains 132 /234 variables (removed 102) and now considering 196/473 (removed 277) transitions.
// Phase 1: matrix 196 rows 132 cols
[2024-05-21 22:00:04] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:00:04] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 22:00:04] [INFO ] Invariant cache hit.
[2024-05-21 22:00:05] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-21 22:00:05] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-05-21 22:00:05] [INFO ] Invariant cache hit.
[2024-05-21 22:00:05] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 132/234 places, 196/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 132/234 places, 196/473 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s71 1)), p1:(OR (LT s1 1) (LT s116 1)), p2:(AND (GEQ s1 1) (GEQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22968 reset in 168 ms.
Product exploration explored 100000 steps with 23012 reset in 211 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 482 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Finished random walk after 4595 steps, including 1045 resets, run visited all 2 properties in 55 ms. (steps per millisecond=83 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0) (NOT p2)))), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-05-21 22:00:06] [INFO ] Invariant cache hit.
[2024-05-21 22:00:06] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 22:00:06] [INFO ] Invariant cache hit.
[2024-05-21 22:00:06] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-21 22:00:06] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2024-05-21 22:00:06] [INFO ] Invariant cache hit.
[2024-05-21 22:00:06] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 405 ms. Remains : 132/132 places, 196/196 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 482 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 1034 steps, including 250 resets, run visited all 2 properties in 19 ms. (steps per millisecond=54 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 23007 reset in 152 ms.
Product exploration explored 100000 steps with 22930 reset in 155 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 196/196 transitions.
Applied a total of 0 rules in 11 ms. Remains 132 /132 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-05-21 22:00:08] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 22:00:08] [INFO ] Invariant cache hit.
[2024-05-21 22:00:08] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 132/132 places, 196/196 transitions.
Built C files in :
/tmp/ltsmin6701978464558457365
[2024-05-21 22:00:08] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6701978464558457365
Running compilation step : cd /tmp/ltsmin6701978464558457365;'/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 312 ms.
Running link step : cd /tmp/ltsmin6701978464558457365;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6701978464558457365;'/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/stateBased5185482619038913902.hoa' '--buchi-type=spotba'
LTSmin run took 84 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-13 finished in 3771 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)||F(p1)))'
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 201 transition count 350
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 201 transition count 350
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 77 place count 201 transition count 339
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 101 place count 177 transition count 306
Iterating global reduction 1 with 24 rules applied. Total rules applied 125 place count 177 transition count 306
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 132 place count 177 transition count 299
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 153 place count 156 transition count 266
Iterating global reduction 2 with 21 rules applied. Total rules applied 174 place count 156 transition count 266
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 188 place count 156 transition count 252
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 201 place count 143 transition count 210
Iterating global reduction 3 with 13 rules applied. Total rules applied 214 place count 143 transition count 210
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 222 place count 143 transition count 202
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 228 place count 137 transition count 196
Iterating global reduction 4 with 6 rules applied. Total rules applied 234 place count 137 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 235 place count 137 transition count 195
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 239 place count 133 transition count 190
Iterating global reduction 5 with 4 rules applied. Total rules applied 243 place count 133 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 244 place count 133 transition count 189
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 245 place count 132 transition count 187
Iterating global reduction 6 with 1 rules applied. Total rules applied 246 place count 132 transition count 187
Applied a total of 246 rules in 25 ms. Remains 132 /234 variables (removed 102) and now considering 187/473 (removed 286) transitions.
// Phase 1: matrix 187 rows 132 cols
[2024-05-21 22:00:08] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:00:09] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 22:00:09] [INFO ] Invariant cache hit.
[2024-05-21 22:00:09] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-21 22:00:09] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-05-21 22:00:09] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 22:00:09] [INFO ] Invariant cache hit.
[2024-05-21 22:00:09] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/234 places, 187/473 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 421 ms. Remains : 132/234 places, 187/473 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s126 1)), p0:(AND (GEQ s8 1) (GEQ s55 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][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-15 finished in 814 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)))'
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)||X((p1||G(F(p2)))))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d2m07-LTLFireability-12
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 202 transition count 363
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 202 transition count 363
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 76 place count 202 transition count 351
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 101 place count 177 transition count 317
Iterating global reduction 1 with 25 rules applied. Total rules applied 126 place count 177 transition count 317
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 136 place count 177 transition count 307
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 158 place count 155 transition count 271
Iterating global reduction 2 with 22 rules applied. Total rules applied 180 place count 155 transition count 271
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 195 place count 155 transition count 256
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 207 place count 143 transition count 223
Iterating global reduction 3 with 12 rules applied. Total rules applied 219 place count 143 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 223 place count 143 transition count 219
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 229 place count 137 transition count 213
Iterating global reduction 4 with 6 rules applied. Total rules applied 235 place count 137 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 238 place count 137 transition count 210
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 241 place count 134 transition count 206
Iterating global reduction 5 with 3 rules applied. Total rules applied 244 place count 134 transition count 206
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 245 place count 133 transition count 204
Iterating global reduction 5 with 1 rules applied. Total rules applied 246 place count 133 transition count 204
Applied a total of 246 rules in 29 ms. Remains 133 /234 variables (removed 101) and now considering 204/473 (removed 269) transitions.
// Phase 1: matrix 204 rows 133 cols
[2024-05-21 22:00:09] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 22:00:09] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 22:00:09] [INFO ] Invariant cache hit.
[2024-05-21 22:00:09] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 22:00:10] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2024-05-21 22:00:10] [INFO ] Invariant cache hit.
[2024-05-21 22:00:10] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 133/234 places, 204/473 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 445 ms. Remains : 133/234 places, 204/473 transitions.
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s71 1)), p1:(AND (GEQ s1 1) (GEQ s131 1)), p2:(OR (LT s1 1) (LT s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 29797 reset in 163 ms.
Product exploration explored 100000 steps with 29806 reset in 173 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 87 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2329 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 457 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 460 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 430 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 453 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Finished probabilistic random walk after 73712 steps, run visited all 6 properties in 269 ms. (steps per millisecond=274 )
Probabilistic random walk after 73712 steps, saw 32576 distinct states, run finished after 269 ms. (steps per millisecond=274 ) properties seen :6
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p2))), (F p0), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 263 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 1 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-21 22:00:12] [INFO ] Invariant cache hit.
[2024-05-21 22:00:12] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 22:00:12] [INFO ] Invariant cache hit.
[2024-05-21 22:00:12] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 22:00:12] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-05-21 22:00:12] [INFO ] Invariant cache hit.
[2024-05-21 22:00:12] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 404 ms. Remains : 133/133 places, 204/204 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 104 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2289 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 438 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 438 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 434 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 454 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 448 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Finished probabilistic random walk after 73712 steps, run visited all 6 properties in 261 ms. (steps per millisecond=282 )
Probabilistic random walk after 73712 steps, saw 32576 distinct states, run finished after 262 ms. (steps per millisecond=281 ) properties seen :6
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p2))), (F p0), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 709 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 29763 reset in 170 ms.
Product exploration explored 100000 steps with 29797 reset in 169 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 363 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 8 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-21 22:00:15] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 22:00:15] [INFO ] Invariant cache hit.
[2024-05-21 22:00:15] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 133/133 places, 204/204 transitions.
Built C files in :
/tmp/ltsmin1063754550409171953
[2024-05-21 22:00:15] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1063754550409171953
Running compilation step : cd /tmp/ltsmin1063754550409171953;'/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 295 ms.
Running link step : cd /tmp/ltsmin1063754550409171953;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1063754550409171953;'/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/stateBased14662035767687922526.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-21 22:00:30] [INFO ] Invariant cache hit.
[2024-05-21 22:00:30] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 22:00:30] [INFO ] Invariant cache hit.
[2024-05-21 22:00:30] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-21 22:00:31] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2024-05-21 22:00:31] [INFO ] Invariant cache hit.
[2024-05-21 22:00:31] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 420 ms. Remains : 133/133 places, 204/204 transitions.
Built C files in :
/tmp/ltsmin14085890883696304434
[2024-05-21 22:00:31] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14085890883696304434
Running compilation step : cd /tmp/ltsmin14085890883696304434;'/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 316 ms.
Running link step : cd /tmp/ltsmin14085890883696304434;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14085890883696304434;'/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/stateBased13026331886603168866.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 22:00:46] [INFO ] Flatten gal took : 7 ms
[2024-05-21 22:00:46] [INFO ] Flatten gal took : 7 ms
[2024-05-21 22:00:46] [INFO ] Time to serialize gal into /tmp/LTL13963461482161775400.gal : 2 ms
[2024-05-21 22:00:46] [INFO ] Time to serialize properties into /tmp/LTL17018651953327456490.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/LTL13963461482161775400.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4416991987256752572.hoa' '-atoms' '/tmp/LTL17018651953327456490.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/LTL17018651953327456490.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4416991987256752572.hoa
Detected timeout of ITS tools.
[2024-05-21 22:01:01] [INFO ] Flatten gal took : 7 ms
[2024-05-21 22:01:01] [INFO ] Flatten gal took : 7 ms
[2024-05-21 22:01:01] [INFO ] Time to serialize gal into /tmp/LTL11588176398998236645.gal : 2 ms
[2024-05-21 22:01:01] [INFO ] Time to serialize properties into /tmp/LTL6137715086305761447.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/LTL11588176398998236645.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6137715086305761447.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...276
Read 1 LTL properties
Checking formula 0 : !((G((F("((s1>=1)&&(l1667>=1))"))||(X(("((s1>=1)&&(l4272>=1))")||(G(F("((s1<1)||(l3092<1))"))))))))
Formula 0 simplified : F(G!"((s1>=1)&&(l1667>=1))" & X(!"((s1>=1)&&(l4272>=1))" & FG!"((s1<1)||(l3092<1))"))
Detected timeout of ITS tools.
[2024-05-21 22:01:16] [INFO ] Flatten gal took : 13 ms
[2024-05-21 22:01:16] [INFO ] Applying decomposition
[2024-05-21 22:01:16] [INFO ] Flatten gal took : 8 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/graph9203947672017684713.txt' '-o' '/tmp/graph9203947672017684713.bin' '-w' '/tmp/graph9203947672017684713.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9203947672017684713.bin' '-l' '-1' '-v' '-w' '/tmp/graph9203947672017684713.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:01:16] [INFO ] Decomposing Gal with order
[2024-05-21 22:01:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:01:16] [INFO ] Removed a total of 248 redundant transitions.
[2024-05-21 22:01:16] [INFO ] Flatten gal took : 18 ms
[2024-05-21 22:01:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 132 labels/synchronizations in 7 ms.
[2024-05-21 22:01:16] [INFO ] Time to serialize gal into /tmp/LTL1592819062064526391.gal : 3 ms
[2024-05-21 22:01:16] [INFO ] Time to serialize properties into /tmp/LTL17177760587751607618.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/LTL1592819062064526391.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17177760587751607618.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)&&(i7.u7.l1667>=1))"))||(X(("((i0.u0.s1>=1)&&(i3.u25.l4272>=1))")||(G(F("((i0.u0.s1<1)||(i7.u8.l3092<1))"))))))...157
Formula 0 simplified : F(G!"((i0.u0.s1>=1)&&(i7.u7.l1667>=1))" & X(!"((i0.u0.s1>=1)&&(i3.u25.l4272>=1))" & FG!"((i0.u0.s1<1)||(i7.u8.l3092<1))"))
Reverse transition relation is NOT exact ! Due to transitions t5, t13, t32, t114, t118, t119, t120, t121, t122, t123, t128, t130, t131, t132, t145, t175, t...707
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11357666037702128176
[2024-05-21 22:01:31] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11357666037702128176
Running compilation step : cd /tmp/ltsmin11357666037702128176;'/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 301 ms.
Running link step : cd /tmp/ltsmin11357666037702128176;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11357666037702128176;'/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))||X(((LTLAPp1==true)||[](<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-12 finished in 97110 ms.
[2024-05-21 22:01:46] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13261430335047878522
[2024-05-21 22:01:46] [INFO ] Applying decomposition
[2024-05-21 22:01:46] [INFO ] Computing symmetric may disable matrix : 473 transitions.
[2024-05-21 22:01:46] [INFO ] Flatten gal took : 13 ms
[2024-05-21 22:01:46] [INFO ] Computation of Complete disable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:01:46] [INFO ] Computing symmetric may enable matrix : 473 transitions.
[2024-05-21 22:01:46] [INFO ] Computation of Complete enable matrix. took 3 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/graph17590611053511305014.txt' '-o' '/tmp/graph17590611053511305014.bin' '-w' '/tmp/graph17590611053511305014.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17590611053511305014.bin' '-l' '-1' '-v' '-w' '/tmp/graph17590611053511305014.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:01:46] [INFO ] Decomposing Gal with order
[2024-05-21 22:01:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:01:46] [INFO ] Computing Do-Not-Accords matrix : 473 transitions.
[2024-05-21 22:01:46] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:01:46] [INFO ] Removed a total of 451 redundant transitions.
[2024-05-21 22:01:46] [INFO ] Flatten gal took : 42 ms
[2024-05-21 22:01:46] [INFO ] Built C files in 127ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13261430335047878522
Running compilation step : cd /tmp/ltsmin13261430335047878522;'/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 22:01:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 642 labels/synchronizations in 15 ms.
[2024-05-21 22:01:46] [INFO ] Time to serialize gal into /tmp/LTLFireability17415873688820944833.gal : 4 ms
[2024-05-21 22:01:46] [INFO ] Time to serialize properties into /tmp/LTLFireability17917453800163901429.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/LTLFireability17415873688820944833.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17917453800163901429.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...278
Read 2 LTL properties
Checking formula 0 : !((G(F("((i5.u0.s1<1)||(i5.u0.l4144<1))"))))
Formula 0 simplified : FG!"((i5.u0.s1<1)||(i5.u0.l4144<1))"
Compilation finished in 1178 ms.
Running link step : cd /tmp/ltsmin13261430335047878522;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin13261430335047878522;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 22:23:32] [INFO ] Flatten gal took : 24 ms
[2024-05-21 22:23:32] [INFO ] Time to serialize gal into /tmp/LTLFireability2814589284924012859.gal : 11 ms
[2024-05-21 22:23:32] [INFO ] Time to serialize properties into /tmp/LTLFireability14005569519775617153.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/LTLFireability2814589284924012859.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14005569519775617153.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 : !((G(F("((s1<1)||(l4144<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l4144<1))"
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin13261430335047878522;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13261430335047878522;'/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' '[]((<>((LTLAPp1==true))||X(((LTLAPp2==true)||[](<>((LTLAPp3==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 22:45:19] [INFO ] Flatten gal took : 40 ms
[2024-05-21 22:45:19] [INFO ] Input system was already deterministic with 473 transitions.
[2024-05-21 22:45:19] [INFO ] Transformed 234 places.
[2024-05-21 22:45:19] [INFO ] Transformed 473 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:45:19] [INFO ] Time to serialize gal into /tmp/LTLFireability17322353687699851051.gal : 3 ms
[2024-05-21 22:45:19] [INFO ] Time to serialize properties into /tmp/LTLFireability14054775182779520254.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/LTLFireability17322353687699851051.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14054775182779520254.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...344
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((s1<1)||(l4144<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l4144<1))"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.046: LTL layer: formula: []((<>((LTLAPp1==true))||X(((LTLAPp2==true)||[](<>((LTLAPp3==true)))))))
pins2lts-mc-linux64( 7/ 8), 0.046: "[]((<>((LTLAPp1==true))||X(((LTLAPp2==true)||[](<>((LTLAPp3==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.046: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.065: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.069: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.079: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.147: DFS-FIFO for weak LTL, using special progress label 478
pins2lts-mc-linux64( 0/ 8), 0.147: There are 479 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.147: State length is 235, there are 480 groups
pins2lts-mc-linux64( 0/ 8), 0.147: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.147: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.147: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.147: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.169: ~1 levels ~960 states ~2200 transitions
pins2lts-mc-linux64( 1/ 8), 0.196: ~1 levels ~1920 states ~6784 transitions
pins2lts-mc-linux64( 1/ 8), 0.222: ~1 levels ~3840 states ~11080 transitions
pins2lts-mc-linux64( 1/ 8), 0.267: ~1 levels ~7680 states ~15760 transitions
pins2lts-mc-linux64( 1/ 8), 0.389: ~1 levels ~15360 states ~34456 transitions
pins2lts-mc-linux64( 1/ 8), 0.698: ~1 levels ~30720 states ~83656 transitions
pins2lts-mc-linux64( 1/ 8), 1.213: ~1 levels ~61440 states ~175648 transitions
pins2lts-mc-linux64( 2/ 8), 2.106: ~1 levels ~122880 states ~368312 transitions
pins2lts-mc-linux64( 2/ 8), 3.562: ~1 levels ~245760 states ~693080 transitions
pins2lts-mc-linux64( 7/ 8), 6.004: ~1 levels ~491520 states ~1327784 transitions
pins2lts-mc-linux64( 0/ 8), 10.496: ~1 levels ~983040 states ~2575032 transitions
pins2lts-mc-linux64( 7/ 8), 18.898: ~1 levels ~1966080 states ~5027376 transitions
pins2lts-mc-linux64( 2/ 8), 35.390: ~1 levels ~3932160 states ~9109928 transitions
pins2lts-mc-linux64( 3/ 8), 70.214: ~1 levels ~7864320 states ~19624200 transitions
pins2lts-mc-linux64( 4/ 8), 139.199: ~1 levels ~15728640 states ~42422616 transitions
pins2lts-mc-linux64( 3/ 8), 268.264: ~1 levels ~31457280 states ~77049000 transitions
pins2lts-mc-linux64( 1/ 8), 560.736: ~1 levels ~62914560 states ~179948200 transitions
pins2lts-mc-linux64( 3/ 8), 1104.027: ~6 levels ~125829120 states ~353734304 transitions
pins2lts-mc-linux64( 5/ 8), 1109.794: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1109.850:
pins2lts-mc-linux64( 0/ 8), 1109.851: mean standard work distribution: 1.4% (states) 2.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 1109.851:
pins2lts-mc-linux64( 0/ 8), 1109.851: Explored 122198405 states 373795655 transitions, fanout: 3.059
pins2lts-mc-linux64( 0/ 8), 1109.851: Total exploration time 1109.690 sec (1109.630 sec minimum, 1109.664 sec on average)
pins2lts-mc-linux64( 0/ 8), 1109.851: States per second: 110119, Transitions per second: 336847
pins2lts-mc-linux64( 0/ 8), 1109.851:
pins2lts-mc-linux64( 0/ 8), 1109.851: Progress states detected: 133225961
pins2lts-mc-linux64( 0/ 8), 1109.851: Redundant explorations: -8.9544
pins2lts-mc-linux64( 0/ 8), 1109.851:
pins2lts-mc-linux64( 0/ 8), 1109.851: Queue width: 8B, total height: 33858851, memory: 258.32MB
pins2lts-mc-linux64( 0/ 8), 1109.851: Tree memory: 1093.9MB, 8.5 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 1109.851: Tree fill ratio (roots/leafs): 99.0%/27.0%
pins2lts-mc-linux64( 0/ 8), 1109.851: Stored 475 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1109.851: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1109.851: Est. total memory use: 1352.2MB (~1282.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13261430335047878522;'/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' '[]((<>((LTLAPp1==true))||X(((LTLAPp2==true)||[](<>((LTLAPp3==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13261430335047878522;'/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' '[]((<>((LTLAPp1==true))||X(((LTLAPp2==true)||[](<>((LTLAPp3==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)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11537116 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15549836 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-d2m07"
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-d2m07, 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-171624208400358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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