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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 12:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 12 12:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 12:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 12:42 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-d2m06-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716328309967

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-d2m06
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 21:51:51] [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:51:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:51:51] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2024-05-21 21:51:51] [INFO ] Transformed 4763 places.
[2024-05-21 21:51:51] [INFO ] Transformed 2478 transitions.
[2024-05-21 21:51:51] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 256 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 3580 places in 15 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 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 369 places :
Symmetric choice reduction at 1 with 369 rule applications. Total rules 614 place count 768 transition count 1495
Iterating global reduction 1 with 369 rules applied. Total rules applied 983 place count 768 transition count 1495
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 1046 place count 768 transition count 1432
Discarding 294 places :
Symmetric choice reduction at 2 with 294 rule applications. Total rules 1340 place count 474 transition count 1138
Iterating global reduction 2 with 294 rules applied. Total rules applied 1634 place count 474 transition count 1138
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1640 place count 474 transition count 1132
Discarding 217 places :
Symmetric choice reduction at 3 with 217 rule applications. Total rules 1857 place count 257 transition count 827
Iterating global reduction 3 with 217 rules applied. Total rules applied 2074 place count 257 transition count 827
Ensure Unique test removed 276 transitions
Reduce isomorphic transitions removed 276 transitions.
Iterating post reduction 3 with 276 rules applied. Total rules applied 2350 place count 257 transition count 551
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 2366 place count 241 transition count 528
Iterating global reduction 4 with 16 rules applied. Total rules applied 2382 place count 241 transition count 528
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 2396 place count 241 transition count 514
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 2406 place count 231 transition count 504
Iterating global reduction 5 with 10 rules applied. Total rules applied 2416 place count 231 transition count 504
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2418 place count 231 transition count 502
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 2426 place count 223 transition count 494
Iterating global reduction 6 with 8 rules applied. Total rules applied 2434 place count 223 transition count 494
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 2446 place count 223 transition count 482
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2448 place count 221 transition count 478
Iterating global reduction 7 with 2 rules applied. Total rules applied 2450 place count 221 transition count 478
Applied a total of 2450 rules in 193 ms. Remains 221 /1183 variables (removed 962) and now considering 478/2478 (removed 2000) transitions.
// Phase 1: matrix 478 rows 221 cols
[2024-05-21 21:51:52] [INFO ] Computed 2 invariants in 25 ms
[2024-05-21 21:51:52] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-21 21:51:52] [INFO ] Invariant cache hit.
[2024-05-21 21:51:52] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-21 21:51:53] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1087 ms to find 0 implicit places.
[2024-05-21 21:51:53] [INFO ] Invariant cache hit.
[2024-05-21 21:51:53] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 221/1183 places, 478/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1439 ms. Remains : 221/1183 places, 478/2478 transitions.
Support contains 35 out of 221 places after structural reductions.
[2024-05-21 21:51:53] [INFO ] Flatten gal took : 57 ms
[2024-05-21 21:51:53] [INFO ] Flatten gal took : 29 ms
[2024-05-21 21:51:53] [INFO ] Input system was already deterministic with 478 transitions.
Support contains 33 out of 221 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2302 resets, run finished after 569 ms. (steps per millisecond=17 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 98 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 118 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 40 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 32 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) 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 32) seen :0
Interrupted probabilistic random walk after 559941 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=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, 31=1}
Probabilistic random walk after 559941 steps, saw 225935 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :30
Running SMT prover for 2 properties.
[2024-05-21 21:51:57] [INFO ] Invariant cache hit.
[2024-05-21 21:51:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 21:51:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-21 21:51:57] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 36 stable transitions
Graph (complete) has 917 edges and 221 vertex of which 220 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 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))'
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 193 transition count 342
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 193 transition count 342
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 193 transition count 337
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 83 place count 171 transition count 310
Iterating global reduction 1 with 22 rules applied. Total rules applied 105 place count 171 transition count 310
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 115 place count 171 transition count 300
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 136 place count 150 transition count 252
Iterating global reduction 2 with 21 rules applied. Total rules applied 157 place count 150 transition count 252
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 166 place count 150 transition count 243
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 178 place count 138 transition count 205
Iterating global reduction 3 with 12 rules applied. Total rules applied 190 place count 138 transition count 205
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 195 place count 138 transition count 200
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 201 place count 132 transition count 194
Iterating global reduction 4 with 6 rules applied. Total rules applied 207 place count 132 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 208 place count 132 transition count 193
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 212 place count 128 transition count 189
Iterating global reduction 5 with 4 rules applied. Total rules applied 216 place count 128 transition count 189
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 219 place count 128 transition count 186
Applied a total of 219 rules in 49 ms. Remains 128 /221 variables (removed 93) and now considering 186/478 (removed 292) transitions.
// Phase 1: matrix 186 rows 128 cols
[2024-05-21 21:51:58] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:51:58] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 21:51:58] [INFO ] Invariant cache hit.
[2024-05-21 21:51:58] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 21:51:58] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2024-05-21 21:51:58] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-21 21:51:58] [INFO ] Invariant cache hit.
[2024-05-21 21:51:58] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/221 places, 186/478 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 428 ms. Remains : 128/221 places, 186/478 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 126 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s119 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-00 finished in 603 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((G(p0)||X((p1 U p2))))||X(G(p1))))'
Support contains 4 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 195 transition count 349
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 195 transition count 349
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 195 transition count 344
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 79 place count 173 transition count 317
Iterating global reduction 1 with 22 rules applied. Total rules applied 101 place count 173 transition count 317
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 113 place count 173 transition count 305
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 133 place count 153 transition count 263
Iterating global reduction 2 with 20 rules applied. Total rules applied 153 place count 153 transition count 263
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 162 place count 153 transition count 254
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 174 place count 141 transition count 222
Iterating global reduction 3 with 12 rules applied. Total rules applied 186 place count 141 transition count 222
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 192 place count 141 transition count 216
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 198 place count 135 transition count 210
Iterating global reduction 4 with 6 rules applied. Total rules applied 204 place count 135 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 205 place count 135 transition count 209
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 209 place count 131 transition count 205
Iterating global reduction 5 with 4 rules applied. Total rules applied 213 place count 131 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 216 place count 131 transition count 202
Applied a total of 216 rules in 21 ms. Remains 131 /221 variables (removed 90) and now considering 202/478 (removed 276) transitions.
// Phase 1: matrix 202 rows 131 cols
[2024-05-21 21:51:59] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:51:59] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 21:51:59] [INFO ] Invariant cache hit.
[2024-05-21 21:51:59] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-21 21:51:59] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2024-05-21 21:51:59] [INFO ] Invariant cache hit.
[2024-05-21 21:51:59] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 131/221 places, 202/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 512 ms. Remains : 131/221 places, 202/478 transitions.
Stuttering acceptance computed with spot in 349 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=p0, acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=7 dest: 6}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s77 1)), p1:(AND (GEQ s1 1) (GEQ s70 1)), p2:(AND (GEQ s1 1) (GEQ s97 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 29720 reset in 358 ms.
Product exploration explored 100000 steps with 29819 reset in 245 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 484 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p1) (NOT p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 225 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2271 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 456 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16679 steps, run visited all 1 properties in 47 ms. (steps per millisecond=354 )
Probabilistic random walk after 16679 steps, saw 8208 distinct states, run finished after 47 ms. (steps per millisecond=354 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p1) (NOT p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2)))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 21 factoid took 267 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-01 finished in 2247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(p1 U X(p2))))'
Support contains 4 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 195 transition count 356
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 195 transition count 356
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 195 transition count 351
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 77 place count 175 transition count 326
Iterating global reduction 1 with 20 rules applied. Total rules applied 97 place count 175 transition count 326
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 109 place count 175 transition count 314
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 129 place count 155 transition count 266
Iterating global reduction 2 with 20 rules applied. Total rules applied 149 place count 155 transition count 266
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 158 place count 155 transition count 257
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 168 place count 145 transition count 229
Iterating global reduction 3 with 10 rules applied. Total rules applied 178 place count 145 transition count 229
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 188 place count 145 transition count 219
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 191 place count 142 transition count 216
Iterating global reduction 4 with 3 rules applied. Total rules applied 194 place count 142 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 195 place count 142 transition count 215
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 196 place count 141 transition count 214
Iterating global reduction 5 with 1 rules applied. Total rules applied 197 place count 141 transition count 214
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 199 place count 141 transition count 212
Applied a total of 199 rules in 21 ms. Remains 141 /221 variables (removed 80) and now considering 212/478 (removed 266) transitions.
// Phase 1: matrix 212 rows 141 cols
[2024-05-21 21:52:01] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:52:01] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 21:52:01] [INFO ] Invariant cache hit.
[2024-05-21 21:52:01] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-21 21:52:01] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2024-05-21 21:52:01] [INFO ] Invariant cache hit.
[2024-05-21 21:52:01] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/221 places, 212/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 466 ms. Remains : 141/221 places, 212/478 transitions.
Stuttering acceptance computed with spot in 226 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s132 1)), p0:(AND (GEQ s1 1) (GEQ s128 1)), p2:(AND (NOT (AND (GEQ s1 1) (GEQ s132 1))) (NOT (AND (GEQ s1 1) (GEQ s134 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 298 ms.
Product exploration explored 100000 steps with 50000 reset in 296 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 518 edges and 141 vertex of which 140 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 (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 20 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-03 finished in 1328 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||X(G(p1)))))'
Support contains 4 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 195 transition count 356
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 195 transition count 356
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 195 transition count 351
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 77 place count 175 transition count 326
Iterating global reduction 1 with 20 rules applied. Total rules applied 97 place count 175 transition count 326
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 108 place count 175 transition count 315
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 127 place count 156 transition count 270
Iterating global reduction 2 with 19 rules applied. Total rules applied 146 place count 156 transition count 270
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 153 place count 156 transition count 263
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 164 place count 145 transition count 226
Iterating global reduction 3 with 11 rules applied. Total rules applied 175 place count 145 transition count 226
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 186 place count 145 transition count 215
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 191 place count 140 transition count 210
Iterating global reduction 4 with 5 rules applied. Total rules applied 196 place count 140 transition count 210
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 200 place count 136 transition count 206
Iterating global reduction 4 with 4 rules applied. Total rules applied 204 place count 136 transition count 206
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 207 place count 136 transition count 203
Applied a total of 207 rules in 22 ms. Remains 136 /221 variables (removed 85) and now considering 203/478 (removed 275) transitions.
// Phase 1: matrix 203 rows 136 cols
[2024-05-21 21:52:02] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:52:02] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 21:52:02] [INFO ] Invariant cache hit.
[2024-05-21 21:52:02] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-21 21:52:02] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-05-21 21:52:02] [INFO ] Invariant cache hit.
[2024-05-21 21:52:02] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/221 places, 203/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 431 ms. Remains : 136/221 places, 203/478 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s1 1) (LT s129 1)) (OR (LT s1 1) (LT s125 1))), p1:(AND (GEQ s1 1) (GEQ s128 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22988 reset in 167 ms.
Product exploration explored 100000 steps with 22998 reset in 186 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 500 edges and 136 vertex of which 135 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 p0 (NOT p1)), (X (NOT p1)), (X p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 75 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2329 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 428 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 441 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Finished probabilistic random walk after 21996 steps, run visited all 2 properties in 84 ms. (steps per millisecond=261 )
Probabilistic random walk after 21996 steps, saw 10767 distinct states, run finished after 84 ms. (steps per millisecond=261 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 6 factoid took 119 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 136 /136 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2024-05-21 21:52:04] [INFO ] Invariant cache hit.
[2024-05-21 21:52:04] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 21:52:04] [INFO ] Invariant cache hit.
[2024-05-21 21:52:04] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-21 21:52:04] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-05-21 21:52:04] [INFO ] Invariant cache hit.
[2024-05-21 21:52:04] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 419 ms. Remains : 136/136 places, 203/203 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 500 edges and 136 vertex of which 135 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 p0 (NOT p1)), (X (NOT p1)), (X p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 83 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2284 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 446 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 446 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Finished probabilistic random walk after 21996 steps, run visited all 2 properties in 76 ms. (steps per millisecond=289 )
Probabilistic random walk after 21996 steps, saw 10767 distinct states, run finished after 76 ms. (steps per millisecond=289 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 6 factoid took 119 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 92 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 23056 reset in 171 ms.
Product exploration explored 100000 steps with 22985 reset in 170 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 78 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 203/203 transitions.
Applied a total of 0 rules in 13 ms. Remains 136 /136 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2024-05-21 21:52:05] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-21 21:52:05] [INFO ] Invariant cache hit.
[2024-05-21 21:52:05] [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 118 ms. Remains : 136/136 places, 203/203 transitions.
Built C files in :
/tmp/ltsmin5593845491749142954
[2024-05-21 21:52:05] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5593845491749142954
Running compilation step : cd /tmp/ltsmin5593845491749142954;'/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 383 ms.
Running link step : cd /tmp/ltsmin5593845491749142954;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5593845491749142954;'/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/stateBased4597308673709473924.hoa' '--buchi-type=spotba'
LTSmin run took 639 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-06 finished in 4606 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)||(p1 U (G(p1)||(p1&&G(!p2))))))'
Support contains 5 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 196 transition count 367
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 196 transition count 367
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 56 place count 196 transition count 361
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 76 place count 176 transition count 336
Iterating global reduction 1 with 20 rules applied. Total rules applied 96 place count 176 transition count 336
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 106 place count 176 transition count 326
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 125 place count 157 transition count 281
Iterating global reduction 2 with 19 rules applied. Total rules applied 144 place count 157 transition count 281
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 154 place count 157 transition count 271
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 165 place count 146 transition count 235
Iterating global reduction 3 with 11 rules applied. Total rules applied 176 place count 146 transition count 235
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 184 place count 146 transition count 227
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 188 place count 142 transition count 223
Iterating global reduction 4 with 4 rules applied. Total rules applied 192 place count 142 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 193 place count 142 transition count 222
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 195 place count 140 transition count 220
Iterating global reduction 5 with 2 rules applied. Total rules applied 197 place count 140 transition count 220
Applied a total of 197 rules in 48 ms. Remains 140 /221 variables (removed 81) and now considering 220/478 (removed 258) transitions.
// Phase 1: matrix 220 rows 140 cols
[2024-05-21 21:52:07] [INFO ] Computed 2 invariants in 5 ms
[2024-05-21 21:52:07] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 21:52:07] [INFO ] Invariant cache hit.
[2024-05-21 21:52:07] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-21 21:52:07] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2024-05-21 21:52:07] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-21 21:52:07] [INFO ] Invariant cache hit.
[2024-05-21 21:52:07] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/221 places, 220/478 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 497 ms. Remains : 140/221 places, 220/478 transitions.
Stuttering acceptance computed with spot in 273 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p0)), p2, (AND (NOT p0) p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=5 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=5 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=p2, acceptance={} source=6 dest: 0}, { cond=(NOT p2), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 0}, { cond=(AND p0 p2), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 7}]], initial=2, aps=[p1:(OR (AND (GEQ s1 1) (GEQ s131 1)) (AND (GEQ s1 1) (GEQ s97 1))), p2:(AND (GEQ s1 1) (GEQ s131 1)), p0:(AND (OR (LT s1 1) (LT s128 1)) (OR (LT s1 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 22872 reset in 281 ms.
Product exploration explored 100000 steps with 23003 reset in 218 ms.
Computed a total of 5 stabilizing places and 19 stable transitions
Graph (complete) has 520 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 19 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 39 factoid took 508 ms. Reduced automaton from 8 states, 30 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2320 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 433 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 7678 steps, run visited all 1 properties in 19 ms. (steps per millisecond=404 )
Probabilistic random walk after 7678 steps, saw 3553 distinct states, run finished after 19 ms. (steps per millisecond=404 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 39 factoid took 633 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-07 finished in 2665 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)&&X(p1))))'
Support contains 5 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 194 transition count 337
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 194 transition count 337
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 59 place count 194 transition count 332
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 80 place count 173 transition count 307
Iterating global reduction 1 with 21 rules applied. Total rules applied 101 place count 173 transition count 307
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 111 place count 173 transition count 297
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 132 place count 152 transition count 255
Iterating global reduction 2 with 21 rules applied. Total rules applied 153 place count 152 transition count 255
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 162 place count 152 transition count 246
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 174 place count 140 transition count 214
Iterating global reduction 3 with 12 rules applied. Total rules applied 186 place count 140 transition count 214
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 192 place count 140 transition count 208
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 198 place count 134 transition count 202
Iterating global reduction 4 with 6 rules applied. Total rules applied 204 place count 134 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 205 place count 134 transition count 201
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 209 place count 130 transition count 197
Iterating global reduction 5 with 4 rules applied. Total rules applied 213 place count 130 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 216 place count 130 transition count 194
Applied a total of 216 rules in 22 ms. Remains 130 /221 variables (removed 91) and now considering 194/478 (removed 284) transitions.
// Phase 1: matrix 194 rows 130 cols
[2024-05-21 21:52:09] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:52:09] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 21:52:09] [INFO ] Invariant cache hit.
[2024-05-21 21:52:09] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 21:52:10] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2024-05-21 21:52:10] [INFO ] Invariant cache hit.
[2024-05-21 21:52:10] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/221 places, 194/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 504 ms. Remains : 130/221 places, 194/478 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s8 1) (LT s54 1) (AND (GEQ s9 1) (GEQ s54 1))), p1:(AND (GEQ s1 1) (GEQ s88 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-08 finished in 702 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((X(G(p0))||(F(G(p1)) U p2))))'
Support contains 5 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 195 transition count 356
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 195 transition count 356
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 58 place count 195 transition count 350
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 80 place count 173 transition count 327
Iterating global reduction 1 with 22 rules applied. Total rules applied 102 place count 173 transition count 327
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 117 place count 173 transition count 312
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 138 place count 152 transition count 263
Iterating global reduction 2 with 21 rules applied. Total rules applied 159 place count 152 transition count 263
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 168 place count 152 transition count 254
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 180 place count 140 transition count 215
Iterating global reduction 3 with 12 rules applied. Total rules applied 192 place count 140 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 196 place count 140 transition count 211
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 202 place count 134 transition count 205
Iterating global reduction 4 with 6 rules applied. Total rules applied 208 place count 134 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 209 place count 134 transition count 204
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 213 place count 130 transition count 200
Iterating global reduction 5 with 4 rules applied. Total rules applied 217 place count 130 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 220 place count 130 transition count 197
Applied a total of 220 rules in 22 ms. Remains 130 /221 variables (removed 91) and now considering 197/478 (removed 281) transitions.
// Phase 1: matrix 197 rows 130 cols
[2024-05-21 21:52:10] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:52:10] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-21 21:52:10] [INFO ] Invariant cache hit.
[2024-05-21 21:52:10] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-21 21:52:10] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2024-05-21 21:52:10] [INFO ] Invariant cache hit.
[2024-05-21 21:52:10] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/221 places, 197/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 482 ms. Remains : 130/221 places, 197/478 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s53 1) (GEQ s77 1)), p0:(AND (GEQ s1 1) (GEQ s94 1)), p1:(AND (GEQ s1 1) (GEQ s97 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-09 finished in 696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((!p0 U p1)))))'
Support contains 3 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 194 transition count 344
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 194 transition count 344
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 194 transition count 340
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 80 place count 172 transition count 313
Iterating global reduction 1 with 22 rules applied. Total rules applied 102 place count 172 transition count 313
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 114 place count 172 transition count 301
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 134 place count 152 transition count 261
Iterating global reduction 2 with 20 rules applied. Total rules applied 154 place count 152 transition count 261
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 162 place count 152 transition count 253
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 174 place count 140 transition count 214
Iterating global reduction 3 with 12 rules applied. Total rules applied 186 place count 140 transition count 214
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 196 place count 140 transition count 204
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 201 place count 135 transition count 199
Iterating global reduction 4 with 5 rules applied. Total rules applied 206 place count 135 transition count 199
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 210 place count 131 transition count 195
Iterating global reduction 4 with 4 rules applied. Total rules applied 214 place count 131 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 217 place count 131 transition count 192
Applied a total of 217 rules in 26 ms. Remains 131 /221 variables (removed 90) and now considering 192/478 (removed 286) transitions.
// Phase 1: matrix 192 rows 131 cols
[2024-05-21 21:52:11] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:52:11] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 21:52:11] [INFO ] Invariant cache hit.
[2024-05-21 21:52:11] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 21:52:11] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-05-21 21:52:11] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-21 21:52:11] [INFO ] Invariant cache hit.
[2024-05-21 21:52:11] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/221 places, 192/478 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 432 ms. Remains : 131/221 places, 192/478 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s70 1)), p1:(AND (GEQ s1 1) (GEQ s125 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22980 reset in 178 ms.
Product exploration explored 100000 steps with 22997 reset in 230 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 478 edges and 131 vertex of which 130 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)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 116 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2305 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 446 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 450 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 434 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Finished probabilistic random walk after 23631 steps, run visited all 4 properties in 99 ms. (steps per millisecond=238 )
Probabilistic random walk after 23631 steps, saw 11486 distinct states, run finished after 101 ms. (steps per millisecond=233 ) properties seen :4
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND p1 p0)), (F (NOT (AND (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 208 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 192/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 131 /131 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-21 21:52:12] [INFO ] Invariant cache hit.
[2024-05-21 21:52:12] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 21:52:12] [INFO ] Invariant cache hit.
[2024-05-21 21:52:13] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 21:52:13] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2024-05-21 21:52:13] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:52:13] [INFO ] Invariant cache hit.
[2024-05-21 21:52:13] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 431 ms. Remains : 131/131 places, 192/192 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 478 edges and 131 vertex of which 130 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 (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X p0), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2293 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 435 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 433 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 440 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Finished probabilistic random walk after 23631 steps, run visited all 4 properties in 130 ms. (steps per millisecond=181 )
Probabilistic random walk after 23631 steps, saw 11486 distinct states, run finished after 130 ms. (steps per millisecond=181 ) properties seen :4
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X p0), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 277 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22935 reset in 204 ms.
Product exploration explored 100000 steps with 22932 reset in 188 ms.
Built C files in :
/tmp/ltsmin2748612295630625374
[2024-05-21 21:52:14] [INFO ] Computing symmetric may disable matrix : 192 transitions.
[2024-05-21 21:52:14] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:52:14] [INFO ] Computing symmetric may enable matrix : 192 transitions.
[2024-05-21 21:52:14] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:52:14] [INFO ] Computing Do-Not-Accords matrix : 192 transitions.
[2024-05-21 21:52:14] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:52:14] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2748612295630625374
Running compilation step : cd /tmp/ltsmin2748612295630625374;'/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 379 ms.
Running link step : cd /tmp/ltsmin2748612295630625374;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2748612295630625374;'/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/stateBased12587152433636524621.hoa' '--buchi-type=spotba'
LTSmin run took 273 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-10 finished in 4395 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) U p1)&&!p2) U (G(p2)&&p3)))'
Support contains 4 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 195 transition count 353
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 195 transition count 353
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 58 place count 195 transition count 347
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 79 place count 174 transition count 321
Iterating global reduction 1 with 21 rules applied. Total rules applied 100 place count 174 transition count 321
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 113 place count 174 transition count 308
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 133 place count 154 transition count 261
Iterating global reduction 2 with 20 rules applied. Total rules applied 153 place count 154 transition count 261
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 160 place count 154 transition count 254
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 171 place count 143 transition count 222
Iterating global reduction 3 with 11 rules applied. Total rules applied 182 place count 143 transition count 222
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 192 place count 143 transition count 212
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 197 place count 138 transition count 207
Iterating global reduction 4 with 5 rules applied. Total rules applied 202 place count 138 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 203 place count 138 transition count 206
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 207 place count 134 transition count 202
Iterating global reduction 5 with 4 rules applied. Total rules applied 211 place count 134 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 213 place count 134 transition count 200
Applied a total of 213 rules in 22 ms. Remains 134 /221 variables (removed 87) and now considering 200/478 (removed 278) transitions.
// Phase 1: matrix 200 rows 134 cols
[2024-05-21 21:52:15] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:52:15] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 21:52:15] [INFO ] Invariant cache hit.
[2024-05-21 21:52:15] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-21 21:52:15] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-05-21 21:52:15] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 21:52:15] [INFO ] Invariant cache hit.
[2024-05-21 21:52:15] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/221 places, 200/478 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 487 ms. Remains : 134/221 places, 200/478 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p2) (NOT p3)), true, (NOT p2), (AND p1 p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p1 (NOT p2)) (AND p2 (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND p2 p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s91 1)), p2:(AND (GEQ s1 1) (GEQ s128 1)), p3:(AND (GEQ s1 1) (GEQ s91 1)), p0:(AND (GEQ s1 1) (GEQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 12 steps with 4 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-11 finished in 625 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 193 transition count 336
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 193 transition count 336
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 193 transition count 331
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 83 place count 171 transition count 304
Iterating global reduction 1 with 22 rules applied. Total rules applied 105 place count 171 transition count 304
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 117 place count 171 transition count 292
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 138 place count 150 transition count 243
Iterating global reduction 2 with 21 rules applied. Total rules applied 159 place count 150 transition count 243
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 167 place count 150 transition count 235
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 179 place count 138 transition count 202
Iterating global reduction 3 with 12 rules applied. Total rules applied 191 place count 138 transition count 202
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 197 place count 138 transition count 196
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 203 place count 132 transition count 190
Iterating global reduction 4 with 6 rules applied. Total rules applied 209 place count 132 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 210 place count 132 transition count 189
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 214 place count 128 transition count 185
Iterating global reduction 5 with 4 rules applied. Total rules applied 218 place count 128 transition count 185
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 221 place count 128 transition count 182
Applied a total of 221 rules in 16 ms. Remains 128 /221 variables (removed 93) and now considering 182/478 (removed 296) transitions.
// Phase 1: matrix 182 rows 128 cols
[2024-05-21 21:52:16] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:52:16] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 21:52:16] [INFO ] Invariant cache hit.
[2024-05-21 21:52:16] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 21:52:16] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2024-05-21 21:52:16] [INFO ] Invariant cache hit.
[2024-05-21 21:52:16] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/221 places, 182/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 453 ms. Remains : 128/221 places, 182/478 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT 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][false, false, false]]
Product exploration explored 100000 steps with 22953 reset in 141 ms.
Product exploration explored 100000 steps with 22988 reset in 140 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 462 edges and 128 vertex of which 127 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 71 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2280 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 462 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 42541 steps, run visited all 1 properties in 73 ms. (steps per millisecond=582 )
Probabilistic random walk after 42541 steps, saw 19880 distinct states, run finished after 74 ms. (steps per millisecond=574 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-12 finished in 1144 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 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 193 transition count 342
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 193 transition count 342
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 193 transition count 337
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 83 place count 171 transition count 310
Iterating global reduction 1 with 22 rules applied. Total rules applied 105 place count 171 transition count 310
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 117 place count 171 transition count 298
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 138 place count 150 transition count 249
Iterating global reduction 2 with 21 rules applied. Total rules applied 159 place count 150 transition count 249
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 168 place count 150 transition count 240
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 180 place count 138 transition count 202
Iterating global reduction 3 with 12 rules applied. Total rules applied 192 place count 138 transition count 202
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 198 place count 138 transition count 196
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 203 place count 133 transition count 191
Iterating global reduction 4 with 5 rules applied. Total rules applied 208 place count 133 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 209 place count 133 transition count 190
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 212 place count 130 transition count 187
Iterating global reduction 5 with 3 rules applied. Total rules applied 215 place count 130 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 216 place count 130 transition count 186
Applied a total of 216 rules in 21 ms. Remains 130 /221 variables (removed 91) and now considering 186/478 (removed 292) transitions.
// Phase 1: matrix 186 rows 130 cols
[2024-05-21 21:52:17] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:52:17] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 21:52:17] [INFO ] Invariant cache hit.
[2024-05-21 21:52:17] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 21:52:17] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2024-05-21 21:52:17] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 21:52:17] [INFO ] Invariant cache hit.
[2024-05-21 21:52:17] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/221 places, 186/478 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 400 ms. Remains : 130/221 places, 186/478 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-13 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 s128 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 22948 reset in 141 ms.
Product exploration explored 100000 steps with 22935 reset in 144 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 470 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 64 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)]
Incomplete random walk after 10000 steps, including 2263 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 424 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 22327 steps, run visited all 1 properties in 40 ms. (steps per millisecond=558 )
Probabilistic random walk after 22327 steps, saw 10963 distinct states, run finished after 41 ms. (steps per millisecond=544 ) 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 97 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 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 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, 186/186 transitions.
Applied a total of 0 rules in 4 ms. Remains 130 /130 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2024-05-21 21:52:18] [INFO ] Invariant cache hit.
[2024-05-21 21:52:18] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 21:52:18] [INFO ] Invariant cache hit.
[2024-05-21 21:52:18] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 21:52:18] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2024-05-21 21:52:18] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:52:18] [INFO ] Invariant cache hit.
[2024-05-21 21:52:18] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 412 ms. Remains : 130/130 places, 186/186 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 470 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 399 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 96 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2291 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 438 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 22327 steps, run visited all 1 properties in 48 ms. (steps per millisecond=465 )
Probabilistic random walk after 22327 steps, saw 10963 distinct states, run finished after 48 ms. (steps per millisecond=465 ) 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 100 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 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23107 reset in 157 ms.
Product exploration explored 100000 steps with 23016 reset in 142 ms.
Built C files in :
/tmp/ltsmin4740718684541447654
[2024-05-21 21:52:20] [INFO ] Computing symmetric may disable matrix : 186 transitions.
[2024-05-21 21:52:20] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:52:20] [INFO ] Computing symmetric may enable matrix : 186 transitions.
[2024-05-21 21:52:20] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:52:20] [INFO ] Computing Do-Not-Accords matrix : 186 transitions.
[2024-05-21 21:52:20] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:52:20] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4740718684541447654
Running compilation step : cd /tmp/ltsmin4740718684541447654;'/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 379 ms.
Running link step : cd /tmp/ltsmin4740718684541447654;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4740718684541447654;'/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/stateBased17383373912533016002.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, 186/186 transitions.
Applied a total of 0 rules in 4 ms. Remains 130 /130 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2024-05-21 21:52:35] [INFO ] Invariant cache hit.
[2024-05-21 21:52:35] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 21:52:35] [INFO ] Invariant cache hit.
[2024-05-21 21:52:35] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 21:52:35] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-05-21 21:52:35] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 21:52:35] [INFO ] Invariant cache hit.
[2024-05-21 21:52:35] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 388 ms. Remains : 130/130 places, 186/186 transitions.
Built C files in :
/tmp/ltsmin10572097231725857751
[2024-05-21 21:52:35] [INFO ] Computing symmetric may disable matrix : 186 transitions.
[2024-05-21 21:52:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:52:35] [INFO ] Computing symmetric may enable matrix : 186 transitions.
[2024-05-21 21:52:35] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:52:35] [INFO ] Computing Do-Not-Accords matrix : 186 transitions.
[2024-05-21 21:52:35] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:52:35] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10572097231725857751
Running compilation step : cd /tmp/ltsmin10572097231725857751;'/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 383 ms.
Running link step : cd /tmp/ltsmin10572097231725857751;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin10572097231725857751;'/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/stateBased17312682506789227128.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 21:52:50] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:52:50] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:52:50] [INFO ] Time to serialize gal into /tmp/LTL17408054359885713618.gal : 3 ms
[2024-05-21 21:52:51] [INFO ] Time to serialize properties into /tmp/LTL17237199528689726856.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17408054359885713618.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7305427460133586059.hoa' '-atoms' '/tmp/LTL17237199528689726856.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/LTL17237199528689726856.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7305427460133586059.hoa
Detected timeout of ITS tools.
[2024-05-21 21:53:06] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:53:06] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:53:06] [INFO ] Time to serialize gal into /tmp/LTL5494219339172064551.gal : 2 ms
[2024-05-21 21:53:06] [INFO ] Time to serialize properties into /tmp/LTL5856674896046163607.ltl : 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/LTL5494219339172064551.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5856674896046163607.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l4281<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l4281<1))"
Detected timeout of ITS tools.
[2024-05-21 21:53:21] [INFO ] Flatten gal took : 21 ms
[2024-05-21 21:53:21] [INFO ] Applying decomposition
[2024-05-21 21:53:21] [INFO ] Flatten gal took : 9 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/graph6531587239319426373.txt' '-o' '/tmp/graph6531587239319426373.bin' '-w' '/tmp/graph6531587239319426373.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6531587239319426373.bin' '-l' '-1' '-v' '-w' '/tmp/graph6531587239319426373.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:53:21] [INFO ] Decomposing Gal with order
[2024-05-21 21:53:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:53:21] [INFO ] Removed a total of 181 redundant transitions.
[2024-05-21 21:53:21] [INFO ] Flatten gal took : 49 ms
[2024-05-21 21:53:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 141 labels/synchronizations in 14 ms.
[2024-05-21 21:53:21] [INFO ] Time to serialize gal into /tmp/LTL528331569626177076.gal : 4 ms
[2024-05-21 21:53:21] [INFO ] Time to serialize properties into /tmp/LTL15801642766132729783.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/LTL528331569626177076.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15801642766132729783.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...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i2.u0.s1<1)||(i7.u19.l4281<1))"))))
Formula 0 simplified : FG!"((i2.u0.s1<1)||(i7.u19.l4281<1))"
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t12, t13, t14, t91, t93, t94, t95, t105, t145, t146, t150, t151, t222, t228, t332, t3...576
Computing Next relation with stutter on 2.35132e+06 deadlock states
10 unique states visited
0 strongly connected components in search stack
18 transitions explored
10 items max in DFS search stack
1340 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.4313,285712,1,0,207830,118051,2342,1.61627e+06,1348,1.06099e+06,640506
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-13 finished in 79227 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((X(p1)&&p0)) U p2)))'
Support contains 4 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 194 transition count 343
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 194 transition count 343
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 194 transition count 341
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 78 place count 172 transition count 314
Iterating global reduction 1 with 22 rules applied. Total rules applied 100 place count 172 transition count 314
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 112 place count 172 transition count 302
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 132 place count 152 transition count 264
Iterating global reduction 2 with 20 rules applied. Total rules applied 152 place count 152 transition count 264
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 161 place count 152 transition count 255
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 172 place count 141 transition count 225
Iterating global reduction 3 with 11 rules applied. Total rules applied 183 place count 141 transition count 225
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 193 place count 141 transition count 215
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 198 place count 136 transition count 210
Iterating global reduction 4 with 5 rules applied. Total rules applied 203 place count 136 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 204 place count 136 transition count 209
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 207 place count 133 transition count 206
Iterating global reduction 5 with 3 rules applied. Total rules applied 210 place count 133 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 212 place count 133 transition count 204
Applied a total of 212 rules in 15 ms. Remains 133 /221 variables (removed 88) and now considering 204/478 (removed 274) transitions.
// Phase 1: matrix 204 rows 133 cols
[2024-05-21 21:53:36] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:53:36] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-21 21:53:36] [INFO ] Invariant cache hit.
[2024-05-21 21:53:36] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-21 21:53:36] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
[2024-05-21 21:53:36] [INFO ] Invariant cache hit.
[2024-05-21 21:53:36] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 133/221 places, 204/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 492 ms. Remains : 133/221 places, 204/478 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s99 1)), p0:(AND (GEQ s1 1) (GEQ s126 1)), p1:(AND (GEQ s1 1) (GEQ s71 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-14 finished in 685 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))'
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 478/478 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 193 transition count 336
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 193 transition count 336
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 193 transition count 331
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 83 place count 171 transition count 304
Iterating global reduction 1 with 22 rules applied. Total rules applied 105 place count 171 transition count 304
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 117 place count 171 transition count 292
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 138 place count 150 transition count 243
Iterating global reduction 2 with 21 rules applied. Total rules applied 159 place count 150 transition count 243
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 167 place count 150 transition count 235
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 179 place count 138 transition count 203
Iterating global reduction 3 with 12 rules applied. Total rules applied 191 place count 138 transition count 203
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 197 place count 138 transition count 197
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 203 place count 132 transition count 191
Iterating global reduction 4 with 6 rules applied. Total rules applied 209 place count 132 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 210 place count 132 transition count 190
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 214 place count 128 transition count 186
Iterating global reduction 5 with 4 rules applied. Total rules applied 218 place count 128 transition count 186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 221 place count 128 transition count 183
Applied a total of 221 rules in 25 ms. Remains 128 /221 variables (removed 93) and now considering 183/478 (removed 295) transitions.
// Phase 1: matrix 183 rows 128 cols
[2024-05-21 21:53:37] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:53:37] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 21:53:37] [INFO ] Invariant cache hit.
[2024-05-21 21:53:37] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 21:53:37] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2024-05-21 21:53:37] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:53:37] [INFO ] Invariant cache hit.
[2024-05-21 21:53:37] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/221 places, 183/478 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 435 ms. Remains : 128/221 places, 183/478 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s76 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-15 finished in 525 ms.
All properties solved by simple procedures.
Total runtime 106339 ms.

BK_STOP 1716328418655

--------------------
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-d2m06"
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-d2m06, 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-171624208400353"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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