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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.6K Jun 7 17:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 7 17:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 7 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 7 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 6 15:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Jun 6 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 17:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Jun 7 17:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 7 17:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 7 17:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:23 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 119K 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-d0m05-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654774338389

Running Version 202205111006
[2022-06-09 11:32:19] [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 11:32:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 11:32:19] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2022-06-09 11:32:19] [INFO ] Transformed 553 places.
[2022-06-09 11:32:19] [INFO ] Transformed 150 transitions.
[2022-06-09 11:32:19] [INFO ] Parsed PT model containing 553 places and 150 transitions in 200 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 31 place count 89 transition count 123
Iterating global reduction 1 with 13 rules applied. Total rules applied 44 place count 89 transition count 123
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 87 transition count 121
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 87 transition count 121
Applied a total of 48 rules in 26 ms. Remains 87 /109 variables (removed 22) and now considering 121/150 (removed 29) transitions.
// Phase 1: matrix 121 rows 87 cols
[2022-06-09 11:32:20] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-09 11:32:20] [INFO ] Implicit Places using invariants in 197 ms returned []
// Phase 1: matrix 121 rows 87 cols
[2022-06-09 11:32:20] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 11:32:20] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-06-09 11:32:20] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
// Phase 1: matrix 121 rows 87 cols
[2022-06-09 11:32:20] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-09 11:32:20] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/109 places, 121/150 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/109 places, 121/150 transitions.
Support contains 33 out of 87 places after structural reductions.
[2022-06-09 11:32:20] [INFO ] Flatten gal took : 31 ms
[2022-06-09 11:32:20] [INFO ] Flatten gal took : 14 ms
[2022-06-09 11:32:20] [INFO ] Input system was already deterministic with 121 transitions.
Incomplete random walk after 10000 steps, including 2256 resets, run finished after 616 ms. (steps per millisecond=16 ) properties (out of 28) seen :8
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 99 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1000 steps, including 98 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :3
Incomplete Best-First random walk after 1000 steps, including 99 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 101 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000 steps, including 64 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 121 rows 87 cols
[2022-06-09 11:32:21] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:32:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:32:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:32:21] [INFO ] After 307ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-06-09 11:32:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 11:32:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:32:22] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-06-09 11:32:22] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-06-09 11:32:22] [INFO ] After 185ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2022-06-09 11:32:22] [INFO ] After 481ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1158 ms.
[2022-06-09 11:32:23] [INFO ] After 1906ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 70 ms.
Support contains 22 out of 87 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 87/87 places, 121/121 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 85 transition count 119
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 85 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 84 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 84 transition count 118
Applied a total of 6 rules in 16 ms. Remains 84 /87 variables (removed 3) and now considering 118/121 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 84/87 places, 118/121 transitions.
Incomplete random walk after 10000 steps, including 2306 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 97 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 101 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 103 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 107 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) 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 15) seen :0
Finished probabilistic random walk after 20858 steps, run visited all 15 properties in 141 ms. (steps per millisecond=147 )
Probabilistic random walk after 20858 steps, saw 9340 distinct states, run finished after 142 ms. (steps per millisecond=146 ) properties seen :15
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(p0) U X(F(p1)))||G((X(p0) U p0))))'
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 121/121 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 75 transition count 95
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 75 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 75 transition count 94
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 32 place count 68 transition count 87
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 68 transition count 85
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 44 place count 65 transition count 79
Iterating global reduction 2 with 3 rules applied. Total rules applied 47 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 50 place count 63 transition count 75
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 54 place count 61 transition count 73
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 59 place count 60 transition count 70
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 62 place count 60 transition count 68
Applied a total of 62 rules in 13 ms. Remains 60 /87 variables (removed 27) and now considering 68/121 (removed 53) transitions.
// Phase 1: matrix 68 rows 60 cols
[2022-06-09 11:32:24] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 11:32:25] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 68 rows 60 cols
[2022-06-09 11:32:25] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 11:32:25] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-06-09 11:32:25] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
// Phase 1: matrix 68 rows 60 cols
[2022-06-09 11:32:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:32:25] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/87 places, 68/121 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/87 places, 68/121 transitions.
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s52 1)), p1:(AND (GEQ s1 1) (GEQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-01 finished in 612 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (F(p1)||G(p0)))||F(X(X(p1)))||X(p2)))'
Support contains 6 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 121/121 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 76 transition count 94
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 76 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 76 transition count 93
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 69 transition count 86
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 69 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 69 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 68 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 67 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 67 transition count 81
Applied a total of 43 rules in 14 ms. Remains 67 /87 variables (removed 20) and now considering 81/121 (removed 40) transitions.
// Phase 1: matrix 81 rows 67 cols
[2022-06-09 11:32:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:32:25] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 81 rows 67 cols
[2022-06-09 11:32:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:32:25] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 11:32:25] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 67 cols
[2022-06-09 11:32:25] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 11:32:25] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 67/87 places, 81/121 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/87 places, 81/121 transitions.
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s25 1) (GEQ s45 1)), p2:(AND (GEQ s16 1) (GEQ s38 1)), p0:(AND (GEQ s5 1) (GEQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-02 finished in 453 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 121/121 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 74 transition count 92
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 74 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 74 transition count 91
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 35 place count 66 transition count 83
Iterating global reduction 1 with 8 rules applied. Total rules applied 43 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 66 transition count 81
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 64 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 62 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 61 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 61 transition count 71
Applied a total of 57 rules in 11 ms. Remains 61 /87 variables (removed 26) and now considering 71/121 (removed 50) transitions.
// Phase 1: matrix 71 rows 61 cols
[2022-06-09 11:32:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:32:26] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 71 rows 61 cols
[2022-06-09 11:32:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:32:26] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-09 11:32:26] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
// Phase 1: matrix 71 rows 61 cols
[2022-06-09 11:32:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:32:26] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/87 places, 71/121 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/87 places, 71/121 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 8177 steps with 1866 reset in 61 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-03 finished in 319 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(((G(p0) U G(p1))||p2))||F(p3)))'
Support contains 4 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 121/121 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 76 transition count 100
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 76 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 76 transition count 99
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 69 transition count 92
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 69 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 66 transition count 86
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 66 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 66 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 64 transition count 82
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 64 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 62 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 62 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 54 place count 62 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 61 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 61 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 61 transition count 75
Applied a total of 58 rules in 20 ms. Remains 61 /87 variables (removed 26) and now considering 75/121 (removed 46) transitions.
// Phase 1: matrix 75 rows 61 cols
[2022-06-09 11:32:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:32:26] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 75 rows 61 cols
[2022-06-09 11:32:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:32:26] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-06-09 11:32:26] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2022-06-09 11:32:26] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 75 rows 61 cols
[2022-06-09 11:32:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:32:26] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/87 places, 75/121 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/87 places, 75/121 transitions.
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) p1 (NOT p0)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s52 1) (GEQ s1 1) (GEQ s42 1)), p3:(AND (GEQ s1 1) (GEQ s42 1)), p1:(AND (GEQ s1 1) (GEQ s52 1)), p0:(AND (GEQ s1 1) (GEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-04 finished in 493 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X(G(X(G(F(p0)))))))))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 121/121 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 75 transition count 93
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 75 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 75 transition count 92
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 32 place count 68 transition count 85
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 68 transition count 83
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 44 place count 65 transition count 77
Iterating global reduction 2 with 3 rules applied. Total rules applied 47 place count 65 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 65 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 50 place count 63 transition count 73
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 63 transition count 73
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 54 place count 61 transition count 71
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 61 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 61 transition count 69
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 59 place count 60 transition count 68
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 60 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 62 place count 60 transition count 66
Applied a total of 62 rules in 21 ms. Remains 60 /87 variables (removed 27) and now considering 66/121 (removed 55) transitions.
// Phase 1: matrix 66 rows 60 cols
[2022-06-09 11:32:26] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:32:26] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 66 rows 60 cols
[2022-06-09 11:32:26] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 11:32:26] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 11:32:26] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2022-06-09 11:32:26] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 66 rows 60 cols
[2022-06-09 11:32:26] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 11:32:26] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/87 places, 66/121 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/87 places, 66/121 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22952 reset in 191 ms.
Product exploration explored 100000 steps with 22869 reset in 145 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 397 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2271 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Finished Best-First random walk after 6033 steps, including 298 resets, run visited all 1 properties in 6 ms. (steps per millisecond=1005 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 66/66 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 60 cols
[2022-06-09 11:32:28] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:32:28] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 66 rows 60 cols
[2022-06-09 11:32:28] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 11:32:28] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 11:32:28] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2022-06-09 11:32:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 66 rows 60 cols
[2022-06-09 11:32:28] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:32:28] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 66/66 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2294 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 509 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 788 steps, run visited all 1 properties in 10 ms. (steps per millisecond=78 )
Probabilistic random walk after 788 steps, saw 407 distinct states, run finished after 10 ms. (steps per millisecond=78 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 209 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22899 reset in 99 ms.
Product exploration explored 100000 steps with 23047 reset in 92 ms.
Built C files in :
/tmp/ltsmin15480966205058012491
[2022-06-09 11:32:29] [INFO ] Computing symmetric may disable matrix : 66 transitions.
[2022-06-09 11:32:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:32:29] [INFO ] Computing symmetric may enable matrix : 66 transitions.
[2022-06-09 11:32:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:32:29] [INFO ] Computing Do-Not-Accords matrix : 66 transitions.
[2022-06-09 11:32:29] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:32:29] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15480966205058012491
Running compilation step : cd /tmp/ltsmin15480966205058012491;'/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 247 ms.
Running link step : cd /tmp/ltsmin15480966205058012491;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15480966205058012491;'/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/stateBased5951323975311443404.hoa' '--buchi-type=spotba'
LTSmin run took 276 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-05 finished in 3103 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(F(p0)))||G(F((G(p2)&&p1)))))'
Support contains 6 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 121/121 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 74 transition count 92
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 74 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 74 transition count 91
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 35 place count 66 transition count 83
Iterating global reduction 1 with 8 rules applied. Total rules applied 43 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 66 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 65 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 65 transition count 78
Applied a total of 48 rules in 12 ms. Remains 65 /87 variables (removed 22) and now considering 78/121 (removed 43) transitions.
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:32:29] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:32:29] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:32:29] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:32:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-09 11:32:29] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:32:29] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:32:30] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/87 places, 78/121 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/87 places, 78/121 transitions.
Stuttering acceptance computed with spot in 442 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s30 1)), p1:(AND (OR (LT s1 1) (LT s64 1)) (GEQ s13 1) (GEQ s36 1)), p2:(AND (GEQ s1 1) (GEQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-06 finished in 627 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!G(X(p0)) U G(p1))||G(p2))))'
Support contains 6 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 121/121 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 76 transition count 97
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 76 transition count 97
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 69 transition count 90
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 69 transition count 90
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 66 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 66 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 66 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 64 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 64 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 62 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 62 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 62 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 61 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 61 transition count 73
Applied a total of 57 rules in 11 ms. Remains 61 /87 variables (removed 26) and now considering 73/121 (removed 48) transitions.
// Phase 1: matrix 73 rows 61 cols
[2022-06-09 11:32:30] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 11:32:30] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 73 rows 61 cols
[2022-06-09 11:32:30] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-09 11:32:30] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-09 11:32:30] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
// Phase 1: matrix 73 rows 61 cols
[2022-06-09 11:32:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:32:30] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/87 places, 73/121 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/87 places, 73/121 transitions.
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), p0, (NOT p1), (AND p0 (NOT p2) p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 2}, { cond=(AND p2 p1 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (LT s2 1) (LT s58 1)), p1:(AND (GEQ s1 1) (GEQ s54 1)), p0:(AND (GEQ s3 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 29785 reset in 154 ms.
Product exploration explored 100000 steps with 29825 reset in 150 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) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 713 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p1) (NOT p2)), p0, (NOT p1), (AND p0 (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2256 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1542 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1096 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 321 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 73 rows 61 cols
[2022-06-09 11:32:32] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:32:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:32:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:32:32] [INFO ] After 18ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:4
[2022-06-09 11:32:32] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-09 11:32:32] [INFO ] After 6ms SMT Verify possible using 26 Read/Feed constraints in real domain returned unsat :1 sat :0 real:5
[2022-06-09 11:32:32] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2022-06-09 11:32:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 11:32:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:32:32] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2022-06-09 11:32:33] [INFO ] After 31ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2022-06-09 11:32:33] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-06-09 11:32:33] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 73/73 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 73/73 transitions.
Incomplete random walk after 10000 steps, including 2320 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1535 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 508 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Finished probabilistic random walk after 4266 steps, run visited all 4 properties in 32 ms. (steps per millisecond=133 )
Probabilistic random walk after 4266 steps, saw 1934 distinct states, run finished after 32 ms. (steps per millisecond=133 ) properties seen :4
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p0))), (G (NOT (AND p2 p1 p0))), (G (NOT (AND (NOT p2) p1 p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 13 factoid took 938 ms. Reduced automaton from 5 states, 12 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 6 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 73/73 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 61 cols
[2022-06-09 11:32:34] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:32:34] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 73 rows 61 cols
[2022-06-09 11:32:34] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:32:34] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-09 11:32:34] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
// Phase 1: matrix 73 rows 61 cols
[2022-06-09 11:32:34] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 11:32:34] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 73/73 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 p2 (NOT p0) (NOT p1)), (X p2), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 206 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2306 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 522 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Finished probabilistic random walk after 4266 steps, run visited all 3 properties in 26 ms. (steps per millisecond=164 )
Probabilistic random walk after 4266 steps, saw 1934 distinct states, run finished after 26 ms. (steps per millisecond=164 ) properties seen :3
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F p1), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 247 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 22965 reset in 104 ms.
Product exploration explored 100000 steps with 23027 reset in 103 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 6 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 73/73 transitions.
Applied a total of 0 rules in 4 ms. Remains 61 /61 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2022-06-09 11:32:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 73 rows 61 cols
[2022-06-09 11:32:36] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 11:32:36] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 73/73 transitions.
Product exploration explored 100000 steps with 22937 reset in 130 ms.
Product exploration explored 100000 steps with 23023 reset in 142 ms.
Built C files in :
/tmp/ltsmin3478090091155255506
[2022-06-09 11:32:37] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3478090091155255506
Running compilation step : cd /tmp/ltsmin3478090091155255506;'/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 153 ms.
Running link step : cd /tmp/ltsmin3478090091155255506;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin3478090091155255506;'/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/stateBased13275734969128718635.hoa' '--buchi-type=spotba'
LTSmin run took 71 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-08 finished in 6791 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&G(G(X(p1)))))'
Support contains 4 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 121/121 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 75 transition count 93
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 75 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 75 transition count 92
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 33 place count 67 transition count 84
Iterating global reduction 1 with 8 rules applied. Total rules applied 41 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 65 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 63 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 62 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 62 transition count 72
Applied a total of 55 rules in 8 ms. Remains 62 /87 variables (removed 25) and now considering 72/121 (removed 49) transitions.
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:32:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:32:37] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:32:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:32:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-09 11:32:37] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
// Phase 1: matrix 72 rows 62 cols
[2022-06-09 11:32:37] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:32:37] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/87 places, 72/121 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/87 places, 72/121 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s52 1)), p0:(AND (GEQ s15 1) (GEQ s35 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 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-09 finished in 337 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((!p1&&(F(p2)||X(p2))))))'
Support contains 5 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 121/121 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 76 transition count 94
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 76 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 76 transition count 93
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 70 transition count 87
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 70 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 70 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 68 transition count 82
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 68 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 68 transition count 81
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 67 transition count 79
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 67 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 66 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 66 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 65 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 65 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 50 place count 65 transition count 75
Applied a total of 50 rules in 13 ms. Remains 65 /87 variables (removed 22) and now considering 75/121 (removed 46) transitions.
// Phase 1: matrix 75 rows 65 cols
[2022-06-09 11:32:37] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 11:32:37] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 75 rows 65 cols
[2022-06-09 11:32:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:32:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-09 11:32:37] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
// Phase 1: matrix 75 rows 65 cols
[2022-06-09 11:32:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:32:37] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/87 places, 75/121 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/87 places, 75/121 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p2) p1), true, (OR (NOT p2) p1), (OR (NOT p2) p1), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s25 1)), p1:(AND (GEQ s1 1) (GEQ s58 1)), p2:(AND (GEQ s1 1) (GEQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-11 finished in 390 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&(X(p1)||!p0))))'
Support contains 4 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 121/121 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 75 transition count 95
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 75 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 75 transition count 94
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 32 place count 68 transition count 87
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 68 transition count 85
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 44 place count 65 transition count 79
Iterating global reduction 2 with 3 rules applied. Total rules applied 47 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 50 place count 63 transition count 75
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 54 place count 61 transition count 73
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 59 place count 60 transition count 70
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 62 place count 60 transition count 68
Applied a total of 62 rules in 12 ms. Remains 60 /87 variables (removed 27) and now considering 68/121 (removed 53) transitions.
// Phase 1: matrix 68 rows 60 cols
[2022-06-09 11:32:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:32:38] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 68 rows 60 cols
[2022-06-09 11:32:38] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:32:38] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-06-09 11:32:38] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 68 rows 60 cols
[2022-06-09 11:32:38] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:32:38] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/87 places, 68/121 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/87 places, 68/121 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s57 1)), p1:(AND (GEQ s6 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-12 finished in 316 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(G(p0)) U ((p1 U !F(X(p0)))||p2)))'
Support contains 4 out of 87 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 121/121 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 77 transition count 100
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 77 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 77 transition count 98
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 70 transition count 91
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 70 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 38 place count 70 transition count 89
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 68 transition count 85
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 66 transition count 82
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 66 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 65 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 65 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 65 transition count 79
Applied a total of 50 rules in 21 ms. Remains 65 /87 variables (removed 22) and now considering 79/121 (removed 42) transitions.
// Phase 1: matrix 79 rows 65 cols
[2022-06-09 11:32:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:32:38] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 79 rows 65 cols
[2022-06-09 11:32:38] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:32:38] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-06-09 11:32:38] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2022-06-09 11:32:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 79 rows 65 cols
[2022-06-09 11:32:38] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:32:38] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/87 places, 79/121 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/87 places, 79/121 transitions.
Stuttering acceptance computed with spot in 120 ms :[p0, (AND p0 (NOT p2)), p0]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s18 1) (GEQ s24 1)), p2:(AND (GEQ s1 1) (GEQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 23055 reset in 201 ms.
Product exploration explored 100000 steps with 22947 reset in 151 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 p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 363 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 116 ms :[p0, (AND p0 (NOT p2)), p0]
Incomplete random walk after 10000 steps, including 2282 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 524 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 79 rows 65 cols
[2022-06-09 11:32:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:32:39] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 11:32:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:32:39] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 11:32:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 11:32:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:32:39] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 11:32:39] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-06-09 11:32:39] [INFO ] After 9ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 11:32:39] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-09 11:32:39] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 65/65 places, 79/79 transitions.
Graph (complete) has 194 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 62 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 62 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 61 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 61 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 60 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 60 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 59 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 59 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 58 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 58 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 58 transition count 68
Applied a total of 17 rules in 13 ms. Remains 58 /65 variables (removed 7) and now considering 68/79 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/65 places, 68/79 transitions.
Incomplete random walk after 10000 steps, including 2284 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished Best-First random walk after 8738 steps, including 440 resets, run visited all 1 properties in 4 ms. (steps per millisecond=2184 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F p0), (F (NOT (AND (NOT p2) (NOT p0)))), (F p2)]
Knowledge based reduction with 10 factoid took 710 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 130 ms :[p0, (AND p0 (NOT p2)), p0]
Stuttering acceptance computed with spot in 92 ms :[p0, (AND p0 (NOT p2)), p0]
Support contains 4 out of 65 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 79/79 transitions.
Applied a total of 0 rules in 9 ms. Remains 65 /65 variables (removed 0) and now considering 79/79 (removed 0) transitions.
// Phase 1: matrix 79 rows 65 cols
[2022-06-09 11:32:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:32:40] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 79 rows 65 cols
[2022-06-09 11:32:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:32:40] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-06-09 11:32:40] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2022-06-09 11:32:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 79 rows 65 cols
[2022-06-09 11:32:40] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:32:40] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 79/79 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 p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 392 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 562 ms :[p0, (AND p0 (NOT p2)), p0]
Incomplete random walk after 10000 steps, including 2286 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :2
Finished Best-First random walk after 231 steps, including 17 resets, run visited all 2 properties in 2 ms. (steps per millisecond=115 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F p0), (F (NOT (AND (NOT p2) (NOT p0)))), (F p2)]
Knowledge based reduction with 10 factoid took 701 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 91 ms :[p0, (AND p0 (NOT p2)), p0]
Stuttering acceptance computed with spot in 260 ms :[p0, (AND p0 (NOT p2)), p0]
Stuttering acceptance computed with spot in 116 ms :[p0, (AND p0 (NOT p2)), p0]
Product exploration explored 100000 steps with 22964 reset in 106 ms.
Product exploration explored 100000 steps with 22894 reset in 113 ms.
Built C files in :
/tmp/ltsmin12222001708876220547
[2022-06-09 11:32:47] [INFO ] Computing symmetric may disable matrix : 79 transitions.
[2022-06-09 11:32:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:32:47] [INFO ] Computing symmetric may enable matrix : 79 transitions.
[2022-06-09 11:32:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:32:47] [INFO ] Computing Do-Not-Accords matrix : 79 transitions.
[2022-06-09 11:32:47] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:32:47] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12222001708876220547
Running compilation step : cd /tmp/ltsmin12222001708876220547;'/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 181 ms.
Running link step : cd /tmp/ltsmin12222001708876220547;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12222001708876220547;'/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/stateBased3758634294269246735.hoa' '--buchi-type=spotba'
LTSmin run took 450 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-14 finished in 9721 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(G(p0))) U X(X(X(!X(!(X(p1)||p2)))))))'
Support contains 4 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 121/121 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 75 transition count 95
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 75 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 75 transition count 94
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 32 place count 68 transition count 87
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 68 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 67 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 67 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 67 transition count 82
Applied a total of 44 rules in 3 ms. Remains 67 /87 variables (removed 20) and now considering 82/121 (removed 39) transitions.
// Phase 1: matrix 82 rows 67 cols
[2022-06-09 11:32:48] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:32:48] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 82 rows 67 cols
[2022-06-09 11:32:48] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:32:48] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-09 11:32:48] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
// Phase 1: matrix 82 rows 67 cols
[2022-06-09 11:32:48] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:32:48] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 67/87 places, 82/121 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/87 places, 82/121 transitions.
Stuttering acceptance computed with spot in 2079 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s27 1)), p1:(AND (GEQ s1 1) (GEQ s64 1)), p0:(AND (GEQ s1 1) (GEQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-15 finished in 2302 ms.
All properties solved by simple procedures.
Total runtime 30710 ms.

BK_STOP 1654774370456

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d0m05"
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-d0m05, 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-165472281800140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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