fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r312-tall-165472282000244
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for DBSingleClientW-PT-d2m04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
478.623 32470.00 56866.00 1623.90 FFFFFFFTFFFFFFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.2K Jun 7 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Jun 7 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 7 17:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 7 17:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 6 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 17K Jun 7 17:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Jun 7 17:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Jun 7 17:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 7 17:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 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-d2m04-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654782306869

Running Version 202205111006
[2022-06-09 13:45:08] [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 13:45:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 13:45:08] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2022-06-09 13:45:08] [INFO ] Transformed 4763 places.
[2022-06-09 13:45:08] [INFO ] Transformed 2478 transitions.
[2022-06-09 13:45:08] [INFO ] Parsed PT model containing 4763 places and 2478 transitions in 338 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 4 formulas.
Deduced a syphon composed of 3580 places in 18 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 369 places :
Symmetric choice reduction at 1 with 369 rule applications. Total rules 614 place count 768 transition count 1398
Iterating global reduction 1 with 369 rules applied. Total rules applied 983 place count 768 transition count 1398
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 1055 place count 768 transition count 1326
Discarding 297 places :
Symmetric choice reduction at 2 with 297 rule applications. Total rules 1352 place count 471 transition count 1029
Iterating global reduction 2 with 297 rules applied. Total rules applied 1649 place count 471 transition count 1029
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1658 place count 471 transition count 1020
Discarding 215 places :
Symmetric choice reduction at 3 with 215 rule applications. Total rules 1873 place count 256 transition count 726
Iterating global reduction 3 with 215 rules applied. Total rules applied 2088 place count 256 transition count 726
Ensure Unique test removed 193 transitions
Reduce isomorphic transitions removed 193 transitions.
Iterating post reduction 3 with 193 rules applied. Total rules applied 2281 place count 256 transition count 533
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 2298 place count 239 transition count 507
Iterating global reduction 4 with 17 rules applied. Total rules applied 2315 place count 239 transition count 507
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 2342 place count 239 transition count 480
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 2350 place count 231 transition count 472
Iterating global reduction 5 with 8 rules applied. Total rules applied 2358 place count 231 transition count 472
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2359 place count 231 transition count 471
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 2366 place count 224 transition count 464
Iterating global reduction 6 with 7 rules applied. Total rules applied 2373 place count 224 transition count 464
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 2382 place count 224 transition count 455
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2384 place count 222 transition count 448
Iterating global reduction 7 with 2 rules applied. Total rules applied 2386 place count 222 transition count 448
Applied a total of 2386 rules in 209 ms. Remains 222 /1183 variables (removed 961) and now considering 448/2478 (removed 2030) transitions.
// Phase 1: matrix 448 rows 222 cols
[2022-06-09 13:45:08] [INFO ] Computed 2 place invariants in 23 ms
[2022-06-09 13:45:09] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 448 rows 222 cols
[2022-06-09 13:45:09] [INFO ] Computed 2 place invariants in 17 ms
[2022-06-09 13:45:09] [INFO ] State equation strengthened by 227 read => feed constraints.
[2022-06-09 13:45:09] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 1059 ms to find 0 implicit places.
// Phase 1: matrix 448 rows 222 cols
[2022-06-09 13:45:09] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 13:45:10] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 222/1183 places, 448/2478 transitions.
Finished structural reductions, in 1 iterations. Remains : 222/1183 places, 448/2478 transitions.
Support contains 35 out of 222 places after structural reductions.
[2022-06-09 13:45:10] [INFO ] Flatten gal took : 60 ms
[2022-06-09 13:45:10] [INFO ] Flatten gal took : 33 ms
[2022-06-09 13:45:10] [INFO ] Input system was already deterministic with 448 transitions.
Support contains 34 out of 222 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2283 resets, run finished after 511 ms. (steps per millisecond=19 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 96 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 99 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) 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 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 98 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 29) seen :1
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 40 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 49 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 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 49 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 36 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 200 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 38 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 120 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 38 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 110 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 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 48 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 38 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 46 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 51 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 49 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 47 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Finished probabilistic random walk after 259594 steps, run visited all 28 properties in 1788 ms. (steps per millisecond=145 )
Probabilistic random walk after 259594 steps, saw 99189 distinct states, run finished after 1788 ms. (steps per millisecond=145 ) properties seen :28
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!((G((X(X(F((p0 U p1))))||p0)) U p2))'
Support contains 5 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 448/448 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 197 transition count 355
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 197 transition count 355
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 197 transition count 351
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 76 place count 175 transition count 317
Iterating global reduction 1 with 22 rules applied. Total rules applied 98 place count 175 transition count 317
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 106 place count 175 transition count 309
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 126 place count 155 transition count 273
Iterating global reduction 2 with 20 rules applied. Total rules applied 146 place count 155 transition count 273
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 159 place count 155 transition count 260
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 170 place count 144 transition count 222
Iterating global reduction 3 with 11 rules applied. Total rules applied 181 place count 144 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 188 place count 144 transition count 215
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 192 place count 140 transition count 211
Iterating global reduction 4 with 4 rules applied. Total rules applied 196 place count 140 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 199 place count 140 transition count 208
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 201 place count 138 transition count 206
Iterating global reduction 5 with 2 rules applied. Total rules applied 203 place count 138 transition count 206
Applied a total of 203 rules in 24 ms. Remains 138 /222 variables (removed 84) and now considering 206/448 (removed 242) transitions.
// Phase 1: matrix 206 rows 138 cols
[2022-06-09 13:45:13] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 13:45:13] [INFO ] Implicit Places using invariants in 190 ms returned []
// Phase 1: matrix 206 rows 138 cols
[2022-06-09 13:45:13] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 13:45:13] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-09 13:45:14] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
// Phase 1: matrix 206 rows 138 cols
[2022-06-09 13:45:14] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 13:45:14] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 138/222 places, 206/448 transitions.
Finished structural reductions, in 1 iterations. Remains : 138/222 places, 206/448 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s136 1)), p0:(AND (GEQ s1 1) (GEQ s130 1)), p1:(AND (GEQ s8 1) (GEQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-00 finished in 1077 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(!p1 U (p2||G(!p1)))))'
Support contains 5 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 448/448 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 197 transition count 355
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 197 transition count 355
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 197 transition count 351
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 76 place count 175 transition count 316
Iterating global reduction 1 with 22 rules applied. Total rules applied 98 place count 175 transition count 316
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 105 place count 175 transition count 309
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 124 place count 156 transition count 276
Iterating global reduction 2 with 19 rules applied. Total rules applied 143 place count 156 transition count 276
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 156 place count 156 transition count 263
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 168 place count 144 transition count 217
Iterating global reduction 3 with 12 rules applied. Total rules applied 180 place count 144 transition count 217
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 185 place count 144 transition count 212
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 190 place count 139 transition count 207
Iterating global reduction 4 with 5 rules applied. Total rules applied 195 place count 139 transition count 207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 197 place count 139 transition count 205
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 200 place count 136 transition count 202
Iterating global reduction 5 with 3 rules applied. Total rules applied 203 place count 136 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 204 place count 136 transition count 201
Applied a total of 204 rules in 34 ms. Remains 136 /222 variables (removed 86) and now considering 201/448 (removed 247) transitions.
// Phase 1: matrix 201 rows 136 cols
[2022-06-09 13:45:14] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 13:45:14] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 201 rows 136 cols
[2022-06-09 13:45:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:45:14] [INFO ] State equation strengthened by 70 read => feed constraints.
[2022-06-09 13:45:14] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
// Phase 1: matrix 201 rows 136 cols
[2022-06-09 13:45:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:45:15] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/222 places, 201/448 transitions.
Finished structural reductions, in 1 iterations. Remains : 136/222 places, 201/448 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(AND (NOT (AND (GEQ s1 1) (GEQ s129 1))) (NOT (AND (GEQ s26 1) (GEQ s56 1)))), p1:(AND (GEQ s26 1) (GEQ s56 1)), p0:(OR (LT s1 1) (LT s126 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 22998 reset in 299 ms.
Product exploration explored 100000 steps with 22961 reset in 209 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 p2 (NOT p1) p0), (X (AND p2 p0)), (X p0), (X (NOT (OR (AND (NOT p2) p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), true, (X (X (AND p2 p0))), (X (X p0)), (X (X (NOT (OR (AND (NOT p2) p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 1102 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2256 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 421 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 33792 steps, run visited all 1 properties in 114 ms. (steps per millisecond=296 )
Probabilistic random walk after 33792 steps, saw 15092 distinct states, run finished after 114 ms. (steps per millisecond=296 ) properties seen :1
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (AND p2 p0)), (X p0), (X (NOT (OR (AND (NOT p2) p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), true, (X (X (AND p2 p0))), (X (X p0)), (X (X (NOT (OR (AND (NOT p2) p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 10 factoid took 366 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 136 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 201/201 transitions.
Applied a total of 0 rules in 3 ms. Remains 136 /136 variables (removed 0) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 136 cols
[2022-06-09 13:45:17] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 13:45:17] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 201 rows 136 cols
[2022-06-09 13:45:17] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:45:17] [INFO ] State equation strengthened by 70 read => feed constraints.
[2022-06-09 13:45:18] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
// Phase 1: matrix 201 rows 136 cols
[2022-06-09 13:45:18] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 13:45:18] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 136/136 places, 201/201 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2317 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 440 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 33792 steps, run visited all 1 properties in 64 ms. (steps per millisecond=528 )
Probabilistic random walk after 33792 steps, saw 15092 distinct states, run finished after 65 ms. (steps per millisecond=519 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23129 reset in 197 ms.
Product exploration explored 100000 steps with 22989 reset in 221 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 201/201 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 134 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 134 transition count 196
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 132 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 132 transition count 194
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 130 transition count 190
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 130 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 130 transition count 189
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 129 transition count 188
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 129 transition count 188
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 128 transition count 187
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 128 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 128 transition count 186
Applied a total of 18 rules in 43 ms. Remains 128 /136 variables (removed 8) and now considering 186/201 (removed 15) transitions.
[2022-06-09 13:45:19] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 186 rows 128 cols
[2022-06-09 13:45:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:45:19] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/136 places, 186/201 transitions.
Finished structural reductions, in 1 iterations. Remains : 128/136 places, 186/201 transitions.
Product exploration explored 100000 steps with 22897 reset in 409 ms.
Product exploration explored 100000 steps with 23079 reset in 335 ms.
Built C files in :
/tmp/ltsmin18429472992446511633
[2022-06-09 13:45:20] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18429472992446511633
Running compilation step : cd /tmp/ltsmin18429472992446511633;'/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 1291 ms.
Running link step : cd /tmp/ltsmin18429472992446511633;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 867 ms.
Running LTSmin : cd /tmp/ltsmin18429472992446511633;'/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/stateBased16222175734875840726.hoa' '--buchi-type=spotba'
LTSmin run took 304 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-02 finished in 8536 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U X(F((!X((p2 U p3))&&p1))))||p0)))'
Support contains 4 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 448/448 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 196 transition count 342
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 196 transition count 342
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 196 transition count 339
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 78 place count 173 transition count 303
Iterating global reduction 1 with 23 rules applied. Total rules applied 101 place count 173 transition count 303
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 109 place count 173 transition count 295
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 128 place count 154 transition count 266
Iterating global reduction 2 with 19 rules applied. Total rules applied 147 place count 154 transition count 266
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 159 place count 154 transition count 254
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 171 place count 142 transition count 214
Iterating global reduction 3 with 12 rules applied. Total rules applied 183 place count 142 transition count 214
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 188 place count 142 transition count 209
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 193 place count 137 transition count 204
Iterating global reduction 4 with 5 rules applied. Total rules applied 198 place count 137 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 199 place count 137 transition count 203
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 202 place count 134 transition count 200
Iterating global reduction 5 with 3 rules applied. Total rules applied 205 place count 134 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 206 place count 134 transition count 199
Applied a total of 206 rules in 16 ms. Remains 134 /222 variables (removed 88) and now considering 199/448 (removed 249) transitions.
// Phase 1: matrix 199 rows 134 cols
[2022-06-09 13:45:22] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 13:45:23] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 199 rows 134 cols
[2022-06-09 13:45:23] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 13:45:23] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-06-09 13:45:23] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
// Phase 1: matrix 199 rows 134 cols
[2022-06-09 13:45:23] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 13:45:23] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 134/222 places, 199/448 transitions.
Finished structural reductions, in 1 iterations. Remains : 134/222 places, 199/448 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (AND (NOT p0) p3)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p3), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s90 1)), p1:(AND (GEQ s1 1) (GEQ s90 1)), p3:(AND (GEQ s1 1) (GEQ s132 1)), p2:(AND (GEQ s1 1) (GEQ s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-05 finished in 627 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X((X((G(p0)||p1))||G(F(p2))))))))'
Support contains 5 out of 222 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 222/222 places, 448/448 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 197 transition count 356
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 197 transition count 356
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 197 transition count 354
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 75 place count 174 transition count 318
Iterating global reduction 1 with 23 rules applied. Total rules applied 98 place count 174 transition count 318
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 107 place count 174 transition count 309
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 126 place count 155 transition count 274
Iterating global reduction 2 with 19 rules applied. Total rules applied 145 place count 155 transition count 274
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 158 place count 155 transition count 261
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 170 place count 143 transition count 218
Iterating global reduction 3 with 12 rules applied. Total rules applied 182 place count 143 transition count 218
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 189 place count 143 transition count 211
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 193 place count 139 transition count 207
Iterating global reduction 4 with 4 rules applied. Total rules applied 197 place count 139 transition count 207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 199 place count 139 transition count 205
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 201 place count 137 transition count 203
Iterating global reduction 5 with 2 rules applied. Total rules applied 203 place count 137 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 204 place count 137 transition count 202
Applied a total of 204 rules in 65 ms. Remains 137 /222 variables (removed 85) and now considering 202/448 (removed 246) transitions.
// Phase 1: matrix 202 rows 137 cols
[2022-06-09 13:45:23] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 13:45:23] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 202 rows 137 cols
[2022-06-09 13:45:23] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 13:45:23] [INFO ] State equation strengthened by 70 read => feed constraints.
[2022-06-09 13:45:23] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2022-06-09 13:45:23] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 202 rows 137 cols
[2022-06-09 13:45:23] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:45:24] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/222 places, 202/448 transitions.
Finished structural reductions, in 1 iterations. Remains : 137/222 places, 202/448 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s130 1)), p2:(AND (GEQ s2 1) (GEQ s133 1)), p1:(AND (GEQ s1 1) (GEQ s127 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-08 finished in 610 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Support contains 5 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 448/448 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 197 transition count 355
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 197 transition count 355
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 197 transition count 351
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 76 place count 175 transition count 320
Iterating global reduction 1 with 22 rules applied. Total rules applied 98 place count 175 transition count 320
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 107 place count 175 transition count 311
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 126 place count 156 transition count 276
Iterating global reduction 2 with 19 rules applied. Total rules applied 145 place count 156 transition count 276
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 158 place count 156 transition count 263
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 169 place count 145 transition count 221
Iterating global reduction 3 with 11 rules applied. Total rules applied 180 place count 145 transition count 221
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 186 place count 145 transition count 215
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 190 place count 141 transition count 211
Iterating global reduction 4 with 4 rules applied. Total rules applied 194 place count 141 transition count 211
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 196 place count 141 transition count 209
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 198 place count 139 transition count 207
Iterating global reduction 5 with 2 rules applied. Total rules applied 200 place count 139 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 201 place count 139 transition count 206
Applied a total of 201 rules in 12 ms. Remains 139 /222 variables (removed 83) and now considering 206/448 (removed 242) transitions.
// Phase 1: matrix 206 rows 139 cols
[2022-06-09 13:45:24] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:45:24] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 206 rows 139 cols
[2022-06-09 13:45:24] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:45:24] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-06-09 13:45:24] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
// Phase 1: matrix 206 rows 139 cols
[2022-06-09 13:45:24] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 13:45:24] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 139/222 places, 206/448 transitions.
Finished structural reductions, in 1 iterations. Remains : 139/222 places, 206/448 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s56 1) (GEQ s91 1))) (GEQ s1 1) (GEQ s132 1)), p0:(AND (GEQ s1 1) (GEQ s129 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-09 finished in 613 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||((X(p0) U p2)&&p1)))))'
Support contains 5 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 448/448 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 197 transition count 349
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 197 transition count 349
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 197 transition count 345
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 76 place count 175 transition count 311
Iterating global reduction 1 with 22 rules applied. Total rules applied 98 place count 175 transition count 311
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 106 place count 175 transition count 303
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 125 place count 156 transition count 274
Iterating global reduction 2 with 19 rules applied. Total rules applied 144 place count 156 transition count 274
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 156 place count 156 transition count 262
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 168 place count 144 transition count 222
Iterating global reduction 3 with 12 rules applied. Total rules applied 180 place count 144 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 187 place count 144 transition count 215
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 192 place count 139 transition count 210
Iterating global reduction 4 with 5 rules applied. Total rules applied 197 place count 139 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 199 place count 139 transition count 208
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 202 place count 136 transition count 205
Iterating global reduction 5 with 3 rules applied. Total rules applied 205 place count 136 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 206 place count 136 transition count 204
Applied a total of 206 rules in 16 ms. Remains 136 /222 variables (removed 86) and now considering 204/448 (removed 244) transitions.
// Phase 1: matrix 204 rows 136 cols
[2022-06-09 13:45:24] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 13:45:24] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 204 rows 136 cols
[2022-06-09 13:45:24] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 13:45:24] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-09 13:45:25] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
// Phase 1: matrix 204 rows 136 cols
[2022-06-09 13:45:25] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 13:45:25] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/222 places, 204/448 transitions.
Finished structural reductions, in 1 iterations. Remains : 136/222 places, 204/448 transitions.
Stuttering acceptance computed with spot in 73 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s130 1)), p1:(AND (GEQ s7 1) (GEQ s56 1)), p2:(AND (GEQ s1 1) (GEQ s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-10 finished in 572 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 222 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 222/222 places, 448/448 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 196 transition count 342
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 196 transition count 342
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 196 transition count 339
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 78 place count 173 transition count 304
Iterating global reduction 1 with 23 rules applied. Total rules applied 101 place count 173 transition count 304
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 108 place count 173 transition count 297
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 129 place count 152 transition count 259
Iterating global reduction 2 with 21 rules applied. Total rules applied 150 place count 152 transition count 259
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 161 place count 152 transition count 248
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 171 place count 142 transition count 227
Iterating global reduction 3 with 10 rules applied. Total rules applied 181 place count 142 transition count 227
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 186 place count 142 transition count 222
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 192 place count 136 transition count 216
Iterating global reduction 4 with 6 rules applied. Total rules applied 198 place count 136 transition count 216
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 201 place count 136 transition count 213
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 204 place count 133 transition count 210
Iterating global reduction 5 with 3 rules applied. Total rules applied 207 place count 133 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 208 place count 133 transition count 209
Applied a total of 208 rules in 33 ms. Remains 133 /222 variables (removed 89) and now considering 209/448 (removed 239) transitions.
// Phase 1: matrix 209 rows 133 cols
[2022-06-09 13:45:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:45:25] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 209 rows 133 cols
[2022-06-09 13:45:25] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 13:45:25] [INFO ] State equation strengthened by 85 read => feed constraints.
[2022-06-09 13:45:25] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2022-06-09 13:45:25] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 209 rows 133 cols
[2022-06-09 13:45:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:45:25] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/222 places, 209/448 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/222 places, 209/448 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (OR (LT s1 1) (LT s80 1)) (GEQ s9 1) (GEQ s54 1)), p0:(OR (LT s1 1) (LT s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23012 reset in 208 ms.
Product exploration explored 100000 steps with 22924 reset in 226 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), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 217 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2290 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 901 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 450 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 977 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Finished probabilistic random walk after 21290 steps, run visited all 3 properties in 69 ms. (steps per millisecond=308 )
Probabilistic random walk after 21290 steps, saw 9708 distinct states, run finished after 69 ms. (steps per millisecond=308 ) properties seen :3
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 299 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 52 ms :[(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, 209/209 transitions.
Applied a total of 0 rules in 11 ms. Remains 133 /133 variables (removed 0) and now considering 209/209 (removed 0) transitions.
// Phase 1: matrix 209 rows 133 cols
[2022-06-09 13:45:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:45:27] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 209 rows 133 cols
[2022-06-09 13:45:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:45:27] [INFO ] State equation strengthened by 85 read => feed constraints.
[2022-06-09 13:45:27] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2022-06-09 13:45:27] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 209 rows 133 cols
[2022-06-09 13:45:27] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-09 13:45:27] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 209/209 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 (NOT p1) p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 224 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2278 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 906 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 452 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 971 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Finished probabilistic random walk after 21290 steps, run visited all 3 properties in 118 ms. (steps per millisecond=180 )
Probabilistic random walk after 21290 steps, saw 9708 distinct states, run finished after 118 ms. (steps per millisecond=180 ) properties seen :3
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 314 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 23054 reset in 186 ms.
Product exploration explored 100000 steps with 22967 reset in 184 ms.
Built C files in :
/tmp/ltsmin10202636113563164709
[2022-06-09 13:45:29] [INFO ] Computing symmetric may disable matrix : 209 transitions.
[2022-06-09 13:45:29] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 13:45:29] [INFO ] Computing symmetric may enable matrix : 209 transitions.
[2022-06-09 13:45:29] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 13:45:29] [INFO ] Computing Do-Not-Accords matrix : 209 transitions.
[2022-06-09 13:45:29] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 13:45:29] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10202636113563164709
Running compilation step : cd /tmp/ltsmin10202636113563164709;'/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 414 ms.
Running link step : cd /tmp/ltsmin10202636113563164709;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10202636113563164709;'/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/stateBased15460967101048918391.hoa' '--buchi-type=spotba'
LTSmin run took 371 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-11 finished in 4973 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(G(X(F(X(((!p0 U p1)||F(G(p0)))))))))))'
Support contains 3 out of 222 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 222/222 places, 448/448 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 196 transition count 348
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 196 transition count 348
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 196 transition count 345
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 79 place count 172 transition count 308
Iterating global reduction 1 with 24 rules applied. Total rules applied 103 place count 172 transition count 308
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 112 place count 172 transition count 299
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 133 place count 151 transition count 262
Iterating global reduction 2 with 21 rules applied. Total rules applied 154 place count 151 transition count 262
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 167 place count 151 transition count 249
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 179 place count 139 transition count 209
Iterating global reduction 3 with 12 rules applied. Total rules applied 191 place count 139 transition count 209
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 198 place count 139 transition count 202
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 203 place count 134 transition count 197
Iterating global reduction 4 with 5 rules applied. Total rules applied 208 place count 134 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 211 place count 134 transition count 194
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 214 place count 131 transition count 191
Iterating global reduction 5 with 3 rules applied. Total rules applied 217 place count 131 transition count 191
Applied a total of 217 rules in 24 ms. Remains 131 /222 variables (removed 91) and now considering 191/448 (removed 257) transitions.
// Phase 1: matrix 191 rows 131 cols
[2022-06-09 13:45:30] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 13:45:30] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 191 rows 131 cols
[2022-06-09 13:45:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:45:30] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-09 13:45:30] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2022-06-09 13:45:30] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 191 rows 131 cols
[2022-06-09 13:45:30] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 13:45:30] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/222 places, 191/448 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/222 places, 191/448 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s125 1)), p1:(AND (GEQ s1 1) (GEQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-12 finished in 705 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(F(p0)))||X(p1))))'
Support contains 3 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 448/448 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 196 transition count 348
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 196 transition count 348
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 196 transition count 345
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 78 place count 173 transition count 310
Iterating global reduction 1 with 23 rules applied. Total rules applied 101 place count 173 transition count 310
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 107 place count 173 transition count 304
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 128 place count 152 transition count 266
Iterating global reduction 2 with 21 rules applied. Total rules applied 149 place count 152 transition count 266
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 163 place count 152 transition count 252
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 176 place count 139 transition count 205
Iterating global reduction 3 with 13 rules applied. Total rules applied 189 place count 139 transition count 205
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 193 place count 139 transition count 201
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 199 place count 133 transition count 195
Iterating global reduction 4 with 6 rules applied. Total rules applied 205 place count 133 transition count 195
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 208 place count 133 transition count 192
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 211 place count 130 transition count 189
Iterating global reduction 5 with 3 rules applied. Total rules applied 214 place count 130 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 215 place count 130 transition count 188
Applied a total of 215 rules in 17 ms. Remains 130 /222 variables (removed 92) and now considering 188/448 (removed 260) transitions.
// Phase 1: matrix 188 rows 130 cols
[2022-06-09 13:45:31] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 13:45:31] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 188 rows 130 cols
[2022-06-09 13:45:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:45:31] [INFO ] State equation strengthened by 65 read => feed constraints.
[2022-06-09 13:45:31] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
// Phase 1: matrix 188 rows 130 cols
[2022-06-09 13:45:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:45:31] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/222 places, 188/448 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/222 places, 188/448 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s120 1)), p0:(AND (GEQ s1 1) (GEQ s119 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22971 reset in 166 ms.
Product exploration explored 100000 steps with 23000 reset in 156 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 220 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2356 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 444 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 439 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 444 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Finished probabilistic random walk after 34414 steps, run visited all 3 properties in 278 ms. (steps per millisecond=123 )
Probabilistic random walk after 34414 steps, saw 15137 distinct states, run finished after 278 ms. (steps per millisecond=123 ) properties seen :3
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 328 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 188/188 (removed 0) transitions.
// Phase 1: matrix 188 rows 130 cols
[2022-06-09 13:45:33] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 13:45:33] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 188 rows 130 cols
[2022-06-09 13:45:33] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:45:33] [INFO ] State equation strengthened by 65 read => feed constraints.
[2022-06-09 13:45:33] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
// Phase 1: matrix 188 rows 130 cols
[2022-06-09 13:45:33] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:45:33] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/130 places, 188/188 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 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 251 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2340 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 444 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 503 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Finished probabilistic random walk after 34414 steps, run visited all 3 properties in 160 ms. (steps per millisecond=215 )
Probabilistic random walk after 34414 steps, saw 15137 distinct states, run finished after 160 ms. (steps per millisecond=215 ) properties seen :3
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 736 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23011 reset in 172 ms.
Product exploration explored 100000 steps with 22980 reset in 164 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 188/188 transitions.
Applied a total of 0 rules in 10 ms. Remains 130 /130 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2022-06-09 13:45:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 188 rows 130 cols
[2022-06-09 13:45:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:45:36] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/130 places, 188/188 transitions.
Product exploration explored 100000 steps with 22941 reset in 281 ms.
Product exploration explored 100000 steps with 23079 reset in 291 ms.
Built C files in :
/tmp/ltsmin1505767226839486786
[2022-06-09 13:45:37] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1505767226839486786
Running compilation step : cd /tmp/ltsmin1505767226839486786;'/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 290 ms.
Running link step : cd /tmp/ltsmin1505767226839486786;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin1505767226839486786;'/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/stateBased2953191420725562650.hoa' '--buchi-type=spotba'
LTSmin run took 575 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-13 finished in 6922 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)||(G(p1) U G(p2))) U X(p2)))'
Support contains 4 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 448/448 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 197 transition count 361
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 197 transition count 361
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 55 place count 197 transition count 356
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 77 place count 175 transition count 321
Iterating global reduction 1 with 22 rules applied. Total rules applied 99 place count 175 transition count 321
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 109 place count 175 transition count 311
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 127 place count 157 transition count 278
Iterating global reduction 2 with 18 rules applied. Total rules applied 145 place count 157 transition count 278
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 157 place count 157 transition count 266
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 169 place count 145 transition count 223
Iterating global reduction 3 with 12 rules applied. Total rules applied 181 place count 145 transition count 223
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 190 place count 145 transition count 214
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 194 place count 141 transition count 210
Iterating global reduction 4 with 4 rules applied. Total rules applied 198 place count 141 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 200 place count 141 transition count 208
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 202 place count 139 transition count 206
Iterating global reduction 5 with 2 rules applied. Total rules applied 204 place count 139 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 205 place count 139 transition count 205
Applied a total of 205 rules in 14 ms. Remains 139 /222 variables (removed 83) and now considering 205/448 (removed 243) transitions.
// Phase 1: matrix 205 rows 139 cols
[2022-06-09 13:45:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:45:38] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 205 rows 139 cols
[2022-06-09 13:45:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:45:38] [INFO ] State equation strengthened by 70 read => feed constraints.
[2022-06-09 13:45:38] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
// Phase 1: matrix 205 rows 139 cols
[2022-06-09 13:45:38] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 13:45:38] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 139/222 places, 205/448 transitions.
Finished structural reductions, in 1 iterations. Remains : 139/222 places, 205/448 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s133 1)), p1:(AND (GEQ s1 1) (GEQ s130 1)), p2:(AND (GEQ s1 1) (GEQ s129 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-14 finished in 765 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(p1) U (G(X(p2))&&G(p2)))))'
Support contains 5 out of 222 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 222/222 places, 448/448 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 196 transition count 349
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 196 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 196 transition count 346
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 79 place count 172 transition count 309
Iterating global reduction 1 with 24 rules applied. Total rules applied 103 place count 172 transition count 309
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 112 place count 172 transition count 300
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 133 place count 151 transition count 263
Iterating global reduction 2 with 21 rules applied. Total rules applied 154 place count 151 transition count 263
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 167 place count 151 transition count 250
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 180 place count 138 transition count 202
Iterating global reduction 3 with 13 rules applied. Total rules applied 193 place count 138 transition count 202
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 200 place count 138 transition count 195
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 205 place count 133 transition count 190
Iterating global reduction 4 with 5 rules applied. Total rules applied 210 place count 133 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 211 place count 133 transition count 189
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 214 place count 130 transition count 186
Iterating global reduction 5 with 3 rules applied. Total rules applied 217 place count 130 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 218 place count 130 transition count 185
Applied a total of 218 rules in 23 ms. Remains 130 /222 variables (removed 92) and now considering 185/448 (removed 263) transitions.
// Phase 1: matrix 185 rows 130 cols
[2022-06-09 13:45:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:45:38] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 185 rows 130 cols
[2022-06-09 13:45:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:45:38] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-09 13:45:39] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2022-06-09 13:45:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 185 rows 130 cols
[2022-06-09 13:45:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:45:39] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/222 places, 185/448 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/222 places, 185/448 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s54 1)), p2:(AND (GEQ s1 1) (GEQ s124 1)), p1:(AND (GEQ s1 1) (GEQ s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-15 finished in 546 ms.
All properties solved by simple procedures.
Total runtime 31185 ms.

BK_STOP 1654782339339

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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-d2m04"
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-d2m04, 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-165472282000244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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