Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r312-tall-165472282000268.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DBSingleClientW-PT-d2m07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282000268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.8K Jun 7 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Jun 7 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Jun 7 17:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Jun 7 17:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 6 15:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 15:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 6.4K Jun 7 17:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Jun 7 17:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 7 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K Jun 7 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 1.6M Jun 6 12:11 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654784226000

Running Version 202205111006
[2022-06-09 14:17:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 14:17:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 14:17:07] [INFO ] Load time of PNML (sax parser for PT used): 256 ms
[2022-06-09 14:17:07] [INFO ] Transformed 4763 places.
[2022-06-09 14:17:07] [INFO ] Transformed 2478 transitions.
[2022-06-09 14:17:07] [INFO ] Parsed PT model containing 4763 places and 2478 transitions in 376 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 3580 places in 17 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 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 371 places :
Symmetric choice reduction at 1 with 371 rule applications. Total rules 616 place count 766 transition count 1409
Iterating global reduction 1 with 371 rules applied. Total rules applied 987 place count 766 transition count 1409
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 1032 place count 766 transition count 1364
Discarding 297 places :
Symmetric choice reduction at 2 with 297 rule applications. Total rules 1329 place count 469 transition count 1067
Iterating global reduction 2 with 297 rules applied. Total rules applied 1626 place count 469 transition count 1067
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1632 place count 469 transition count 1061
Discarding 215 places :
Symmetric choice reduction at 3 with 215 rule applications. Total rules 1847 place count 254 transition count 771
Iterating global reduction 3 with 215 rules applied. Total rules applied 2062 place count 254 transition count 771
Ensure Unique test removed 248 transitions
Reduce isomorphic transitions removed 248 transitions.
Iterating post reduction 3 with 248 rules applied. Total rules applied 2310 place count 254 transition count 523
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 2325 place count 239 transition count 497
Iterating global reduction 4 with 15 rules applied. Total rules applied 2340 place count 239 transition count 497
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 2345 place count 239 transition count 492
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 2356 place count 228 transition count 481
Iterating global reduction 5 with 11 rules applied. Total rules applied 2367 place count 228 transition count 481
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 2378 place count 217 transition count 470
Iterating global reduction 5 with 11 rules applied. Total rules applied 2389 place count 217 transition count 470
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 2401 place count 217 transition count 458
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2405 place count 213 transition count 444
Iterating global reduction 6 with 4 rules applied. Total rules applied 2409 place count 213 transition count 444
Applied a total of 2409 rules in 196 ms. Remains 213 /1183 variables (removed 970) and now considering 444/2478 (removed 2034) transitions.
// Phase 1: matrix 444 rows 213 cols
[2022-06-09 14:17:07] [INFO ] Computed 2 place invariants in 22 ms
[2022-06-09 14:17:08] [INFO ] Implicit Places using invariants in 253 ms returned []
// Phase 1: matrix 444 rows 213 cols
[2022-06-09 14:17:08] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 14:17:08] [INFO ] State equation strengthened by 225 read => feed constraints.
[2022-06-09 14:17:08] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 947 ms to find 0 implicit places.
// Phase 1: matrix 444 rows 213 cols
[2022-06-09 14:17:08] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-09 14:17:08] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 213/1183 places, 444/2478 transitions.
Finished structural reductions, in 1 iterations. Remains : 213/1183 places, 444/2478 transitions.
Support contains 38 out of 213 places after structural reductions.
[2022-06-09 14:17:09] [INFO ] Flatten gal took : 57 ms
[2022-06-09 14:17:09] [INFO ] Flatten gal took : 34 ms
[2022-06-09 14:17:09] [INFO ] Input system was already deterministic with 444 transitions.
Support contains 34 out of 213 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2302 resets, run finished after 570 ms. (steps per millisecond=17 ) properties (out of 30) seen :2
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 102 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 97 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 34 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 77 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 100 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Interrupted probabilistic random walk after 590956 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1, 23=1, 25=1, 26=1, 27=1}
Probabilistic random walk after 590956 steps, saw 236853 distinct states, run finished after 3002 ms. (steps per millisecond=196 ) properties seen :26
Running SMT prover for 2 properties.
// Phase 1: matrix 444 rows 213 cols
[2022-06-09 14:17:13] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-09 14:17:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 14:17:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 14:17:13] [INFO ] After 189ms 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 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 5 stabilizing places and 5 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&F(p1)))'
Support contains 3 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 444/444 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 185 transition count 335
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 185 transition count 335
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 60 place count 185 transition count 331
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 82 place count 163 transition count 297
Iterating global reduction 1 with 22 rules applied. Total rules applied 104 place count 163 transition count 297
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 115 place count 163 transition count 286
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 132 place count 146 transition count 249
Iterating global reduction 2 with 17 rules applied. Total rules applied 149 place count 146 transition count 249
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 157 place count 146 transition count 241
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 167 place count 136 transition count 210
Iterating global reduction 3 with 10 rules applied. Total rules applied 177 place count 136 transition count 210
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 183 place count 136 transition count 204
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 186 place count 133 transition count 201
Iterating global reduction 4 with 3 rules applied. Total rules applied 189 place count 133 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 192 place count 133 transition count 198
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 193 place count 132 transition count 197
Iterating global reduction 5 with 1 rules applied. Total rules applied 194 place count 132 transition count 197
Applied a total of 194 rules in 55 ms. Remains 132 /213 variables (removed 81) and now considering 197/444 (removed 247) transitions.
// Phase 1: matrix 197 rows 132 cols
[2022-06-09 14:17:13] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:17:13] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 197 rows 132 cols
[2022-06-09 14:17:13] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 14:17:14] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-06-09 14:17:14] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2022-06-09 14:17:14] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 197 rows 132 cols
[2022-06-09 14:17:14] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 14:17:14] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/213 places, 197/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/213 places, 197/444 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s120 1)), p0:(AND (OR (LT s1 1) (LT s120 1)) (OR (LT s1 1) (LT s122 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 3 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-00 finished in 795 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(X((F(p0)&&!p0)))||G(p0)))&&F(p1))))'
Support contains 3 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 444/444 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 185 transition count 336
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 185 transition count 336
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 60 place count 185 transition count 332
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 82 place count 163 transition count 298
Iterating global reduction 1 with 22 rules applied. Total rules applied 104 place count 163 transition count 298
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 116 place count 163 transition count 286
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 133 place count 146 transition count 250
Iterating global reduction 2 with 17 rules applied. Total rules applied 150 place count 146 transition count 250
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 157 place count 146 transition count 243
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 167 place count 136 transition count 211
Iterating global reduction 3 with 10 rules applied. Total rules applied 177 place count 136 transition count 211
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 188 place count 136 transition count 200
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 190 place count 134 transition count 198
Iterating global reduction 4 with 2 rules applied. Total rules applied 192 place count 134 transition count 198
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 134 transition count 197
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 194 place count 133 transition count 196
Iterating global reduction 5 with 1 rules applied. Total rules applied 195 place count 133 transition count 196
Applied a total of 195 rules in 14 ms. Remains 133 /213 variables (removed 80) and now considering 196/444 (removed 248) transitions.
// Phase 1: matrix 196 rows 133 cols
[2022-06-09 14:17:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:17:14] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 196 rows 133 cols
[2022-06-09 14:17:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:17:14] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-06-09 14:17:14] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
// Phase 1: matrix 196 rows 133 cols
[2022-06-09 14:17:14] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 14:17:15] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 133/213 places, 196/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/213 places, 196/444 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(AND (GEQ s1 1) (GEQ s123 1)), p1:(AND (GEQ s1 1) (GEQ s126 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][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-d2m07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-02 finished in 629 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&(G(!(p1 U p2))||X(F(p1))))))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 444/444 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 185 transition count 328
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 185 transition count 328
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 185 transition count 325
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 82 place count 162 transition count 290
Iterating global reduction 1 with 23 rules applied. Total rules applied 105 place count 162 transition count 290
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 118 place count 162 transition count 277
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 136 place count 144 transition count 239
Iterating global reduction 2 with 18 rules applied. Total rules applied 154 place count 144 transition count 239
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 161 place count 144 transition count 232
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 172 place count 133 transition count 205
Iterating global reduction 3 with 11 rules applied. Total rules applied 183 place count 133 transition count 205
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 191 place count 133 transition count 197
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 194 place count 130 transition count 194
Iterating global reduction 4 with 3 rules applied. Total rules applied 197 place count 130 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 200 place count 130 transition count 191
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 201 place count 129 transition count 190
Iterating global reduction 5 with 1 rules applied. Total rules applied 202 place count 129 transition count 190
Applied a total of 202 rules in 22 ms. Remains 129 /213 variables (removed 84) and now considering 190/444 (removed 254) transitions.
// Phase 1: matrix 190 rows 129 cols
[2022-06-09 14:17:15] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 14:17:15] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 190 rows 129 cols
[2022-06-09 14:17:15] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:17:15] [INFO ] State equation strengthened by 62 read => feed constraints.
[2022-06-09 14:17:15] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
// Phase 1: matrix 190 rows 129 cols
[2022-06-09 14:17:15] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 14:17:15] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/213 places, 190/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/213 places, 190/444 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p1))), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s70 1)), p2:(AND (GEQ s1 1) (GEQ s70 1) (GEQ s1 1) (GEQ s116 1)), p1:(AND (GEQ s1 1) (GEQ s128 1))], nbAcceptance=2, 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 7 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-04 finished in 668 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(((p1 U (X(!X(p2))&&X((p1 U p2))))&&p0))))'
Support contains 5 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 444/444 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 186 transition count 330
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 186 transition count 330
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 186 transition count 326
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 79 place count 165 transition count 294
Iterating global reduction 1 with 21 rules applied. Total rules applied 100 place count 165 transition count 294
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 111 place count 165 transition count 283
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 129 place count 147 transition count 245
Iterating global reduction 2 with 18 rules applied. Total rules applied 147 place count 147 transition count 245
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 155 place count 147 transition count 237
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 165 place count 137 transition count 215
Iterating global reduction 3 with 10 rules applied. Total rules applied 175 place count 137 transition count 215
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 183 place count 137 transition count 207
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 185 place count 135 transition count 205
Iterating global reduction 4 with 2 rules applied. Total rules applied 187 place count 135 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 190 place count 135 transition count 202
Applied a total of 190 rules in 16 ms. Remains 135 /213 variables (removed 78) and now considering 202/444 (removed 242) transitions.
// Phase 1: matrix 202 rows 135 cols
[2022-06-09 14:17:15] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 14:17:15] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 202 rows 135 cols
[2022-06-09 14:17:15] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 14:17:16] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-06-09 14:17:16] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 135 cols
[2022-06-09 14:17:16] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 14:17:16] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/213 places, 202/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 135/213 places, 202/444 transitions.
Stuttering acceptance computed with spot in 390 ms :[true, true, true, true, (OR (NOT p0) p1 p2), p2, (NOT p2), p2, p2, (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(OR p1 p2), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 7}, { cond=p1, acceptance={} source=4 dest: 8}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=p2, acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}], [{ cond=p2, acceptance={} source=7 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=8 dest: 7}, { cond=(AND p1 p2), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=9 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s56 1)), p1:(AND (GEQ s1 1) (GEQ s129 1)), p2:(AND (GEQ s9 1) (GEQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-05 finished in 873 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))||F(p1)||F(p2))))'
Support contains 6 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 444/444 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 186 transition count 334
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 186 transition count 334
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 186 transition count 329
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 81 place count 164 transition count 299
Iterating global reduction 1 with 22 rules applied. Total rules applied 103 place count 164 transition count 299
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 115 place count 164 transition count 287
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 132 place count 147 transition count 251
Iterating global reduction 2 with 17 rules applied. Total rules applied 149 place count 147 transition count 251
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 159 place count 147 transition count 241
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 170 place count 136 transition count 207
Iterating global reduction 3 with 11 rules applied. Total rules applied 181 place count 136 transition count 207
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 188 place count 136 transition count 200
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 191 place count 133 transition count 197
Iterating global reduction 4 with 3 rules applied. Total rules applied 194 place count 133 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 197 place count 133 transition count 194
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 198 place count 132 transition count 193
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 132 transition count 193
Applied a total of 199 rules in 43 ms. Remains 132 /213 variables (removed 81) and now considering 193/444 (removed 251) transitions.
// Phase 1: matrix 193 rows 132 cols
[2022-06-09 14:17:16] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 14:17:16] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 193 rows 132 cols
[2022-06-09 14:17:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:17:16] [INFO ] State equation strengthened by 64 read => feed constraints.
[2022-06-09 14:17:17] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2022-06-09 14:17:17] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 193 rows 132 cols
[2022-06-09 14:17:17] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:17:17] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/213 places, 193/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/213 places, 193/444 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s55 1)), p1:(AND (GEQ s54 1) (GEQ s92 1)), p2:(AND (GEQ s1 1) (GEQ s97 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-06 finished in 518 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(p1))))'
Support contains 3 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 444/444 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 185 transition count 323
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 185 transition count 323
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 60 place count 185 transition count 319
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 82 place count 163 transition count 286
Iterating global reduction 1 with 22 rules applied. Total rules applied 104 place count 163 transition count 286
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 115 place count 163 transition count 275
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 133 place count 145 transition count 243
Iterating global reduction 2 with 18 rules applied. Total rules applied 151 place count 145 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 159 place count 145 transition count 235
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 170 place count 134 transition count 208
Iterating global reduction 3 with 11 rules applied. Total rules applied 181 place count 134 transition count 208
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 189 place count 134 transition count 200
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 192 place count 131 transition count 197
Iterating global reduction 4 with 3 rules applied. Total rules applied 195 place count 131 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 198 place count 131 transition count 194
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 199 place count 130 transition count 193
Iterating global reduction 5 with 1 rules applied. Total rules applied 200 place count 130 transition count 193
Applied a total of 200 rules in 11 ms. Remains 130 /213 variables (removed 83) and now considering 193/444 (removed 251) transitions.
// Phase 1: matrix 193 rows 130 cols
[2022-06-09 14:17:17] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 14:17:17] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 193 rows 130 cols
[2022-06-09 14:17:17] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:17:17] [INFO ] State equation strengthened by 69 read => feed constraints.
[2022-06-09 14:17:17] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 130 cols
[2022-06-09 14:17:17] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 14:17:17] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/213 places, 193/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/213 places, 193/444 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s17 1) (GEQ s54 1)), p1:(OR (LT s8 1) (LT s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-07 finished in 594 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(X(p0)))||G(p1))))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 444/444 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 185 transition count 330
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 185 transition count 330
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 60 place count 185 transition count 326
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 82 place count 163 transition count 293
Iterating global reduction 1 with 22 rules applied. Total rules applied 104 place count 163 transition count 293
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 116 place count 163 transition count 281
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 133 place count 146 transition count 251
Iterating global reduction 2 with 17 rules applied. Total rules applied 150 place count 146 transition count 251
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 157 place count 146 transition count 244
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 168 place count 135 transition count 210
Iterating global reduction 3 with 11 rules applied. Total rules applied 179 place count 135 transition count 210
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 192 place count 135 transition count 197
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 194 place count 133 transition count 195
Iterating global reduction 4 with 2 rules applied. Total rules applied 196 place count 133 transition count 195
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 198 place count 133 transition count 193
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 199 place count 132 transition count 192
Iterating global reduction 5 with 1 rules applied. Total rules applied 200 place count 132 transition count 192
Applied a total of 200 rules in 20 ms. Remains 132 /213 variables (removed 81) and now considering 192/444 (removed 252) transitions.
// Phase 1: matrix 192 rows 132 cols
[2022-06-09 14:17:17] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 14:17:17] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 192 rows 132 cols
[2022-06-09 14:17:17] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 14:17:18] [INFO ] State equation strengthened by 65 read => feed constraints.
[2022-06-09 14:17:18] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
// Phase 1: matrix 192 rows 132 cols
[2022-06-09 14:17:18] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:17:18] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 132/213 places, 192/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/213 places, 192/444 transitions.
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(AND (GEQ s8 1) (GEQ s55 1)), p1:(AND (GEQ s1 1) (GEQ s126 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][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-08 finished in 673 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(X(p1)))||p0)))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 444/444 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 186 transition count 341
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 186 transition count 341
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 186 transition count 336
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 81 place count 164 transition count 302
Iterating global reduction 1 with 22 rules applied. Total rules applied 103 place count 164 transition count 302
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 116 place count 164 transition count 289
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 133 place count 147 transition count 254
Iterating global reduction 2 with 17 rules applied. Total rules applied 150 place count 147 transition count 254
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 157 place count 147 transition count 247
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 167 place count 137 transition count 222
Iterating global reduction 3 with 10 rules applied. Total rules applied 177 place count 137 transition count 222
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 184 place count 137 transition count 215
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 187 place count 134 transition count 212
Iterating global reduction 4 with 3 rules applied. Total rules applied 190 place count 134 transition count 212
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 193 place count 134 transition count 209
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 194 place count 133 transition count 208
Iterating global reduction 5 with 1 rules applied. Total rules applied 195 place count 133 transition count 208
Applied a total of 195 rules in 19 ms. Remains 133 /213 variables (removed 80) and now considering 208/444 (removed 236) transitions.
// Phase 1: matrix 208 rows 133 cols
[2022-06-09 14:17:18] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 14:17:18] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 208 rows 133 cols
[2022-06-09 14:17:18] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:17:18] [INFO ] State equation strengthened by 81 read => feed constraints.
[2022-06-09 14:17:18] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
// Phase 1: matrix 208 rows 133 cols
[2022-06-09 14:17:18] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:17:19] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 133/213 places, 208/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/213 places, 208/444 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s123 1) (AND (GEQ s1 1) (GEQ s92 1))), p1:(OR (LT s1 1) (LT s99 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 23007 reset in 263 ms.
Product exploration explored 100000 steps with 22951 reset in 231 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 211 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2286 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 447 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 446 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Finished probabilistic random walk after 21734 steps, run visited all 2 properties in 162 ms. (steps per millisecond=134 )
Probabilistic random walk after 21734 steps, saw 10675 distinct states, run finished after 163 ms. (steps per millisecond=133 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 199 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 133 /133 variables (removed 0) and now considering 208/208 (removed 0) transitions.
// Phase 1: matrix 208 rows 133 cols
[2022-06-09 14:17:20] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 14:17:20] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 208 rows 133 cols
[2022-06-09 14:17:20] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 14:17:21] [INFO ] State equation strengthened by 81 read => feed constraints.
[2022-06-09 14:17:21] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
// Phase 1: matrix 208 rows 133 cols
[2022-06-09 14:17:21] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 14:17:21] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 208/208 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 142 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2336 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 445 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Finished probabilistic random walk after 21734 steps, run visited all 2 properties in 125 ms. (steps per millisecond=173 )
Probabilistic random walk after 21734 steps, saw 10675 distinct states, run finished after 125 ms. (steps per millisecond=173 ) properties seen :2
Knowledge obtained : [(AND p1 p0), (X p0), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 253 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 23043 reset in 182 ms.
Product exploration explored 100000 steps with 22863 reset in 194 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 208/208 transitions.
Applied a total of 0 rules in 19 ms. Remains 133 /133 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2022-06-09 14:17:23] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 208 rows 133 cols
[2022-06-09 14:17:23] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 14:17:23] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 208/208 transitions.
Product exploration explored 100000 steps with 22973 reset in 192 ms.
Product exploration explored 100000 steps with 22925 reset in 197 ms.
Built C files in :
/tmp/ltsmin2522658595707220852
[2022-06-09 14:17:23] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2522658595707220852
Running compilation step : cd /tmp/ltsmin2522658595707220852;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 407 ms.
Running link step : cd /tmp/ltsmin2522658595707220852;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin2522658595707220852;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3892532962608955708.hoa' '--buchi-type=spotba'
LTSmin run took 12807 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-09 finished in 18450 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(F(G(F((X((G(p1)||p0))||p2))))))))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 444/444 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 186 transition count 338
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 186 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 186 transition count 335
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 79 place count 164 transition count 301
Iterating global reduction 1 with 22 rules applied. Total rules applied 101 place count 164 transition count 301
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 164 transition count 289
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 129 place count 148 transition count 260
Iterating global reduction 2 with 16 rules applied. Total rules applied 145 place count 148 transition count 260
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 152 place count 148 transition count 253
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 162 place count 138 transition count 221
Iterating global reduction 3 with 10 rules applied. Total rules applied 172 place count 138 transition count 221
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 183 place count 138 transition count 210
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 185 place count 136 transition count 208
Iterating global reduction 4 with 2 rules applied. Total rules applied 187 place count 136 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 188 place count 136 transition count 207
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 189 place count 135 transition count 206
Iterating global reduction 5 with 1 rules applied. Total rules applied 190 place count 135 transition count 206
Applied a total of 190 rules in 33 ms. Remains 135 /213 variables (removed 78) and now considering 206/444 (removed 238) transitions.
// Phase 1: matrix 206 rows 135 cols
[2022-06-09 14:17:37] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 14:17:37] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 206 rows 135 cols
[2022-06-09 14:17:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:17:37] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-06-09 14:17:37] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2022-06-09 14:17:37] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 206 rows 135 cols
[2022-06-09 14:17:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:17:37] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/213 places, 206/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 135/213 places, 206/444 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s72 1)), p0:(OR (LT s1 1) (LT s125 1)), p2:(AND (GEQ s1 1) (GEQ s128 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23085 reset in 186 ms.
Product exploration explored 100000 steps with 23042 reset in 183 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 1395 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2310 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 447 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 502 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Finished probabilistic random walk after 72102 steps, run visited all 2 properties in 235 ms. (steps per millisecond=306 )
Probabilistic random walk after 72102 steps, saw 32162 distinct states, run finished after 235 ms. (steps per millisecond=306 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 5 factoid took 206 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 206/206 transitions.
Applied a total of 0 rules in 5 ms. Remains 135 /135 variables (removed 0) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 135 cols
[2022-06-09 14:17:40] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 14:17:40] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 206 rows 135 cols
[2022-06-09 14:17:40] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-09 14:17:40] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-06-09 14:17:40] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2022-06-09 14:17:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 206 rows 135 cols
[2022-06-09 14:17:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:17:40] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 135/135 places, 206/206 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 806 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2302 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 455 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 454 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Finished probabilistic random walk after 72102 steps, run visited all 2 properties in 188 ms. (steps per millisecond=383 )
Probabilistic random walk after 72102 steps, saw 32162 distinct states, run finished after 189 ms. (steps per millisecond=381 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 5 factoid took 227 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 22917 reset in 185 ms.
Product exploration explored 100000 steps with 22973 reset in 179 ms.
Built C files in :
/tmp/ltsmin9410144762169528231
[2022-06-09 14:17:42] [INFO ] Computing symmetric may disable matrix : 206 transitions.
[2022-06-09 14:17:42] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 14:17:42] [INFO ] Computing symmetric may enable matrix : 206 transitions.
[2022-06-09 14:17:42] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 14:17:42] [INFO ] Computing Do-Not-Accords matrix : 206 transitions.
[2022-06-09 14:17:42] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 14:17:42] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9410144762169528231
Running compilation step : cd /tmp/ltsmin9410144762169528231;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 410 ms.
Running link step : cd /tmp/ltsmin9410144762169528231;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9410144762169528231;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12898575433394337653.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 206/206 transitions.
Applied a total of 0 rules in 12 ms. Remains 135 /135 variables (removed 0) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 135 cols
[2022-06-09 14:17:57] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 14:17:57] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 206 rows 135 cols
[2022-06-09 14:17:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:17:58] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-06-09 14:17:58] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2022-06-09 14:17:58] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 206 rows 135 cols
[2022-06-09 14:17:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:17:58] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 135/135 places, 206/206 transitions.
Built C files in :
/tmp/ltsmin5193409629774262508
[2022-06-09 14:17:58] [INFO ] Computing symmetric may disable matrix : 206 transitions.
[2022-06-09 14:17:58] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 14:17:58] [INFO ] Computing symmetric may enable matrix : 206 transitions.
[2022-06-09 14:17:58] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 14:17:58] [INFO ] Computing Do-Not-Accords matrix : 206 transitions.
[2022-06-09 14:17:58] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 14:17:58] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5193409629774262508
Running compilation step : cd /tmp/ltsmin5193409629774262508;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 413 ms.
Running link step : cd /tmp/ltsmin5193409629774262508;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5193409629774262508;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11289430678651582504.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-09 14:18:13] [INFO ] Flatten gal took : 16 ms
[2022-06-09 14:18:13] [INFO ] Flatten gal took : 13 ms
[2022-06-09 14:18:13] [INFO ] Time to serialize gal into /tmp/LTL2893969869510088934.gal : 3 ms
[2022-06-09 14:18:13] [INFO ] Time to serialize properties into /tmp/LTL14936208061262967237.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2893969869510088934.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14936208061262967237.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2893969...267
Read 1 LTL properties
Checking formula 0 : !((X(X(G(F(G(F((X(((G("((s1>=1)&&(l1766>=1))"))||("(s1<1)"))||("(l3835<1)")))||("((s1>=1)&&(l4118>=1))")))))))))
Formula 0 simplified : !XXGFGF("((s1>=1)&&(l4118>=1))" | X("(l3835<1)" | "(s1<1)" | G"((s1>=1)&&(l1766>=1))"))
Detected timeout of ITS tools.
[2022-06-09 14:18:28] [INFO ] Flatten gal took : 12 ms
[2022-06-09 14:18:28] [INFO ] Applying decomposition
[2022-06-09 14:18:28] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12597319987288525419.txt' '-o' '/tmp/graph12597319987288525419.bin' '-w' '/tmp/graph12597319987288525419.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12597319987288525419.bin' '-l' '-1' '-v' '-w' '/tmp/graph12597319987288525419.weights' '-q' '0' '-e' '0.001'
[2022-06-09 14:18:28] [INFO ] Decomposing Gal with order
[2022-06-09 14:18:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 14:18:28] [INFO ] Removed a total of 243 redundant transitions.
[2022-06-09 14:18:28] [INFO ] Flatten gal took : 57 ms
[2022-06-09 14:18:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 188 labels/synchronizations in 11 ms.
[2022-06-09 14:18:28] [INFO ] Time to serialize gal into /tmp/LTL5032211757739973992.gal : 3 ms
[2022-06-09 14:18:28] [INFO ] Time to serialize properties into /tmp/LTL11511987508351913061.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5032211757739973992.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11511987508351913061.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5032211...246
Read 1 LTL properties
Checking formula 0 : !((X(X(G(F(G(F((X(((G("((i2.u0.s1>=1)&&(i2.u0.l1766>=1))"))||("(i2.u0.s1<1)"))||("(i7.u17.l3835<1)")))||("((i2.u0.s1>=1)&&(i5.u16.l411...171
Formula 0 simplified : !XXGFGF("((i2.u0.s1>=1)&&(i5.u16.l4118>=1))" | X("(i2.u0.s1<1)" | "(i7.u17.l3835<1)" | G"((i2.u0.s1>=1)&&(i2.u0.l1766>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10809687003800382911
[2022-06-09 14:18:43] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10809687003800382911
Running compilation step : cd /tmp/ltsmin10809687003800382911;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 317 ms.
Running link step : cd /tmp/ltsmin10809687003800382911;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10809687003800382911;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](<>([](<>((X(([]((LTLAPp1==true))||(LTLAPp0==true)))||(LTLAPp2==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-10 finished in 81954 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((false U X(!p0)))'
Support contains 2 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 444/444 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 184 transition count 322
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 184 transition count 322
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 62 place count 184 transition count 318
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 85 place count 161 transition count 284
Iterating global reduction 1 with 23 rules applied. Total rules applied 108 place count 161 transition count 284
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 120 place count 161 transition count 272
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 138 place count 143 transition count 240
Iterating global reduction 2 with 18 rules applied. Total rules applied 156 place count 143 transition count 240
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 164 place count 143 transition count 232
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 176 place count 131 transition count 197
Iterating global reduction 3 with 12 rules applied. Total rules applied 188 place count 131 transition count 197
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 196 place count 131 transition count 189
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 199 place count 128 transition count 186
Iterating global reduction 4 with 3 rules applied. Total rules applied 202 place count 128 transition count 186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 205 place count 128 transition count 183
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 206 place count 127 transition count 182
Iterating global reduction 5 with 1 rules applied. Total rules applied 207 place count 127 transition count 182
Applied a total of 207 rules in 18 ms. Remains 127 /213 variables (removed 86) and now considering 182/444 (removed 262) transitions.
// Phase 1: matrix 182 rows 127 cols
[2022-06-09 14:18:58] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 14:18:59] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 182 rows 127 cols
[2022-06-09 14:18:59] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 14:18:59] [INFO ] State equation strengthened by 60 read => feed constraints.
[2022-06-09 14:18:59] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
// Phase 1: matrix 182 rows 127 cols
[2022-06-09 14:18:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:18:59] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 127/213 places, 182/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 127/213 places, 182/444 transitions.
Stuttering acceptance computed with spot in 71 ms :[p0, p0, true]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s8 1) (GEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 287 ms.
Product exploration explored 100000 steps with 50000 reset in 279 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 45 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-12 finished in 1134 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F(p0)))))'
Support contains 2 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 444/444 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 184 transition count 322
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 184 transition count 322
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 62 place count 184 transition count 318
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 85 place count 161 transition count 283
Iterating global reduction 1 with 23 rules applied. Total rules applied 108 place count 161 transition count 283
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 121 place count 161 transition count 270
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 139 place count 143 transition count 232
Iterating global reduction 2 with 18 rules applied. Total rules applied 157 place count 143 transition count 232
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 164 place count 143 transition count 225
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 175 place count 132 transition count 198
Iterating global reduction 3 with 11 rules applied. Total rules applied 186 place count 132 transition count 198
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 194 place count 132 transition count 190
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 197 place count 129 transition count 187
Iterating global reduction 4 with 3 rules applied. Total rules applied 200 place count 129 transition count 187
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 203 place count 129 transition count 184
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 204 place count 128 transition count 183
Iterating global reduction 5 with 1 rules applied. Total rules applied 205 place count 128 transition count 183
Applied a total of 205 rules in 15 ms. Remains 128 /213 variables (removed 85) and now considering 183/444 (removed 261) transitions.
// Phase 1: matrix 183 rows 128 cols
[2022-06-09 14:19:00] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 14:19:00] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 183 rows 128 cols
[2022-06-09 14:19:00] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 14:19:00] [INFO ] State equation strengthened by 62 read => feed constraints.
[2022-06-09 14:19:00] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
// Phase 1: matrix 183 rows 128 cols
[2022-06-09 14:19:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:19:00] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/213 places, 183/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 128/213 places, 183/444 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-14 finished in 521 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 444/444 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 184 transition count 329
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 184 transition count 329
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 62 place count 184 transition count 325
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 85 place count 161 transition count 290
Iterating global reduction 1 with 23 rules applied. Total rules applied 108 place count 161 transition count 290
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 121 place count 161 transition count 277
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 139 place count 143 transition count 240
Iterating global reduction 2 with 18 rules applied. Total rules applied 157 place count 143 transition count 240
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 164 place count 143 transition count 233
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 175 place count 132 transition count 199
Iterating global reduction 3 with 11 rules applied. Total rules applied 186 place count 132 transition count 199
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 199 place count 132 transition count 186
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 201 place count 130 transition count 184
Iterating global reduction 4 with 2 rules applied. Total rules applied 203 place count 130 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 205 place count 130 transition count 182
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 206 place count 129 transition count 181
Iterating global reduction 5 with 1 rules applied. Total rules applied 207 place count 129 transition count 181
Applied a total of 207 rules in 23 ms. Remains 129 /213 variables (removed 84) and now considering 181/444 (removed 263) transitions.
// Phase 1: matrix 181 rows 129 cols
[2022-06-09 14:19:00] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 14:19:00] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 181 rows 129 cols
[2022-06-09 14:19:00] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 14:19:00] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-09 14:19:00] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2022-06-09 14:19:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 181 rows 129 cols
[2022-06-09 14:19:00] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 14:19:01] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/213 places, 181/444 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/213 places, 181/444 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s123 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-d2m07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-15 finished in 459 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(F(G(F((X((G(p1)||p0))||p2))))))))'
[2022-06-09 14:19:01] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8677310244755385444
[2022-06-09 14:19:01] [INFO ] Computing symmetric may disable matrix : 444 transitions.
[2022-06-09 14:19:01] [INFO ] Applying decomposition
[2022-06-09 14:19:01] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 14:19:01] [INFO ] Computing symmetric may enable matrix : 444 transitions.
[2022-06-09 14:19:01] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 14:19:01] [INFO ] Flatten gal took : 24 ms
[2022-06-09 14:19:01] [INFO ] Computing Do-Not-Accords matrix : 444 transitions.
[2022-06-09 14:19:01] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13765414998036639490.txt' '-o' '/tmp/graph13765414998036639490.bin' '-w' '/tmp/graph13765414998036639490.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13765414998036639490.bin' '-l' '-1' '-v' '-w' '/tmp/graph13765414998036639490.weights' '-q' '0' '-e' '0.001'
[2022-06-09 14:19:01] [INFO ] Decomposing Gal with order
[2022-06-09 14:19:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 14:19:01] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8677310244755385444
Running compilation step : cd /tmp/ltsmin8677310244755385444;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-09 14:19:01] [INFO ] Removed a total of 627 redundant transitions.
[2022-06-09 14:19:01] [INFO ] Flatten gal took : 53 ms
[2022-06-09 14:19:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 273 labels/synchronizations in 11 ms.
[2022-06-09 14:19:01] [INFO ] Time to serialize gal into /tmp/LTLFireability1225805689540922565.gal : 4 ms
[2022-06-09 14:19:01] [INFO ] Time to serialize properties into /tmp/LTLFireability969773332861303516.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1225805689540922565.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability969773332861303516.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...266
Read 1 LTL properties
Checking formula 0 : !((X(X(G(F(G(F((X(((G("((i0.u0.s1>=1)&&(i3.u15.l1766>=1))"))||("(i0.u0.s1<1)"))||("(i5.u25.l3835<1)")))||("((i0.u0.s1>=1)&&(i6.u35.l41...172
Formula 0 simplified : !XXGFGF("((i0.u0.s1>=1)&&(i6.u35.l4118>=1))" | X("(i0.u0.s1<1)" | "(i5.u25.l3835<1)" | G"((i0.u0.s1>=1)&&(i3.u15.l1766>=1))"))
Compilation finished in 1246 ms.
Running link step : cd /tmp/ltsmin8677310244755385444;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8677310244755385444;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](<>([](<>((X(([]((LTLAPp1==true))||(LTLAPp0==true)))||(LTLAPp2==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.021: LTL layer: formula: X(X([](<>([](<>((X(([]((LTLAPp1==true))||(LTLAPp0==true)))||(LTLAPp2==true))))))))
pins2lts-mc-linux64( 1/ 8), 0.022: "X(X([](<>([](<>((X(([]((LTLAPp1==true))||(LTLAPp0==true)))||(LTLAPp2==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.022: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.047: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.047: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.085: There are 448 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.085: State length is 214, there are 450 groups
pins2lts-mc-linux64( 0/ 8), 0.085: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.085: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.085: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.085: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.107: [Blue] ~32 levels ~960 states ~2616 transitions
pins2lts-mc-linux64( 4/ 8), 0.127: [Blue] ~33 levels ~1920 states ~4584 transitions
pins2lts-mc-linux64( 4/ 8), 0.152: [Blue] ~33 levels ~3840 states ~8272 transitions
pins2lts-mc-linux64( 4/ 8), 0.201: [Blue] ~33 levels ~7680 states ~16360 transitions
pins2lts-mc-linux64( 4/ 8), 0.301: [Blue] ~33 levels ~15360 states ~31984 transitions
pins2lts-mc-linux64( 4/ 8), 0.513: [Blue] ~33 levels ~30720 states ~64424 transitions
pins2lts-mc-linux64( 4/ 8), 0.896: [Blue] ~33 levels ~61440 states ~140608 transitions
pins2lts-mc-linux64( 4/ 8), 1.698: [Blue] ~34 levels ~122880 states ~274808 transitions
pins2lts-mc-linux64( 2/ 8), 2.978: [Blue] ~112 levels ~245760 states ~525944 transitions
pins2lts-mc-linux64( 2/ 8), 5.145: [Blue] ~144 levels ~491520 states ~1049216 transitions
pins2lts-mc-linux64( 2/ 8), 9.058: [Blue] ~345 levels ~983040 states ~2179944 transitions
pins2lts-mc-linux64( 2/ 8), 16.636: [Blue] ~912 levels ~1966080 states ~4621064 transitions
pins2lts-mc-linux64( 6/ 8), 31.792: [Blue] ~2540 levels ~3932160 states ~10482888 transitions
pins2lts-mc-linux64( 1/ 8), 62.078: [Blue] ~8009 levels ~7864320 states ~21660368 transitions
pins2lts-mc-linux64( 0/ 8), 123.905: [Blue] ~85531 levels ~15728640 states ~43975472 transitions
pins2lts-mc-linux64( 1/ 8), 244.717: [Blue] ~16942 levels ~31457280 states ~93909784 transitions
pins2lts-mc-linux64( 1/ 8), 491.146: [Blue] ~44981 levels ~62914560 states ~190562528 transitions
pins2lts-mc-linux64( 6/ 8), 1005.221: [Blue] ~99465 levels ~125829120 states ~417385360 transitions
pins2lts-mc-linux64( 7/ 8), 1116.773: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1116.819:
pins2lts-mc-linux64( 0/ 8), 1116.819: Explored 134947937 states 473231228 transitions, fanout: 3.507
pins2lts-mc-linux64( 0/ 8), 1116.819: Total exploration time 1116.720 sec (1116.680 sec minimum, 1116.695 sec on average)
pins2lts-mc-linux64( 0/ 8), 1116.819: States per second: 120843, Transitions per second: 423769
pins2lts-mc-linux64( 0/ 8), 1116.819:
pins2lts-mc-linux64( 0/ 8), 1116.819: State space has 134215127 states, 17859112 are accepting
pins2lts-mc-linux64( 0/ 8), 1116.819: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1116.819: blue states: 134947937 (100.55%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1116.819: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1116.819: all-red states: 18034924 (13.44%), bogus 1478 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1116.819:
pins2lts-mc-linux64( 0/ 8), 1116.819: Total memory used for local state coloring: 40.1MB
pins2lts-mc-linux64( 0/ 8), 1116.819:
pins2lts-mc-linux64( 0/ 8), 1116.819: Queue width: 8B, total height: 2630516, memory: 20.07MB
pins2lts-mc-linux64( 0/ 8), 1116.819: Tree memory: 1096.9MB, 8.6 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 1116.819: Tree fill ratio (roots/leafs): 99.0%/28.0%
pins2lts-mc-linux64( 0/ 8), 1116.819: Stored 448 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1116.819: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1116.820: Est. total memory use: 1117.0MB (~1044.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8677310244755385444;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](<>([](<>((X(([]((LTLAPp1==true))||(LTLAPp0==true)))||(LTLAPp2==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8677310244755385444;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](<>([](<>((X(([]((LTLAPp1==true))||(LTLAPp0==true)))||(LTLAPp2==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-06-09 14:39:39] [INFO ] Flatten gal took : 20 ms
[2022-06-09 14:39:39] [INFO ] Time to serialize gal into /tmp/LTLFireability6150219851288199470.gal : 3 ms
[2022-06-09 14:39:39] [INFO ] Time to serialize properties into /tmp/LTLFireability8735858394131179645.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6150219851288199470.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8735858394131179645.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...288
Read 1 LTL properties
Checking formula 0 : !((X(X(G(F(G(F((X(((G("((s1>=1)&&(l1766>=1))"))||("(s1<1)"))||("(l3835<1)")))||("((s1>=1)&&(l4118>=1))")))))))))
Formula 0 simplified : !XXGFGF("((s1>=1)&&(l4118>=1))" | X("(l3835<1)" | "(s1<1)" | G"((s1>=1)&&(l1766>=1))"))
Detected timeout of ITS tools.
[2022-06-09 15:00:21] [INFO ] Flatten gal took : 574 ms
[2022-06-09 15:00:21] [INFO ] Input system was already deterministic with 444 transitions.
[2022-06-09 15:00:21] [INFO ] Transformed 213 places.
[2022-06-09 15:00:21] [INFO ] Transformed 444 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-09 15:00:21] [INFO ] Time to serialize gal into /tmp/LTLFireability15644173117482534714.gal : 3 ms
[2022-06-09 15:00:21] [INFO ] Time to serialize properties into /tmp/LTLFireability2311374204838644658.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15644173117482534714.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2311374204838644658.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(G(F(G(F((X(((G("((s1>=1)&&(l1766>=1))"))||("(s1<1)"))||("(l3835<1)")))||("((s1>=1)&&(l4118>=1))")))))))))
Formula 0 simplified : !XXGFGF("((s1>=1)&&(l4118>=1))" | X("(l3835<1)" | "(s1<1)" | G"((s1>=1)&&(l1766>=1))"))
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t28, t29, t30, t34, t35, t36, t39, t40, t41, t44, t46, t47, t91, t92, t...1917
Computing Next relation with stutter on 2.95061e+08 deadlock states

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d2m07"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d2m07, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-165472282000268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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